[{"_1":2,"_12739":-5,"_12740":-5},"loaderData",{"_3":4,"_17":18},"root",{"_5":6,"_7":6,"_8":9,"_10":9,"_11":12,"_13":14,"_15":16},"isProd",true,"enableStats","domain","bitcointuesdaymadrid.com","siteHost","sentryTrace","4cd4e15ea7b741a8a17b185acb2617df--0","sentryBaggage","sentry-environment=production,sentry-trace_id=4cd4e15ea7b741a8a17b185acb2617df,sentry-sampled=false","remixVersion",2,"routes/$",{"_19":20,"_12457":12458},"json",{"_21":22,"_23":24,"_25":-5,"_26":-5,"_27":28,"_91":6,"_38":92,"_101":102,"_103":104,"_12442":63,"_10":12443,"_12444":12443,"_12445":12446,"_12452":12453},"prefersLanguages",[],"viewTerm","collaborators","panelParam","openComment","document",{"_29":30,"_72":41,"_73":54,"_74":75,"_55":76,"_77":78,"_79":80,"_81":82,"_85":86,"_87":88,"_89":90},"content",[31],{"_32":33,"_34":35},"children",[],"block",{"_36":37,"_38":39,"_40":41,"_42":43,"_67":68,"_69":70,"_71":70},"type","Query","id","PqNf3Wyp","revision","bafy2bzacedi2bgmizsgdeeridycehyuzjswp7vgkbphwdecuzsqgdfv52qchk","attributes",{"_44":45,"_46":47,"_48":49,"_66":63},"style","Card","columnCount",3,"query",{"_50":51,"_59":60},"includes",[52],{"_53":54,"_55":56,"_57":58},"space","z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH","path","records","mode","Children","sort",[61],{"_62":63,"_64":65},"reverse",false,"term","UpdateTime","banner","annotations",[],"text","","link","version","account","authors",[54],"/records","createTime","2024-11-15T09:52:03.159Z","updateTime","2025-02-03T16:54:40.353Z","metadata",{"_83":84},"name","Records","detachedBlocks",{},"genesis","bafy2bzacecvh44rtdgwybj22chahcx2uj73jj7in7ng2z44aurt4ka7qxwqki","visibility","PUBLIC","isLatest",{"_55":93,"_72":41,"_94":63,"_95":54,"_38":96,"_97":-5,"_98":-5,"_99":-5,"_100":-5},[56],"latest","uid","hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records","blockRef","blockRange","hostname","scheme","siteHomeIcon","ipfs://bafybeifqqfzu2tmdqxzjwbx3ncarzfxtdc5bj7cf2pxoyyge7s4tlpi3oi","dehydratedState",{"_105":106,"_107":108},"mutations",[],"queries",[109,152,331,439,790,803,813,1755,3506,5563,5809,7378,7502,8496,8790,9678,10456,10956,11621,12381],{"_110":111,"_147":148,"_150":151},"state",{"_112":113,"_131":132,"_133":134,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},"data",{"_36":27,"_27":114,"_38":129},{"_29":115,"_72":41,"_73":54,"_74":126,"_55":76,"_77":78,"_79":80,"_81":127,"_85":128,"_87":88,"_89":90},[116],{"_32":117,"_34":118},[],{"_36":37,"_38":39,"_40":41,"_42":119,"_67":125,"_69":70,"_71":70},{"_44":45,"_46":47,"_48":120,"_66":63},{"_50":121,"_59":123},[122],{"_53":54,"_55":56,"_57":58},[124],{"_62":63,"_64":65},[],[54],{"_83":84},{},{"_38":96,"_95":54,"_55":130,"_72":41,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":63},[56],"dataUpdateCount",1,"dataUpdatedAt",1773151562498,"error","errorUpdateCount",0,"errorUpdatedAt","fetchFailureCount","fetchFailureReason","fetchMeta","isInvalidated","status","success","fetchStatus","idle","queryKey",[149,96,41,63],"ENTITY","queryHash","[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records\",\"bafy2bzacedi2bgmizsgdeeridycehyuzjswp7vgkbphwdecuzsqgdfv52qchk\",false]",{"_110":153,"_147":329,"_150":330},{"_112":154,"_131":132,"_133":328,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":155,"_38":325},{"_29":156,"_72":277,"_73":54,"_74":278,"_55":70,"_77":280,"_79":281,"_81":282,"_85":290,"_87":324,"_89":90},[157,174,189],{"_32":158,"_34":159},[],{"_36":160,"_38":161,"_40":162,"_42":163,"_67":164,"_69":173,"_71":70},"Paragraph","DszSJtzx","bafy2bzacediefqjwfodsih3fqsmvpfhr54wn66ysz2phoy7vue6umuy4bxqo2",{},[165],{"_36":166,"_167":168,"_169":170,"_42":172,"_71":70},"Bold","starts",[137],"ends",[171],14,{},"Hyper Academia is a knowledge community dedicated to reimagining academic publishing through open hypermedia. Our mission is to empower scholars to collaboratively write, link, and evolve knowledge in a way that is transparent, verifiable, and alive.",{"_32":175,"_34":176},[],{"_36":160,"_38":177,"_40":162,"_42":178,"_67":179,"_69":188,"_71":70},"jYnfHJvv",{},[180],{"_36":166,"_167":181,"_169":184,"_42":187,"_71":70},[182,183],66,113,[185,186],74,178,{},"We aim to build the missing foundation of the hypertextual web: a Linkbase — a decentralized system that enables semantic referencing, contextual discussion, and durable citation across the open web.",{"_32":190,"_34":269},[191,212,231,250],{"_32":192,"_34":193},[],{"_36":160,"_38":194,"_40":195,"_42":196,"_67":197,"_69":211,"_71":70},"UEUWiz3_","bafy2bzacea6gtkwv2xzshnf7btsh2h6d4iqec67s37mxhbmdpabvk7wwyqfxi",{},[198,203],{"_36":166,"_167":199,"_169":200,"_42":202,"_71":70},[137],[201],5,{},{"_36":204,"_167":205,"_169":207,"_42":209,"_71":210},"Link",[206],114,[208],118,{},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/forum?l","Forum: Please start any discussion you believe is relevant to the goal of building an Open Linkbase for the web. (Link)",{"_32":213,"_34":214},[],{"_36":160,"_38":215,"_40":195,"_42":216,"_67":217,"_69":230,"_71":70},"aVdaZZKQ",{},[218,223],{"_36":166,"_167":219,"_169":220,"_42":222,"_71":70},[137],[221],7,{},{"_36":204,"_167":224,"_169":226,"_42":228,"_71":229},[225],97,[227],101,{},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records?l","Records: A list of all the open-access research papers referenced in this knowledge repository. (Link)",{"_32":232,"_34":233},[],{"_36":160,"_38":234,"_40":195,"_42":235,"_67":236,"_69":249,"_71":70},"mvSLAkpf",{},[237,242],{"_36":166,"_167":238,"_169":239,"_42":241,"_71":70},[137],[240],8,{},{"_36":204,"_167":243,"_169":245,"_42":247,"_71":248},[244],175,[246],179,{},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/articles?l","Articles: Submit your article by linking your article to the site with a comment. We will review the article, and if it is relevant, we will post it to the Articles section. (Link)",{"_32":251,"_34":252},[],{"_36":160,"_38":253,"_40":254,"_42":255,"_67":256,"_69":268,"_71":70},"PuiCY1P7","bafy2bzacedm32nu24upavo7ty6jmaor7hhdjjhk7uig6z4j6nmokfiuwfsagw",{},[257,261],{"_36":166,"_167":258,"_169":259,"_42":260,"_71":70},[137],[171],{},{"_36":204,"_167":262,"_169":264,"_42":266,"_71":267},[263],57,[265],61,{},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/linkbase?l","Linkbase Specs: A document that describes the Linkbase. (Link)",{"_36":160,"_38":270,"_40":271,"_42":272,"_67":275,"_69":276,"_71":70},"DoL0_sZu","bafy2bzacecidkbdbkybbpnqregmlxtne7xt57drbjd7ysh5ica3jztv3s3wli",{"_273":274},"childrenType","Unordered",[],"Structure of the Site:","bafy2bzacecedhdybyvon4lwvrvlsetvv5pygov5g63z4ap3u7d43j4r25lp4w",[279,54],"z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou","1970-01-01T00:00:00Z","2026-02-14T19:03:21.548Z",{"_83":283,"_284":102,"_285":286,"_287":288,"_289":70},"Hyper Academia","icon","cover","ipfs://bafybeif2duvubf2clxnuo3ec6imi4x3o5qfi7zjuwm4nrp7l4mb7angtpa","siteUrl","https://hyperacademia.hyper.media","layout",{"_291":292},"navigation",{"_32":293,"_34":322},[294,300,304,310,316],{"_32":295,"_34":296},[],{"_36":204,"_38":297,"_71":298,"_69":299},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/forum","hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/forum?v=bafy2bzacedh3a4eq35f6cn2vfbkryeonj6c2nn2e6ornr57gapfnq6ww4cclm&l","Forum",{"_32":301,"_34":302},[],{"_36":204,"_38":96,"_71":303,"_69":84},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records?v=bafy2bzacedi2bgmizsgdeeridycehyuzjswp7vgkbphwdecuzsqgdfv52qchk&l",{"_32":305,"_34":306},[],{"_36":204,"_38":307,"_71":308,"_69":309},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/articles","hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/articles?v=bafy2bzaceaiponawjrtiiggub54sjkz23bwco5kf2sby22xn26yduobaikz7m&l","Articles",{"_32":311,"_34":312},[],{"_36":204,"_38":313,"_71":314,"_69":315},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/linkbase","hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/linkbase?v=bafy2bzacecdyqzxpgbmuwyuz3v3hufdguwzu7nocatdbebl4v5bzstrvtqdrw&l","Linkbase Draft",{"_32":317,"_34":318},[],{"_36":204,"_38":319,"_71":320,"_69":321},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/YYQb9EAntOvvEP73NoIa0","hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/YYQb9EAntOvvEP73NoIa0?v=bafy2bzaceb6d27l5xy6tzurwdgcwg6zinki4xuha3j3vvmakerg5tq6cqyp32&l","Planning a demo/paper for HT'26",{"_36":323,"_38":291},"Group","bafy2bzacectninw64euzh25egcusjdt3e24xh4nanr5px4ar4fvinl3gn4kty",{"_38":326,"_95":54,"_55":327,"_72":-5,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH",[],1773151562511,[149,326,-5,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH\",null,true]",{"_110":332,"_147":436,"_150":438},{"_112":333,"_131":132,"_133":435,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},[334,370,395,417],{"_36":27,"_38":335,"_55":339,"_74":340,"_77":341,"_79":346,"_349":350,"_87":351,"_72":338,"_352":353,"_356":357,"_364":365,"_368":-5,"_81":369,"_89":90},{"_38":313,"_95":54,"_55":336,"_72":338,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[337],"linkbase","bafy2bzacecdyqzxpgbmuwyuz3v3hufdguwzu7nocatdbebl4v5bzstrvtqdrw",[337],[279,54],{"_342":343,"_344":345},"seconds","1751701123","nanos",1000000,{"_342":347,"_344":348},"1751838605",875000000,"sortTime","2025-07-05T07:38:43.001Z","bafy2bzacebqzqnezvxqimq7njt7o5wmyvxorynwyi45fmz4ayvxm4nh2emxd2","breadcrumbs",[354],{"_83":283,"_55":70,"_355":63},"isMissing","activitySummary",{"_358":-5,"_359":70,"_360":137,"_361":362,"_363":6},"latestCommentTime","latestCommentId","commentCount","latestChangeTime",{"_342":347,"_344":348},"isUnread","generationInfo",{"_87":351,"_366":367},"generation","1751701123001","redirectInfo",{"_83":315},{"_36":27,"_38":371,"_55":375,"_74":376,"_77":377,"_79":380,"_349":383,"_87":384,"_72":374,"_352":385,"_356":387,"_364":389,"_368":-5,"_81":391,"_89":90},{"_38":297,"_95":54,"_55":372,"_72":374,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[373],"forum","bafy2bzacedh3a4eq35f6cn2vfbkryeonj6c2nn2e6ornr57gapfnq6ww4cclm",[373],[279,54],{"_342":378,"_344":379},"1731663014",360000000,{"_342":381,"_344":382},"1751701760",547000000,"2024-11-15T09:30:14.360Z","bafy2bzacebdawtmebewoq2wpfyuumcoxpun4326jvlyrey6kgwf4fkhqofhei",[386],{"_83":283,"_55":70,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":388,"_363":6},{"_342":381,"_344":382},{"_87":384,"_366":390},"1731663014360",{"_83":299,"_285":392,"_393":394},"ipfs://bafybeif2fekqdxxepfhv4zh33rgy6hjx3rwjhkdzxx3llycys62the5iyi","contentWidth","L",{"_36":27,"_38":396,"_55":400,"_74":401,"_77":402,"_79":405,"_349":408,"_87":409,"_72":399,"_352":410,"_356":412,"_364":414,"_368":-5,"_81":416,"_89":90},{"_38":307,"_95":54,"_55":397,"_72":399,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[398],"articles","bafy2bzaceaiponawjrtiiggub54sjkz23bwco5kf2sby22xn26yduobaikz7m",[398],[54],{"_342":403,"_344":404},"1751698646",962000000,{"_342":406,"_344":407},"1751701193",24000000,"2025-07-05T06:57:26.962Z","bafy2bzacebujlcxxtru4iyfjj3b3gqsgubmbnu6lhawuu3dp7eqyaylbawxqi",[411],{"_83":283,"_55":70,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":413,"_363":63},{"_342":406,"_344":407},{"_87":409,"_366":415},"1751698646962",{"_83":309},{"_36":27,"_38":418,"_55":420,"_74":421,"_77":422,"_79":425,"_349":78,"_87":88,"_72":41,"_352":428,"_356":430,"_364":432,"_368":-5,"_81":434,"_89":90},{"_38":96,"_95":54,"_55":419,"_72":41,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56],[56],[54],{"_342":423,"_344":424},"1731664323",159000000,{"_342":426,"_344":427},"1738601680",353000000,[429],{"_83":283,"_55":70,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":431,"_363":6},{"_342":426,"_344":427},{"_87":88,"_366":433},"1731664323159",{"_83":84},1773151562514,[437,326,58],"DOC_LIST_DIRECTORY","[\"DOC_LIST_DIRECTORY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH\",\"Children\"]",{"_110":440,"_147":788,"_150":789},{"_112":441,"_131":132,"_133":787,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},[442,466,491,516,542,571,593,614,636,658,684,713,739,765],{"_36":27,"_38":443,"_55":448,"_74":449,"_77":450,"_79":453,"_349":454,"_87":447,"_72":447,"_352":455,"_356":458,"_364":460,"_368":-5,"_81":462,"_89":90},{"_38":444,"_95":54,"_55":445,"_72":447,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/smart-contracts-building-blocks-for-digital-markets",[56,446],"smart-contracts-building-blocks-for-digital-markets","bafy2bzacedso2tbfaqqnb7vynu5xk4p7icmlkcfpe4htnliggod5tumtjgwpy",[56,446],[279],{"_342":451,"_344":452},"1760040103",680000000,{"_342":451,"_344":452},"2025-10-09T20:01:43.680Z",[456,457],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":459,"_363":6},{"_342":451,"_344":452},{"_87":447,"_366":461},"1760040103679",{"_83":463,"_464":465},"Smart Contracts: Building Blocks for Digital Markets","summary","Copyright (c) 1996 by Nick Szabo\npermission to redistribute without alteration hereby granted",{"_36":27,"_38":467,"_55":472,"_74":473,"_77":474,"_79":477,"_349":480,"_87":481,"_72":471,"_352":482,"_356":485,"_364":487,"_368":-5,"_81":489,"_89":90},{"_38":468,"_95":54,"_55":469,"_72":471,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/ohp-open-hypermedia-protocol",[56,470],"ohp-open-hypermedia-protocol","bafy2bzaceb5g2ghhzmslplmaqsyvrz6raz6ub7cuemsnafggjtuntq5jpg67c",[56,470],[279,54],{"_342":475,"_344":476},"1751929115",722000000,{"_342":478,"_344":479},"1751929631",413000000,"2025-07-07T22:58:35.722Z","bafy2bzaceb2sngluy6thyy3yiwsoilltbyckqfdbssqh4ir4arufb7p7t7yfm",[483,484],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":486,"_363":6},{"_342":478,"_344":479},{"_87":481,"_366":488},"1751929115721",{"_83":490},"OHP - Open Hypermedia Protocol",{"_36":27,"_38":492,"_55":497,"_74":498,"_77":499,"_79":502,"_349":505,"_87":506,"_72":496,"_352":507,"_356":510,"_364":512,"_368":-5,"_81":514,"_89":90},{"_38":493,"_95":54,"_55":494,"_72":496,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/ohp-a-draft-proposal-for-a-standard-open-hypermedia-protocol-levels-0-and-1-revision-12",[56,495],"ohp-a-draft-proposal-for-a-standard-open-hypermedia-protocol-levels-0-and-1-revision-12","bafy2bzacecedtpecy4ftuuwgtjvkrevoht3qxodvaju3u5ia4k4fawg24hsy6",[56,495],[279],{"_342":500,"_344":501},"1751909134",681000000,{"_342":503,"_344":504},"1751910721",543000000,"2025-07-07T17:25:34.681Z","bafy2bzacedn6akfvuxwwbzv55pvgsnbfdfrqg5ho24bs2gkofrq5czaseuntg",[508,509],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":511,"_363":63},{"_342":503,"_344":504},{"_87":506,"_366":513},"1751909134680",{"_83":515},"OHP: A Draft Proposal for a Standard Open Hypermedia Protocol (Levels 0 and 1: Revision 1.2)",{"_36":27,"_38":517,"_55":522,"_74":523,"_77":524,"_79":527,"_349":528,"_87":521,"_72":521,"_352":529,"_356":532,"_364":538,"_368":-5,"_81":540,"_89":90},{"_38":518,"_95":54,"_55":519,"_72":521,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/the-dexter-hypertext-reference-model",[56,520],"the-dexter-hypertext-reference-model","bafy2bzacecj6hopdys7isf3mhrk63bfjjl3ewaeww4sx5ainwe2x2xlopsh3i",[56,520],[279],{"_342":525,"_344":526},"1751840958",249000000,{"_342":525,"_344":526},"2025-07-06T22:29:18.249Z",[530,531],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":533,"_359":536,"_360":16,"_361":537,"_363":6},{"_342":534,"_344":535},"1751841417",94000000,"z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/z6C8FHfFv76Vb7",{"_342":525,"_344":526},{"_87":521,"_366":539},"1751840958248",{"_83":541},"The Dexter Hypertext Reference Model",{"_36":27,"_38":543,"_55":548,"_74":549,"_77":550,"_79":553,"_349":556,"_87":557,"_72":547,"_352":558,"_356":561,"_364":567,"_368":-5,"_81":569,"_89":90},{"_38":544,"_95":54,"_55":545,"_72":547,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/fohm-a-fundamental-open-hypertext-model-for-investigating-interoperability-between-hypertext-domains",[56,546],"fohm-a-fundamental-open-hypertext-model-for-investigating-interoperability-between-hypertext-domains","bafy2bzaceazfbkeiizkojnccrl2op4rrtmd34c2k2g3ig6vwstm7aky6k7cnm",[56,546],[279],{"_342":551,"_344":552},"1751828439",670000000,{"_342":554,"_344":555},"1751837717",922000000,"2025-07-06T19:00:39.670Z","bafy2bzaced6r4ytsmm4pedz33sodrsum6p564q7if2poumru2f6ghl4sfwutk",[559,560],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":562,"_359":565,"_360":16,"_361":566,"_363":6},{"_342":563,"_344":564},"1751837837",504000000,"z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/z6C8DDcF6FYZnQ",{"_342":554,"_344":555},{"_87":557,"_366":568},"1751828439670",{"_83":570},"FOHM: A Fundamental Open Hypertext Model for Investigating Interoperability between Hypertext Domains",{"_36":27,"_38":572,"_55":577,"_74":578,"_77":579,"_79":582,"_349":583,"_87":576,"_72":576,"_352":584,"_356":587,"_364":589,"_368":-5,"_81":591,"_89":90},{"_38":573,"_95":54,"_55":574,"_72":576,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/letter-to-vannevar-bush-from-engelbart",[56,575],"letter-to-vannevar-bush-from-engelbart","bafy2bzaceapz6vfyjvnouujsswjhsgtdhxldaa6er7ertvvtf2uc5anyy7rjm",[56,575],[54],{"_342":580,"_344":581},"1746392451",380000000,{"_342":580,"_344":581},"2025-05-04T21:00:51.380Z",[585,586],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":588,"_363":63},{"_342":580,"_344":581},{"_87":576,"_366":590},"1746392451380",{"_83":592},"Letter to Vannevar Bush from Engelbart",{"_36":27,"_38":594,"_55":599,"_74":600,"_77":601,"_79":603,"_349":604,"_87":598,"_72":598,"_352":605,"_356":608,"_364":610,"_368":-5,"_81":612,"_89":90},{"_38":595,"_95":54,"_55":596,"_72":598,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/42-a-file-structure-for-the-complex-the-charging-and-the-indeterminate",[56,597],"42-a-file-structure-for-the-complex-the-charging-and-the-indeterminate","bafy2bzacedycyq4lxmpja5dwroz5tgu5jkjckbpthslber6ultftqv4ftg22s",[56,597],[54],{"_342":602,"_344":564},"1746391562",{"_342":602,"_344":564},"2025-05-04T20:46:02.504Z",[606,607],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":609,"_363":63},{"_342":602,"_344":564},{"_87":598,"_366":611},"1746391562503",{"_83":613},"4.2: A File Structure for The Complex, The Charging, and the Indeterminate",{"_36":27,"_38":615,"_55":620,"_74":621,"_77":622,"_79":625,"_349":626,"_87":619,"_72":619,"_352":627,"_356":630,"_364":632,"_368":-5,"_81":634,"_89":90},{"_38":616,"_95":54,"_55":617,"_72":619,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/the-hype-in-hypertext",[56,618],"the-hype-in-hypertext","bafy2bzacecxctduy6skwjksign4curadmp63aojdgrkhaiso2gvseh4usks6a",[56,618],[54],{"_342":623,"_344":624},"1746390655",618000000,{"_342":623,"_344":624},"2025-05-04T20:30:55.618Z",[628,629],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":631,"_363":63},{"_342":623,"_344":624},{"_87":619,"_366":633},"1746390655618",{"_83":635},"The Hype in Hypertext:",{"_36":27,"_38":637,"_55":642,"_74":643,"_77":645,"_79":647,"_349":648,"_87":641,"_72":641,"_352":649,"_356":652,"_364":654,"_368":-5,"_81":656,"_89":90},{"_38":638,"_95":54,"_55":639,"_72":641,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/bitcoin-a-peer-to-peer-electronic-cash-system",[56,640],"bitcoin-a-peer-to-peer-electronic-cash-system","bafy2bzacec5sacme4htf7rr2af4s73pq32kq6s6gdq335d3dqumpt5rentpjc",[56,640],[644],"z6Mkm12s5FcfNj4agUDaCYYwiz13G2rMipVFvCBytNE3Y3br",{"_342":646,"_344":581},"1746390124",{"_342":646,"_344":581},"2025-05-04T20:22:04.380Z",[650,651],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":653,"_363":6},{"_342":646,"_344":581},{"_87":641,"_366":655},"1746390172217",{"_83":657},"Bitcoin: A Peer-to-Peer Electronic Cash System",{"_36":27,"_38":659,"_55":664,"_74":665,"_77":666,"_79":669,"_349":670,"_87":663,"_72":663,"_352":671,"_356":674,"_364":680,"_368":-5,"_81":682,"_89":90},{"_38":660,"_95":54,"_55":661,"_72":663,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/as-we-will-think",[56,662],"as-we-will-think","bafy2bzacecch5uwnt26x7dklj2wsiozscxmqoyev5may4dvqmc6nb5kqhly7k",[56,662],[279],{"_342":667,"_344":668},"1745341604",879000000,{"_342":667,"_344":668},"2025-04-22T17:06:44.879Z",[672,673],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":675,"_359":678,"_360":16,"_361":679,"_363":6},{"_342":676,"_344":677},"1745576239",628000000,"z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/z6B3nWk12rxCRv",{"_342":667,"_344":668},{"_87":663,"_366":681},"1745341604878",{"_83":683},"As We Will Think",{"_36":27,"_38":685,"_55":690,"_74":691,"_77":692,"_79":695,"_349":698,"_87":699,"_72":689,"_352":700,"_356":703,"_364":709,"_368":-5,"_81":711,"_89":90},{"_38":686,"_95":54,"_55":687,"_72":689,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/transcopyright-pre-permission-for-virtual-republishing",[56,688],"transcopyright-pre-permission-for-virtual-republishing","bafy2bzaceclc5nlpgulmjwhnqelgtmzn4ulwy64vercqapqvs7f7m6tshknfm",[56,688],[279],{"_342":693,"_344":694},"1745327549",553000000,{"_342":696,"_344":697},"1745327819",245000000,"2025-04-22T13:12:29.553Z","bafy2bzaceadk7ljpnu3dhwyjwgh4xbtfpuqb4vojfc3wzfpalmc4yeuynia5s",[701,702],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":704,"_359":707,"_360":16,"_361":708,"_363":6},{"_342":705,"_344":706},"1758882964",301000000,"zDnaeXWXuy4pXkctJDhPze8HXMe1k6RGg7CAgQCZrzgTj737w/z6DLSzPhcJnUnu",{"_342":696,"_344":697},{"_87":699,"_366":710},"1745327563804",{"_83":712},"Transcopyright:\nPre-Permission for Virtual Republishing",{"_36":27,"_38":714,"_55":719,"_74":720,"_77":721,"_79":724,"_349":726,"_87":727,"_72":718,"_352":728,"_356":731,"_364":733,"_368":-5,"_81":735,"_89":90},{"_38":715,"_95":54,"_55":716,"_72":718,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/as-we-may-think",[56,717],"as-we-may-think","bafy2bzacec3kkhk7fwcoj2r3igjlqws2osakiwpnxyimlpsnklxrxwtyn6bpu",[56,717],[279],{"_342":722,"_344":723},"1729611030",794000000,{"_342":725,"_344":404},"1743608847","2024-10-22T15:30:30.794Z","bafy2bzacedmimdqfu2cexkqm6y2mlg4cggvgq6nalwzsn2ffpnnjy7an435ae",[729,730],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":732,"_363":6},{"_342":725,"_344":404},{"_87":727,"_366":734},"1743608925485",{"_83":736,"_285":737,"_738":63},"As We May Think","ipfs://bafybeifbrtystxmyorvcqtndxmtwlj5oozrq7ytjz3g2c3jw4mu4trv4nq","showOutline",{"_36":27,"_38":740,"_55":745,"_74":746,"_77":747,"_79":750,"_349":751,"_87":744,"_72":744,"_352":752,"_356":755,"_364":761,"_368":-5,"_81":763,"_89":90},{"_38":741,"_95":54,"_55":742,"_72":744,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/microcosm-an-open-model-for-hypermedia-with-dynamic-linking",[56,743],"microcosm-an-open-model-for-hypermedia-with-dynamic-linking","bafy2bzacedslgk3murmoxfmfgbz43t6hgjml4f4ngzhztmufodoglys4tus46",[56,743],[54],{"_342":748,"_344":749},"1731665822",800000000,{"_342":748,"_344":749},"2024-11-15T10:17:02.800Z",[753,754],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":756,"_359":759,"_360":16,"_361":760,"_363":6},{"_342":757,"_344":758},"1749727803",27000000,"z6MkgYR76i3w2Xc2fcvgFJWfYjsop6YwUonDhQx3AdLmQ4BQ/z6BmB7UXky54FT",{"_342":748,"_344":749},{"_87":744,"_366":762},"1731665822800",{"_83":764},"MICROCOSM: An Open Model for Hypermedia With Dynamic Linking",{"_36":27,"_38":766,"_55":771,"_74":772,"_77":773,"_79":776,"_349":777,"_87":770,"_72":770,"_352":778,"_356":781,"_364":783,"_368":-5,"_81":785,"_89":90},{"_38":767,"_95":54,"_55":768,"_72":770,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/distributed-electronic-rights-in-javascript",[56,769],"distributed-electronic-rights-in-javascript","bafy2bzacedcmcgdvm6gazawxh2s3rd2bx6c3whsllxzrydpttnp5zkzmcsbvk",[56,769],[54],{"_342":774,"_344":775},"1731665029",267000000,{"_342":774,"_344":775},"2024-11-15T10:03:49.267Z",[779,780],{"_83":283,"_55":70,"_355":63},{"_83":84,"_55":76,"_355":63},{"_358":-5,"_359":70,"_360":137,"_361":782,"_363":6},{"_342":774,"_344":775},{"_87":770,"_366":784},"1731665029267",{"_83":786},"Distributed Electronic Rights in JavaScript",1773151562510,[437,96,58],"[\"DOC_LIST_DIRECTORY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records\",\"Children\"]",{"_110":791,"_147":800,"_150":802},{"_112":792,"_131":132,"_133":799,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_793":16,"_794":137,"_795":796,"_32":171,"_797":798},"citations","comments","changes",6,"blocks",{},1773151562521,[801,96],"DOCUMENT_INTERACTION_SUMMARY","[\"DOCUMENT_INTERACTION_SUMMARY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records\"]",{"_110":804,"_147":810,"_150":812},{"_112":805,"_131":132,"_133":809,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":73,"_38":806,"_81":808},{"_72":277,"_95":54,"_38":326,"_55":807,"_97":-5,"_98":-5,"_99":-5,"_100":-5},[],{"_83":283,"_284":102,"_285":286,"_287":288,"_289":70,"_464":-5},1773151562523,[811,54],"ACCOUNT","[\"ACCOUNT\",\"z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH\"]",{"_110":814,"_147":1753,"_150":1754},{"_112":815,"_131":132,"_133":1752,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":816,"_38":1750},{"_29":817,"_72":447,"_73":54,"_74":1746,"_55":1747,"_77":454,"_79":454,"_81":1748,"_85":1749,"_87":447,"_89":90},[818,875,896,944,1048,1069,1187,1229,1333,1361,1429,1496,1582,1677,1691],{"_32":819,"_34":869},[820,834,848,855,862],{"_32":821,"_34":822},[],{"_36":160,"_38":823,"_40":447,"_42":824,"_67":825,"_69":833,"_71":70},"qGvwoRGJ",{},[826],{"_36":204,"_167":827,"_169":829,"_42":831,"_71":832},[828],302,[830],320,{},"mailto:majordomo@toad.com","The contract, a set of promises agreed to in a \"meeting of the minds\", is the traditional way to formalize a relationship. While contracts are primarily used in business relationships (the focus of this article), they can also involve personal relationships such as marraiges. Contracts are also important in politics, not only because of \"social contract\" theories but also because contract enforcement has traditionally been considered a basic function of capitalist governments.",{"_32":835,"_34":836},[],{"_36":160,"_38":837,"_40":447,"_42":838,"_67":839,"_69":847,"_71":70},"5E4zoIt_",{},[840],{"_36":204,"_167":841,"_169":843,"_42":845,"_71":846},[842],253,[844],284,{},"https://www.fon.hum.uva.nl/rob/Courses/InformationInSpeech/CDROM/Literature/LOTwinterschool2006/szabo.best.vwh.net/kolmogorov.html","Whether enforced by a government, or otherwise, the contract is the basic building block of a free market economy. Over many centuries of cultural evolution has emerged both the concept of contract and principles related to it, encoded into common law. Algorithmic information theory suggests that such evolved structures are often prohibitively costly to recompute. If we started from scratch, using reason and experience, it could take many centuries to redevelop sophisticated ideas like property rights that make the modern free market work [Hayek].",{"_32":849,"_34":850},[],{"_36":160,"_38":851,"_40":447,"_42":852,"_67":853,"_69":854,"_71":70},"AO3IFkep",{},[],"The success of the common law of contracts, combined with the high cost of replacing it, makes it worthwhile to both preserve and to make use of these principles where appropriate. Yet, the digital revolution is radically changing the kinds of relationships we can have. What parts of our hard-won legal tradition will still be valuable in the cyberspace era? What is the best way to apply these common law principles to the design of our on-line relationships?",{"_32":856,"_34":857},[],{"_36":160,"_38":858,"_40":447,"_42":859,"_67":860,"_69":861,"_71":70},"P-gR_HSR",{},[],"Computers make possible the running of algorithms heretofore prohibitively costly, and networks the quicker transmission of larger and more sophsiticated messages. Furthermore, computer scientists and cryptographers have recently discovered many new and quite interesting algorithms. Combining these messages and algorithms makes possible a wide variety of new protocols.",{"_32":863,"_34":864},[],{"_36":160,"_38":865,"_40":447,"_42":866,"_67":867,"_69":868,"_71":70},"FDIEBT0K",{},[],"New institutions, and new ways to formalize the relationships that make up these institutions, are now made possible by the digital revolution. I call these new contracts \"smart\", because they are far more functional than their inanimate paper-based ancestors. No use of artificial intelligence is implied. A smart contract is a set of promises, specified in digital form, including protocols within which the parties perform on these promises.",{"_36":870,"_38":871,"_40":447,"_42":872,"_67":873,"_69":874,"_71":70},"Heading","8RDRtJT7",{"_273":323},[],"Introduction",{"_32":876,"_34":891},[877,884],{"_32":878,"_34":879},[],{"_36":160,"_38":880,"_40":447,"_42":881,"_67":882,"_69":883,"_71":70},"wAS9Xqqs",{},[],"The basic idea of smart contracts is that many kinds of contractual clauses (such as liens, bonding, delineation of property rights, etc.) can be embedded in the hardware and software we deal with, in such a way as to make breach of contract expensive (if desired, sometimes prohibitively so) for the breacher. A canonical real-life example, which we might consider to be the primitive ancestor of smart contracts, is the humble vending machine. Within a limited amount of potential loss (the amount in the till should be less than the cost of breaching the mechanism), the machine takes in coins, and via a simple mechanism, which makes a beginner's level problem in design with finite automata, dispense change and product fairly. Smart contracts go beyond the vending machine in proposing to embed contracts in all sorts of property that is valuable and controlled by digital means. Smart contracts reference that property in a dynamic, proactively enforced form, and provide much better observation and verification where proactive measures must fall short. And where the vending machine, like electronic mail, implements an asynchronous protocol between the vending company and the customer, some smart contracts entail multiple synchronous steps between two or more parties.",{"_32":885,"_34":886},[],{"_36":160,"_38":887,"_40":447,"_42":888,"_67":889,"_69":890,"_71":70},"BZ2iU4-N",{},[],"Other forerunners of smart contracts include POS (Point of Sale) terminals and cards, EDI (Electronic Data Interchange, used for ordering and other transactionsbetween large corporations), and the SWIFT, ACH, and FedWire networks for transferring and clearing payments between banks. These implement commercial security models, but too often with little heed paid to the contractual needs and obligations of the parties.",{"_36":870,"_38":892,"_40":447,"_42":893,"_67":894,"_69":895,"_71":70},"sKrmBcRD",{"_273":323},[],"Contracts Embedded in the World",{"_32":897,"_34":939},[898,926],{"_32":899,"_34":914},[900,907],{"_32":901,"_34":902},[],{"_36":160,"_38":903,"_40":447,"_42":904,"_67":905,"_69":906,"_71":70},"G5rPLoVx",{},[],"(a) robust against naive vandalism, and",{"_32":908,"_34":909},[],{"_36":160,"_38":910,"_40":447,"_42":911,"_67":912,"_69":913,"_71":70},"ojBrxvz-",{},[],"(b) robust against sophisticated, incentive compatible (rational) breach",{"_36":160,"_38":915,"_40":447,"_42":916,"_67":917,"_69":925,"_71":70},"cPuJ0mza",{"_273":323},[918],{"_36":919,"_167":920,"_169":922,"_42":924,"_71":70},"Italic",[921],95,[923],116,{},"A broad statement of the key idea of smart contracts, then, is to say that contracts should be embedded in the world. The mechanisms of the world should be structured in such a way as to make the contracts",{"_32":927,"_34":928},[],{"_36":160,"_38":929,"_40":447,"_42":930,"_67":931,"_69":938,"_71":70},"yIxHfsxW",{},[932],{"_36":204,"_167":933,"_169":935,"_42":937,"_71":846},[934],859,[936],889,{},"A vandal can be a strategy or sub-strategy of a game whose utility is at least partially a function of one's own negative utility; or it can be a mistake by a contracting party to the same effect. \"Naive\" simply refers to both lack of forethought as to the consequences of a breach, as well as the relatively low amount of resources expended to enable that breach. Naive vandalism is common enough that it must be taken into consideration. A third category, (c) sophisticated vandalism (where the vandals can and are willing to sacrifice substantial resources), for example a military attack by third parties, is of a special and difficult kind that doesn't often arise in typical contracting, so that we can place it in a separate category and ignore it here. The distinction between naive and sophisticated strategies has been computationally formalized in algorithmic information theory",{"_36":870,"_38":940,"_40":447,"_42":941,"_67":942,"_69":943,"_71":70},"6faQBhSe",{"_273":323},[],"Attacks against Smart Contracts",{"_32":945,"_34":1043},[946,965,977,990,1003,1016,1023,1036],{"_32":947,"_34":948},[],{"_36":160,"_38":949,"_40":447,"_42":950,"_67":951,"_69":964,"_71":70},"E6G1Y7Pw",{},[952],{"_36":919,"_167":953,"_169":958,"_42":963,"_71":70},[954,955,956,957],286,423,568,711,[959,960,961,962],294,433,579,720,{},"The threat of physical force is an obvious way to embed a contract in the world -- have a judicial system decide what physical steps are to be taken out by an enforcement agency (including arrest, confiscation of property, etc.) in response to a breach of contract. It is what I call a reactive form of security. The need to invoke reactive security can be minimized, but not eliminated, by making contractual arrangements verifiable, for example by recording a breach on a video camera, or putting a signature on a contract, in order to prove breach claims in court. Observation of a contract in progress, in order to detect the first sign of breach and minimize losses, also is a reactive form of security. A proactive form of security is a physical mechanism that makes breach expensive, such as a combination lock that makes access to a room containing trade secrets expensive without explicit authorization.",{"_32":966,"_34":967},[],{"_36":160,"_38":968,"_40":447,"_42":969,"_67":970,"_69":976,"_71":70},"ZLSxqFCz",{},[971],{"_36":919,"_167":972,"_169":974,"_42":975,"_71":70},[973],165,[186],{},"From common law, economic theory, and contractual conditions often found in practice, we can distill four basic objectives of contract design. The first of these is observability, the ability of the principals to observe each others' performance of the contract, or to prove their performance to other principals. The field of accounting is, roughly speaking, primarily concerned with making contracts an organization is involved in more observable.",{"_32":978,"_34":979},[],{"_36":160,"_38":980,"_40":447,"_42":981,"_67":982,"_69":989,"_71":70},"zXNQqDxK",{},[983],{"_36":919,"_167":984,"_169":986,"_42":988,"_71":70},[985],19,[987],32,{},"A second objective verifiability, the ability of a principal to prove to an arbitrator that a contract has been performed or breached, or the ability of the arbitrator to find this out by other means. The disciplines of auditing and investigation roughly correspond with verification of contract performance. Observability and verifiability can also include the ability to differentiate between intentional violations of the contract and good faith errors.",{"_32":991,"_34":992},[],{"_36":160,"_38":993,"_40":447,"_42":994,"_67":995,"_69":1002,"_71":70},"kmasqf03",{},[996],{"_36":919,"_167":997,"_169":999,"_42":1001,"_71":70},[998],40,[1000],47,{},"A third objective of contract design is privity, the principle that knowledge and control over the contents and performance of a contract should be distributed among parties only as much as is necessary for the performance of that contract. This is a generalization of the common law principle of contract privity, which states that third parties, other than the designated arbitrators and intermediaries, should have no say in the enforcement of a contract. Generalized privity goes beyond this to formalize the common claim, \"it's none of your business\". Attacks against privity are epitomized by third parties Eve the eavesdropper, a passive observer of contents or performance, and malicious Mallet, who actively interferes with performance or steals service. Under this model privacy and confidentiality, or protecting the value of information about a contract, its parties, and its performance from Eve, is subsumed under privity, as are property rights. The field of security (especially, for smart contracts, computer and network security), roughly corresponds to the goal of privity.",{"_32":1004,"_34":1005},[],{"_36":160,"_38":1006,"_40":447,"_42":1007,"_67":1008,"_69":1015,"_71":70},"fdJ00b-P",{},[1009],{"_36":919,"_167":1010,"_169":1012,"_42":1014,"_71":70},[1011],22,[1013],36,{},"A fourth objective is enforceability, and at the same time minimizing the need for enforcement. Improved verifiability often also helps meet this fourth objective. Reputation, built-in incentives, \"self-enforcing\" protocols, and verifiability can all play a strong part in meeting the fourth objective. Computer and network security also can contribute greatly to making smart contracts self-enforcing.",{"_32":1017,"_34":1018},[],{"_36":160,"_38":1019,"_40":447,"_42":1020,"_67":1021,"_69":1022,"_71":70},"kgYDWybt",{},[],"Smart contracts often involve trusted third parties, exemplified by an intermediary, who is involved in the performance, and an arbitrator, who is invoked to resolve disputes arising out of performance (or lack thereof). Privity implies that we want to minimize vulnerability to third parties. Verifiability and observabiliy often require that we invoke them. A mediator must be trusted with some of the contents and/or performance of the contract. An arbitrator must be trusted with some of the contents, and some of the history of performance, and to resolve disputes and invoke penalties fairly. In smart contract design we want to get the most out of intermediaries and arbitrators, while minimizing exposure to them. One common outcome is that confidentiality is violated only in case of dispute.",{"_32":1024,"_34":1025},[],{"_36":160,"_38":1026,"_40":447,"_42":1027,"_67":1028,"_69":1035,"_71":70},"2e3GxHik",{},[1029],{"_36":204,"_167":1030,"_169":1031,"_42":1033,"_71":1034},[923],[1032],145,{},"https://www.fon.hum.uva.nl/rob/Courses/InformationInSpeech/CDROM/Literature/LOTwinterschool2006/szabo.best.vwh.net/multi.small.html","In the future the size distribution of multinational companies will approach that of local business, giving rise to multinational small business . Legal barriers are the most severe cost of doing business across many jurisdictions. Smart contracts can cut through this Gordian knot of jurisdictions. Where smart contracts can increase privity, they can decrease vulnerability to capricious jurisdictions. Where smart contracts can increase observability or verifiability, they can decrease dependence on these obscure local legal codes and enforcement traditions.",{"_32":1037,"_34":1038},[],{"_36":160,"_38":1039,"_40":447,"_42":1040,"_67":1041,"_69":1042,"_71":70},"1khT36kZ",{},[],"The consequences of smart contract design on contract law and economics, and on strategic contract drafting, (and vice versa), have been little explored. As well, I suspect the possibilities for greatly reducing the transaction costs of executing some kinds of contracts, and the opportunities for creating new kinds of businesses and social institutions based on smart contracts, are vast but little explored. The \"cypherpunks\" have explored the political impact of some of the new protocol building blocks. The field of Electronic Data Interchange (EDI), in which elements of traditional business transactions (invoices, receipts, etc.) are exchanged electronically, sometimes including encryption and digital signature capabilities, can be viewed as a primitive forerunner to smart contracts. Indeed those business forms can provide good starting points and channel markers for smart contract designers.",{"_36":870,"_38":1044,"_40":447,"_42":1045,"_67":1046,"_69":1047,"_71":70},"yDbqeOMM",{"_273":323},[],"Some Basic Principles of Contract Design",{"_32":1049,"_34":1064},[1050,1057],{"_32":1051,"_34":1052},[],{"_36":160,"_38":1053,"_40":447,"_42":1054,"_67":1055,"_69":1056,"_71":70},"H0WLXiNl",{},[],"One important task of smart contracts, that has been largely overlooked by traditional EDI, is critical to \"the meeting of the minds\" that is at the heart of a contract: communicating the semantics of the protocols to the parties involved. There is ample opportunity in smart contracts for \"smart fine print\": actions taken by the software hidden from a party to the transaction. For example, grocery store POS machines don't tell customers whether or not their names are being linked to their purchases in a database. The clerks don't even know, and they've processed thousands of such transactions under their noses. Thus, via hidden action of the software, the customer is giving away information they might consider valuable or confidential, but the contract has been drafted, and transaction has been designed, in such a way as to hide those important parts of that transaction from the customer.",{"_32":1058,"_34":1059},[],{"_36":160,"_38":1060,"_40":447,"_42":1061,"_67":1062,"_69":1063,"_71":70},"aBQBg2EY",{},[],"To properly communicate transaction semantics, we need good visual metaphors for the elements of the contract. These would hide the details of the protocol without surrendering control over the knowledge and execution of contract terms. A primitive but good example is provided by the SecureMosiac software from CommerceNet. Encryption is shown by putting the document in an envelope, and a digital signature by affixing a seal onto the document or envelope. On the other hand, Mosaic servers log connections, and sometimes even transactions, without warning users -- classic hidden actions.",{"_36":870,"_38":1065,"_40":447,"_42":1066,"_67":1067,"_69":1068,"_71":70},"1bqx2PGw",{"_273":323},[],"Observability & Hidden Actions",{"_32":1070,"_34":1182},[1071,1086,1108,1120,1139,1150,1163],{"_32":1072,"_34":1073},[],{"_36":160,"_38":1074,"_40":447,"_42":1075,"_67":1076,"_69":1085,"_71":70},"6eNVwDGR",{},[1077],{"_36":919,"_167":1078,"_169":1081,"_42":1084,"_71":70},[1079,1080],39,356,[1082,1083],62,360,{},"Protocols based on mathematics, called cryptographic protocols, tre the basic building blocks that implement the improved tradeoffs between observability, verifiability, privity, and enforceability in smart contracts. Contrary to the common wisdom, obscurity is often critical to security. Cryptographic protocols are built around foci of obscurity called keys. A key's immense unknown randomness allows the rest of the system to be simple and public. The obscurity of a large random number, so vast that a lucky guess is unlikely in in, if desired, the lifetime of the universe, is the foundation upon which cryptographic protocols, and in turn smart contracts, are built.",{"_32":1087,"_34":1088},[],{"_36":160,"_38":1089,"_40":447,"_42":1090,"_67":1091,"_69":1107,"_71":70},"lnFqFC19",{},[1092,1100],{"_36":919,"_167":1093,"_169":1096,"_42":1099,"_71":70},[1094,1095],120,380,[1097,1098],130,391,{},{"_36":204,"_167":1101,"_169":1103,"_42":1105,"_71":1106},[1102],1002,[1104],1005,{},"http://szabo.best.vwh.net/rsa.html","A wide variety of new cryptographic protocols have emerged in recent years. The most tradtional kind of cryptography is secret key cryptography, in which Alice and Bob (our exemplar parties to a smart contract) use a single shared, prearranged key to encrypt messages between them. A fundamental problem we will see throughout these protocols is the need to keep keys secret, and pubilic key cryptography helps solve this. In this technique, Alice generates two keys, called the private and public keys. She keeps the private key secret and well protected, and publishes the public key. When Bob wishes to send a message to Alice, he encrypts a message with her public key, sends the encrypted message, and she decrypts the message with her private key. The private key provides a \"trapdoor\" that allows Alice to compute an easy inverse of the encryption function that used the public key. The public key provides no clue as to what the private key is, even though they are mathematically related. The RSA algorithm is the most widely used method of public key cryptography.",{"_32":1109,"_34":1110},[],{"_36":160,"_38":1111,"_40":447,"_42":1112,"_67":1113,"_69":1119,"_71":70},"x8HfPaye",{},[1114],{"_36":919,"_167":1115,"_169":1116,"_42":1118,"_71":70},[1082],[1117],80,{},"Public key cryptography also makes possible a wide variety of digital signatures. These proves that a piece of data (hereafter referred to as just an \"object\") was in active contact with the private key corresponding to the signature: the object was actively \"signed\" with that key. The digital signature probably should have been called a \"digital stamp\" or \"digital seal\" since its function resembles more those methods than an autograph. In particular, it is not biometric like an autograph, although incorporation of a typed-in password as part of the private key used to sign can sometimes subsitute for an autograph. In many Asian countries, a hand-carved wooden block, called a \"chop\", is often used instead of autographs. Every chop is unique, and because of the unique carving and wood grain cannot be copied. A digital signature is similar to the chop, since every newly generated key is unique, but it is trivial to copy the key if obtained from the holder. A digital signature relies on the assumption that the holder will keep the private key secret.",{"_32":1121,"_34":1122},[],{"_36":160,"_38":1123,"_40":447,"_42":1124,"_67":1125,"_69":1138,"_71":70},"84LIsRBE",{},[1126,1131],{"_36":919,"_167":1127,"_169":1128,"_42":1130,"_71":70},[16],[1129],17,{},{"_36":204,"_167":1132,"_169":1134,"_42":1136,"_71":1137},[1133],589,[1135],609,{},"http://www.digicash.com/publish/bigbro.html","A blind signature is a digital signature and secret-key encryption protocol that together have the mathematical property of commutativity, so that they can be stripped in reverse of the order they were applied. The effect is that Bob \"signs\" an object, for which he can verify its general form, but cannot see its specific content. Typically the key of the signature defines the meaning of the signed object, rather than the contents of the object signed, so that Bob doesn't sign a blank check. Blind signatures used in digital bearer instruments, where Bob is the clearing agent, and in Chaumian credentials , where Bob is the credential issuer.",{"_32":1140,"_34":1141},[],{"_36":160,"_38":1142,"_40":447,"_42":1143,"_67":1144,"_69":1149,"_71":70},"dl-ils-N",{},[1145],{"_36":919,"_167":1146,"_169":1147,"_42":1148,"_71":70},[137],[171],{},"Secret sharing is a method of splitting a key (and thus control over any object encrypted with that key) into N parts, of which only M are needed to recreate the key, but less than M of the parts provide no information about the key. Secret sharing is a potent tool for distributing control over objects between principals.",{"_32":1151,"_34":1152},[],{"_36":160,"_38":1153,"_40":447,"_42":1154,"_67":1155,"_69":1162,"_71":70},"4mmQju8P",{},[1156],{"_36":204,"_167":1157,"_169":1159,"_42":1160,"_71":1161},[1158],4,[1013],{},"http://www.niksula.cs.hut.fi/~haa/nonpub/zeroknowledge.html","The zero-knowledge interactive proof is an alternative to public key methods for challenge-response identification. Otherwise normally functioning parties who have an incentive to respond properly to the challenge, but fail to do so, do not possess the key), without revealing any information about that privatge key to the challenger or any eavesdroppers. ZKIPs are currently used for authentication, and in smart weapons for Identification Friend or Foe (IFF).",{"_32":1164,"_34":1165},[],{"_36":160,"_38":1166,"_40":447,"_42":1167,"_67":1168,"_69":1181,"_71":70},"qyW9d3MJ",{},[1169,1175],{"_36":204,"_167":1170,"_169":1172,"_42":1174,"_71":1137},[1171],226,[1173],246,{},{"_36":919,"_167":1176,"_169":1178,"_42":1180,"_71":70},[1177],361,[1179],372,{},"Information about who is talking to whom, such as can be found on telephone bills, can be quite valuable even without records of the actual content. Confidential messsaging is necessary for the some of the privity features of Chaumian credentials and bearer securities to be strongly implemented on an actual network. To provide this traffic confidentiality, a digital mix can allow parties to communicate across a network without revealing their partners to network providers or the outside world. In a mix, traffic analysis by Eve is prevented by the Russian-doll encryption of the message by the sender with the public keys of each mix operator in the chain, and the mixing of messages by each operator, so that panoptic wiretapper Eve loses track of the messages. For the sender/recipient pair to remain confidential, only 1 out of N of the operators needs to be trusted with their local traffic information, although Eve can sometimes gather statistics over large numbers of messages between the same partners to eventually guess who is talking to whom. The communicating parties can also be mutually anonymous, and with normal encryption need trust no other parties with the content of messages. The \"Mixmaster\" software on the Internet implements most of the features of a digital mix[Mixmaster].",{"_36":870,"_38":1183,"_40":447,"_42":1184,"_67":1185,"_69":1186,"_71":70},"fEoK8lyx",{"_273":323},[],"Cryptographic Building Blocks",{"_32":1188,"_34":1224},[1189,1196,1203,1210,1217],{"_32":1190,"_34":1191},[],{"_36":160,"_38":1192,"_40":447,"_42":1193,"_67":1194,"_69":1195,"_71":70},"MNhDzNt0",{},[],"So far, we've assumed parties like Alice and Bob are monolithic. But in the world of smart contracts, they will use computer-based software agents and smart cards to do their electronic bidding. Keys are not necessarily tied to identities, and the task of doing such binding turns out to be more difficult than at first glance. Once keys are bound, they need to be well protected, but wide area network connections are notoriously to hacking.",{"_32":1197,"_34":1198},[],{"_36":160,"_38":1199,"_40":447,"_42":1200,"_67":1201,"_69":1202,"_71":70},"8mI4_IaB",{},[],"If we assume that the attacker has the ability to intercept and redirect any messages in the network protocol, as is the case on wide area netowrks such as the Internet. then we must also assume, for practical all commercial operating systems, that they would also be able to invade client if not merchant computers and find any keys lying on the disk.",{"_32":1204,"_34":1205},[],{"_36":160,"_38":1206,"_40":447,"_42":1207,"_67":1208,"_69":1209,"_71":70},"1Wv7NXUV",{},[],"There's no completely satisfactory solution to end point operations security from network-based attacks, but here's a strategy for practically defanging this problem for public-key based systems:",{"_32":1211,"_34":1212},[],{"_36":160,"_38":1213,"_40":447,"_42":1214,"_67":1215,"_69":1216,"_71":70},"oQ6orEAm",{},[],"All public key operation are are done inside an unreadable hardware board on a machine with a very narrow serial-line connection (ie, it carries only a simple single-use protocol with well-verified security) to a dedicated firewall. Such a board is available, for example, from Kryptor, and I believe Viacrypt may also have a PGP-compatable board. This is economical for central sites, but may be less practical for normal users. Besides better security, it has the added advantage that hardware speeds up the public key computations.",{"_32":1218,"_34":1219},[],{"_36":160,"_38":1220,"_40":447,"_42":1221,"_67":1222,"_69":1223,"_71":70},"N0PaM2gx",{},[],"If Mallet's capability is to physically sieze the machine, a weaker form of key protection will suffice. The trick is to hold the keys in volatile memory. This makes the PC proof from physical attacks -- all that needed to destroy the keys is to turn off the PC. If the key backups can be hidden in a different, secure physical location, this allows the user of this PC to encrypt large amounts of data both on the PC itself and on public computer networks, without fear that physical attack against the PC will compromise that data. The data is still vulnerable to a \"rubber hose attack\" where the owner is coerced into revealing the hidden keys. Protection against rubber hose attacks might require some form of Shamir secret sharing which splits the keys between diverse phgsical sites.",{"_36":870,"_38":1225,"_40":447,"_42":1226,"_67":1227,"_69":1228,"_71":70},"vYetqqhS",{"_273":323},[],"Protection of Keys",{"_32":1230,"_34":1328},[1231,1238,1251],{"_32":1232,"_34":1233},[],{"_36":160,"_38":1234,"_40":447,"_42":1235,"_67":1236,"_69":1237,"_71":70},"A5nCaV9L",{},[],"How does Alice know she has Bob's key? Who, indeed, can be the parties to a smart contract? Can they be defined just by their keys? Do we need biometrics (such as autographs, typed-in passwords, retina scans, etc.)?",{"_32":1239,"_34":1240},[],{"_36":160,"_38":1241,"_40":447,"_42":1242,"_67":1243,"_69":1250,"_71":70},"56UzyDzm",{},[1244],{"_36":919,"_167":1245,"_169":1247,"_42":1249,"_71":70},[1246],127,[1248],138,{},"The public key cryptography software package \"Pretty Good Privacy\" (PGP) uses a model called \"the web of trust\". Alice chooses introducers whom she trusts to properly identify the map between other people and their public keys. PGP takes it from there, automatically validating any other keys that have been signed by Alice's designated introducers.",{"_32":1252,"_34":1323},[1253,1260,1281],{"_32":1254,"_34":1255},[],{"_36":160,"_38":1256,"_40":447,"_42":1257,"_67":1258,"_69":1259,"_71":70},"uKFzqaxs",{},[],"1) Does the key actually belong to whom it appears to belong? In other words, has it been certified with a trusted signature?",{"_32":1261,"_34":1276},[1262,1269],{"_32":1263,"_34":1264},[],{"_36":160,"_38":1265,"_40":447,"_42":1266,"_67":1267,"_69":1268,"_71":70},"GDX3ULZm",{},[],"Having been told by Alice the answer to the second question, PGP can calculates the answer to the first question for the public keys Alice has collected.",{"_32":1270,"_34":1271},[],{"_36":160,"_38":1272,"_40":447,"_42":1273,"_67":1274,"_69":1275,"_71":70},"eT4Ugg4D",{},[],"Keys that have been certified by a trusted introducer are deemed valid by PGP. The keys belonging to trusted introducers must themselves be certified either by you or by other trusted introducers. This \"transitivity\" introduces an implicit third criterion",{"_36":160,"_38":1277,"_40":447,"_42":1278,"_67":1279,"_69":1280,"_71":70},"bIUzOUmz",{"_273":323},[],"2) Does it belong to an introducers, someone you can trust to certify other keys?",{"_32":1282,"_34":1318},[1283,1290,1297,1304,1311],{"_32":1284,"_34":1285},[],{"_36":160,"_38":1286,"_40":447,"_42":1287,"_67":1288,"_69":1289,"_71":70},"1MbR_oFn",{},[],"PGP confuses this with criterion (2). It is not clear that any single person has enough judgement to properly undertake task (3), nor has a reasonable institution been proposed that will do so. This is one of the unsolved problems in smart contracts.",{"_32":1291,"_34":1292},[],{"_36":160,"_38":1293,"_40":447,"_42":1294,"_67":1295,"_69":1296,"_71":70},"YuiU4TH5",{},[],"PGP also can be given trust ratings and programmed to compute a weighted score of validity-- for example, two marginally trusted signatures might be considered as credible as one fully trusted signature.",{"_32":1298,"_34":1299},[],{"_36":160,"_38":1300,"_40":447,"_42":1301,"_67":1302,"_69":1303,"_71":70},"0VRUzXL8",{},[],"Any keys in Alice's secret key ring are \"axiomatically\" valid to Alice's PGP program, needing no introducer's signature. PGP also assumes that Alice ultimately trusts herself to certify other keys.",{"_32":1305,"_34":1306},[],{"_36":160,"_38":1307,"_40":447,"_42":1308,"_67":1309,"_69":1310,"_71":70},"yWXWyqa3",{},[],"It is believed that PGP causes the emergence of a decentralized fault-tolerant web of confidence for all public keys, but a chain of introduced introducers grows weak very quickly, due to lack of transitivity.",{"_32":1312,"_34":1313},[],{"_36":160,"_38":1314,"_40":447,"_42":1315,"_67":1316,"_69":1317,"_71":70},"r7ftrFLc",{},[],"PGP's grass-roots approach contrasts sharply with tradtional public key management schemes, such as X.509 and the related Privacy Enhanced Mail (PEM). These standard schemes subsistute a heirarchical system of introducers called certification authorities (CAs).",{"_36":160,"_38":1319,"_40":447,"_42":1320,"_67":1321,"_69":1322,"_71":70},"95cRZm6a",{"_273":323},[],"3) Does the key belong to someone you can trust to introduce other introducers?",{"_36":160,"_38":1324,"_40":447,"_42":1325,"_67":1326,"_69":1327,"_71":70},"3Uyvggp-",{"_273":323},[],"There are two entirely separate criteria PGP uses to judge a public key's usefulness:",{"_36":870,"_38":1329,"_40":447,"_42":1330,"_67":1331,"_69":1332,"_71":70},"w14MGSFB",{"_273":323},[],"The Man In the Middle & PGP's Web of Trust",{"_32":1334,"_34":1356},[1335,1342,1349],{"_32":1336,"_34":1337},[],{"_36":160,"_38":1338,"_40":447,"_42":1339,"_67":1340,"_69":1341,"_71":70},"1H3pwELJ",{},[],"Two different acts are often called \"notarization\". The first is simply where one swears to the truth of some affidavit before a notary or some other officer entitled to take oaths. This does not require the notary to know who the affiant is. The second act is when someone \"acknowledges\" before a notary that he has executed a document as ``his own act and deed.'' This second act requires the notary to know the person making the acknowledgment. Thus, for example, the form of an acknowledgment can go something like this:",{"_32":1343,"_34":1344},[],{"_36":160,"_38":1345,"_40":447,"_42":1346,"_67":1347,"_69":1348,"_71":70},"uK2zOldQ",{},[],"On this ____ day of ___, 19__, personally appeared before me ____, known to me and known to me to be the person who signed the foregoing instrument, and acknowledged that he executed the same as his own act and deed.",{"_32":1350,"_34":1351},[],{"_36":160,"_38":1352,"_40":447,"_42":1353,"_67":1354,"_69":1355,"_71":70},"iqq8puOX",{},[],"In the first type of act of notarization, the notary merely certifies that the affiant swore the statement was true. In the second type the notary actually vouches that the person making the acknowledgment was who he claims to be.",{"_36":870,"_38":1357,"_40":447,"_42":1358,"_67":1359,"_69":1360,"_71":70},"dyvRlJNe",{"_273":323},[],"Notaries Public",{"_32":1362,"_34":1424},[1363,1376,1383,1390,1397,1404,1417],{"_32":1364,"_34":1365},[],{"_36":160,"_38":1366,"_40":447,"_42":1367,"_67":1368,"_69":1375,"_71":70},"GyWiypqN",{},[1369],{"_36":919,"_167":1370,"_169":1372,"_42":1374,"_71":70},[1371],289,[1373],317,{},"These roles of a notary public are substantially different from the alleged role of heirarchies of \"certification authorities\" (CAs) in PEM/X.509, and the \"web of trust\" in PGP, to \"prove identity\". In fact the certificates generated by these systems do no such thing. Rather a certficate proves that a claim was made by a CA at some time in the past. The (implicit) claim is that a particular key belonged to a particular person at that time. That key is not biometric like an autograph, and can thus be transferred at any time. Furthermore, false claims can be made by a CA about what keys an end-user has held, and the end-user can be stuck with no evidence of CA fraud; nor does the CA have any way of proving that their claim is correct if an end-user challenges it. It is extremely difficult, on the other hand, for notary publics to forge autographs and expect to get away with it often enough to maintain their professional reputations.",{"_32":1377,"_34":1378},[],{"_36":160,"_38":1379,"_40":447,"_42":1380,"_67":1381,"_69":1382,"_71":70},"7A4HSU84",{},[],"Both the PGP web of trust and X.509 models suffer from more flaws. A single rooted heirarchy assumes a mythological beast called a universally trusted entity. Heirarchies in general create rigid structures that don't fit the way knowledge about keys and keyholders, and incentives to accurately reflect that knowledge, are distributed among people in the real world. In turn, hile PGP distinguishes between \"Alice holds a key\" and \"Alice can be trusted to certify a key\", it does not follow that the second claim that Alice can be trusted to validate another issuer. There is little transitivity: seeing Alice's key certified by Bob, whom I know and trust, tells me little about whether Alice's certification of Charlie's key is correct. Seeing Alice certified by Bob as an introducer tells me little about wether Alice can be trusted to certify other introducers. It does tell me that I know to blame Alice if her claim turns out to be wrong; although it's far from clear that Alice has any legal liability.",{"_32":1384,"_34":1385},[],{"_36":160,"_38":1386,"_40":447,"_42":1387,"_67":1388,"_69":1389,"_71":70},"9WMZZlNL",{},[],"There is an even more severe flaw when public key is used for digital signatures. Because the claim was only made in the past, both PGP and X.509 allow the end user to plausible deny that they \"signed\" a document; and conversely if one's key is surreptitiously stolen, or for other reasons no revocation action is taken, there is no way to prove that one did not \"sign\" the documenent digitally \"signed\" with the stolen key. Finally, there is no widely accepted legal agreement on what is specifically being claimed when one \"certifies\" a key, nor is there any built-in or widely used mechanism for describing the actual claim one is making. Real world CAs have a nasty habit of disclaiming liability for their mistakes, or for the misunderstandings that will arise out of the often vague and sloppy, sometimes implicit claims they make. Finally, there are a wide variety of other claims one might make about a key, such as \"this key belongs to an office\", \"this key belongs to a server\", \"this keyholder has a good credit rating\", \"use this key to decrypt your new copy of Microsquish Expel\", \"this key is good for 100 MB of downloads from our web server\", etc. which are facilitated by neither X.509 nor the PGP web of trust.",{"_32":1391,"_34":1392},[],{"_36":160,"_38":1393,"_40":447,"_42":1394,"_67":1395,"_69":1396,"_71":70},"5EWnIQGS",{},[],"We know too little about the best uses of public-key cryptography to establish such fixed methods with such narrow semantics. This author has suggested a mechanism which modifies the PGP web of trust to create arbitrary certificate with a form roughly as follows:",{"_32":1398,"_34":1399},[],{"_36":160,"_38":1400,"_40":447,"_42":1401,"_67":1402,"_69":1403,"_71":70},"Sh9VJjNx",{},[],"Key about which a claim is being made type of claim, in some standard one-line format (like MIME types) Plain text description of claim Timestamp digitally \"signed\", Alice's key",{"_32":1405,"_34":1406},[],{"_36":160,"_38":1407,"_40":447,"_42":1408,"_67":1409,"_69":1416,"_71":70},"b0NbvWcv",{},[1410],{"_36":919,"_167":1411,"_169":1413,"_42":1415,"_71":70},[1412],48,[1414],56,{},"In other words, all claims about keys should be explicit, readily known from reading the certificate itself, and no kind of claim should be arbitrarily excluded by the mechanism. The legal force of the claim can be based on the text itself, rather than overstated, obscure, and often implicit interpretations about what \"certifying\" is supposed to mean. Standard kinds of claims will emerge, including perhaps more transitive \"good judge of judgement\" certificates for which chain-following software can be written, and non-transitive \"is-a-person\" credentials directly \"bound\" to traditional notarized identification by a physical notarization protocol that includes both autographs and digital \"signatures\". More likely, new and more useful kinds of certificates will evolve. These standards should be allowed to emerge out of the wide varieties of possible end uses, much like case law has matured over time, rather than being dictated by our current very inexperienced understanding.",{"_32":1418,"_34":1419},[],{"_36":160,"_38":1420,"_40":447,"_42":1421,"_67":1422,"_69":1423,"_71":70},"tB8CiHqY",{},[],"Meanwhile, there is a more practical defense aggainst the man in the middle attack: advertise, early and often. Users of an insecure network can communicate the integrity of a key reasonably well by tying it to a persistent pattern of behavior: for example posts in a persistent style from a persistent e-mail address, persistence of a key unchallenged on a key server, etc. This is the most practical and widely used way by which PGP users gain confidence in public keys, and it does not require certification authorities or introducers. Those who advertise their keys widely, and those who are well known, are more likely to have keys bound to their person.",{"_36":870,"_38":1425,"_40":447,"_42":1426,"_67":1427,"_69":1428,"_71":70},"BnXTj3bG",{"_273":323},[],"Problems with Certification",{"_32":1430,"_34":1491},[1431,1438,1455,1467,1479],{"_32":1432,"_34":1433},[],{"_36":160,"_38":1434,"_40":447,"_42":1435,"_67":1436,"_69":1437,"_71":70},"9WdTWpwW",{},[],"\"Identity\" is hardly the only thing we might want map to a key. After all, physical keys we use for our house, car, etc. are not necessarily tied to our identity -- we can loan them to trusted friends and relatives, make copies of them, etc. Indeed, in cyberspace we might create \"virtual personae\" to reflect such multi-person relationships, or in contrast to reflect different parts of our personality that we do not want others to link. Here is a possible classification scheme for virtual personae, pedagogically presented:",{"_32":1439,"_34":1440},[],{"_36":160,"_38":1441,"_40":447,"_42":1442,"_67":1443,"_69":1454,"_71":70},"ET_L9ntc",{},[1444,1448],{"_36":919,"_167":1445,"_169":1446,"_42":1447,"_71":70},[16],[201],{},{"_36":204,"_167":1449,"_169":1451,"_42":1453,"_71":1137},[1450],461,[1452],481,{},"A nym is an identifier that links only a small amount of related information about a person, usually that information deemed by the nym holder to be relevant to a particular organization or community. Examples of nyms include electronic bulletin board nicknames, pen names, aliases, and brand names. A nym may gain reputation within its community. For example, a conglomerate may sell a wide variety of brand names, each reputable in its own market niche. With Chaumian credentials , a nym can take advantage of the positive credentials of the holder's other nyms, as provably linked by the is-a-person credential.",{"_32":1456,"_34":1457},[],{"_36":160,"_38":1458,"_40":447,"_42":1459,"_67":1460,"_69":1466,"_71":70},"EmiCJtk2",{},[1461],{"_36":919,"_167":1462,"_169":1463,"_42":1465,"_71":70},[16],[1464],11,{},"A true name is an identifier that links many different kinds of information about an person, such as a full birth name or social security number. As in magick, knowing a true name can confer tremendous power to one's enemies. It also can have major economic value among those who cooperate peacefully, as in the use of direct marketing to target product information to those persons most likely to be interested in those particular products.",{"_32":1468,"_34":1469},[],{"_36":160,"_38":1470,"_40":447,"_42":1471,"_67":1472,"_69":1478,"_71":70},"N1o7Q4ZL",{},[1473],{"_36":919,"_167":1474,"_169":1475,"_42":1477,"_71":70},[16],[1476],9,{},"A persona is any perstient pattern of behavior, along with consistently grouped information such as key(s), name(s), network address(es), writing style, and services provided.",{"_32":1480,"_34":1481},[],{"_36":160,"_38":1482,"_40":447,"_42":1483,"_67":1484,"_69":1490,"_71":70},"6cBbwzaO",{},[1485],{"_36":919,"_167":1486,"_169":1487,"_42":1489,"_71":70},[16],[1488],16,{},"A reputable name is a nym or true name that has a good reputation, usually because it carries many positive credentials, has a good credit rating, or is otherwise highly regarded. Companies strive to carry reputable brand names, while professionals such as doctors and lawyers strive to have many good personal recommendations of their name. Reputable names can be difficult to transfer between parties, because reputation assumes persistence of behavior, but such transfer can sometimes occur (for example, the sale of brand names between companies).",{"_36":870,"_38":1492,"_40":447,"_42":1493,"_67":1494,"_69":1495,"_71":70},"pBMZ0Z5a",{"_273":323},[],"Virtual Personae",{"_32":1497,"_34":1577},[1498,1511,1524,1531,1547,1565],{"_32":1499,"_34":1500},[],{"_36":160,"_38":1501,"_40":447,"_42":1502,"_67":1503,"_69":1510,"_71":70},"-GSV5iVk",{},[1504],{"_36":919,"_167":1505,"_169":1507,"_42":1509,"_71":70},[1506],42,[1508],68,{},"Blind signatures can be used to construct digital bearer instruments, objects identified by a unique key, and issued, cleared, and redeemed by a clearing agent. When an object is transferred, the trasferee can request the clearing agent to verify that the key has never before been cleared, and issue a new key. The clearing agent prevents multiple clearing of particular objects, but can be prevented from linking particular objects one or both of the clearing nyms who transferred that object. These instruments come in an \"online\" variety, cleared during every transfer, and thus both verifiable and observable, and an \"offline\" variety, which can be transfered without being cleared, but is only verifiable when finally cleared, by revealing any the clearing nym of any intermediate holder who transfered the object multiple times (a breach of contract). Privacy from the clearing agent can take the form of transferee-unlinkability, transferer-unlinkability, or \"double blinded\" where both transferer and transferee are unlinkable by the clearing agent.",{"_32":1512,"_34":1513},[],{"_36":160,"_38":1514,"_40":447,"_42":1515,"_67":1516,"_69":1523,"_71":70},"KreozVqm",{},[1517],{"_36":204,"_167":1518,"_169":1519,"_42":1521,"_71":1522},[137],[1520],13,{},"http://www.digicash.com/ecash/about.html","Digital cash is the premier example of a digital bearer instrument, in which the clearing agent is a bank. Bearer instrument protocols enable online payment while honoring the characteristics desired of bearer notes, especially unforgeability (via the clearing mechanism) and transfer confidentiality (via blinding).",{"_32":1525,"_34":1526},[],{"_36":160,"_38":1527,"_40":447,"_42":1528,"_67":1529,"_69":1530,"_71":70},"B6dNwYDO",{},[],"To implement a full transaction of payment for services, we need more than just the digital cash protocol; we need a protocol that guarantees that service will be rendered if payment is made, and vice versa. Current commercial systems use a wide variety of techniques to accomplish this, such as certified mail, face to face exchange, reliance on credit history and collection agencies to extend credit, etc. Smart contracts have the potential to greatly reduce the fraud and enforcement costs of many commercial transactions.",{"_32":1532,"_34":1533},[],{"_36":160,"_38":1534,"_40":447,"_42":1535,"_67":1536,"_69":1546,"_71":70},"x5e3YBgk",{},[1537],{"_36":919,"_167":1538,"_169":1541,"_42":1545,"_71":70},[16,1539,1540],59,217,[1542,1543,1544],12,78,236,{},"A credential is a claim made by one party about another. A positive credential is one the second party would prefer to reveal, such as a degree from a prestigious school, while that party would prefer not to reveal a negative credential such as a bad credit rating.",{"_32":1548,"_34":1549},[],{"_36":160,"_38":1550,"_40":447,"_42":1551,"_67":1552,"_69":1564,"_71":70},"CRAykzp_",{},[1553,1558],{"_36":204,"_167":1554,"_169":1555,"_42":1557,"_71":1137},[16],[1556],21,{},{"_36":919,"_167":1559,"_169":1561,"_42":1563,"_71":70},[1560],185,[1562],207,{},"A Chaumian credential is a cryptographic protocol for proving one possesses claims made about onself by other nyms, without revealing linkages between those nyms. It's based around the is-a-person credential the true name credential, used to prove the linkage of otherwise unlinkable nyms, and to prevent the transfer of nyms between parties.",{"_32":1566,"_34":1567},[],{"_36":160,"_38":1568,"_40":447,"_42":1569,"_67":1570,"_69":1576,"_71":70},"oOOMY43_",{},[1571],{"_36":919,"_167":1572,"_169":1574,"_42":1575,"_71":70},[1573],30,[1000],{},"Another form of credential is bearer credential, a digital bearer instrument where the object is a credential. Here the second party in the claim refers to any bearer -- the claim is tied only to the reputable name of issuing organization, not to the nym or true name of the party holding the credential.",{"_36":870,"_38":1578,"_40":447,"_42":1579,"_67":1580,"_69":1581,"_71":70},"hzuEpbHV",{"_273":323},[],"Constructing Smart Contracts",{"_32":1583,"_34":1672},[1584,1591,1598,1605,1612,1623,1630,1637,1644,1651,1658,1665],{"_32":1585,"_34":1586},[],{"_36":160,"_38":1587,"_40":447,"_42":1588,"_67":1589,"_69":1590,"_71":70},"gd8LFOln",{},[],"We can extend the concept of smart contracts to property. Smart property might be created by embedding smart contracts in physical objects. These embedded protocols would automatically give control of the keys for operating the property to the party who rightfully owns that property, based on the terms of the contract. For example, a car might be rendered inoperable unless the proper challenge-response protocol is completed with its rightful owner, preventing theft. If a loan was taken out to buy that car, and the owner failed to make payments, the smart contract could automatically invoke a lien, which returns control of the car keys to the bank. This \"smart lien\" might be much cheaper and more effective than a repo man. Also needed is a protocol to provably remove the lien when the loan has been paid off, as well as hardship and operational exceptions. For example, it would be rude to revoke operation of the car while it's doing 75 down the freeway.",{"_32":1592,"_34":1593},[],{"_36":160,"_38":1594,"_40":447,"_42":1595,"_67":1596,"_69":1597,"_71":70},"IsaSVL0x",{},[],"Smart property is software or physical devices with the desired characteristics of ownership embedded into them; for example devices that can be rendered of far less value to parties who lack possesion of a key, as demonstrated via a zero knowledge interactive proof.",{"_32":1599,"_34":1600},[],{"_36":160,"_38":1601,"_40":447,"_42":1602,"_67":1603,"_69":1604,"_71":70},"pPKXy1xE",{},[],"One method of implementing smart property is thru operation necessary data (OND): data necessary to the operation of smart property. For example, a complex, OND can be proprietary firing sequence needed to operate a computerized engine, a CAM file needed to manufacture a specialized part, etc. To avoid theft of service, ZKIP is required to open an encrypted channel to the device. To avoid leaking the OND to Eve, tamper detection combined with a dead-man switch can be used on the device end of the channel.",{"_32":1606,"_34":1607},[],{"_36":160,"_38":1608,"_40":447,"_42":1609,"_67":1610,"_69":1611,"_71":70},"hCb4TAZN",{},[],"We might also usedand engrained immobilizing or destructive devices to foil attempts to hot-wire smart property.",{"_32":1613,"_34":1614},[],{"_36":160,"_38":1615,"_40":447,"_42":1616,"_67":1617,"_69":1622,"_71":70},"A7AlEduH",{},[1618],{"_36":919,"_167":1619,"_169":1620,"_42":1621,"_71":70},[16],[1542],{},"A smart lien is the sharing of a smart property between parties, usually two parties called the owner and the lienholder. This property may be in the proximate possesion of the owner or the lienholder, corresponding to the common-law notions of \"artisan's lien\" and \"innkeeper's lien\" respectively. Smart liens might be used to secure lines of credit, insurance policies,and many other kinds of contracts that involve smart property.",{"_32":1624,"_34":1625},[],{"_36":160,"_38":1626,"_40":447,"_42":1627,"_67":1628,"_69":1629,"_71":70},"pnvPCoPI",{},[],"How can debts be collected? No wise bank will lend unless the lendee can either be coerced into repaying the debt, or the loan is more than covered by securely liened collateral plus some conservative function of its reputation for payment in full and on time. For all parties, both credit and liability are closely related, and limited.",{"_32":1631,"_34":1632},[],{"_36":160,"_38":1633,"_40":447,"_42":1634,"_67":1635,"_69":1636,"_71":70},"k9AuCqsv",{},[],"The liability of a party is limited by that party's liens and by the ability to deter that party by threatening punishment for violating contracts (ie, committing crimes as defined by the contract with the jurisdiction). The potential for other actions an party might take that cause liability, such as damage to others' persons or property, also need to be limited. More on that later.",{"_32":1638,"_34":1639},[],{"_36":160,"_38":1640,"_40":447,"_42":1641,"_67":1642,"_69":1643,"_71":70},"Am6gnob0",{},[],"Many parties, especially new entrants, may lack this reputation capital, and will thus need to be able to share their property with the bank via secure liens. A lien is, in a practical sense, a method of sharing a piece of property between the \"owner of record\" and a \"lienholder\", instead of the property having strictly one owner. Liens are used in many large credit transactions, such as auto loans, mortgages, farm loans, etc. They are enforced by the jurisdiction specified in the contract; usually this enforcement is done by the government and subsidized by the taxpayers rather than paid for by the contracting parties. (In fact this usually is the case with contracts and property rights in general, the enforcement clause is an implicit government subsidy). One way to implement a lien without governments is via co-signing with your privately chosen arbitrator (as long as the arbitratror has a good reputation and the contractual right to take appropriate action against you). Smart liens might greatly expand the privity and security of such arrangements.",{"_32":1645,"_34":1646},[],{"_36":160,"_38":1647,"_40":447,"_42":1648,"_67":1649,"_69":1650,"_71":70},"0Mzl3B_h",{},[],"As is the case today, credit problems will usually be solved by artfully written, menacing dunning letters and dings to one's credit rating long before the lien needs to be invoked. However, the lien needs to be enforceable to make these dunning letters credible over the long run.",{"_32":1652,"_34":1653},[],{"_36":160,"_38":1654,"_40":447,"_42":1655,"_67":1656,"_69":1657,"_71":70},"eF2qJr1-",{},[],"What about extending the concept of contract to cover agreement to a prearranged set of tort laws? These tort laws would be defined by contracts between private arbitration and enforcement agencies, while customers would have a choice of jurisdictions in this system of free-market \"governments\". If these privately practiced law organizations (PPLs for short) bear ultimate responsibility for the criminal activities of their customers, or need to insure lack of defection or future payments on the part of customers, they may in turn ask for liens against their customers, either in with contractual terms allowing arrest of customers under certain conditions (eg if they commit acts specified as criminal by the PPL contract) or (more likely for mobile world-traveling and virtual pseudonymous customers) smart liens against liquid assets such as bank accounts and investment portfolios. Smart liens over information, such as digital bearer securities, can be implemented via secret sharing (two or more keys required to unlock the encryption).",{"_32":1659,"_34":1660},[],{"_36":160,"_38":1661,"_40":447,"_42":1662,"_67":1663,"_69":1664,"_71":70},"cSbP6TmN",{},[],"Other important areas of liability include consumer liability and property damage (including pollution). There need to mechanisms so that, for example, pollution damage to others' persons or property can be assessed, and liens should exist so that the polluter can be properly charged and the victims paid. Where pollution is quantifiable, as with SO2 emissions, markets can be set up to trade emission rights. The PPLs would have liens in place to monitor their customer's emissions and assess fees where emission rights have been exceeded.",{"_32":1666,"_34":1667},[],{"_36":160,"_38":1668,"_40":447,"_42":1669,"_67":1670,"_69":1671,"_71":70},"3XXUJvic",{},[],"Alas, there are some dangers where maximum damage could far surpass any liens. A good rule of thumb here is that if the risk is against a third party, and it cannot be liened or insured against, then PPLs should not allow it to be taken. PPLs that allow their customers to take such risks against non-PPL parties would ruin their credit rating. One example of such a risk is building a nuclear plant for which no insurance company is willing to submit liability coverage. If a plant is safe, presumably one should be able to convince a good insurance company to cover its potential to damage others' property.",{"_36":870,"_38":1673,"_40":447,"_42":1674,"_67":1675,"_69":1676,"_71":70},"3Ob8B4a0",{"_273":323},[],"Smart Property",{"_32":1678,"_34":1686},[1679],{"_32":1680,"_34":1681},[],{"_36":160,"_38":1682,"_40":447,"_42":1683,"_67":1684,"_69":1685,"_71":70},"VvgSUb6J",{},[],"Digital cash is here today, and many more smart contract mechanisms are being designed. So far the design criteria important for automating contract execution have come from disparate fields like economics and cryptography, with little cross-communication: little awareness of the technology on the one hand, and little awareness of its best business uses other. The idea of smart contracts is to recognize that these efforts are striving after common objectives, which converge on the concept of smart contracts.",{"_36":870,"_38":1687,"_40":447,"_42":1688,"_67":1689,"_69":1690,"_71":70},"s3u1cYSP",{"_273":323},[],"Conclusion",{"_32":1692,"_34":1693},[],{"_36":160,"_38":1694,"_40":447,"_42":1695,"_67":1696,"_69":1745,"_71":70},"LzfO0b7O",{},[1697,1715,1721,1727,1733,1739],{"_36":919,"_167":1698,"_169":1706,"_42":1714,"_71":70},[987,1699,1700,1701,1702,1703,1704,1705],85,187,219,403,450,492,597,[1707,1708,1709,1710,960,1711,1712,1713],72,171,214,228,468,554,626,{},{"_36":204,"_167":1716,"_169":1717,"_42":1719,"_71":1720},[960],[1718],449,{},"http://www.xmission.com/~legalize/lf/blurbs/f-a-hayek.htm",{"_36":204,"_167":1722,"_169":1724,"_42":1726,"_71":1137},[1723],701,[1725],748,{},{"_36":204,"_167":1728,"_169":1729,"_42":1731,"_71":1732},[1725],[1730],792,{},"http://www.digicash.com/publish/sciam.html",{"_36":204,"_167":1734,"_169":1735,"_42":1737,"_71":1738},[1730],[1736],809,{},"http://www.agorics.com/",{"_36":204,"_167":1740,"_169":1741,"_42":1743,"_71":1744},[1736],[1742],826,{},"http://www.digicash.com/","\nReferences:\nOliver Williamson, The Economic Institutions of Capitalism\nJanet Landa, Trust, Ethnicity, and Identity\nThe New Palgrave: Allocation, Information, and Markets\nBruce Schneier, Applied Cryptography\nCrypto and Eurocrypt conference proceedings, 1982-1994.\n\"Crypto Rebels\", Wired #2, also cypherpunks mailing list\n(mail to majordomo@toad.com with body \"subscribe cypherpunks\")\nPerry H. Beaumont, Fixed Income Synthetic Assets\nFrederich Hayek, The Fatal Conceit\nMing Li & Paul Vitanyi, An Introduction to Kolmogorov Complexity\nand Its Applications\nVernor Vinge, \"True Names\" (fiction), from True Names and Other Dangers\nMixmaster (ptr to web site)\nPGP (ptr to web site)\nTim May, \"Cyphernomicon\"\nDavid Chaum, \"Security Without Identification\"\nDavid Chaum, \"Achieving Electronic Privacy\"\nAgorics web site\nDigiCash web site",[279],"/records/smart-contracts-building-blocks-for-digital-markets",{"_83":463,"_464":465},{},{"_38":444,"_95":54,"_55":1751,"_72":447,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,446],1773151562598,[149,444,447,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/smart-contracts-building-blocks-for-digital-markets\",\"bafy2bzacedso2tbfaqqnb7vynu5xk4p7icmlkcfpe4htnliggod5tumtjgwpy\",true]",{"_110":1756,"_147":3504,"_150":3505},{"_112":1757,"_131":132,"_133":3503,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":1758,"_38":3501},{"_29":1759,"_72":471,"_73":54,"_74":3496,"_55":3497,"_77":480,"_79":3498,"_81":3499,"_85":3500,"_87":481,"_89":90},[1760,1767,1774,1787,1793,1814,1828,1842,1928,2005,3155,3206,3274,3302,3316],{"_32":1761,"_34":1762},[],{"_36":160,"_38":1763,"_40":481,"_42":1764,"_67":1765,"_69":1766,"_71":70},"PJOM2Ch2",{},[],"Working Draft 1.5 20th June 1997",{"_32":1768,"_34":1769},[],{"_36":160,"_38":1770,"_40":481,"_42":1771,"_67":1772,"_69":1773,"_71":70},"YH88J_MV",{},[],"Authors Hugh Davis, Sigi Reich, Antoine Rizk",{"_32":1775,"_34":1776},[],{"_36":160,"_38":1777,"_40":471,"_42":1778,"_67":1779,"_69":1786,"_71":70},"wNACgMRS",{},[1780],{"_36":204,"_167":1781,"_169":1782,"_42":1784,"_71":1785},[240],[1783],55,{},"https://www.southampton.ac.uk/~hcd/ohp/ohp3.htm","Source: https://www.southampton.ac.uk/~hcd/ohp/ohp3.htm",{"_32":1788,"_34":1789},[],{"_36":160,"_38":1790,"_40":471,"_42":1791,"_67":1792,"_69":70,"_71":70},"34Cbndwa",{},[],{"_32":1794,"_34":1809},[1795],{"_32":1796,"_34":1797},[],{"_36":160,"_38":1798,"_40":481,"_42":1799,"_67":1800,"_69":1808,"_71":70},"B5QSopD3",{},[1801],{"_36":204,"_167":1802,"_169":1804,"_42":1806,"_71":1807},[1803],151,[1805],176,{},"mailto:H.C.Davis@ecs.soton.ac.uk","This document specifies the draft for the Open Hypermedia Systems' Protocol (OHP). Distribution of this document is unlimited. Comments are welcome at H.C.Davis@ecs.soton.ac.uk. For discussions about the protocol as well as Open Hypermedia Systems in general see also the OHS Mailing List and the OHS Working Group Home Page.",{"_36":870,"_38":1810,"_40":481,"_42":1811,"_67":1812,"_69":1813,"_71":70},"1Zv9pRDy",{"_273":323},[],"Status of this Document",{"_32":1815,"_34":1823},[1816],{"_32":1817,"_34":1818},[],{"_36":160,"_38":1819,"_40":481,"_42":1820,"_67":1821,"_69":1822,"_71":70},"Zg3ePcux",{},[],"This section should give a management summary and overview. What is the motivation behind OHP? What would be the benefits if OHP would be supported by tools? (viewer independent of linkservice, link editing possible, ...) Should we mention why http is insufficient (because Web users might be interested)?",{"_36":870,"_38":1824,"_40":481,"_42":1825,"_67":1826,"_69":1827,"_71":70},"KkK2fhan",{"_273":323},[],"Abstract",{"_32":1829,"_34":1837},[1830],{"_32":1831,"_34":1832},[],{"_36":160,"_38":1833,"_40":481,"_42":1834,"_67":1835,"_69":1836,"_71":70},"nmdXAZt1",{},[],"This section specifies the actual form and the minimum set of messages defined in OHP. We describe the message header and the messages to be sent; we evolve on specific issues such as location specifications, presentation specifications, and expected functionality and behaviour of components. We finish with example scenarios, related work, and a list of references.",{"_36":870,"_38":1838,"_40":481,"_42":1839,"_67":1840,"_69":1841,"_71":70},"FIKb9Sf9",{"_273":323},[],"Protocol Definition",{"_32":1843,"_34":1922},[1844,1858,1865,1872,1881,1896,1909],{"_32":1845,"_34":1846},[],{"_36":160,"_38":1847,"_40":481,"_42":1848,"_67":1849,"_69":1857,"_71":70},"XO_29Xvj",{},[1850],{"_36":919,"_167":1851,"_169":1853,"_42":1856,"_71":70},[1708,1701,1852],327,[186,1854,1855],230,339,{},"The Open Hypermedia Protocol (OHP) is to be used as a standardised protocol between viewers and link services. These agents of OHP transactions can be of various forms: a Viewer can be a dedicated viewer for a specific LinkService; or it can be an adapted version of an existing generic application such as Microsoft Word. The LinkService can be a 'simple' LinkService providing only links as well as a hyperbase providing both, links and documents. For the remainder of this contribution we will only use the terms Viewer and LinkService for these components.",{"_32":1859,"_34":1860},[],{"_36":160,"_38":1861,"_40":481,"_42":1862,"_67":1863,"_69":1864,"_71":70},"NiKDc_wr",{},[],"In this paper we are concerned with enabling applications to make them link service aware, so that users may have access to the full range of hypermedia functionality from their standard desktop environment. Many of the current generation of hypermedia systems such as DHM (Grønbæk & Trigg, 1992) HyperDisco (Wiil, 1996), Microcosm (Davis et al., 1994), Multicard (Rizk & Sauter, 1992) and the Texas A&M system prototypes (e.g. Kacmar & Leggett, 1991) have addressed this problem, but so far no standard has emerged due to the different hypertext data models and communication protocols adopted by these systems.",{"_32":1866,"_34":1867},[],{"_36":160,"_38":1868,"_40":481,"_42":1869,"_67":1870,"_69":1871,"_71":70},"9R4-aDDa",{},[],"For the definition of the protocol we additionally make some assumptions on the architecture. Note however, that we are not aiming and not claiming for fully defining a reference architecture. The general picture we have in mind when defining OHP is as follows:",{"_32":1873,"_34":1874},[],{"_36":1875,"_38":1876,"_40":481,"_42":1877,"_67":1878,"_69":1879,"_71":1880},"Image","Xlbh4XN8",{"_273":323},[],"Fig.: Components and Layers in OHP Definition","ipfs://bafkreih7jzzwm3ki5astug5rimimh6jy37izxadjh7gaxxsnnvktchs7di",{"_32":1882,"_34":1883},[],{"_36":160,"_38":1884,"_40":481,"_42":1885,"_67":1886,"_69":1895,"_71":70},"q6Xdmi3F",{},[1887],{"_36":919,"_167":1888,"_169":1891,"_42":1894,"_71":70},[1117,1889,1890],274,291,[1892,954,1893],87,300,{},"In defining OHP we abstracted in different layers. On the top-level a so-called Viewer talks OHP to another component which is only interesting from an OHP point of view in that this component understands and answers OHP requests. Typically though this component would be a LinkService or a HyperBase.",{"_32":1897,"_34":1898},[],{"_36":160,"_38":1899,"_40":481,"_42":1900,"_67":1901,"_69":1908,"_71":70},"7U9dsRnk",{},[1902],{"_36":919,"_167":1903,"_169":1905,"_42":1907,"_71":70},[1904],206,[1906],221,{},"OHP abstracts from the communication layer. However, there has to be a component that establishes connections, that 'knows' how to talk to other services and viewers, and the more. We call this component a SessionManager and it could be described as an intermediate component between LinkService and Viewer. For the definition of OHP we assume that both Viewer and LinkService exchange OHP messages via the SessionManager, the actual communication though is not part of OHP.",{"_32":1910,"_34":1911},[],{"_36":160,"_38":1912,"_40":481,"_42":1913,"_67":1914,"_69":1921,"_71":70},"0ytvTdvJ",{},[1915],{"_36":919,"_167":1916,"_169":1918,"_42":1920,"_71":70},[921,1917],443,[1919,1703],122,{},"Besides the components Viewer, LinkService and SessionManager there is a fourth component, the Document Management System (DMS). We are convinced that an additional protocol - a document management procotocol (DMP) - should allow standardised communication to document management systems. The Open Document Management API (Open Document Management, 1997) could serve as a good example and some of the concepts in OHP, e.g. the definition of a NodeId as a unique document identifier, follow this proposal.",{"_36":870,"_38":1923,"_40":1924,"_42":1925,"_67":1926,"_69":1927,"_71":70},"W35eityG","bafy2bzaceaimazzdifw7xyhsjnce5bwn2a2lxrvhipfyrlgsx5wmgjba25owu",{"_273":323},[],"4. Introduction",{"_32":1929,"_34":2000},[1930,1944],{"_32":1931,"_34":1939},[1932],{"_32":1933,"_34":1934},[],{"_36":160,"_38":1935,"_40":481,"_42":1936,"_67":1937,"_69":1938,"_71":70},"KJCwLCuI",{},[],"OHP is a peer to peer asynchronous protocol. Messages may be sent by either the LinkService or by the Viewer. If a reply is expected, it is up to the receiving component to initiate a new message. There are thus two main classes of messages to be considered; those sent by the Viewer and those sent by the LinkService.",{"_36":870,"_38":1940,"_40":481,"_42":1941,"_67":1942,"_69":1943,"_71":70},"uZuoKZII",{"_273":323},[],"5.1 General Form",{"_32":1945,"_34":1995},[1946,1953,1960,1967,1974,1981,1988],{"_32":1947,"_34":1948},[],{"_36":160,"_38":1949,"_40":481,"_42":1950,"_67":1951,"_69":1952,"_71":70},"GOwHSYvv",{},[],"For actually defining the mechanics of OHP we will follow a Backus-Naur Form (BNF) as is for instance done in Internet drafts. We use the following constructs:",{"_32":1954,"_34":1955},[],{"_36":160,"_38":1956,"_40":481,"_42":1957,"_67":1958,"_69":1959,"_71":70},"yGjm52Mj",{},[],"name = definition: The name of a rule is simply the name itself and is separated from its definition by the equal \"=\" character.\n\"literal\": defines a literal. Definition is case sensitive.\n{elem1 | elem2}: a \"|\" can be used to define either/or alternatives.",{"_32":1961,"_34":1962},[],{"_36":160,"_38":1963,"_40":481,"_42":1964,"_67":1965,"_69":1966,"_71":70},"6Jfl-S5P",{},[],"{elem}*: A \"*\" indicates repetition, i.e. there can be any number of occurrences.\n{elem}+: A \"+\" indicates that one or more elements have to be present, i.e. there has to be at least one element.\n[elem]: Square brackets enclose optional elements.\n: Angle brackets enclose basic types that are not specified in more detail but can be dealt with by the receiving/sending components.",{"_32":1968,"_34":1969},[],{"_36":160,"_38":1970,"_40":481,"_42":1971,"_67":1972,"_69":1973,"_71":70},"ie1Lvb-h",{},[],"Additionally we assume the following rules (the US-ASCII coded character set is defined by ANSI X3.4- 1986):",{"_32":1975,"_34":1976},[],{"_36":160,"_38":1977,"_40":481,"_42":1978,"_67":1979,"_69":1980,"_71":70},"hercYcQY",{},[],"CHAR = US-ASCII character (octets 0 - 127)\nUPALPHA = any US-ASCII uppercase letter \"A\"..\"Z\"\nLOALPHA = any US-ASCII lowercase letter \"a\"..\"z\"\nALPHA = UPALPHA | LOALPHA\nDIGIT = any US-ASCII digit \"0\"..\"9\"\nCTL = any US-ASCII control character (octets 0 - 31) and DEL (127) CR = US-ASCII CR, carriage return (13)\nLF = US-ASCII LF, linefeed (10)\nSP = US-ASCII SP, space (32)",{"_32":1982,"_34":1983},[],{"_36":160,"_38":1984,"_40":481,"_42":1985,"_67":1986,"_69":1987,"_71":70},"qo5akUzo",{},[],"OHP messages will consist of text strings (CHAR). In the following sections the messages are shown formatted on multiple lines for ease of presentation. However, the messages themselves will be one continuous stream of ASCII text, unbroken by line feeds (LF). The messages consist of Tags, which are proceeded by a backslash ('\\') and succeeded by a white space (SP). The characters that follow, up to the next tag or the end of the message are the tag contents. A tag content may be empty if shown as optional in the message definition. The tags of each message are all compulsory, and must be presented in the order of the message definition. If a backslash ('\\') occurs within the tag content, then it should be quoted by preceding it with a further backslash.",{"_32":1989,"_34":1990},[],{"_36":160,"_38":1991,"_40":481,"_42":1992,"_67":1993,"_69":1994,"_71":70},"M83RmpNI",{},[],"We can now begin to define the protocol.",{"_36":870,"_38":1996,"_40":481,"_42":1997,"_67":1998,"_69":1999,"_71":70},"zbuQ8w_-",{"_273":323},[],"5.2 Notational Conventions and Generic Grammar",{"_36":870,"_38":2001,"_40":481,"_42":2002,"_67":2003,"_69":2004,"_71":70},"DY3XRv8Z",{"_273":323},[],"5. Form of the Protocol",{"_32":2006,"_34":3150},[2007,2078,2128,2836,3067],{"_32":2008,"_34":2073},[2009,2016,2023,2032,2039,2046,2053,2060],{"_32":2010,"_34":2011},[],{"_36":160,"_38":2012,"_40":481,"_42":2013,"_67":2014,"_69":2015,"_71":70},"__YPR-8R",{},[],"As opposed to the previous draft of OHP (Davis et al., 1996), which define a Channel as an identifier for messages, we have defined a dedicated message header (see Thread \"Channels in OHP\"). As already mentioned above, OHP abstracts from the communication layer so the header does not include any host or port or other communication specific information.",{"_32":2017,"_34":2018},[],{"_36":160,"_38":2019,"_40":481,"_42":2020,"_67":2021,"_69":2022,"_71":70},"2ObolEcf",{},[],"The OHP message header is defined as",{"_32":2024,"_34":2025},[],{"_36":2026,"_38":2027,"_40":481,"_42":2028,"_67":2030,"_69":2031,"_71":70},"Code","iglg_-0L",{"_2029":70},"language",[],"MessHeader = \\MessId the OHP Id and version number\n \\Subject name of this message\n",{"_32":2033,"_34":2034},[],{"_36":160,"_38":2035,"_40":481,"_42":2036,"_67":2037,"_69":2038,"_71":70},"c4l8SJPU",{},[],"MessId uniquely identifies this type of message and gives OHP version information. The subject field is considered to be particularely helpful in case a component can not understand a message; it could then at least provide additional information about the message.",{"_32":2040,"_34":2041},[],{"_36":160,"_38":2042,"_40":481,"_42":2043,"_67":2044,"_69":2045,"_71":70},"Bkp_I0A-",{},[],"Besides basic header information there are two more fields that will be present in almost all messages but that do not have to be understood by the LinkService. These fields are",{"_32":2047,"_34":2048},[],{"_36":2026,"_38":2049,"_40":481,"_42":2050,"_67":2051,"_69":2052,"_71":70},"DmouUDKL",{"_2029":70},[],"\\SessionId a byte string that can be used for uniquely identifying\n messages and deal with transaction management\n",{"_32":2054,"_34":2055},[],{"_36":2026,"_38":2056,"_40":481,"_42":2057,"_67":2058,"_69":2059,"_71":70},"2brspFC6",{"_2029":70},[],"\\UserId a byte string that can be used for identifying a user\n",{"_32":2061,"_34":2062},[],{"_36":160,"_38":2063,"_40":481,"_42":2064,"_67":2065,"_69":2072,"_71":70},"Y4DPyli5",{},[2066],{"_36":919,"_167":2067,"_169":2069,"_42":2071,"_71":70},[2068],167,[2070],173,{},"As mentioned above, the actual managing of documents is a crucial issue. Within OHP, documents are therfore not dealt with directly but are called by a reference, the NodeId. A NodeId has to be unique within a given usage scenario. However, from a protocol perspective the NodeId is opaque.",{"_36":870,"_38":2074,"_40":481,"_42":2075,"_67":2076,"_69":2077,"_71":70},"aNUXkyG0",{"_273":323},[],"6.1 Message Header",{"_32":2079,"_34":2123},[2080,2087,2116],{"_32":2081,"_34":2082},[],{"_36":160,"_38":2083,"_40":481,"_42":2084,"_67":2085,"_69":2086,"_71":70},"jqMeAPR6",{},[],"The abstraction from communication information within the OHP header requires a number of assumptions about the underlying components' functionality. The main component both LinkService and Viewer will be talking to is the so-called \"SessionManager\". Note that there is a manifold of different terms for this component: in the previous draft of OHP it has been called \"Communication Protocol Shim\" (Davis et al., 1996), (Goose et al., 1997) call it \"Runtime\", (Wiil and Leggett, 1996) call it \"Tool integrator\"; all approaches have in common that they require a component at the client's side managing different OHP sessions. That's why we use the term SessionManager.",{"_32":2088,"_34":2110},[2089,2096,2103],{"_32":2090,"_34":2091},[],{"_36":160,"_38":2092,"_40":481,"_42":2093,"_67":2094,"_69":2095,"_71":70},"HOv08E0l",{},[],"Establishing of connections to the LinkServices the user wants to connect; transfering and receiving of OHP messages;",{"_32":2097,"_34":2098},[],{"_36":160,"_38":2099,"_40":481,"_42":2100,"_67":2101,"_69":2102,"_71":70},"C_ZpoFlz",{},[],"Loading of documents if asked to by the LaunchDocument message; the parameter given is of type NodeId.",{"_32":2104,"_34":2105},[],{"_36":160,"_38":2106,"_40":481,"_42":2107,"_67":2108,"_69":2109,"_71":70},"E90Z2CNE",{},[],"Providing of document management functions in the absence of a document management system. The SessionManager should then do tasks such as providing attribute access functions for a given document (its NickName, Type, Preferred Viewer etc.). ",{"_36":160,"_38":2111,"_40":481,"_42":2112,"_67":2114,"_69":2115,"_71":70},"XY8HXIvO",{"_273":2113},"Ordered",[],"This is the basic functionality and behaviour we are assuming a SessionManager component to have:",{"_32":2117,"_34":2118},[],{"_36":160,"_38":2119,"_40":481,"_42":2120,"_67":2121,"_69":2122,"_71":70},"oDedjJ4O",{},[],"Additionally, as creation of links between node in different application windows is a crucial issue, also this functionality could be part of the SessionManager. Issues such as joining n to m anchors, defining direction, scope etc. would probably be best implemented just once in the Session Manager. This means that the SessionManager not in some implementations might not only be a process but also have a user interface component available to all applications on a user's desktop.",{"_36":870,"_38":2124,"_40":481,"_42":2125,"_67":2126,"_69":2127,"_71":70},"ZYLUIKY6",{"_273":323},[],"6.2 Responsibilities of Session Manager",{"_32":2129,"_34":2831},[2130,2140,2189,2238,2245,2252,2264,2271,2283,2290,2297,2304,2332,2339,2346,2358,2365,2372,2379,2386,2393,2400,2407,2419,2440,2447,2454,2461,2468,2480,2487,2494,2501,2508,2515,2522,2534,2541,2548,2559,2566,2573,2584,2591,2598,2609,2616,2623,2630,2637,2644,2651,2663,2670,2677,2688,2695,2702,2748,2773,2798,2805],{"_32":2131,"_34":2132},[],{"_36":1875,"_38":2133,"_40":481,"_42":2134,"_67":2137,"_69":2138,"_71":2139},"DftirzAK",{"_273":323,"_2135":2136},"width",601.4423076923077,[],"Tab.: Message Requests by Viewer and Answers by LinkService","ipfs://bafkreihvczqllcwg35r3oo4etug32fhrwfjoha35533sb2fbnapq6ar5xi",{"_32":2141,"_34":2184},[2142,2149,2156,2163,2170,2177],{"_32":2143,"_34":2144},[],{"_36":160,"_38":2145,"_40":481,"_42":2146,"_67":2147,"_69":2148,"_71":70},"Al-TzK2M",{},[],"RequestService",{"_32":2150,"_34":2151},[],{"_36":160,"_38":2152,"_40":481,"_42":2153,"_67":2154,"_69":2155,"_71":70},"E9QU1_-3",{},[],"ClosingNode",{"_32":2157,"_34":2158},[],{"_36":160,"_38":2159,"_40":481,"_42":2160,"_67":2161,"_69":2162,"_71":70},"n0DlHdEP",{},[],"UpdateAnchors",{"_32":2164,"_34":2165},[],{"_36":160,"_38":2166,"_40":481,"_42":2167,"_67":2168,"_69":2169,"_71":70},"ldBjJKeX",{},[],"UpdateNode",{"_32":2171,"_34":2172},[],{"_36":160,"_38":2173,"_40":481,"_42":2174,"_67":2175,"_69":2176,"_71":70},"wXkiaOPX",{},[],"CreateLink",{"_32":2178,"_34":2179},[],{"_36":160,"_38":2180,"_40":481,"_42":2181,"_67":2182,"_69":2183,"_71":70},"VzRLCAfI",{},[],"CreateNode",{"_36":160,"_38":2185,"_40":481,"_42":2186,"_67":2187,"_69":2188,"_71":70},"dCFNG3Tp",{"_273":274},[],"Additionally, the Viewer might send the following messages:",{"_32":2190,"_34":2233},[2191,2198,2205,2212,2219,2226],{"_32":2192,"_34":2193},[],{"_36":160,"_38":2194,"_40":481,"_42":2195,"_67":2196,"_69":2197,"_71":70},"-z0P6KgH",{},[],"LaunchDocument",{"_32":2199,"_34":2200},[],{"_36":160,"_38":2201,"_40":481,"_42":2202,"_67":2203,"_69":2204,"_71":70},"eLpwq2AW",{},[],"DisplayAnchor",{"_32":2206,"_34":2207},[],{"_36":160,"_38":2208,"_40":481,"_42":2209,"_67":2210,"_69":2211,"_71":70},"mlHoF69B",{},[],"DisplayLocSpec",{"_32":2213,"_34":2214},[],{"_36":160,"_38":2215,"_40":481,"_42":2216,"_67":2217,"_69":2218,"_71":70},"_YVP2R3G",{},[],"Interpret",{"_32":2220,"_34":2221},[],{"_36":160,"_38":2222,"_40":481,"_42":2223,"_67":2224,"_69":2225,"_71":70},"Qz0G3GqF",{},[],"NewAnchor",{"_32":2227,"_34":2228},[],{"_36":160,"_38":2229,"_40":481,"_42":2230,"_67":2231,"_69":2232,"_71":70},"dyQJFmG5",{},[],"CloseNode",{"_36":160,"_38":2234,"_40":481,"_42":2235,"_67":2236,"_69":2237,"_71":70},"eD-4lQHT",{"_273":274},[],"The LinkService might send the following messages to the Viewer",{"_32":2239,"_34":2240},[],{"_36":160,"_38":2241,"_40":481,"_42":2242,"_67":2243,"_69":2244,"_71":70},"LHz2UZEa",{},[],"All, Viewer, LinkService as well as other components speaking OHP can send an error message.",{"_32":2246,"_34":2247},[],{"_36":160,"_38":2248,"_40":481,"_42":2249,"_67":2250,"_69":2251,"_71":70},"MSNBn7dD",{},[],"We will now present the messages in detail and also give examples or additional comments where necessary to understand the semantics of the protocol.",{"_32":2253,"_34":2254},[],{"_36":160,"_38":2255,"_40":481,"_42":2256,"_67":2257,"_69":2263,"_71":70},"9txblX-L",{},[2258],{"_36":166,"_167":2259,"_169":2260,"_42":2262,"_71":70},[137],[2261],35,{},"Message Pair \"GetServices/Services\"",{"_32":2265,"_34":2266},[],{"_36":160,"_38":2267,"_40":481,"_42":2268,"_67":2269,"_69":2270,"_71":70},"Xbw6TqEq",{},[],"The \"GetServices\" message is to be sent from Viewer to LinkService in order to know which services are available. The LinkService has to answer this request by a \"Services\" message. Services are defined by a description and a service name.",{"_32":2272,"_34":2273},[],{"_36":160,"_38":2274,"_40":481,"_42":2275,"_67":2276,"_69":2282,"_71":70},"HexKkp0u",{},[2277],{"_36":919,"_167":2278,"_169":2279,"_42":2281,"_71":70},[137],[2280],402,{},"Note the naming of message IDs in OHP: \"MV\" is short for \"message from viewer\", the second token gives the name of the message and the last two tokens define that the message class this message belongs to is OHP and give version information. Equally, service originated messages start with \"MS\", short for \"message from service\". Messages that can be originated by any of the components start with \"M\".",{"_32":2284,"_34":2285},[],{"_36":2026,"_38":2286,"_40":481,"_42":2287,"_67":2288,"_69":2289,"_71":70},"63Nft9kV",{"_2029":70},[],"\\MessId MV_GetServices_OHP_1.0\n\\Subject \"GetServices\"\n\\SessionId \n\\UserId \n",{"_32":2291,"_34":2292},[],{"_36":160,"_38":2293,"_40":481,"_42":2294,"_67":2295,"_69":2296,"_71":70},"s1Ej0tAZ",{},[],"The linkservice will reply with",{"_32":2298,"_34":2299},[],{"_36":2026,"_38":2300,"_40":481,"_42":2301,"_67":2302,"_69":2303,"_71":70},"jtQrzjLo",{"_2029":70},[],"\n\\MessId MS_Services_OHP_1.0\n\\Subject \"Services\"\n\\Data\n {\\Service the name of the service\n \\Description a description of the service in the\n local language}+\n\\SessionId \n\\UserId \n",{"_32":2305,"_34":2327},[2306,2313,2320],{"_32":2307,"_34":2308},[],{"_36":160,"_38":2309,"_40":481,"_42":2310,"_67":2311,"_69":2312,"_71":70},"nOTxxuJs",{},[],"FollowLink",{"_32":2314,"_34":2315},[],{"_36":160,"_38":2316,"_40":481,"_42":2317,"_67":2318,"_69":2319,"_71":70},"VIwN4S3i",{},[],"MakeAnchor - which must also add the service for the anchor ",{"_32":2321,"_34":2322},[],{"_36":160,"_38":2323,"_40":481,"_42":2324,"_67":2325,"_69":2326,"_71":70},"zm6FNx7t",{},[],"DeleteAnchor",{"_36":160,"_38":2328,"_40":481,"_42":2329,"_67":2330,"_69":2331,"_71":70},"pcJPub5S",{"_273":274},[],"We have identified a number of default services that each LinkService supporting OHP has to provide. These services include",{"_32":2333,"_34":2334},[],{"_36":160,"_38":2335,"_40":481,"_42":2336,"_67":2337,"_69":2338,"_71":70},"6S1rBcJd",{},[],"Any of these services may be requested by a \"RequestService\" message, for instance",{"_32":2340,"_34":2341},[],{"_36":2026,"_38":2342,"_40":481,"_42":2343,"_67":2344,"_69":2345,"_71":70},"N5yypQGE",{"_2029":70},[],"\\MessId MS_RequestService_OHP_1.0\n\\Subject \"RequestService\"\n\\Service \"FollowLink\"\n\\AnchorId 152.78.115.213:D:999\n\\LocSpec {\\ContentType ASCII\n \\Content \"OHS Home Page\" \\LocType \"NameLoc\"\n \\NodeId 152.78.115.213:E:3334}\n\\Presentation\n\\SessionId 33\n\\UserId Hugh\n",{"_32":2347,"_34":2348},[],{"_36":160,"_38":2349,"_40":481,"_42":2350,"_67":2351,"_69":2357,"_71":70},"YcsEWwgd",{},[2352],{"_36":166,"_167":2353,"_169":2354,"_42":2356,"_71":70},[137],[2355],31,{},"Message Pair \"GetNodeId/NodeId\"",{"_32":2359,"_34":2360},[],{"_36":160,"_38":2361,"_40":481,"_42":2362,"_67":2363,"_69":2364,"_71":70},"RaD49SwR",{},[],"OHP does not actually deal with the documents being involved in an OHP session; it uses references to documents instead. However, in many situations it might be useful to get a document identifier given the name of a document or any of its attributed. For this purpose the message pair \"GetNodeId / NodeId\" is introduced.",{"_32":2366,"_34":2367},[],{"_36":2026,"_38":2368,"_40":481,"_42":2369,"_67":2370,"_69":2371,"_71":70},"y-EAdz7E",{"_2029":70},[],"\\MessId MV_GetNodeId_OHP_1.0\n\\Subject \"GetNodeId\"\n\\DocumentName the name of the document\n\\DocumentAttributes\n {\\name the attribute's name\n \\value its value}*\n\\SessionId \n\\UserId ",{"_32":2373,"_34":2374},[],{"_36":160,"_38":2375,"_40":481,"_42":2376,"_67":2377,"_69":2378,"_71":70},"Sdz8IrKr",{},[],"The LinkServer will answer this request with",{"_32":2380,"_34":2381},[],{"_36":2026,"_38":2382,"_40":481,"_42":2383,"_67":2384,"_69":2385,"_71":70},"ayCTb1Xk",{"_2029":70},[],"\\MessId MS_NodeId_OHP_1.0\n\\Subject \"NodeId\"\n[\\NodeId NodeId | \\result a result message string]\n\\SessionId \n\\UserId \n",{"_32":2387,"_34":2388},[],{"_36":160,"_38":2389,"_40":481,"_42":2390,"_67":2391,"_69":2392,"_71":70},"QivueXer",{},[],"If there is no NodeId for the given document name and attributes then the document is either currently unknown to the LinkService or it is unavailable (it could for instance be locked). The LinkService specifies this in the result tag. It is the responsibility of the SessionManager to register this node or pass the error on to the user. In case it wants to reister a new node the SessionManager would send",{"_32":2394,"_34":2395},[],{"_36":2026,"_38":2396,"_40":481,"_42":2397,"_67":2398,"_69":2399,"_71":70},"qxJNuXlT",{"_2029":70},[],"\\MessId MV_CreateNode_OHP_1.0\n\\Subject \"CreateNode\"\n\\DocumentName the name of the document\n\\DocumentAttributes\n {\\name the attribute's name\n \\value its value}*\n\\SessionId \n\\UserId ",{"_32":2401,"_34":2402},[],{"_36":160,"_38":2403,"_40":481,"_42":2404,"_67":2405,"_69":2406,"_71":70},"RyIoZRqp",{},[],"The LinkServer will eventually send back a NodeId message (see above).",{"_32":2408,"_34":2409},[],{"_36":160,"_38":2410,"_40":481,"_42":2411,"_67":2412,"_69":2418,"_71":70},"qsJ-Qlx1",{},[2413],{"_36":166,"_167":2414,"_169":2415,"_42":2417,"_71":70},[137],[2416],41,{},"Message Pair \"GetAnchorTable/AnchorTable\"",{"_32":2420,"_34":2435},[2421,2428],{"_32":2422,"_34":2423},[],{"_36":160,"_38":2424,"_40":481,"_42":2425,"_67":2426,"_69":2427,"_71":70},"eAY-GLd-",{},[],"a. What services it may offer (see above)",{"_32":2429,"_34":2430},[],{"_36":160,"_38":2431,"_40":481,"_42":2432,"_67":2433,"_69":2434,"_71":70},"Dmw5uy_C",{},[],"b. What anchors to display in the current document",{"_36":160,"_38":2436,"_40":481,"_42":2437,"_67":2438,"_69":2439,"_71":70},"q8IwcNsY",{"_273":323},[],"Now that we have the document itself and an appropriate application for the document, the application needs to know",{"_32":2441,"_34":2442},[],{"_36":160,"_38":2443,"_40":481,"_42":2444,"_67":2445,"_69":2446,"_71":70},"LmL7OKPO",{},[],"In order to get the anchors for a given document (represented by its NodeId) the GetAnchorTable message is used. Note that the message is asynchronous, and that it should result in one or more AnchorTable messages, e.g. if a distributed LinkService came up with separate answers. The application should be capable of concatenating the tables.",{"_32":2448,"_34":2449},[],{"_36":2026,"_38":2450,"_40":481,"_42":2451,"_67":2452,"_69":2453,"_71":70},"yD-J0LWG",{"_2029":70},[],"\\MessId MV_GetAnchorTable_OHP_1.0\n\\Subject \"GetAnchorTable\"\n\\NodeId \n\\SessionId \n\\UserId \n",{"_32":2455,"_34":2456},[],{"_36":160,"_38":2457,"_40":481,"_42":2458,"_67":2459,"_69":2460,"_71":70},"NZWdjssj",{},[],"The LinkService should answer this with the \"AnchorTable\" message.",{"_32":2462,"_34":2463},[],{"_36":2026,"_38":2464,"_40":481,"_42":2465,"_67":2466,"_69":2467,"_71":70},"-dA-TEJb",{"_2029":70},[],"\\MessId MS_AnchorTable_OHP_1.0\n\\Subject \"AnchorTable\"\n\\NodeId \n\\Data {\\AnchorId \\LocSpec\n \\Direction {\"AtoB\" | \"bidirectional\"} \\Presentation \\Service}+\n\\SessionId \n\\UserId \n",{"_32":2469,"_34":2470},[],{"_36":160,"_38":2471,"_40":481,"_42":2472,"_67":2473,"_69":2479,"_71":70},"FkmJcE3U",{},[2474],{"_36":166,"_167":2475,"_169":2476,"_42":2478,"_71":70},[137],[2477],34,{},"Message Pair \"CreateLinkId/LinkId\"",{"_32":2481,"_34":2482},[],{"_36":160,"_38":2483,"_40":481,"_42":2484,"_67":2485,"_69":2486,"_71":70},"p3qSDiLF",{},[],"This message is sent by the Viewer - it could also be sent by the SessionManager's user interface component - when a user creates a link. OHP allows any number of incoming and outging anchor ids; a link at least has a direction and a name. The CreateLinkId message should be answered by the LinkService with a LinkId message (see below). If the creation of the link has not been successful for any reason a result tag instead of a LinkId should be answered.",{"_32":2488,"_34":2489},[],{"_36":2026,"_38":2490,"_40":481,"_42":2491,"_67":2492,"_69":2493,"_71":70},"J7LgI-Q-",{"_2029":70},[],"\\MessId MV_CreateLinkId_OHP_1.0\n\\Subject \"CreateLinkId\"\n\\AAnchors {\\AnchorId }+\n\\BAnchors {\\AnchorId }+\n\\Direction {\"AtoB\" | \"bidirectional\"}\n\\Description textual description of the link\n\\SessionId \n\\UserId \n",{"_32":2495,"_34":2496},[],{"_36":160,"_38":2497,"_40":481,"_42":2498,"_67":2499,"_69":2500,"_71":70},"JPoQclE-",{},[],"The LinkServer's answer",{"_32":2502,"_34":2503},[],{"_36":2026,"_38":2504,"_40":481,"_42":2505,"_67":2506,"_69":2507,"_71":70},"bq0jU9gU",{"_2029":70},[],"\\MessId MS_LinkId_OHP_1.0\n\\Subject \"LinkId\"\n[\\LinkId LinkId | \\result a result message string]\n\\SessionId \n\\UserId \n",{"_32":2509,"_34":2510},[],{"_36":160,"_38":2511,"_40":481,"_42":2512,"_67":2513,"_69":2514,"_71":70},"200yI5Xg",{},[],"Delete as well as update link messages are omitted as those are supposed to be done at the LinkService. It",{"_32":2516,"_34":2517},[],{"_36":160,"_38":2518,"_40":481,"_42":2519,"_67":2520,"_69":2521,"_71":70},"ojfgEuk0",{},[],"is not clear that there is a simple interface to this function which could be provided at the client end.",{"_32":2523,"_34":2524},[],{"_36":160,"_38":2525,"_40":481,"_42":2526,"_67":2527,"_69":2533,"_71":70},"8GpLRnDJ",{},[2528],{"_36":166,"_167":2529,"_169":2530,"_42":2532,"_71":70},[137],[2531],24,{},"Message \"RequestService\"",{"_32":2535,"_34":2536},[],{"_36":160,"_38":2537,"_40":481,"_42":2538,"_67":2539,"_69":2540,"_71":70},"Tk5flQtm",{},[],"The RequestService message is a very general message that can be used by the Viewer to request a LinkService to do one of its services. The available services can be retrieved by the GetServices message.",{"_32":2542,"_34":2543},[],{"_36":2026,"_38":2544,"_40":481,"_42":2545,"_67":2546,"_69":2547,"_71":70},"3UXb5HBQ",{"_2029":70},[],"\\MessId MV_RequestService_OHP_1.0\n\\Subject \"RequestService\"\n\\Service name of the service\n\\AnchorId \n\\LocSpec\n\\Presentation\n\\SessionId \n\\UserId ",{"_32":2549,"_34":2550},[],{"_36":160,"_38":2551,"_40":481,"_42":2552,"_67":2553,"_69":2558,"_71":70},"JUztBI8m",{},[2554],{"_36":166,"_167":2555,"_169":2556,"_42":2557,"_71":70},[137],[1556],{},"Message \"ClosingNode\"",{"_32":2560,"_34":2561},[],{"_36":160,"_38":2562,"_40":481,"_42":2563,"_67":2564,"_69":2565,"_71":70},"vYIMAbb1",{},[],"This message is sent from the Viewer to the LinkService when a node is closed by the user.",{"_32":2567,"_34":2568},[],{"_36":2026,"_38":2569,"_40":481,"_42":2570,"_67":2571,"_69":2572,"_71":70},"3lTKQZIS",{"_2029":70},[],"\\MessId MV_ClosingNode_OHP_1.0\n\\Subject \"ClosingNode\"\n\\NodeId \n\\SessionId \n\\UserId \n",{"_32":2574,"_34":2575},[],{"_36":160,"_38":2576,"_40":481,"_42":2577,"_67":2578,"_69":2583,"_71":70},"vUIAMENr",{},[2579],{"_36":166,"_167":2580,"_169":2581,"_42":2582,"_71":70},[137],[2531],{},"Message \"Update Anchors\"",{"_32":2585,"_34":2586},[],{"_36":160,"_38":2587,"_40":481,"_42":2588,"_67":2589,"_69":2590,"_71":70},"F7icghs2",{},[],"The UpdateAnchors message is sent by the Viewer to the LinkService when the Viewer wants to update the existing anchor list for a given NodeId.",{"_32":2592,"_34":2593},[],{"_36":2026,"_38":2594,"_40":481,"_42":2595,"_67":2596,"_69":2597,"_71":70},"4URLio5a",{"_2029":70},[],"\\MessId MV_UpdateAnchors_OHP_1.0\n\\Subject \"UpdateAnchors\"\n\\NodeId \n\\Data {\\AnchorID \\LocSpec \n \\Presentation \\Service }+\n\\SessionId \n\\UserId ",{"_32":2599,"_34":2600},[],{"_36":160,"_38":2601,"_40":481,"_42":2602,"_67":2603,"_69":2608,"_71":70},"GS5e6ypQ",{},[2604],{"_36":166,"_167":2605,"_169":2606,"_42":2607,"_71":70},[137],[2531],{},"Message \"LaunchDocument\"",{"_32":2610,"_34":2611},[],{"_36":160,"_38":2612,"_40":481,"_42":2613,"_67":2614,"_69":2615,"_71":70},"yL77uBsN",{},[],"We start the list of messages being sent by the LinkService to the Viewer with the LaunchDocument message. The LinkService might send this message for instance as the result of a follow link from another application.",{"_32":2617,"_34":2618},[],{"_36":2026,"_38":2619,"_40":481,"_42":2620,"_67":2621,"_69":2622,"_71":70},"X2EgdhUK",{"_2029":70},[],"\\MessId MS_LaunchDocument_OHP_1.0\n\\Subject \"LaunchDocument\"\n\\NodeId \n\\DMS \"SessionManager\" | \"LinkService\"| DMS handle ???\n\\ReadOnly \"True\" | \"False\"\n\\SessionId \n\\UserId ",{"_32":2624,"_34":2625},[],{"_36":160,"_38":2626,"_40":481,"_42":2627,"_67":2628,"_69":2629,"_71":70},"R7lqy57q",{},[],"I think NodeId should be interpreted by the SessionManager. We should not have to deal with the DMS stuff here. LaunchDocument will not have DatacallBack. Instead it will have a DMS field which will have the value \"SessionManager\", \"LinkService\" or the name of the DMS which can interpret the DocId.",{"_32":2631,"_34":2632},[],{"_36":160,"_38":2633,"_40":481,"_42":2634,"_67":2635,"_69":2636,"_71":70},"qR2yjCiV",{},[],"The Viewer might now get the document and - in case in can not deal with the type of document on its own - launch the appropriate Viewer. This will be initiated by advising the SessionManager to to this task.",{"_32":2638,"_34":2639},[],{"_36":160,"_38":2640,"_40":481,"_42":2641,"_67":2642,"_69":2643,"_71":70},"sHGDlp7w",{},[],"The SessionManager may use a document management protocol (DMP) to get the document, or it may do it itself, or ask the LinkService. It may also use DMP to obtain any document attributes, such as nickname, document type and preferred Viewer. If it doesn't do this, then it will be necessary for the SessionManager to supply these values.",{"_32":2645,"_34":2646},[],{"_36":160,"_38":2647,"_40":481,"_42":2648,"_67":2649,"_69":2650,"_71":70},"yjmYu9OP",{},[],"Alternatively, we may have loaded a document and wish to start Link services. ",{"_32":2652,"_34":2653},[],{"_36":160,"_38":2654,"_40":481,"_42":2655,"_67":2656,"_69":2662,"_71":70},"6WwecxJA",{},[2657],{"_36":166,"_167":2658,"_169":2659,"_42":2661,"_71":70},[137],[2660],23,{},"Message \"DisplayAnchor\"",{"_32":2664,"_34":2665},[],{"_36":160,"_38":2666,"_40":481,"_42":2667,"_67":2668,"_69":2669,"_71":70},"wLq8u_yI",{},[],"The LinkService might request from the Viewer to display an anchor in case a document has changed. For this purpose the \"DisplayAnchor\" message is used.",{"_32":2671,"_34":2672},[],{"_36":2026,"_38":2673,"_40":481,"_42":2674,"_67":2675,"_69":2676,"_71":70},"fD_XltQC",{"_2029":70},[],"\n\\MessId MS_DisplayAnchor_OHP_1.0\n\\Subject \"DisplayAnchor\"\n\\SessionId \n\\Subject DisplayAnchor\n\\AnchorID \\Presentation\n\\UserId \n",{"_32":2678,"_34":2679},[],{"_36":160,"_38":2680,"_40":481,"_42":2681,"_67":2682,"_69":2687,"_71":70},"FPxVH53u",{},[2683],{"_36":166,"_167":2684,"_169":2685,"_42":2686,"_71":70},[137],[2531],{},"Message \"DisplayLocSpec\"",{"_32":2689,"_34":2690},[],{"_36":160,"_38":2691,"_40":481,"_42":2692,"_67":2693,"_69":2694,"_71":70},"typ-7dKE",{},[],"Equally, location specifications might wanted to be displayed by the server. ",{"_32":2696,"_34":2697},[],{"_36":2026,"_38":2698,"_40":481,"_42":2699,"_67":2700,"_69":2701,"_71":70},"sYKiTMZd",{"_2029":70},[],"\n\\MessId MS_DisplayLocSpec_OHP_1.0\n\\Subject \"DisplayLocSpec\"\n\\LocSpec \\Presentation\n\\SessionId \n",{"_32":2703,"_34":2739},[2704,2725,2732],{"_32":2705,"_34":2720},[2706,2713],{"_32":2707,"_34":2708},[],{"_36":160,"_38":2709,"_40":481,"_42":2710,"_67":2711,"_69":2712,"_71":70},"sP5yvsGr",{},[],"Server End Scripts. These are the scripts that are carried out when some particular event occurs or some action is requested. From the point of view of the viewer there is no difference between some process being run or a link being followed by the linkserver. Of course, these scripts may cause new messages to be sent back to the viewer, to change its presentation in some way.",{"_32":2714,"_34":2715},[],{"_36":160,"_38":2716,"_40":481,"_42":2717,"_67":2718,"_69":2719,"_71":70},"RgoBSImr",{},[],"Client End Scripts. These are scripts that are sent to the viewer by the linkserver. In general they are either sent as part of a LocSpec in order to identify an anchor, or they are sent as a process which the viewer will be expected to run, for example in order to change the presentation of the data in some way. OHP must provide support for such scripts if the viewer wishes to use them.",{"_36":160,"_38":2721,"_40":481,"_42":2722,"_67":2723,"_69":2724,"_71":70},"r0bupa2X",{"_273":2113},[],"Scripts play an important part in some hypermedia systems (e.g. Hypercard and Multicard) , and are hardly used in others. Scripts may be classified into two types:",{"_32":2726,"_34":2727},[],{"_36":160,"_38":2728,"_40":481,"_42":2729,"_67":2730,"_69":2731,"_71":70},"yBQ4QBzn",{},[],"The message being foreseen to deal with these scripts is the Interpret message. It is sent fom the LinkService to the Viewer in order to execute a script at the Viewer. If the script is not executable or any other type of error occurs this message should be answered by the Viewer with an \"error\" message.",{"_32":2733,"_34":2734},[],{"_36":2026,"_38":2735,"_40":481,"_42":2736,"_67":2737,"_69":2738,"_71":70},"iRPDRJxk",{"_2029":70},[],"\n\\MessId MS_Interpret_OHP_1.0\n\\Subject \"Interpret\"\n\\ScriptLanguage language, e.g. Perl, JavaScript, ...\n\\Data the actual script\n\\SessionId \n\\UserId \n",{"_36":870,"_38":2740,"_40":481,"_42":2741,"_67":2742,"_69":2747,"_71":70},"vjEa2vNL",{"_273":323},[2743],{"_36":166,"_167":2744,"_169":2745,"_42":2746,"_71":70},[137],[985],{},"Message \"Interpret\"",{"_32":2749,"_34":2764},[2750,2757],{"_32":2751,"_34":2752},[],{"_36":160,"_38":2753,"_40":481,"_42":2754,"_67":2755,"_69":2756,"_71":70},"3HqV6fo0",{},[],"The LinkService might independently inform the Viewer about new anchors. It can do so by sending \"NewAnchor\" messages.",{"_32":2758,"_34":2759},[],{"_36":2026,"_38":2760,"_40":481,"_42":2761,"_67":2762,"_69":2763,"_71":70},"IEnHCMk5",{"_2029":70},[],"\n\\MessId MS_NewAnchor_OHP_1.0\n\\Subject \"NewAnchor\"\n\\Data {\\AnchorId \\LocSpec\n \\Direction {\"AtoB\" | \"bidirectional\"}\n \\Presentation \\Service}\n\\SessionId \n\\UserId \n",{"_36":870,"_38":2765,"_40":481,"_42":2766,"_67":2767,"_69":2772,"_71":70},"f2YGyWEk",{"_273":323},[2768],{"_36":166,"_167":2769,"_169":2770,"_42":2771,"_71":70},[137],[985],{},"Message \"NewAnchor\"",{"_32":2774,"_34":2789},[2775,2782],{"_32":2776,"_34":2777},[],{"_36":160,"_38":2778,"_40":481,"_42":2779,"_67":2780,"_69":2781,"_71":70},"ujzhFYrr",{},[],"This message is sent by the LinkService to a node that it wishes to automatically close e.g. in order to free a lock on a document.",{"_32":2783,"_34":2784},[],{"_36":2026,"_38":2785,"_40":481,"_42":2786,"_67":2787,"_69":2788,"_71":70},"atDUU23R",{"_2029":70},[],"\n\\MessId MV_CloseNode_OHP_1.0\n\\Subject \"CloseNode\"\n\\NodeId \n\\UpdateNode {\"True\" | \"False\"}\n\\SessionId \n\\UserId \n",{"_36":870,"_38":2790,"_40":481,"_42":2791,"_67":2792,"_69":2797,"_71":70},"pakn40CZ",{"_273":323},[2793],{"_36":166,"_167":2794,"_169":2795,"_42":2796,"_71":70},[137],[985],{},"Message \"CloseNode\"",{"_32":2799,"_34":2800},[],{"_36":160,"_38":2801,"_40":481,"_42":2802,"_67":2803,"_69":2804,"_71":70},"ZTkGolV3",{},[],"The application is then responsible for closing the node itself, ensuring that it has updated any anchors and its contents if required by the UpdateNode tag. In case of any errors the Viewer should send back an error message.",{"_32":2806,"_34":2821},[2807,2814],{"_32":2808,"_34":2809},[],{"_36":160,"_38":2810,"_40":481,"_42":2811,"_67":2812,"_69":2813,"_71":70},"Ty5dbshe",{},[],"The \"Error\" message might be sent by any component. It is composed of the following structure:",{"_32":2815,"_34":2816},[],{"_36":2026,"_38":2817,"_40":481,"_42":2818,"_67":2819,"_69":2820,"_71":70},"fwtNrTkV",{"_2029":70},[],"\n\\MessId M_Error_OHP_1.0\n\\Subject \"Error\"\n\\MessageId Id of message that caused the error\n\\ErrorSubject the type of error that occurred\n\\ErrorMessage the actual error string\n\\SessionId \n\\UserId \n",{"_36":870,"_38":2822,"_40":481,"_42":2823,"_67":2824,"_69":2830,"_71":70},"WaqN8FCL",{"_273":323},[2825],{"_36":166,"_167":2826,"_169":2827,"_42":2829,"_71":70},[137],[2828],15,{},"Message \"Error\"",{"_36":870,"_38":2832,"_40":481,"_42":2833,"_67":2834,"_69":2835,"_71":70},"2NAngyvB",{"_273":323},[],"6.3 Overview of Messages",{"_32":2837,"_34":3062},[2838,2845,2852,2873,2880,2887,2894,2901,2908,2915,2922,2943,2971,2978,2999,3020,3041],{"_32":2839,"_34":2840},[],{"_36":160,"_38":2841,"_40":481,"_42":2842,"_67":2843,"_69":2844,"_71":70},"-sv7Jyyt",{},[],"The definition of the location specifications has been quite a controversial issue (see Thread \"opaque locspecs\"). The two main camps being the \"opaque\" people on one side and the \"HyTime\" people on the other end of the spectrum. The argument towards opaque location specification is that for the LinkService location specifications should be opaque because the LinkService does not actually deal with them but rather wants to handle them as uninterpreted byte blocks. The HyTime (HyTime; 1992) followers on the other hand argue that at some point you actually have to have a specification so that an application is able to locate a specific position within a document's multimedia content. And if you have to define it use an existing standard that has been developed in order to deal with location specifications in an abstract, platform independent way.",{"_32":2846,"_34":2847},[],{"_36":160,"_38":2848,"_40":481,"_42":2849,"_67":2850,"_69":2851,"_71":70},"Y7iCcrYa",{},[],"We have learned from both viewpoints and have concluded that both are right. Therfore, we do not treat location specifcations as opqaue but we allow components to do so by simply ignoring the specifications.",{"_32":2853,"_34":2868},[2854,2861],{"_32":2855,"_34":2856},[],{"_36":160,"_38":2857,"_40":481,"_42":2858,"_67":2859,"_69":2860,"_71":70},"eHqDirbl",{},[],"A full HyTime implementation was considered to put too much onus on the application and also would be rather difficult to implement in a macro-like language. We thus agreed on a subset of location specifications as defined in HyTime.",{"_32":2862,"_34":2863},[],{"_36":160,"_38":2864,"_40":481,"_42":2865,"_67":2866,"_69":2867,"_71":70},"CsncpwYY",{},[],"The protocol is assumed to develop, thus in a first step the focus is on establishing the protocol and later on improving and enhancing it. However, we are convinced that without a basic agreement on the location specifications real interoperability between viewers is not possible.",{"_36":160,"_38":2869,"_40":481,"_42":2870,"_67":2871,"_69":2872,"_71":70},"eIzI5rNm",{"_273":274},[],"A number of additionally criteria have been influencing our decision for the current definition of location specifiers:",{"_32":2874,"_34":2875},[],{"_36":160,"_38":2876,"_40":481,"_42":2877,"_67":2878,"_69":2879,"_71":70},"If8Wj5Ib",{},[],"As an example let us take the simplest data type, e.g. ASCII text. Most systems have developed similar fairly rich methods of locating strings. The location specification should include standards for these methods. Later, we might extend standards for such things as pictures, formatted text, videos etc. But opaque types will always be allowed and supported.",{"_32":2881,"_34":2882},[],{"_36":160,"_38":2883,"_40":481,"_42":2884,"_67":2885,"_69":2886,"_71":70},"50Bbvigq",{},[],"We also would like to stress the point that standarisation of location specifications is only partially subject to OHP. This can be compared to the situation with the document management protocol: strictly speaking this should not be part of the definition of OHP; however, if OHP should be really useful there have to be some common assumptions about both location specifications and document management functionality. For the current version of OHP we therefore provide these features so that OHP as a protocol can be implemented.",{"_32":2888,"_34":2889},[],{"_36":160,"_38":2890,"_40":481,"_42":2891,"_67":2892,"_69":2893,"_71":70},"e3STn_1e",{},[],"Now that we have explained in general our decisions we are able to define location specifications as part of OHP.",{"_32":2895,"_34":2896},[],{"_36":2026,"_38":2897,"_40":481,"_42":2898,"_67":2899,"_69":2900,"_71":70},"x2E-USY-",{"_2029":70},[],"LocSpec =\n\\ContentType type, e.g., ASCII, binary\n\\Content Mime encoded text string\n\\LocData Loc\n",{"_32":2902,"_34":2903},[],{"_36":160,"_38":2904,"_40":481,"_42":2905,"_67":2906,"_69":2907,"_71":70},"1DCuoHkZ",{},[],"Location specification consist of a content type, the content itsef as well as the actual location data. LocData is defined as",{"_32":2909,"_34":2910},[],{"_36":2026,"_38":2911,"_40":481,"_42":2912,"_67":2913,"_69":2914,"_71":70},"Gxaoggfi",{"_2029":70},[],"Loc = NameLoc | DataLoc | TreeLoc | PathLoc | ScriptLoc | NALoc\n",{"_32":2916,"_34":2917},[],{"_36":160,"_38":2918,"_40":481,"_42":2919,"_67":2920,"_69":2921,"_71":70},"hLgvMjbI",{},[],"In the sequel we will explain these different basic types of location specifications. Again, it is up to the developer to introduce his own additional location specification or to add additional tags where necessry for specific applications. For most cases though, the proposed set of location specifications should be sufficient.",{"_32":2923,"_34":2938},[2924,2931],{"_32":2925,"_34":2926},[],{"_36":160,"_38":2927,"_40":481,"_42":2928,"_67":2929,"_69":2930,"_71":70},"LyBEqS8m",{},[],"Name space locations are used to reference an object by its name. Names are expressed in OHP by NodeIds so the defintion of NameLoc is as follows:",{"_32":2932,"_34":2933},[],{"_36":2026,"_38":2934,"_40":481,"_42":2935,"_67":2936,"_69":2937,"_71":70},"KVVIOp5S",{"_2029":70},[],"NameLoc =\n \\LocType \"NameLoc\"\n \\NodeId \n",{"_36":870,"_38":2939,"_40":481,"_42":2940,"_67":2941,"_69":2942,"_71":70},"X0EjPCyX",{"_273":323},[],"Name Space Locations",{"_32":2944,"_34":2966},[2945,2952,2959],{"_32":2946,"_34":2947},[],{"_36":160,"_38":2948,"_40":481,"_42":2949,"_67":2950,"_69":2951,"_71":70},"mbiacGB-",{},[],"So-called data locations are coordinate locations, i.e., objects are addressed by their relative position to another object. DataLocs will be heavily used by OHP as most systems define anchors by relative positioning, for instance by keeping an offset. In order to know how this dimension specification should be interpreted, i.e. to get its data type, a quantum tag is defined. Count list follows the HyTime semantics of defining a dimenstion list. In particular, two markers define beginning and end of a node on an axis thus resulting in (number of axes * 2) markers.",{"_32":2953,"_34":2954},[],{"_36":160,"_38":2955,"_40":481,"_42":2956,"_67":2957,"_69":2958,"_71":70},"7bTghDQH",{},[],"A reverse counter is kept in order to do cross checking of validity of anchors. In case the expected object still can not be found an overrun behaviour can be specified: the error can simply be ignored, the markers can be truncated to the last unit on the axis or an error can be raised.",{"_32":2960,"_34":2961},[],{"_36":160,"_38":2962,"_40":481,"_42":2963,"_67":2964,"_69":2965,"_71":70},"oeFqmqou",{},[],"The HyTime time quantum \"utc\" expects items in the form yyyy-mm-dd hh:mm:ss.decimal, e.g., 1997-06- 06 17:59:22.6122.",{"_36":870,"_38":2967,"_40":481,"_42":2968,"_67":2969,"_69":2970,"_71":70},"HJkHeMQB",{"_273":323},[],"Data Locations",{"_32":2972,"_34":2973},[],{"_36":2026,"_38":2974,"_40":481,"_42":2975,"_67":2976,"_69":2977,"_71":70},"GD0GfhxA",{"_2029":70},[],"DataLoc =\n \\LocType \"DataLoc\"\n \\NodeId \n \\Quantum \"string\" | \"int\" | \"byte\" | \"utc\"\n \\CountList list of Strings being interpreted by the viewer\n \\RevCountList list of Strings being interpreted by the viewer\n \\Overrun \"ignore\" | \"error\" | \"trunc\" overrun attribute\n",{"_32":2979,"_34":2994},[2980,2987],{"_32":2981,"_34":2982},[],{"_36":160,"_38":2983,"_40":481,"_42":2984,"_67":2985,"_69":2986,"_71":70},"_iOk0BtS",{},[],"Tree locations can be used for addressing a single object within a tree. The addressing is done in a way that on each level of the tree an object is selected by its position. These position numbers are expressed in CountList. For example a count list of \"1 2 3\" applied to a NodeId referencing a book would get the third section of the second chapter of the book (assuming that a book has a structure with chapters and sections).",{"_32":2988,"_34":2989},[],{"_36":2026,"_38":2990,"_40":481,"_42":2991,"_67":2992,"_69":2993,"_71":70},"kOQQKZ7r",{"_2029":70},[],"TreeLoc =\n \\LocType \"TreeLoc\"\n \\NodeId \n \\Overrun \"ignore\" | \"error\" | \"trunc\"\n \\CountList list of numbers",{"_36":870,"_38":2995,"_40":481,"_42":2996,"_67":2997,"_69":2998,"_71":70},"386Z2vpd",{"_273":323},[],"Tree Locations",{"_32":3000,"_34":3015},[3001,3008],{"_32":3002,"_34":3003},[],{"_36":160,"_38":3004,"_40":481,"_42":3005,"_67":3006,"_69":3007,"_71":70},"JkWjxXNk",{},[],"As opposed to tree locations path locations are used to address a range of nodes by a path. This is done by addressing a tree as though it were a matrix in which the rows are the levels of the tree and the columns are the paths. Therefore the count list of a path location consists of an even number of pairs: the first pair identifies the columns (i.e. the paths to the leaves) and the second pair selects the rows.",{"_32":3009,"_34":3010},[],{"_36":2026,"_38":3011,"_40":481,"_42":3012,"_67":3013,"_69":3014,"_71":70},"_9OeIVpX",{"_2029":70},[],"PathLoc =\n \\LocType \"PathLoc\"\n \\NodeId \n \\Overrun \"ignore\" | \"error\" | \"trunc\"\n \\CountList list of numbers",{"_36":870,"_38":3016,"_40":481,"_42":3017,"_67":3018,"_69":3019,"_71":70},"D3S_3Z7W",{"_273":323},[],"Path Locations",{"_32":3021,"_34":3036},[3022,3029],{"_32":3023,"_34":3024},[],{"_36":160,"_38":3025,"_40":481,"_42":3026,"_67":3027,"_69":3028,"_71":70},"VtgFr93a",{},[],"OHP does not define a specific query mechanism for addressing locations (as thus for instance HyTime with the standard DSSSL Query Language, SDQ). However, by allowing script locations we define a way for those Hypermedia systems that use scripts to identify and address locations at the client's side.",{"_32":3030,"_34":3031},[],{"_36":2026,"_38":3032,"_40":481,"_42":3033,"_67":3034,"_69":3035,"_71":70},"mgGu8oKA",{"_2029":70},[],"ScriptLoc =\n \\LocType \"ScriptLoc\"\n \\Script viewer executable script\n",{"_36":870,"_38":3037,"_40":481,"_42":3038,"_67":3039,"_69":3040,"_71":70},"RIMeK5bb",{"_273":323},[],"Script Locations",{"_32":3042,"_34":3057},[3043,3050],{"_32":3044,"_34":3045},[],{"_36":160,"_38":3046,"_40":481,"_42":3047,"_67":3048,"_69":3049,"_71":70},"756uf_OB",{},[],"An idea borrowed from HyTime is to address data that is currently not accessible. This could be a printed book which is not available on-line, a radio broadcast or even a person or an organization. The point is that it might in some cases make sense to reference these nodes without having a Viewer for them. Instead, the Viewer could display a notification string, stating for example where to find a book in a shelf in a library. We call this location specification NALoc for \"not accessible\" location.",{"_32":3051,"_34":3052},[],{"_36":2026,"_38":3053,"_40":481,"_42":3054,"_67":3055,"_69":3056,"_71":70},"6JHFA1C2",{"_2029":70},[],"NALoc =\n \\LocType \"NALoc\"\n \\Loc string as description of the object and its physical location\n",{"_36":870,"_38":3058,"_40":481,"_42":3059,"_67":3060,"_69":3061,"_71":70},"zTZA81LN",{"_273":323},[],"Inaccessible Locations",{"_36":870,"_38":3063,"_40":481,"_42":3064,"_67":3065,"_69":3066,"_71":70},"VJYfBroP",{"_273":323},[],"6.4 Location Specifications",{"_32":3068,"_34":3145},[3069,3076,3083,3090,3097,3104,3111,3118,3131,3138],{"_32":3070,"_34":3071},[],{"_36":160,"_38":3072,"_40":481,"_42":3073,"_67":3074,"_69":3075,"_71":70},"ScD4TpLm",{},[],"Many systems incorporate the possibility of displaying persistent selections in different ways. For example, persistent selections in text might be coloured blue, or some other colour, and areas of bitmaps might be shaded, raised or outlined; some systems support buttons that are not shown, or are only shown when the pointer is over them. In general this is a user choice, and it applies to all the persistent selections in the view, so may be a setting on the viewer that is completely independent of the link service.",{"_32":3077,"_34":3078},[],{"_36":160,"_38":3079,"_40":481,"_42":3080,"_67":3081,"_69":3082,"_71":70},"igq_Dchn",{},[],"However, there are cases where an author may wish particular persistent selections to show in some way that is different from others. In this case it is possible for the viewer to allow the specification of some particular presentation of the selection, and to store this along with the LocSpec, so that when it is viewed later, it will have the desired appearance. If this were the only requirement, the syntax and semantics of the presentation specifier would belong only to the viewer.",{"_32":3084,"_34":3085},[],{"_36":160,"_38":3086,"_40":481,"_42":3087,"_67":3088,"_69":3089,"_71":70},"1pGwRKCN",{},[],"Unfortunately, there are many cases where the link service may wish, as the result of some script, to change the presentation, and the linkservice will not know the presentation unless it is part of the standard.",{"_32":3091,"_34":3092},[],{"_36":160,"_38":3093,"_40":481,"_42":3094,"_67":3095,"_69":3096,"_71":70},"LvY-Z7vY",{},[],"For the purpose of this version of the protocol we suggest that the information about presentation is kept Viewer specific. i.e. the Viewer may ask to store any presentation information in any form that it chooses, and the Viewer will interpret this data at a later stage when asked to present the data again.",{"_32":3098,"_34":3099},[],{"_36":160,"_38":3100,"_40":481,"_42":3101,"_67":3102,"_69":3103,"_71":70},"G8FJ0Kud",{},[],"The consequence of this policy will be that the LinkService will not be able to communicate to the Viewer that it should change any presentation (e.g. as the result of a script) since it will not know the syntax of the presentation tag for this particular Viewer.",{"_32":3105,"_34":3106},[],{"_36":160,"_38":3107,"_40":481,"_42":3108,"_67":3109,"_69":3110,"_71":70},"IRYielXq",{},[],"We are aware that strictly speaking presentation styles should not be defined within OHP (Anderson, 1997). However, as is true for the document management part and also for the location specifications, in order to make OHP really useable in the first phase a standardised agreed way of expressing presentation specifics has to be found.",{"_32":3112,"_34":3113},[],{"_36":2026,"_38":3114,"_40":481,"_42":3115,"_67":3116,"_69":3117,"_71":70},"3yhJohZm",{"_2029":70},[],"\\Presentation [\\Colour colour][\\style style]\n [\\visibility \"true\"| \"false\"]\n",{"_32":3119,"_34":3120},[],{"_36":160,"_38":3121,"_40":481,"_42":3122,"_67":3123,"_69":3130,"_71":70},"WWoT_Wi1",{},[3124],{"_36":166,"_167":3125,"_169":3127,"_42":3129,"_71":70},[3126],263,[3128],268,{},"Following the original proposal we suggest a triplet of colour, style, visibility, each of which is optional. The above defintion allows us to only put these things if we have them, and we could also add other tags if needed. We will define some tag values which will be understood.",{"_32":3132,"_34":3133},[],{"_36":160,"_38":3134,"_40":481,"_42":3135,"_67":3136,"_69":3137,"_71":70},"ea9PKFVP",{},[],"We assume that the eight primary computer colours are supported, i.e. blue, cyan, green, magenta, orange, pink, red and yellow.",{"_32":3139,"_34":3140},[],{"_36":160,"_38":3141,"_40":481,"_42":3142,"_67":3143,"_69":3144,"_71":70},"MNKL9jkv",{},[],"As minimal subset of styles we define flashing, bold, italic, outlined and shaded.",{"_36":870,"_38":3146,"_40":481,"_42":3147,"_67":3148,"_69":3149,"_71":70},"H4q3KtZO",{"_273":323},[],"6.5 Presentation Specification",{"_36":870,"_38":3151,"_40":481,"_42":3152,"_67":3153,"_69":3154,"_71":70},"JB-7sOxa",{"_273":323},[],"6. Definitions",{"_32":3156,"_34":3201},[3157,3164],{"_32":3158,"_34":3159},[],{"_36":160,"_38":3160,"_40":481,"_42":3161,"_67":3162,"_69":3163,"_71":70},"FCF4FsG7",{},[],"In this section we consider, by reference to some different types of hypermedia viewers, the way these applications might use the OHP protocol. In order to allow readers to 'play' with OHP and to better visualize the communiction process we have developed a small Java applet that should help in understanding OHP.",{"_32":3165,"_34":3192},[3166,3173],{"_32":3167,"_34":3168},[],{"_36":160,"_38":3169,"_40":481,"_42":3170,"_67":3171,"_69":3172,"_71":70},"o8LiLZZQ",{},[],"The following simple applet is based on the assumptions we have made about the components being involved in an OHP scenario. On the OHP level we thus only have two components, Viewer and LinkService, that talk OHP to each other. The communication layer is not shown in the applet.",{"_32":3174,"_34":3187},[3175],{"_32":3176,"_34":3177},[],{"_36":160,"_38":3178,"_40":481,"_42":3179,"_67":3180,"_69":3186,"_71":70},"4NJmJYvh",{},[3181],{"_36":166,"_167":3182,"_169":3183,"_42":3185,"_71":70},[137],[3184],43,{},"Fig.: Java Applet allowing to play with OHP",{"_36":160,"_38":3188,"_40":481,"_42":3189,"_67":3190,"_69":3191,"_71":70},"2RWgWbpR",{"_273":323},[],"In order to play with OHP select a scenario and walk through it by pressing 'start'.",{"_36":870,"_38":3193,"_40":481,"_42":3194,"_67":3195,"_69":3200,"_71":70},"37lVPsn6",{"_273":323},[3196],{"_36":166,"_167":3197,"_169":3198,"_42":3199,"_71":70},[137],[1542],{},"Try out OHP!",{"_36":870,"_38":3202,"_40":481,"_42":3203,"_67":3204,"_69":3205,"_71":70},"-Ue96qsv",{"_273":323},[],"7. Example Scenarios",{"_32":3207,"_34":3269},[3208,3243],{"_32":3209,"_34":3238},[3210,3217,3224,3231],{"_32":3211,"_34":3212},[],{"_36":160,"_38":3213,"_40":481,"_42":3214,"_67":3215,"_69":3216,"_71":70},"QhYPj_is",{},[],"The World-Wide Web Consortium proposes a standardised way to extend the HyperText Transfer Protocol. This extension is called Protocol Extension Protocol (PEP, Nielsen, 1997).",{"_32":3218,"_34":3219},[],{"_36":160,"_38":3220,"_40":481,"_42":3221,"_67":3222,"_69":3223,"_71":70},"e-uN6rte",{},[],"PEP should be used for situations where applications require more facilities than the standard version of HTTP provides, from distributed authoring, collaboration and printing, to various remote procedure call mechanisms.",{"_32":3225,"_34":3226},[],{"_36":160,"_38":3227,"_40":481,"_42":3228,"_67":3229,"_69":3230,"_71":70},"ix5YBm7l",{},[],"The Protocol Extension Protocol (PEP) is an extension mechanism designed to address the tension between private agreement and public specification and to accommodate extension of HTTP clients and servers by software components. The PEP mechanism is to associate each extension with a URI, and use a few new header fields to carry the extension identifier and related information from HTTP clients, through proxies and intermediaries, to servers, and back again.",{"_32":3232,"_34":3233},[],{"_36":160,"_38":3234,"_40":481,"_42":3235,"_67":3236,"_69":3237,"_71":70},"WNboOKrN",{},[],"From an OHP point of view PEP could be used in the communications layer which is represented by the SessionManager component. OHP itself however, is on a higher level and its focus is different to that of PEP being based on HTTP.",{"_36":870,"_38":3239,"_40":481,"_42":3240,"_67":3241,"_69":3242,"_71":70},"42Lav33m",{"_273":323},[],"8.1 Protocol Extension Protocol (PEP)",{"_32":3244,"_34":3264},[3245,3252],{"_32":3246,"_34":3247},[],{"_36":160,"_38":3248,"_40":481,"_42":3249,"_67":3250,"_69":3251,"_71":70},"vO4W7rgH",{},[],"OpenDoc is a multi-platform component-based architecture, based around CORBA. OpenDoc uses compound documents, where the data in each component is viewed and accessed by means of \"part editors\". OpenDoc assigns the correct editor to handle each different data type, looking first at user preferences, and failing that, making an intelligent decision based on the data type, and its knowledge of the available editors. The part editors share windows, menus and other resources within a document. OpenDoc provides a highly versatile persistent storage system known as Bento, which allows multiple part editors to share a single document file. The Bento storage units and mechanisms are also used for clipboard transfers, drag-and-drop, and linking between parts, documents and/or networks.",{"_32":3253,"_34":3254},[],{"_36":160,"_38":3255,"_40":481,"_42":3256,"_67":3257,"_69":3263,"_71":70},"EgxRK8Cl",{},[3258],{"_36":919,"_167":3259,"_169":3260,"_42":3262,"_71":70},[1556],[3261],49,{},"OpenDoc includes the Open Scripting Architecture - a highly versatile mechanism that includes an Apple Event Model (AEOM) style communication architecture. Consequently the same kind of Shims that would work with the AEOM would work with properly built OpenDoc part editors, and hence with OpenDoc applications. OpenDoc is a multi-platform architecture, and if it is successful in establishing itself the implications are significant.",{"_36":870,"_38":3265,"_40":481,"_42":3266,"_67":3267,"_69":3268,"_71":70},"XaNrRqy-",{"_273":323},[],"8.2 OpenDoc",{"_36":870,"_38":3270,"_40":481,"_42":3271,"_67":3272,"_69":3273,"_71":70},"RAUOqF-2",{"_273":323},[],"8. Related Work",{"_32":3275,"_34":3297},[3276],{"_32":3277,"_34":3292},[3278,3285],{"_32":3279,"_34":3280},[],{"_36":160,"_38":3281,"_40":481,"_42":3282,"_67":3283,"_69":3284,"_71":70},"8JlLnIPQ",{},[],"Collaboration",{"_32":3286,"_34":3287},[],{"_36":160,"_38":3288,"_40":481,"_42":3289,"_67":3290,"_69":3291,"_71":70},"NU-Wvt11",{},[],"Transaction Semantics",{"_36":160,"_38":3293,"_40":481,"_42":3294,"_67":3295,"_69":3296,"_71":70},"YmQRi_fm",{"_273":274},[],"We sum up what we have proposed, conclude. List of open issues:",{"_36":870,"_38":3298,"_40":481,"_42":3299,"_67":3300,"_69":3301,"_71":70},"keTzgVzJ",{"_273":323},[],"9. Summary and Conclusion ",{"_32":3303,"_34":3311},[3304],{"_32":3305,"_34":3306},[],{"_36":160,"_38":3307,"_40":481,"_42":3308,"_67":3309,"_69":3310,"_71":70},"ac-C2x25",{},[],"The OHS community, all that have contributed in any form. Special thanks to Pete Nürnberg, Ken Anderson, Richard Taylor.",{"_36":870,"_38":3312,"_40":481,"_42":3313,"_67":3314,"_69":3315,"_71":70},"hvS6KMvc",{"_273":323},[],"Acknowledgements",{"_32":3317,"_34":3491},[3318,3329,3342,3354,3366,3379,3392,3399,3412,3423,3430,3437,3444,3457,3468,3480],{"_32":3319,"_34":3320},[],{"_36":160,"_38":3321,"_40":481,"_42":3322,"_67":3323,"_69":3328,"_71":70},"LuY0cf8c",{},[3324],{"_36":919,"_167":3325,"_169":3326,"_42":3327,"_71":70},[171],[1414],{},"Kenneth M. A. A Critique of the Open Hypermedia Protocol. 3rd Workshop on Open Hypermedia Systems, Southampton, April 1997. Available as http://www.daimi.aau.dk/~kock/OHS- HT97/Papers/anderson.html [1997 June 20].",{"_32":3330,"_34":3331},[],{"_36":160,"_38":3332,"_40":481,"_42":3333,"_67":3334,"_69":3341,"_71":70},"duzL0LaI",{},[3335],{"_36":919,"_167":3336,"_169":3338,"_42":3340,"_71":70},[3337],37,[3339],117,{},"Davis, H.C., Knight, S.K. & Hall, W. Light Hypermedia Link Services: A Study in Third Party Application Integration. In: The ACM Conference on Hypermedia Technology, ECHT '94 Proceedings. pp 41-50. ACM. Sept. 1994.",{"_32":3343,"_34":3344},[],{"_36":160,"_38":3345,"_40":481,"_42":3346,"_67":3347,"_69":3353,"_71":70},"VwZ99rsB",{},[3348],{"_36":919,"_167":3349,"_169":3350,"_42":3352,"_71":70},[2355],[3351],142,{},"Davis, H., Lewis, A., Rizk, A. OHP: A Draft Proposal for a Standard Open Hypermedia Protocol (Levels 0 and 1: Revision 1.2 - 13th March. 1996). 2nd Workshop on Open Hypermedia Systems, Washington, March 1996. Available as http://www.ecs.soton.ac.uk/~hcd/protweb.htm [1997 June 20].",{"_32":3355,"_34":3356},[],{"_36":160,"_38":3357,"_40":481,"_42":3358,"_67":3359,"_69":3365,"_71":70},"g5OSzN2T",{},[3360],{"_36":919,"_167":3361,"_169":3362,"_42":3364,"_71":70},[1464],[3363],26,{},"Davis, H.: Channels in OHP. Thread in OHS Mailing List (1997 June 6) Available as http://www.csdl.tamu.edu/ohs/archive/0032.html [1997 June 20].",{"_32":3367,"_34":3368},[],{"_36":160,"_38":3369,"_40":481,"_42":3370,"_67":3371,"_69":3378,"_71":70},"XG99Npjy",{},[3372],{"_36":919,"_167":3373,"_169":3375,"_42":3377,"_71":70},[3374],28,[3376],125,{},"Goose S., Lewis A., Hugh D. OHRA: Towards an Open Hypermedia Reference Architecture and a Migration Path for Existing Systems. 3rd Workshop on Open Hypermedia Systems, Southampton, April 1997. Available as http://www.daimi.aau.dk/~kock/OHS-HT97/Papers/goose.html [1997 June 20].",{"_32":3380,"_34":3381},[],{"_36":160,"_38":3382,"_40":481,"_42":3383,"_67":3384,"_69":3391,"_71":70},"FXhx1SFy",{},[3385],{"_36":919,"_167":3386,"_169":3387,"_42":3390,"_71":70},[3363,1097],[3388,3389],82,202,{},"Grønbæk, K. & Trigg, R.H. Design Issues for a Dexter-Based Hypermedia System. In: D. Lucarella, J. Nanard, M. Nanard, P. Paolini. eds. The Proceedings of the ACM Conference on Hypertext, ECHT '92 Milano, pp 191-200. ACM Press. Nov. 1992",{"_32":3393,"_34":3394},[],{"_36":160,"_38":3395,"_40":481,"_42":3396,"_67":3397,"_69":3398,"_71":70},"cbJVaiBI",{},[],"ISO - International Organization for Standardization: Information Technology - Hypermedia/Time-based Structuring Language (HyTime), ISO/IEC 10744, 1992.",{"_32":3400,"_34":3401},[],{"_36":160,"_38":3402,"_40":481,"_42":3403,"_67":3404,"_69":3411,"_71":70},"p3P90Mzo",{},[3405],{"_36":919,"_167":3406,"_169":3408,"_42":3410,"_71":70},[3407],29,[3409],91,{},"Kacmar, C.J. & Leggett, J.J. PROXHY: A Process-Oriented Extensible Hypertext Architecture. ACM Trans. on Information Systems, 9(4) pp 299-419. Oct. 1991.",{"_32":3413,"_34":3414},[],{"_36":160,"_38":3415,"_40":481,"_42":3416,"_67":3417,"_69":3422,"_71":70},"PlK5vrpO",{},[3418],{"_36":919,"_167":3419,"_169":3420,"_42":3421,"_71":70},[2828],[1573],{},"Nürnberg, P.: opaque locspecs. Thread in OHS Mailing List (1997 April 17) Available as http://www.csdl.tamu.edu/ohs/archive/0023.html [1997 June 20].",{"_32":3424,"_34":3425},[],{"_36":160,"_38":3426,"_40":481,"_42":3427,"_67":3428,"_69":3429,"_71":70},"AEWVo2uC",{},[],"Open Document Management API (ODMA): Open Document Management API Version 1.5. Available as http://www.aiim.org/odma/odma15.htm [1997 June 20].",{"_32":3431,"_34":3432},[],{"_36":160,"_38":3433,"_40":481,"_42":3434,"_67":3435,"_69":3436,"_71":70},"TOSNHKWS",{},[],"PEP - an Extension Mechanism for HTTP: W3C Working Draft 28 April 1997. Edited by Henrik Frystyk Nielsen. Available as http://www.w3.org/TR/WD-http-pep-970428 [1997 June 20].",{"_32":3438,"_34":3439},[],{"_36":160,"_38":3440,"_40":481,"_42":3441,"_67":3442,"_69":3443,"_71":70},"IF9prJIl",{},[],"Reich, S.: How OHP's LocSpecs could benefit from ISO/IEC 10744. 3rd Workshop on Open Hypermedia Systems, Southampton, April 1997. Available as http://www.daimi.aau.dk/~kock/OHS- HT97/Papers/reich.ps [1997 June 20].",{"_32":3445,"_34":3446},[],{"_36":160,"_38":3447,"_40":481,"_42":3448,"_67":3449,"_69":3456,"_71":70},"Gh_M3Kv8",{},[3450],{"_36":919,"_167":3451,"_169":3452,"_42":3455,"_71":70},[1011,3339],[3453,3454],58,184,{},"Rizk, A. & Sauter, L. Multicard: An Open Hypermedia System. In: D. Lucarella, J. Nanard, M. Nanard, P. Paolini. eds. The Proceedings of the ACM Conference on Hypertext, ECHT '92 Milano, Italy, December 1992, pp 181-190. ACM Press. 1992",{"_32":3458,"_34":3459},[],{"_36":160,"_38":3460,"_40":481,"_42":3461,"_67":3462,"_69":3467,"_71":70},"hzD1fdKj",{},[3463],{"_36":919,"_167":3464,"_169":3465,"_42":3466,"_71":70},[171],[1117],{},"Taylor, R. N. Response: A Draft Proposal for a Standard Open Hypermedia Protocol. 2nd Workshop on Open Hypermedia Systems, Washington, March 1996. Available as ?????????????????? [1997 June 20].",{"_32":3469,"_34":3470},[],{"_36":160,"_38":3471,"_40":481,"_42":3472,"_67":3473,"_69":3479,"_71":70},"Hug8UDTF",{},[3474],{"_36":919,"_167":3475,"_169":3477,"_42":3478,"_71":70},[3476],33,[3376],{},"Wiil, U.K & Østerbye, K. (eds.). The Proceedings of the ECHT '94 Workshop on Open Hypermedia Systems, Edinburgh, Sept. 1994. Technical Report R-94-2038. Aalborg University. Oct. 1994.",{"_32":3481,"_34":3482},[],{"_36":160,"_38":3483,"_40":481,"_42":3484,"_67":3485,"_69":3490,"_71":70},"2nSqQAnH",{},[3486],{"_36":919,"_167":3487,"_169":3488,"_42":3489,"_71":70},[2531],[185],{},"Wiil, U.K & Leggett, J. The HyperDisco Approach to Open Hypermedia Systems. In: The Proceedings of the ACM Conference on Hypertext '96, Washington D.C., pp 140-148. ACM Press. March 1996. An OHP application must also provide an interface to allow anchors to be updated e.g. after document editing.",{"_36":870,"_38":3492,"_40":481,"_42":3493,"_67":3494,"_69":3495,"_71":70},"QAYEeiF7",{"_273":323},[],"References",[279,54],"/records/ohp-open-hypermedia-protocol","2025-07-07T23:07:11.413Z",{"_83":490},{},{"_38":468,"_95":54,"_55":3502,"_72":471,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,470],1773151562766,[149,468,471,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/ohp-open-hypermedia-protocol\",\"bafy2bzaceb5g2ghhzmslplmaqsyvrz6raz6ub7cuemsnafggjtuntq5jpg67c\",true]",{"_110":3507,"_147":5561,"_150":5562},{"_112":3508,"_131":132,"_133":5560,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":3509,"_38":5558},{"_29":3510,"_72":496,"_73":54,"_74":5553,"_55":5554,"_77":505,"_79":5555,"_81":5556,"_85":5557,"_87":506,"_89":90},[3511,3532,3548,3561,3645,3836,3886,4630,4967,5078,5470],{"_32":3512,"_34":3513},[],{"_36":160,"_38":3514,"_40":506,"_42":3515,"_67":3516,"_69":3531,"_71":70},"ZB8af6L_",{},[3517,3521,3525],{"_36":166,"_167":3518,"_169":3519,"_42":3520,"_71":70},[137],[2660],{},{"_36":919,"_167":3522,"_169":3523,"_42":3524,"_71":70},[137],[1700],{},{"_36":204,"_167":3526,"_169":3528,"_42":3529,"_71":3530},[3527],168,[1700],{},"mailto:ajl@ecs.soton.ac.uk","Hugh Davis, Andy Lewis\nThe Multimedia Research Group\nElectronics and Computer Science\nThe University of Southampton\nSouthampton\nUK, SO17 1BJ\nemail hcd@ecs.soton.ac.uk, ajl@ecs.soton.ac.uk",{"_32":3533,"_34":3534},[],{"_36":160,"_38":3535,"_40":506,"_42":3536,"_67":3537,"_69":3547,"_71":70},"RoJ7iSjX",{},[3538,3542],{"_36":166,"_167":3539,"_169":3540,"_42":3541,"_71":70},[137],[1520],{},{"_36":919,"_167":3543,"_169":3544,"_42":3546,"_71":70},[137],[3545],50,{},"Antoine Rizk\nEuroclid\nemail Antoine.Rizk@inria.fr\n",{"_32":3549,"_34":3557},[3550],{"_32":3551,"_34":3552},[],{"_36":160,"_38":3553,"_40":506,"_42":3554,"_67":3555,"_69":3556,"_71":70},"ZlXFOWow",{},[],"This paper describes a proposal for a protocol known as OHP, for communication between applications and hypermedia link services. If hypermedia viewers were written to use this protocol, or third party applications were adapted to use the protocol, then these applications could be used with any link service which adhered to the protocol. The paper proposes the use of shims for converting between the OHP protocol and the linkservice's native protocol.",{"_36":870,"_38":3558,"_40":506,"_42":3559,"_67":3560,"_69":1827,"_71":70},"-pXHwaS0",{"_273":323},[],{"_32":3562,"_34":3640},[3563,3570,3619,3626,3633],{"_32":3564,"_34":3565},[],{"_36":160,"_38":3566,"_40":506,"_42":3567,"_67":3568,"_69":3569,"_71":70},"vb71H-D3",{},[],"In order to introduce this paper we would first like to define what we mean by \"open\" when referring to hypermedia systems. A number of authors (Davis et al., 1992 ; Østerbye, 1996 ) and workshops ( Aßfalg, 1994 ) ( Wiil & Østerbye, 1994 ), have attempted to define the term \"open hypermedia\", and we believe that the following is a reasonable summary of current thinking.",{"_32":3571,"_34":3614},[3572,3579,3586,3593,3600,3607],{"_32":3573,"_34":3574},[],{"_36":160,"_38":3575,"_40":506,"_42":3576,"_67":3577,"_69":3578,"_71":70},"RfiMZajm",{},[],"Size: It should be possible to import new nodes, links, anchors and other hypermedia objects of any limitation, to the size of the objects or to the maximum number of such objects that the system may contain, being imposed by the hypermedia system.",{"_32":3580,"_34":3581},[],{"_36":160,"_38":3582,"_40":506,"_42":3583,"_67":3584,"_69":3585,"_71":70},"P2h_BCAl",{},[],"Data Formats: The system should allow the import and use of any data format, including temporal media.",{"_32":3587,"_34":3588},[],{"_36":160,"_38":3589,"_40":506,"_42":3590,"_67":3591,"_69":3592,"_71":70},"dNN2sa_H",{},[],"Applications: The system should allow any application to access the link service in order to participate in the hypermedia functionality.",{"_32":3594,"_34":3595},[],{"_36":160,"_38":3596,"_40":506,"_42":3597,"_67":3598,"_69":3599,"_71":70},"RJ8W3NJC",{},[],"Data Models: The hypermedia system should not impose a single view of what constitutes a hypermedia data model, but should be configurable and extensible so that new hypermedia data models may be incorporated. It should thus be possible to interoperate with external hypermedia systems, and to exchange data with external systems.",{"_32":3601,"_34":3602},[],{"_36":160,"_38":3603,"_40":506,"_42":3604,"_67":3605,"_69":3606,"_71":70},"Qq8DtCJ9",{},[],"Platforms: It should be possible to implement the system on multiple distributed platforms.",{"_32":3608,"_34":3609},[],{"_36":160,"_38":3610,"_40":506,"_42":3611,"_67":3612,"_69":3613,"_71":70},"TkHHS8qq",{},[],"Users: The system must support multiple users, and allow each user to maintain their own private view of the objects in the system.",{"_36":160,"_38":3615,"_40":506,"_42":3616,"_67":3617,"_69":3618,"_71":70},"6bPmURXZ",{"_273":2113},[],"The term open implies the possibility of importing new objects into a system. A truly open hypermedia system should be open with regard to:",{"_32":3620,"_34":3621},[],{"_36":160,"_38":3622,"_40":506,"_42":3623,"_67":3624,"_69":3625,"_71":70},"lK9JChOJ",{},[],"In this paper we are concerned with enabling applications to make them link service aware, so that users may have access to the full range of hypermedia functionality from their standard desktop environment. Many of the current generation of hypermedia systems such as DHM (Grønbæk & Trigg, 1992 ) HyperDisco ( Wiil, 1996 ), Microcosm ( Davis et al., 1994 ), Multicard ( Rizk & Sauter, 1992 ) and the Texas A&M system prototypes (e.g. Kacmar & Leggett ) have addressed this problem, but so far no standard has emerged due to the different hypertext data models and communication protocols adopted by these systems.",{"_32":3627,"_34":3628},[],{"_36":160,"_38":3629,"_40":506,"_42":3630,"_67":3631,"_69":3632,"_71":70},"vK1BtxRY",{},[],"Unfortunately, linkservice protocols tend to be kept confidential, and are anyway too detailed to form the topic of published papers. However, we have now seen the results of sufficient research in this subject to be able to identify the common themes, and hopefully to abstract the common requirements. This first draft of this protocol leans heavily upon the M2000 protocol (Rizk, 1991 ) developed for use with Multicard, and the Microcosm message model. It is a first attempt at such a standard protocol, and no doubt it will need adapting and will evolve as system designers attempt to map their systems onto the protocol.",{"_32":3634,"_34":3635},[],{"_36":160,"_38":3636,"_40":506,"_42":3637,"_67":3638,"_69":3639,"_71":70},"Hx7rZnoN",{},[],"We should emphasise at this point that all this protocol attempts to provide is a standard method for applications, such as word processors, graphics viewers and drawing programs, to communicate with a link service so that they may offer hypermedia services to their users. This protocol is not an attempt to produce a complete standard for all inter-component communication, such as would be required for the link service to communicate with agents and other service providing components.",{"_36":870,"_38":3641,"_40":506,"_42":3642,"_67":3643,"_69":3644,"_71":70},"_UjppcXd",{"_273":323},[],"1. Introduction",{"_32":3646,"_34":3831},[3647,3654,3661,3670,3698,3705],{"_32":3648,"_34":3649},[],{"_36":160,"_38":3650,"_40":506,"_42":3651,"_67":3652,"_69":3653,"_71":70},"bI_pQ529",{},[],"In general, open hypermedia systems tend to implement a link service layer which provides the storage and access mechanism for links and anchors. The Dexter reference model ( Halasz & Mayer, 1994 ) refers to this as the storage layer . Some systems call this layer a hyperbase ; such systems usually store not only the links and anchors, but also the nodes in this layer. The distinctions between the different types of system are ill defined, and anyway not the subject of this paper. The thing that all such systems have in common is that the application layer (or runtime layer) is physically separate from the storage layer, and that there is some system of message passing between the two, which allows the applications (editors, viewers) to send and receive messages and query the link service concerning hypertext services.",{"_32":3655,"_34":3656},[],{"_36":160,"_38":3657,"_40":506,"_42":3658,"_67":3659,"_69":3660,"_71":70},"WEDP0XkW",{},[],"All systems designers have developed their own private protocols for communicating with the link service, and these protocols are so deeply buried into the system code that in general it would involve a major re- implementation to rewrite the system to adhere to some new, standard protocol. However, the topics of these communication are essentially similar and it should quite possible to abstract a common set of messages. We suggest that the difference between different system protocols could be resolved if each system produced a protocol shim which would sit between the application and the link service as shown in figure 1.",{"_32":3662,"_34":3663},[],{"_36":1875,"_38":3664,"_40":506,"_42":3665,"_67":3667,"_69":3668,"_71":3669},"VMfk4zsc",{"_273":323,"_2135":3666},525.3658536585366,[],"Figure 1: Protocol conversion using a protocol shim.","ipfs://bafkreie7wilfgvat6int7a4exffioyaziwghnem3zti5ua2dp7fmngrcla",{"_32":3671,"_34":3693},[3672,3679,3686],{"_32":3673,"_34":3674},[],{"_36":160,"_38":3675,"_40":506,"_42":3676,"_67":3677,"_69":3678,"_71":70},"PH5qDjwk",{},[],"Once an application (for example a word processor) had been adapted to communicate using the standard protocol (for example, using an application macro language) , then it would be possible to circulate the code extensions or macros so that any system would be able to benefit from this \"hypertext aware\" application.",{"_32":3680,"_34":3681},[],{"_36":160,"_38":3682,"_40":506,"_42":3683,"_67":3684,"_69":3685,"_71":70},"PjPH2kuR",{},[],"Each system developer need develop just one extension to their system (the protocol shim itself)",{"_32":3687,"_34":3688},[],{"_36":160,"_38":3689,"_40":506,"_42":3690,"_67":3691,"_69":3692,"_71":70},"rO1w3nIF",{},[],"Applications that have been developed specifically as hypermedia viewer/editors could be used in other systems, so long as they observed the protocols.",{"_36":160,"_38":3694,"_40":506,"_42":3695,"_67":3696,"_69":3697,"_71":70},"2pS6DT5o",{"_273":274},[],"The advantages of this scheme are:",{"_32":3699,"_34":3700},[],{"_36":160,"_38":3701,"_40":506,"_42":3702,"_67":3703,"_69":3704,"_71":70},"vskfXf0j",{},[],"The problem with this approach is that some hypermedia systems have much heavier weight requirements on their protocols than others. However many developers have recently acknowledged that it is necessary to accept the concept of \"levels of awareness\" (e.g. Davis et al., 1994 , Wiil, 1996 ), and that it will not always be possible or reasonable to expect the highest level of hypertext functionality from every third party application. Reflecting these pragmatic observations we propose that the OHP protocol will have a number of levels of conformity, and it would thus be possible to describe a given application as OHP aware to some given level.",{"_32":3706,"_34":3826},[3707,3735,3742,3770,3777,3812,3819],{"_32":3708,"_34":3730},[3709,3716,3723],{"_32":3710,"_34":3711},[],{"_36":160,"_38":3712,"_40":506,"_42":3713,"_67":3714,"_69":3715,"_71":70},"1WBVrx9G",{},[],"where anchors are stored;",{"_32":3717,"_34":3718},[],{"_36":160,"_38":3719,"_40":506,"_42":3720,"_67":3721,"_69":3722,"_71":70},"TYvRHRVQ",{},[],"how new anchors are allocated;",{"_32":3724,"_34":3725},[],{"_36":160,"_38":3726,"_40":506,"_42":3727,"_67":3728,"_69":3729,"_71":70},"naRIyZkY",{},[],"how the anchor refers to the object within the node data that is to be the physical manifestation of that anchor.",{"_36":160,"_38":3731,"_40":506,"_42":3732,"_67":3733,"_69":3734,"_71":70},"O12BrB62",{"_273":274},[],"One of the major differences between hypertext implementations is the way that anchors have been treated (Davis, 1995 ). The issues, from the point of view of hypertext enabling third party applications, are: ",{"_32":3736,"_34":3737},[],{"_36":160,"_38":3738,"_40":506,"_42":3739,"_67":3740,"_69":3741,"_71":70},"acn7i31u",{},[],"Questions about the behaviour of anchors (are anchors actually processes, and what happens when an anchor is activated?) are not of interest in this context, as they are dealt with within the link service rather than within the application. For the purposes of this discussion we will follow Leggett & Schnase's (1994 ) distinction between an anchor (a hypertext object which describes one or other end of a link) and a persistent selection (that object within the node data which is the physical manifestation of the link anchor, such as a coloured text string).",{"_32":3743,"_34":3765},[3744,3751,3758],{"_32":3745,"_34":3746},[],{"_36":160,"_38":3747,"_40":506,"_42":3748,"_67":3749,"_69":3750,"_71":70},"Y4wXR8kM",{},[],"counting: e.g. \"the string at bytes 1023-1043 through the file\", \"the 8th line of the 12th paragraph\", \"the rectangle of dimensions (45,20) pixels at co-ordinates (1427,2393) in the bitmap\", etc.;",{"_32":3752,"_34":3753},[],{"_36":160,"_38":3754,"_40":506,"_42":3755,"_67":3756,"_69":3757,"_71":70},"JRKXjupW",{},[],"naming : e.g. \"the bookmark called 'MyBookmark' \", \"the spreadsheet cell range called 'Total' \", \"the drawing object named 'GasMain4' \", \"the section of a text named 'Conclusions' \", etc.; ",{"_32":3759,"_34":3760},[],{"_36":160,"_38":3761,"_40":506,"_42":3762,"_67":3763,"_69":3764,"_71":70},"LasDSYUA",{},[],"searching: e.g. \"the first occurrence in the file of the string 'Xanadu' \", \"the record in a database that results from this SQL query\", etc.",{"_36":160,"_38":3766,"_40":506,"_42":3767,"_67":3768,"_69":3769,"_71":70},"3GaW26Df",{"_273":274},[],"Probably the most generic description of the anchor is provided by Grønbæk & Trigg (1996) , in which an anchor is described as a binding between a component identifier and a location specifier (LocSpec). A LocSpec contains the details which describe a persistent selection, and the semantics of these details are decided by the application at the time that the anchor is created and resolved using the same algorithm when the anchor is loaded again at a later time. A similar generalisation of the nature of these details comes from the HyTime standard(DeRose & Durand, 1994) which allows that anchors might reference objects within the node using:",{"_32":3771,"_34":3772},[],{"_36":160,"_38":3773,"_40":506,"_42":3774,"_67":3775,"_69":3776,"_71":70},"bWtHuJoq",{},[],"HyTime also allows that references might be made of combinations of these methods, e.g. \"The first occurrence of the string 'Xanadu' in the 5th paragraph of the chapter named 'history' \".",{"_32":3778,"_34":3807},[3779,3786,3793,3800],{"_32":3780,"_34":3781},[],{"_36":160,"_38":3782,"_40":506,"_42":3783,"_67":3784,"_69":3785,"_71":70},"UP_oMmYE",{},[],"The application embeds the anchor in the node data. In this case the application may also embed all the link information at this point (e.g. URL's embedded in html as HREF's) or might allocate an ID to the anchor which is unique to this node, and which will specify to the link service the link or links in which the anchor participates, as in Hyper-G (Andrews et al., 1995 ).",{"_32":3787,"_34":3788},[],{"_36":160,"_38":3789,"_40":506,"_42":3790,"_67":3791,"_69":3792,"_71":70},"WW7m1U94",{},[],"The application allocates an ID for the anchor, which will be unique for that node, and takes responsibility for maintaining a table of IDs and LocSpecs belonging to the node. The link service can resolve an anchor by using the (node name, anchor ID) pair. This is the approach taken by most Dexter based systems such as DHM.",{"_32":3794,"_34":3795},[],{"_36":160,"_38":3796,"_40":506,"_42":3797,"_67":3798,"_69":3799,"_71":70},"R9kZHSif",{},[],"The application requests that the link service allocates an ID for the anchor, which will be unique over the entire link service. The application will still need to maintain a table of anchor IDs and LocSpecs at run time. This approach is taken by Multicard and the hyperbase class of systems.",{"_32":3801,"_34":3802},[],{"_36":160,"_38":3803,"_40":506,"_42":3804,"_67":3805,"_69":3806,"_71":70},"vwNpP6KS",{},[],"The application talks to the linkservice by transmitting the node identifier and LocSpec, and allocates no specific anchor ID at all. This is the approach taken by Microcosm.",{"_36":160,"_38":3808,"_40":506,"_42":3809,"_67":3810,"_69":3811,"_71":70},"r5GIxFzt",{"_273":2113},[],"Different systems allocate anchors in different ways. There are four principle methods:",{"_32":3813,"_34":3814},[],{"_36":160,"_38":3815,"_40":506,"_42":3816,"_67":3817,"_69":3818,"_71":70},"6imlPA9o",{},[],"In designing our protocol, we must produce a standard which allows existing and future hypermedia systems to participate, regardless of the method they use to represent anchors or LocSpecs or the way that they allocate and store anchors.",{"_32":3820,"_34":3821},[],{"_36":160,"_38":3822,"_40":506,"_42":3823,"_67":3824,"_69":3825,"_71":70},"7cmpD3_9",{},[],"So far, the discussion of anchors has assumed that all anchors will be represented by some persistent selection or button within the node data when the data is displayed. Hypertext links are invoked by clicking on the button. This traditional interface to hypermedia is well established, but has limitations that are discussed in Hall (1994) . An alternative interface to hypermedia is the \"selection and action\" metaphor which has been pioneered in Microcosm, which enables the user to make dynamic queries of the system, for example by selecting some text string and asking the system to compute links using some dynamic information retrieval algorithm. The protocols will need to support this form of hypertext interaction.",{"_36":870,"_38":3827,"_40":506,"_42":3828,"_67":3829,"_69":3830,"_71":70},"osWSojwU",{"_273":323},[],"3. Anchors",{"_36":870,"_38":3832,"_40":506,"_42":3833,"_67":3834,"_69":3835,"_71":70},"n1MdTW1q",{"_273":323},[],"2. The Protocol Shim",{"_32":3837,"_34":3881},[3838,3859,3866,3875],{"_32":3839,"_34":3854},[3840,3847],{"_32":3841,"_34":3842},[],{"_36":160,"_38":3843,"_40":506,"_42":3844,"_67":3845,"_69":3846,"_71":70},"igGYJBUf",{},[],"applications that have been enabled for one communication protocol will only be transferable to other systems if that other system has a shim using that protocol.",{"_32":3848,"_34":3849},[],{"_36":160,"_38":3850,"_40":506,"_42":3851,"_67":3852,"_69":3853,"_71":70},"m-jFqyfg",{},[],"it would be preferable to build shims that will allow clients on one machine architecture to communicate with link services on other architectures.",{"_36":160,"_38":3855,"_40":506,"_42":3856,"_67":3857,"_69":3858,"_71":70},"Rgd9zcsr",{"_273":274},[],"The question of the choice of communication protocol is interesting. The communication is clearly peer-to-peer in the sense that either the shim or the node viewer might initiate a message. We could agree that any suitable method could be used (e.g. DDE on Windows, AppleEvents on the Mac, RPC on Unix), but this approach has problems:",{"_32":3860,"_34":3861},[],{"_36":160,"_38":3862,"_40":506,"_42":3863,"_67":3864,"_69":3865,"_71":70},"0mKnCdin",{},[],"For these reasons it makes sense to separate the choice of communication protocol from the hypertext protocol, as shown in figure 2. In this configuration, the application developer produces a communication shim to run on the client side. This shim understands the application protocol (e.g. DDE) and converts it to whatever network protocol is required (e.g. sockets). As we shall see later, this shim needs to be more than just a communication protocol converter, and is required to have some hypertext functionality. The linkservice developer produces the protocol shim, which runs on the same platform as the linkservice, and accepts incoming messages in whatever network protocols are supported.",{"_32":3867,"_34":3868},[],{"_36":1875,"_38":3869,"_40":506,"_42":3870,"_67":3872,"_69":3873,"_71":3874},"ZNdCJPEv",{"_273":323,"_2135":3871},624.6575342465753,[],"Figure 2: Communication Protocol Conversion","ipfs://bafkreig5skrxskds2pd7ez3kdlzf3lgu4fljqtubp4nyfn5ehcnqutoj4u",{"_32":3876,"_34":3877},[],{"_36":160,"_38":3878,"_40":506,"_42":3879,"_67":3880,"_69":70,"_71":70},"ciz4GBsD",{},[],{"_36":870,"_38":3882,"_40":506,"_42":3883,"_67":3884,"_69":3885,"_71":70},"Gs23YdHO",{"_273":323},[],"4. Communication Protocols",{"_32":3887,"_34":4625},[3888,3966,4005,4031,4052,4093,4331,4471,4562],{"_32":3889,"_34":3961},[3890,3897,3905,3912,3933,3940,3947,3954],{"_32":3891,"_34":3892},[],{"_36":160,"_38":3893,"_40":506,"_42":3894,"_67":3895,"_69":3896,"_71":70},"MhFcdrdm",{},[],"The difficulty in defining a standard LocSpec is that if it is to be sufficiently flexible to meet all possible ways of expressing positions in a document as intended by the HyTime standard (see section 3 ) then it will be difficult to parse and thus put considerable onus on the application. Instead we suggest the following simplification, at least for the purpose of getting the standard started. We expect that it will evolve.",{"_32":3898,"_34":3899},[],{"_36":2026,"_38":3900,"_40":506,"_42":3901,"_67":3903,"_69":3904,"_71":70},"zJkRNj-o",{"_2029":3902},"xml",[],"LocSpec ::=\n\n{\\ContentType MimeType\n\\Content Mime encoded text string\n\\Count [Comma separated list of numbers]\n\\ReverseCount [Comma separated list of numbers]\n\\Name [Mime encoded text string]\n\\Script [Viewer Executable Script] }\n ",{"_32":3906,"_34":3907},[],{"_36":160,"_38":3908,"_40":506,"_42":3909,"_67":3910,"_69":3911,"_71":70},"Ms5IYXrX",{},[],"The important thing to realise about the LocSpec is that although the link service may be required to store this information, it is not usually required to interpret the information in any way. The semantics of the various fields within the LocSpec are decided by the viewer at the time that it creates the LocSpec, and then stored in the linkservice for later retrieval and interpretation by the same viewer. Thus different viewers are not required to keep to any particular convention for representing these fields.",{"_32":3913,"_34":3928},[3914,3921],{"_32":3915,"_34":3916},[],{"_36":160,"_38":3917,"_40":506,"_42":3918,"_67":3919,"_69":3920,"_71":70},"m67jubb7",{},[],"some link services may attempt to search their databases for anchors that have particular attributes;",{"_32":3922,"_34":3923},[],{"_36":160,"_38":3924,"_40":506,"_42":3925,"_67":3926,"_69":3927,"_71":70},"hm-SmDx3",{},[],"extra information is generally useful if it becomes necessary to mend the position of the anchor after a document has been edited by an editor that was not linkservice aware.",{"_36":160,"_38":3929,"_40":506,"_42":3930,"_67":3931,"_69":3932,"_71":70},"2yOxsHZD",{"_273":274},[],"The one exception to the above rule is the content. Some hypermedia systems store the content of the anchors within the linkservice, and use this information as the basis for providing services. For example, Microcosm searches its linkbases for links authored on particular content in order to provide generic links. For this reason, this part of the LocSpec is not optional. The protocol requires that the LocSpec contains at least one method for the viewer to store information about the position of an anchor. However, it is strongly recommended that application developers try to fill as many of these fields as possible. The reasons for this recommendation are that:",{"_32":3934,"_34":3935},[],{"_36":160,"_38":3936,"_40":506,"_42":3937,"_67":3938,"_69":3939,"_71":70},"U_6kbSEW",{},[],"The comma separated list of numbers used in the count and reverse count will depend on the method used by the viewer to represent positions in documents, e.g. 3, 2, 5, 423 might be used by a structured document to mean the 423rd character in the 5th paragraph of section 3.2. Alternatively it might represent the top left and bottom right co-ordinates of a rectangle in a bitmap.",{"_32":3941,"_34":3942},[],{"_36":160,"_38":3943,"_40":506,"_42":3944,"_67":3945,"_69":3946,"_71":70},"GHq3B9z3",{},[],"The reverse offset allows us to represent a position by counting from the end of a document. This overloading can be useful when trying to fix LocSpecs that have become broken due to document editing.",{"_32":3948,"_34":3949},[],{"_36":160,"_38":3950,"_40":506,"_42":3951,"_67":3952,"_69":3953,"_71":70},"xLkOk4gF",{},[],"The name may be any object understood by the viewer which is unique to the current document, such as a bookmark name or a drawing object.",{"_32":3955,"_34":3956},[],{"_36":160,"_38":3957,"_40":506,"_42":3958,"_67":3959,"_69":3960,"_71":70},"XtIptj86",{},[],"The script is a set of instructions which may be interpreted by the application which will enable the application to locate the object.",{"_36":870,"_38":3962,"_40":506,"_42":3963,"_67":3964,"_69":3965,"_71":70},"mOnD-Xu5",{"_273":323},[],"5.1. LocSpecs",{"_32":3967,"_34":4000},[3968,3974,3980,3986,3993],{"_32":3969,"_34":3970},[],{"_36":160,"_38":3971,"_40":506,"_42":3972,"_67":3973,"_69":3075,"_71":70},"KmtbRkMQ",{},[],{"_32":3975,"_34":3976},[],{"_36":160,"_38":3977,"_40":506,"_42":3978,"_67":3979,"_69":3082,"_71":70},"JvMRUab6",{},[],{"_32":3981,"_34":3982},[],{"_36":160,"_38":3983,"_40":506,"_42":3984,"_67":3985,"_69":3089,"_71":70},"0NLnE6Wy",{},[],{"_32":3987,"_34":3988},[],{"_36":160,"_38":3989,"_40":506,"_42":3990,"_67":3991,"_69":3992,"_71":70},"o-PSQogi",{},[],"For the purpose of this version of the protocol we suggest that the information about presentation is kept viewer specific. i.e. the viewer may ask to store any presentation information in any form that it chooses, and the viewer will interpret this data at a later stage when asked to present the data again.",{"_32":3994,"_34":3995},[],{"_36":160,"_38":3996,"_40":506,"_42":3997,"_67":3998,"_69":3999,"_71":70},"Qk5A7YuX",{},[],"The consequence of this policy will be that link services will not be able to communicate to the viewer that it should change any presentation (e.g. as the result of a script) since it will not know the syntax of the presentation tag for this particular viewer. Later versions of the protocol should standardise the form of this information, e.g. by defining the data as {colour, style, visibility} and giving a set of values and meanings to each of these parameters.",{"_36":870,"_38":4001,"_40":506,"_42":4002,"_67":4003,"_69":4004,"_71":70},"TKS_BzEx",{"_273":323},[],"5.2. Presentation Specifics",{"_32":4006,"_34":4026},[4007],{"_32":4008,"_34":4022},[4009,4015],{"_32":4010,"_34":4011},[],{"_36":160,"_38":4012,"_40":506,"_42":4013,"_67":4014,"_69":2712,"_71":70},"3HJpfcxs",{},[],{"_32":4016,"_34":4017},[],{"_36":160,"_38":4018,"_40":506,"_42":4019,"_67":4020,"_69":4021,"_71":70},"jTCmKGlg",{},[],"Client End Scripts. These are scripts that are sent to the viewer by the linkserver. In general they are either sent as part of a LocSpec in order to identify an anchor, or they are sent as a process which the viewer will be expected to run, for example in order to change the presentation of the data in some way. OHP must provide support for such scripts if the viewer wishes to use them. ",{"_36":160,"_38":4023,"_40":506,"_42":4024,"_67":4025,"_69":2724,"_71":70},"8RAgD94T",{"_273":323},[],{"_36":870,"_38":4027,"_40":506,"_42":4028,"_67":4029,"_69":4030,"_71":70},"_uYKnJWf",{"_273":323},[],"5.3. Scripts",{"_32":4032,"_34":4047},[4033,4040],{"_32":4034,"_34":4035},[],{"_36":160,"_38":4036,"_40":506,"_42":4037,"_67":4038,"_69":4039,"_71":70},"MuNu-AVQ",{},[],"It is quite possible that one communication shim may need to maintain communication with more than one application on a client machine, and also quite possible that one application might be concurrently displaying more than one node (e.g. an MDI application in Windows). Similarly, one link server (and protocol shim) may need to maintain communication with more than one client. For this reason it is necessary that messages contain routing information, so that messages sent by the link service are sent to the correct node in the correct application on the correct machine. However, from the point of view of the application developer, it is not necessary to know anything about the content of the routing information. The link service will provide the information to the application, and the application will be responsible for returning this information every time it sends a message to the link service, so that the link service can identify where to reply. This information is known in the protocol as the Channel .",{"_32":4041,"_34":4042},[],{"_36":160,"_38":4043,"_40":506,"_42":4044,"_67":4045,"_69":4046,"_71":70},"55XUfsbA",{},[],"Since the linkservice will maintain a unique channel to each document that is currently connected, it will not be necessary for most of the messages to pass the document name, as this is implicit in the channel. However, there would be nothing to prevent the linkservice explicitly using the document name as part of the channel information.",{"_36":870,"_38":4048,"_40":506,"_42":4049,"_67":4050,"_69":4051,"_71":70},"p8tpaWdv",{"_273":323},[],"5.4. Communication Channels",{"_32":4053,"_34":4088},[4054,4061,4068,4075,4082],{"_32":4055,"_34":4056},[],{"_36":160,"_38":4057,"_40":506,"_42":4058,"_67":4059,"_69":4060,"_71":70},"WcUI1pko",{},[],"OHP is a peer to peer asynchronous protocol. Messages may be sent by either the link service or by the editor / viewer, and no message waits for any form of reply. If a reply is expected, it is up to the receiving component to initiate a new message. There are thus two classes of message to be considered; those sent by the viewer and those sent by the link service.",{"_32":4062,"_34":4063},[],{"_36":160,"_38":4064,"_40":506,"_42":4065,"_67":4066,"_69":4067,"_71":70},"EV57sWC3",{},[],"Messages that the viewer may send will depend largely on the set of services that can be handled by the link server. It therefore makes sense that part of the protocol will allow the definition of the subjects which the link server can handle. These subjects do not need to be known in advance.",{"_32":4069,"_34":4070},[],{"_36":160,"_38":4071,"_40":506,"_42":4072,"_67":4073,"_69":4074,"_71":70},"fSKK4DWB",{},[],"On the other hand, the messages which the link server may send to the viewer must be defined in advance, since the viewer must be coded to deal with these messages.",{"_32":4076,"_34":4077},[],{"_36":160,"_38":4078,"_40":506,"_42":4079,"_67":4080,"_69":4081,"_71":70},"Zz7RObr4",{},[],"OHP messages will consist of text strings. In the following sections the messages are shown formatted on multiple lines for ease of presentation. However, the messages themselves will be one continuous stream of ASCII text, unbroken by line breaks. The messages consist of Tags, which are proceeded by a backslash ('') and succeeded by a space. The characters that follow, up to the next tag or the end of the message are the tag contents. A tag content may be empty if shown as optional in the message definition. The tags of each message are all compulsory, and must be presented in the order in the message definition. If a backslash ('') or closing curly bracket ('{' or '}') occurs within the tag content, then it should be quoted by preceding it with a further backslash. The bold '+ ' is used in the following descriptions to indicate that one or more of the line indicated may be included at this point.",{"_32":4083,"_34":4084},[],{"_36":160,"_38":4085,"_40":506,"_42":4086,"_67":4087,"_69":1994,"_71":70},"SSq8FTJ_",{},[],{"_36":870,"_38":4089,"_40":506,"_42":4090,"_67":4091,"_69":4092,"_71":70},"XRGeIQRc",{"_273":323},[],"5.5. Form of the Protocol",{"_32":4094,"_34":4326},[4095,4130,4179,4200,4242],{"_32":4096,"_34":4125},[4097,4104,4111,4118],{"_32":4098,"_34":4099},[],{"_36":2026,"_38":4100,"_40":506,"_42":4101,"_67":4102,"_69":4103,"_71":70},"06SjGCJM",{"_2029":70},[],"\n\\Subject HeresServices\n\\Data {\\Menuitem Menuitem \\Service Service } +\n\\Channel Channel\n",{"_32":4105,"_34":4106},[],{"_36":160,"_38":4107,"_40":506,"_42":4108,"_67":4109,"_69":4110,"_71":70},"W-ygxpZU",{},[],"Which will define the menu that will be placed on the viewer, and the set of services that will be requested from the link service when such items are selected from the menu.",{"_32":4112,"_34":4113},[],{"_36":160,"_38":4114,"_40":506,"_42":4115,"_67":4116,"_69":4117,"_71":70},"aNZXyDz6",{},[],"For example, a Microcosm link server would typically send the following: ",{"_32":4119,"_34":4120},[],{"_36":2026,"_38":4121,"_40":506,"_42":4122,"_67":4123,"_69":4124,"_71":70},"h9oZNk0z",{"_2029":70},[],"\\Subject HeresServices\n\\Data {\\Menuitem Follow Link\\Service FOLLOW.LINK}\n\\Data {\\Menuitem Show Links\\Service SHOW.LINKS}\n\\Data {\\Menuitem Compute Links\\Service COMPUTE.LINKS} \\Data {\\Menuitem Make Start Anchor\\Service START.LINK} \\Data {\\Menuitem Make End Anchor\\Service END.LINK} \\Channel #9",{"_36":870,"_38":4126,"_40":506,"_42":4127,"_67":4128,"_69":4129,"_71":70},"KHiKyeZ6",{"_273":323},[],"5.6.1. HeresServices",{"_32":4131,"_34":4174},[4132,4139,4146,4153,4160,4167],{"_32":4133,"_34":4134},[],{"_36":2026,"_38":4135,"_40":506,"_42":4136,"_67":4137,"_69":4138,"_71":70},"7zZN_fhH",{"_2029":70},[],"\n\\Subject LaunchDocument\n\\DocumentName DocName\n\\ReadOnly True/False\n\\DocumentNickName [DocNickName]\n\\DocumentType MimeType\n\\DataCallBack True or False \n\\Channel Channel\n",{"_32":4140,"_34":4141},[],{"_36":160,"_38":4142,"_40":506,"_42":4143,"_67":4144,"_69":4145,"_71":70},"qHmj4ee6",{},[],"This message introduces a special problem. At the time that it is sent there may be no viewer open to receive the message! The linkserver has requested that a particular document of a particular type is opened, but at present the viewer for this data type is not running. It is necessary that there is some component at the client end to receive this message that can arrange to fire up the appropriate viewer. We suggest that this functionality should be added to the communication protocol shim, which is anyway at the client end. The shim will need to know which viewer to load, depending upon the mime type of the data. The viewer, when it has been launched will receive this message will be responsible for storing the channel information and using it whenever sending messages back to the linkservice.",{"_32":4147,"_34":4148},[],{"_36":160,"_38":4149,"_40":506,"_42":4150,"_67":4151,"_69":4152,"_71":70},"retaYn4-",{},[],"A further problem is introduced by the fact that some systems would expect the client viewer to now arrange to fetch its own data (using the document name to describe a file on the file system or a remote server) whereas other systems might expect that the data will be held within the linkservice (hyperbase). The DataCallback tag, allows the linkservice to indicate that it wishes the viewer to send a message back asking for the data, and if such a call-back occurs it will answer with a HeresDocument message. If the call-back is false the linkservice will expect the viewer to arrange to load its own data.",{"_32":4154,"_34":4155},[],{"_36":160,"_38":4156,"_40":506,"_42":4157,"_67":4158,"_69":4159,"_71":70},"W-6FQEY5",{},[],"It is also a useful point to introduce the idea of levels of the protocol. Many linkservices allow third party applications to participate in the hypertext, in so far as they may be launched and run with given node data, and they may be closed. This is the functionality that is supported by OHP Level 0. In this case the will be expected to handle messages to open the node (LaunchDocument) and close the node (CloseNode). The application itself is not expected to deliver and hypermedia functionality. All other messages in this document are part of the Level 1 Protocol. Level 2 of the protocol is not yet defined, but is discussed in the section 8. The client end communication shim is responsible for knowing the level of the applications it launches so that it does not attempt to send messages to non-communicating applications, but instead returns error messages. In this respect the shim acts as a proxy for the application. ",{"_32":4161,"_34":4162},[],{"_36":160,"_38":4163,"_40":506,"_42":4164,"_67":4165,"_69":4166,"_71":70},"spYDV0Y7",{},[],"The ReadOnly Tag enables the link service to inform the viewer that it should not allow the user to edit the node contents.",{"_32":4168,"_34":4169},[],{"_36":160,"_38":4170,"_40":506,"_42":4171,"_67":4172,"_69":4173,"_71":70},"v50biUWJ",{},[],"The DocumentNickName allows for the case where the linkservice may supply better descriptions of the document than the filename alone, and the viewer may elect to display this name somewhere, typically in the title bar.",{"_36":870,"_38":4175,"_40":506,"_42":4176,"_67":4177,"_69":4178,"_71":70},"zncBOWBp",{"_273":323},[],"5.6.2. LaunchDocument",{"_32":4180,"_34":4195},[4181,4188],{"_32":4182,"_34":4183},[],{"_36":160,"_38":4184,"_40":506,"_42":4185,"_67":4186,"_69":4187,"_71":70},"ZkircEXT",{},[],"This message is sent by the linkservice if it has received a call-back asking the linkservice to supply the document data.",{"_32":4189,"_34":4190},[],{"_36":2026,"_38":4191,"_40":506,"_42":4192,"_67":4193,"_69":4194,"_71":70},"z142Hszk",{"_2029":70},[],"\\Subject HeresDocument\n\\Data Mime Encoded Data\n\\Channel Channel ",{"_36":870,"_38":4196,"_40":506,"_42":4197,"_67":4198,"_69":4199,"_71":70},"XGl5aFjv",{"_273":323},[],"5.6.3. HeresDocument",{"_32":4201,"_34":4237},[4202,4209,4216,4223,4230],{"_32":4203,"_34":4204},[],{"_36":160,"_38":4205,"_40":506,"_42":4206,"_67":4207,"_69":4208,"_71":70},"J_8sYEBl",{},[],"After a document is launched the viewer may request the anchor table. This linkservice will reply with this message.",{"_32":4210,"_34":4211},[],{"_36":2026,"_38":4212,"_40":506,"_42":4213,"_67":4214,"_69":4215,"_71":70},"2tLbu5RZ",{"_2029":70},[],"\\Subject HeresAnchorTable\n\\Data {\\AnchorID AnchorID\n \\LocSpec LocSpec\n \\Direction Start/End/Bidirect\n \\Presentation colour,style,display\n \\Service Service } +\n\\Channel Channel",{"_32":4217,"_34":4218},[],{"_36":160,"_38":4219,"_40":506,"_42":4220,"_67":4221,"_69":4222,"_71":70},"STECK3k8",{},[],"An anchor record is thus seen to consist of an unique identifier, a LocSpec, a direction and a service.",{"_32":4224,"_34":4225},[],{"_36":160,"_38":4226,"_40":506,"_42":4227,"_67":4228,"_69":4229,"_71":70},"siF0U7xs",{},[],"The direction field allows the linkservice to specify whether the given anchor is the start of a link, the end of alink, or one end of a bi-directional link.",{"_32":4231,"_34":4232},[],{"_36":160,"_38":4233,"_40":506,"_42":4234,"_67":4235,"_69":4236,"_71":70},"W7AlcnQY",{},[],"The service field allows for the case that not all hypertext buttons will require a Follow Link type of service. Sometimes a anchor may be created that causes some other service (e.g. dynamically generate links) to be requested.",{"_36":870,"_38":4238,"_40":506,"_42":4239,"_67":4240,"_69":4241,"_71":70},"ADD9M4xt",{"_273":323},[],"5.6.4. HeresAnchorTable",{"_32":4243,"_34":4321},[4244,4251,4265,4279,4293,4307],{"_32":4245,"_34":4246},[],{"_36":160,"_38":4247,"_40":506,"_42":4248,"_67":4249,"_69":4250,"_71":70},"_du9I3d2",{},[],"When a document is launched, or possibly at some other time, it will often be necessary to send a message requesting that a particular anchor is displayed, e.g. by moving the cursor to the anchor, or highlighting the anchor. This message is sent to the viewer to request such an action. \\Subject DisplayAnchor \\AnchorID AnchorID \\Presentation colour,style,display \\Channel Channel",{"_32":4252,"_34":4260},[4253],{"_32":4254,"_34":4255},[],{"_36":160,"_38":4256,"_40":506,"_42":4257,"_67":4258,"_69":4259,"_71":70},"JJ7BgY6e",{},[],"Sometimes it is necessary to display something other than a pre-defined anchor, for example, the result of a search. This message may define the object to be viewed. \\Subject DisplayLocSpec \\LocSpec LocSpec \\Presentation colour,style,display \\Channel Channel",{"_36":870,"_38":4261,"_40":506,"_42":4262,"_67":4263,"_69":4264,"_71":70},"3py1gF1X",{"_273":323},[],"5.6.6. DisplayLocSpec",{"_32":4266,"_34":4274},[4267],{"_32":4268,"_34":4269},[],{"_36":160,"_38":4270,"_40":506,"_42":4271,"_67":4272,"_69":4273,"_71":70},"Gi7hsa8x",{},[],"The protocol requires that the viewer is not responsible for allocating anchor ID's. Instead a message will be sent to the linkservice asking for an anchor ID, and the linkservice will reply: \\Subject HeresNewAnchor \\Data {\\AnchorID AnchorID \\LocSpec LocSpec \\Direction Start/End/Bidirect \\Presentation colour,style,display \\Service Service } \\Channel Channel ",{"_36":870,"_38":4275,"_40":506,"_42":4276,"_67":4277,"_69":4278,"_71":70},"C_IAGFpR",{"_273":323},[],"5.6.7. HeresNewAnchor",{"_32":4280,"_34":4288},[4281],{"_32":4282,"_34":4283},[],{"_36":160,"_38":4284,"_40":506,"_42":4285,"_67":4286,"_69":4287,"_71":70},"i1xY2JMn",{},[],"This message allows the link service to send scripts to the application which the application will interpret. Such scripts might alter the presentation of a node, change the contents of a node or anything else that the interpreter contained in the application is capable of undertaking. \\Subject Interpret \\ScriptType ScriptingLanguage \\Data { Script } \\Channel Channel The ScriptType tag will define the interpreter that will be required by the application that receives the following script. In the simplest case an application might interpret keystrokes that could be played to the application. At the other end of the scale, the application might implement a Java interpreter. The protocol may need extra messages to allow the linkservice to query the application to discover the scripting language(s) that it can handle. In its current form the linkservice must either know what languages can be handled, or must accept that the script may be ignored. ",{"_36":870,"_38":4289,"_40":506,"_42":4290,"_67":4291,"_69":4292,"_71":70},"PMhSUQtn",{"_273":323},[],"5.6.8. Interpret",{"_32":4294,"_34":4302},[4295],{"_32":4296,"_34":4297},[],{"_36":160,"_38":4298,"_40":506,"_42":4299,"_67":4300,"_69":4301,"_71":70},"c64sTS85",{},[],"This message is sent by the linkservice to an application when it has requested a new connection to the linkservice (see CreateNode below). \\Subject HeresNewChannel \\SendDocument True / False \\DocumentNickName [DocNickName] \\Channel Channel The SendDocument Tag is used by the linkservice to request that the viewer follows up by actually sending the contents of the node, as is required by many of the hyperbase variety of linkservices. If the linkservice already knows of the document, and has a nickname for the document, it will return this.",{"_36":870,"_38":4303,"_40":506,"_42":4304,"_67":4305,"_69":4306,"_71":70},"L0Ef6hTs",{"_273":323},[],"5.6.9. HeresNewChannel",{"_32":4308,"_34":4316},[4309],{"_32":4310,"_34":4311},[],{"_36":160,"_38":4312,"_40":496,"_42":4313,"_67":4314,"_69":4315,"_71":70},"m0NLDUeZ",{},[],"This message is sent by the link service to a node that it wishes to automatically close. \\Subject CloseNode \\UpdateNode True / False \\Channel Channel The application is then responsible for closing itself, ensuring that it has updated any anchors and its contents if required by the UpdateNode tag. ",{"_36":870,"_38":4317,"_40":496,"_42":4318,"_67":4319,"_69":4320,"_71":70},"ZnAgugjk",{"_273":323},[],"5.6.10. CloseNode",{"_36":870,"_38":4322,"_40":506,"_42":4323,"_67":4324,"_69":4325,"_71":70},"zfqdoPlR",{"_273":323},[],"5.6.5. DisplayAnchor",{"_36":870,"_38":4327,"_40":506,"_42":4328,"_67":4329,"_69":4330,"_71":70},"Ry4wX0yo",{"_273":323},[],"5.6. Messages that the linkserver may send",{"_32":4332,"_34":4466},[4333,4347,4361,4375,4410,4424,4438,4452],{"_32":4334,"_34":4342},[4335],{"_32":4336,"_34":4337},[],{"_36":160,"_38":4338,"_40":496,"_42":4339,"_67":4340,"_69":4341,"_71":70},"R0XJIehS",{},[],"This message allows the viewer to ask the linkservice to send it the contents of a node. This is only required where the linkservice actually stores the node data, and would typically be sent in response to a LaunchDocument message which had the DataCallBack flag set. The linkservice will respond with a HeresDocument message. \\Subject GetNode \\DocumentName DocName \\Channel Channel The DocumentName is redundant when calling back for a node, as the linkservice already knows this. However, this message might also be sent to request a new document.",{"_36":870,"_38":4343,"_40":496,"_42":4344,"_67":4345,"_69":4346,"_71":70},"109al9Yi",{"_273":323},[],"5.7.1. GetNode",{"_32":4348,"_34":4356},[4349],{"_32":4350,"_34":4351},[],{"_36":160,"_38":4352,"_40":496,"_42":4353,"_67":4354,"_69":4355,"_71":70},"LfEHRIJD",{},[],"When a viewer has loaded up, it will be necessary for it to ask the linkservice to itemise the set of services it may provide on a menu. \\Subject GetServices \\Channel Channel The linkservice should respond with a HeresServices message.",{"_36":870,"_38":4357,"_40":496,"_42":4358,"_67":4359,"_69":4360,"_71":70},"IEkVfLhi",{"_273":323},[],"5.7.2. GetServices",{"_32":4362,"_34":4370},[4363],{"_32":4364,"_34":4365},[],{"_36":160,"_38":4366,"_40":496,"_42":4367,"_67":4368,"_69":4369,"_71":70},"QpHc6Bpd",{},[],"The viewer, while running is expected to maintain the anchor table. It is expected to obtain the anchors from the linkservice by sending the message: \\Subject GetAnchorTable \\Channel Channel and the linkservice is expected to respond with a HeresAnchorTable message.",{"_36":870,"_38":4371,"_40":496,"_42":4372,"_67":4373,"_69":4374,"_71":70},"CfeiF5fa",{"_273":323},[],"5.7.3. GetAnchorTable",{"_32":4376,"_34":4405},[4377,4384,4391,4398],{"_32":4378,"_34":4379},[],{"_36":160,"_38":4380,"_40":496,"_42":4381,"_67":4382,"_69":4383,"_71":70},"SbJ5qg_C",{},[],"Most of the hypertext functionality will be obtained by either clicking on buttons or sensitive areas (which are representations of anchors) or making a selection and requesting an action from the menu, or simply choosing an action from the menu. In the case where a button is clicked, the viewer will know the service that is required from the anchor table. In the case where an action is chosen from the menu, this will define the required service. Messages requesting services will take the form: \\Subject RequestService \\Service Service",{"_32":4385,"_34":4386},[],{"_36":160,"_38":4387,"_40":496,"_42":4388,"_67":4389,"_69":4390,"_71":70},"PUafF6qE",{},[],"\\AnchorID [ AnchorID ] \\LocSpec [ LocSpec ] \\Presentation [ colour,style,display ] \\Channel Channel",{"_32":4392,"_34":4393},[],{"_36":160,"_38":4394,"_40":496,"_42":4395,"_67":4396,"_69":4397,"_71":70},"MF3ro--L",{},[],"The anchor ID will be empty in many of these messages, for example, when requesting that an anchor is created on a given LocSpec.",{"_32":4399,"_34":4400},[],{"_36":160,"_38":4401,"_40":496,"_42":4402,"_67":4403,"_69":4404,"_71":70},"lFITSbAY",{},[],"The LocSpec may be empty, for example in the case where a simple action has been chosen from a menu.",{"_36":870,"_38":4406,"_40":496,"_42":4407,"_67":4408,"_69":4409,"_71":70},"mxmgzq70",{"_273":323},[],"5.7.4. RequestService",{"_32":4411,"_34":4419},[4412],{"_32":4413,"_34":4414},[],{"_36":160,"_38":4415,"_40":496,"_42":4416,"_67":4417,"_69":4418,"_71":70},"eUpPCyQh",{},[],"When a document has been edited the viewer is responsible for ensuring that the LocSpecs in the anchor table are changed. Consequently it will be necessary to communicate these changes to the link service. \\Subject UpdateAnchors \\Data {\\AnchorID AnchorID \\LocSpec LocSpec \\Direction Start/End/Bidirect \\Presentation colour,style,display \\Service Service }+ \\Channel Channel",{"_36":870,"_38":4420,"_40":496,"_42":4421,"_67":4422,"_69":4423,"_71":70},"QEz5yhZF",{"_273":323},[],"5.7.5. Update Anchors",{"_32":4425,"_34":4433},[4426],{"_32":4427,"_34":4428},[],{"_36":160,"_38":4429,"_40":496,"_42":4430,"_67":4431,"_69":4432,"_71":70},"KT6szgsm",{},[],"A user may wish to register a new document that they are currently viewing with the link service. In this case there will not yet be an established channel between the document and the linkserver. The viewer/editor will send the following message. \\Subject CreateNode \\DocumentName DocName \\DocumentType MimeType When the linkservice gets the message, it will send a HeresNewChannel message back (see above), and if necessary (SendDocument = True) the viewer will then arrange to send the actual contents of the document using the UpdateNode message. Note that it is quite possible that the document concerned may already be registered with the link service: in this case this message serves only to open a communication channel to the linkserver. Also note that the message contains no information about document ownership or permissions: it is assumed that the linkservice, on receiving this message, will enter into a dialogue with the user to obtain such information.",{"_36":870,"_38":4434,"_40":496,"_42":4435,"_67":4436,"_69":4437,"_71":70},"oc4YU3xK",{"_273":323},[],"5.7.6. CreateNode",{"_32":4439,"_34":4447},[4440],{"_32":4441,"_34":4442},[],{"_36":160,"_38":4443,"_40":496,"_42":4444,"_67":4445,"_69":4446,"_71":70},"9mTY-WID",{},[],"If the contents of a node have changed during a session (or if it is a new node) it may be necessary to send the contents back to the linkservice, if the linkservice is of the type that stores the actual contents. \\Subject UpdateNode \\DocumentType MimeType \\Data Mime Encoded Data \\Channel Channel",{"_36":870,"_38":4448,"_40":496,"_42":4449,"_67":4450,"_69":4451,"_71":70},"f49YqRdm",{"_273":323},[],"5.7.7. UpdateNode",{"_32":4453,"_34":4461},[4454],{"_32":4455,"_34":4456},[],{"_36":160,"_38":4457,"_40":506,"_42":4458,"_67":4459,"_69":4460,"_71":70},"-O36dxnz",{},[],"This message is sent when a node is closed by the user. \\Subject Closing \\Channel Channel This will close the channel which may now be re-assigned.",{"_36":870,"_38":4462,"_40":496,"_42":4463,"_67":4464,"_69":4465,"_71":70},"ZR7THb4A",{"_273":323},[],"5.7.8. Closing",{"_36":870,"_38":4467,"_40":496,"_42":4468,"_67":4469,"_69":4470,"_71":70},"slM-4RfY",{"_273":323},[],"5.7. Messages that the Editor/Viewer May Send",{"_32":4472,"_34":4557},[4473,4529],{"_32":4474,"_34":4524},[4475,4482,4489,4496,4503,4510,4517],{"_32":4476,"_34":4477},[],{"_36":160,"_38":4478,"_40":496,"_42":4479,"_67":4480,"_69":4481,"_71":70},"TZ-Fdqgf",{},[],"We are very much aware that at times such protocols are insufficient for the needs of a particular problem. We therefore suggest that for experimental purposes, the following extensions to the protocol are allowed. Any message may include a tag ",{"_32":4483,"_34":4484},[],{"_36":2026,"_38":4485,"_40":496,"_42":4486,"_67":4487,"_69":4488,"_71":70},"nHuWa1ah",{"_2029":70},[],"\\Other Data",{"_32":4490,"_34":4491},[],{"_36":160,"_38":4492,"_40":496,"_42":4493,"_67":4494,"_69":4495,"_71":70},"ZAf3PK8q",{},[],"where the data may be anything that the application and the link service wish to include.",{"_32":4497,"_34":4498},[],{"_36":160,"_38":4499,"_40":496,"_42":4500,"_67":4501,"_69":4502,"_71":70},"XE7JSWaQ",{},[],"Furthermore, either the application or the linkservice may send a message",{"_32":4504,"_34":4505},[],{"_36":2026,"_38":4506,"_40":496,"_42":4507,"_67":4508,"_69":4509,"_71":70},"hUy5oW_M",{"_2029":70},[],"\\Subject Other\n\\UserDefinedTag User Defined Data +\n\\Channel Channel ",{"_32":4511,"_34":4512},[],{"_36":160,"_38":4513,"_40":496,"_42":4514,"_67":4515,"_69":4516,"_71":70},"X14zbR92",{},[],"so that they can create their own messages with their own data.",{"_32":4518,"_34":4519},[],{"_36":160,"_38":4520,"_40":496,"_42":4521,"_67":4522,"_69":4523,"_71":70},"0lVeG9WT",{},[],"Application developers are strongly encouraged to attempt to make the interpretation of these tags and messages optional at the client end, or the applications that they hypertext enable will not be transferable to other systems.",{"_36":870,"_38":4525,"_40":496,"_42":4526,"_67":4527,"_69":4528,"_71":70},"a2hd35XQ",{"_273":323},[],"5.8.1. Other",{"_32":4530,"_34":4552},[4531,4538,4545],{"_32":4532,"_34":4533},[],{"_36":160,"_38":4534,"_40":496,"_42":4535,"_67":4536,"_69":4537,"_71":70},"swum4kTT",{},[],"There may be times when a message is sent by one component that the other component does not understand or is for some reason unable to service. In these cases it may be important that the sending component is informed of the error. Either the linkservice or the editor should send an error message when it receives a message that it is unable to process.",{"_32":4539,"_34":4540},[],{"_36":2026,"_38":4541,"_40":496,"_42":4542,"_67":4543,"_69":4544,"_71":70},"IJ9GcM8N",{"_2029":70},[],"\\Subject Error \\ErrorSubject Subject tag of error message \\ErrorMessage Message \\Channel Channel",{"_32":4546,"_34":4547},[],{"_36":160,"_38":4548,"_40":496,"_42":4549,"_67":4550,"_69":4551,"_71":70},"6p38daOt",{},[],"The Error Message might be used to display in a message box to the user.",{"_36":870,"_38":4553,"_40":496,"_42":4554,"_67":4555,"_69":4556,"_71":70},"amCsHCFG",{"_273":323},[],"5.8.2. Error",{"_36":870,"_38":4558,"_40":496,"_42":4559,"_67":4560,"_69":4561,"_71":70},"NVG2D3uZ",{"_273":323},[],"5.8. Messages that both may send",{"_32":4563,"_34":4620},[4564],{"_32":4565,"_34":4615},[4566,4573,4580,4587,4594,4601,4608],{"_32":4567,"_34":4568},[],{"_36":160,"_38":4569,"_40":496,"_42":4570,"_67":4571,"_69":4572,"_71":70},"79VGxIaD",{},[],"Linkservice Requests: messages that the linkserver sends to the client asking for some action.",{"_32":4574,"_34":4575},[],{"_36":160,"_38":4576,"_40":496,"_42":4577,"_67":4578,"_69":4579,"_71":70},"pHKLkNIw",{},[],"Linkservice Replies: messages that the linkserver sends in response to all client requests.",{"_32":4581,"_34":4582},[],{"_36":160,"_38":4583,"_40":496,"_42":4584,"_67":4585,"_69":4586,"_71":70},"FabYs-W1",{},[],"Client Initialisation Requests: Messages that the client sends, typically at start-up, in order to initialise itself with the necessary linkservice information.",{"_32":4588,"_34":4589},[],{"_36":160,"_38":4590,"_40":496,"_42":4591,"_67":4592,"_69":4593,"_71":70},"7dW8M3uN",{},[],"Client Update Requests: Messages that the client sends to the linkserver to inform the linkserver of changes to the linkservice information that have occurred at the client end.",{"_32":4595,"_34":4596},[],{"_36":160,"_38":4597,"_40":496,"_42":4598,"_67":4599,"_69":4600,"_71":70},"C0YNtjVy",{},[],"Client Event Requests: Messages that are sent when a sensitive area is clicked on, or a choice has been made from a link service supplied menu. ",{"_32":4602,"_34":4603},[],{"_36":160,"_38":4604,"_40":496,"_42":4605,"_67":4606,"_69":4607,"_71":70},"zpAVANjY",{},[],"Client Replies: Messages that are sent by the client in response to requests from the linkservice.",{"_32":4609,"_34":4610},[],{"_36":160,"_38":4611,"_40":496,"_42":4612,"_67":4613,"_69":4614,"_71":70},"TYKLt_dz",{},[],"Bi-directional Messages: Messages that may be sent either way.",{"_36":160,"_38":4616,"_40":496,"_42":4617,"_67":4618,"_69":4619,"_71":70},"42ATSr4a",{"_273":274},[],"Now that we have introduced the entire protocol, it may be convenient to classify the types of messages. Appendix A classifies all messages using this scheme:",{"_36":870,"_38":4621,"_40":496,"_42":4622,"_67":4623,"_69":4624,"_71":70},"zcQHckiX",{"_273":323},[],"5.9. Protocol Summary",{"_36":870,"_38":4626,"_40":506,"_42":4627,"_67":4628,"_69":4629,"_71":70},"O8ktMcxS",{"_273":323},[],"5. Defining the OHP Protocol",{"_32":4631,"_34":4962},[4632,4639,4758,4877,4913,4941],{"_32":4633,"_34":4634},[],{"_36":160,"_38":4635,"_40":496,"_42":4636,"_67":4637,"_69":4638,"_71":70},"hop3SI-1",{},[],"In this section we consider, by reference to some different types of hypermedia viewer / editors, the way that these applications might use the OHP Protocol.",{"_32":4640,"_34":4753},[4641,4648,4655,4662,4669,4676,4683,4690,4697,4704,4711,4718,4725,4732,4739,4746],{"_32":4642,"_34":4643},[],{"_36":160,"_38":4644,"_40":496,"_42":4645,"_67":4646,"_69":4647,"_71":70},"mEDlADqR",{},[],"A Microcosm semi-aware viewer might be a program such as Word for Windows, which has been adapted, usually by the use of application specific macros, to allow the user to make selections and request actions. For the purpose of this example we will assume that we are not going to attempt to enable the application to handle persistent selections: in Microcosm terms this viewer will not handle buttons or specific links, but will allow the user to create local and generic links, and will allow the user to follow such links and to request other services such as computed links.",{"_32":4649,"_34":4650},[],{"_36":160,"_38":4651,"_40":496,"_42":4652,"_67":4653,"_69":4654,"_71":70},"XmPrkrwB",{},[],"Let us assume that in this case the user has been working in Word for Windows \"off-line\", and the scenario begins at the moment that the user decides that they wish to start using hypertext services.",{"_32":4656,"_34":4657},[],{"_36":160,"_38":4658,"_40":496,"_42":4659,"_67":4660,"_69":4661,"_71":70},"5oa-nKa0",{},[],"The user selects a menu option on Word asking to register with the link service. This menu might cause the following message to be sent to the link service:",{"_32":4663,"_34":4664},[],{"_36":2026,"_38":4665,"_40":496,"_42":4666,"_67":4667,"_69":4668,"_71":70},"0D_2WtD6",{"_2029":70},[]," \\Subject CreateNode \\DocumentName C:\\DOCS\\MYDOC.DOC \\DocumentType Word4Windows",{"_32":4670,"_34":4671},[],{"_36":160,"_38":4672,"_40":496,"_42":4673,"_67":4674,"_69":4675,"_71":70},"TXWBwh3e",{},[],"The Linkservice would check to see if it already knew about this document. If not, it would create a new record in the link database registering the document. Assuming that there were already 8 live connections to the link service, it might return the message:",{"_32":4677,"_34":4678},[],{"_36":2026,"_38":4679,"_40":496,"_42":4680,"_67":4681,"_69":4682,"_71":70},"3r2dgSVL",{"_2029":70},[],"\\Subject HeresNewChannel \\DocumentNickName Hugh's Comments On The Protocol\\SendDocument False \\Channel #9",{"_32":4684,"_34":4685},[],{"_36":160,"_38":4686,"_40":496,"_42":4687,"_67":4688,"_69":4689,"_71":70},"qhWO2BFN",{},[],"The viewer might now request the services",{"_32":4691,"_34":4692},[],{"_36":2026,"_38":4693,"_40":496,"_42":4694,"_67":4695,"_69":4696,"_71":70},"qsidBVYq",{"_2029":70},[],"\\Subject GetServices \\Channel #9",{"_32":4698,"_34":4699},[],{"_36":160,"_38":4700,"_40":496,"_42":4701,"_67":4702,"_69":4703,"_71":70},"JIDFCmca",{},[],"The linkservice would decide, which would now know the document type, and thus the viewer, and would return the appropriate available services, e.g. ",{"_32":4705,"_34":4706},[],{"_36":2026,"_38":4707,"_40":496,"_42":4708,"_67":4709,"_69":4710,"_71":70},"J4APMOhZ",{"_2029":70},[],"\\Subject HeresSubjects \\Data {\\Menuitem Follow Link\\Service FOLLOW.LINK} \\Data {\\Menuitem Show Links\\Service SHOW.LINKS} \\Data {\\Menuitem Compute Links\\Service COMPUTE.LINKS} \\Data {\\Menuitem Make Start Anchor\\Service START.LINK} \\Data {\\Menuitem Make End Anchor\\Service END.LINK} \\Channel #9",{"_32":4712,"_34":4713},[],{"_36":160,"_38":4714,"_40":496,"_42":4715,"_67":4716,"_69":4717,"_71":70},"iIXX_tgF",{},[],"The viewer on receiving this message would build a menu for the user to select these services. Since this viewer is not intended to be capable of handling persistent selections, no request will be sent to the link service for the anchor table.",{"_32":4719,"_34":4720},[],{"_36":160,"_38":4721,"_40":496,"_42":4722,"_67":4723,"_69":4724,"_71":70},"-5wwgAdU",{},[],"Now, a user might select the string \"making a menu\" within the document and select \"Make Start Anchor\" from the menu. The viewer will send the message:",{"_32":4726,"_34":4727},[],{"_36":2026,"_38":4728,"_40":496,"_42":4729,"_67":4730,"_69":4731,"_71":70},"QQuWO11r",{"_2029":70},[],"\\Subject RequestService \\Service START.LINK \\AnchorID \\LocSpec {\\ContentType ASCII\\Content making a menu\\Count \\ReverseCount \\Name \\Script } \\Presentation \\Channel #9",{"_32":4733,"_34":4734},[],{"_36":160,"_38":4735,"_40":496,"_42":4736,"_67":4737,"_69":4738,"_71":70},"7KISu2tT",{},[],"The link service, on receiving this message would note that no LocSpec information, other than the content, had been provided, and would thus start up the link making dialogue with options to create local or generic links. Note that the link making dialogue is within the province of the link service, and is not, currently, part of the OHP protocol.",{"_32":4740,"_34":4741},[],{"_36":160,"_38":4742,"_40":496,"_42":4743,"_67":4744,"_69":4745,"_71":70},"4IMj1y_U",{},[],"The user might continue to request further services in a similar way to the above, and then when finished would close the document, which action would cause the following message to be sent.",{"_32":4747,"_34":4748},[],{"_36":2026,"_38":4749,"_40":496,"_42":4750,"_67":4751,"_69":4752,"_71":70},"CRWWy0EI",{"_2029":70},[],"\\Subject Closing \\Channel #9",{"_36":870,"_38":4754,"_40":496,"_42":4755,"_67":4756,"_69":4757,"_71":70},"M_7FzUO1",{"_273":323},[],"6.1. A Microcosm Semi-Aware Viewer",{"_32":4759,"_34":4872},[4760,4767,4774,4781,4788,4795,4802,4809,4816,4823,4830,4837,4851,4858],{"_32":4761,"_34":4762},[],{"_36":160,"_38":4763,"_40":496,"_42":4764,"_67":4765,"_69":4766,"_71":70},"wEYy0Jfr",{},[],"Now let us consider the case of Word for Windows adapted as a fully aware Microcosm viewer. In this example perhaps the user follows a link to a node that is a Word for Windows document held on the network file system. Thus the linkservice might begin by sending the message:",{"_32":4768,"_34":4769},[],{"_36":2026,"_38":4770,"_40":496,"_42":4771,"_67":4772,"_69":4773,"_71":70},"uL87c8O4",{"_2029":70},[],"\\Subject LaunchDocument \\DocumentName N:\\docs\\file.doc \\ReadOnly False \\DocumentNickName \\DocumentType Word4Windows \\DataCallBack False \\Channel #10 ",{"_32":4775,"_34":4776},[],{"_36":160,"_38":4777,"_40":496,"_42":4778,"_67":4779,"_69":4780,"_71":70},"fUHM7TB_",{},[],"indicating that the linkservice wishes Word for Windows to be launched with the named document in editable mode. The linkservice has allocated channel 10. When word has been launched it will send back the messages:",{"_32":4782,"_34":4783},[],{"_36":2026,"_38":4784,"_40":496,"_42":4785,"_67":4786,"_69":4787,"_71":70},"b3kQlsWV",{"_2029":70},[],"\\Subject GetServices \\Channel #10 \\Subject GetAnchorTable \\Channel #10",{"_32":4789,"_34":4790},[],{"_36":160,"_38":4791,"_40":496,"_42":4792,"_67":4793,"_69":4794,"_71":70},"J6bdaAC4",{},[],"The linkservice might reply to this by sending the same HeresServices message as in the previous section, and also send the message:",{"_32":4796,"_34":4797},[],{"_36":2026,"_38":4798,"_40":496,"_42":4799,"_67":4800,"_69":4801,"_71":70},"ypoeR0Uy",{"_2029":70},[],"\\Subject HeresAnchorTable\n\\Data {\\AnchorID id_1 \\LocSpec {\\ContentType ASCII \\Content bank balance\n\\Count 1045 \\ReverseCount 2345 \\Name \\Script } \\Direction Start\n\\Presentation 1,1,1 \\Service FOLLOW.LINK}\n\\Data {\\AnchorID id_2 \\LocSpec {\\ContentType ASCII \\Content html editors\n\\Count 2085 \\ReverseCount 1305 \\Name \\Script } \\Direction Start\n\\Presentation 1,1,1 \\Service COMPUTE.LINKS}\n\\Data {\\AnchorID id_3 \\LocSpec {\\ContentType ASCII \\Content Dr Smith \\Count 3045 \\ReverseCount 345 \\Name \\Script } \\Direction End \\Presentation 1,1,2 \\Service Nil}\n\\Channel #10",{"_32":4803,"_34":4804},[],{"_36":160,"_38":4805,"_40":496,"_42":4806,"_67":4807,"_69":4808,"_71":70},"x_xB5iym",{},[],"In this example three link anchors are described. The first two are start anchors, and the third is a destination anchor (which has a service of Nil). The LocSpecs of these anchors describe the persistent selections in terms of byte offsets through the file, in both directions. An interesting problem arises here. Word can handle and save bookmarks, which would make an ideal method for representing persistent selections. However, if the user who is making links within the document does not have write permission for this document, then it will not be possible to save the document with the bookmarks embedded. For this reason the viewer is not attempting to save the bookmarks with the file, but is saving their position within the anchor's LocSpec, and might turn these positions into bookmarks during the period that the file is being viewed or edited.",{"_32":4810,"_34":4811},[],{"_36":160,"_38":4812,"_40":496,"_42":4813,"_67":4814,"_69":4815,"_71":70},"klI0lvJR",{},[],"The first thing that the viewer would need to do would be to put the bookmarks into the given positions. It will need to check that the content at these position does match the expected content, and if not it will need to apply some algorithm to find where the bookmarks should be placed.",{"_32":4817,"_34":4818},[],{"_36":160,"_38":4819,"_40":496,"_42":4820,"_67":4821,"_69":4822,"_71":70},"6cv4pKgD",{},[],"The linkservice might follow it original LaunchDocument request with:",{"_32":4824,"_34":4825},[],{"_36":2026,"_38":4826,"_40":496,"_42":4827,"_67":4828,"_69":4829,"_71":70},"Kp-yGkGS",{"_2029":70},[],"\\Subject DisplayLocSpec {\\ContentType ASCII \\Content Dr Smith \\Count 3045 \\ReverseCount 345 \\Name \\Script }\\Presentation 1,1,1\\Channel #10",{"_32":4831,"_34":4832},[],{"_36":160,"_38":4833,"_40":496,"_42":4834,"_67":4835,"_69":4836,"_71":70},"he7Yi9JD",{},[],"The viewer will now need to highlight the string \"Dr Smith\" and scroll the document so that this destination anchor is within view.",{"_32":4838,"_34":4846},[4839],{"_32":4840,"_34":4841},[],{"_36":2026,"_38":4842,"_40":496,"_42":4843,"_67":4844,"_69":4845,"_71":70},"MsFA6gDg",{"_2029":70},[],"\\Subject RequestService \\Service COMPUTE.LINKS \\AnchorID id_2\\LocSpec\\LocSpec {\\ContentType ASCII \\Content html editors \\Count 2085 \\ReverseCount 1305 \\Name \\Script }\\Presentation \\Channel #10",{"_36":160,"_38":4847,"_40":496,"_42":4848,"_67":4849,"_69":4850,"_71":70},"XX-Z32ct",{"_273":323},[],"Maybe the user now clicks on the bookmark over the string \"html editors\". In this case the viewer will send the message:",{"_32":4852,"_34":4853},[],{"_36":160,"_38":4854,"_40":496,"_42":4855,"_67":4856,"_69":4857,"_71":70},"J4eJD_bT",{},[],"This will cause the linkservice to apply the COMPUTE.LINKS service to the given LocSpec. Before the viewer is closed, it will be the responsibility of the viewer to send an UpdateAnchors message to the linkservice to ensure that all its LocSpecs coincide with the current position of the bookmarks.",{"_32":4859,"_34":4867},[4860],{"_32":4861,"_34":4862},[],{"_36":160,"_38":4863,"_40":496,"_42":4864,"_67":4865,"_69":4866,"_71":70},"y1VKWn-1",{},[],"Microcosm does not store anchorID's. A Microcosm link consists principally of the start and end LocSpecs. The anchor id's in the anchor table were inserted by the protocol shim for the sake of complying with the OHP protocol. Microcosm itself will never use them: it will communicate with the shim entirely in terms of LocSpecs, and will never send the DisplayAnchor message.2 It is important that the viewer does not make any assumption that the set of bookmarks it has at any particular time represents the entire set of available bookmarks. This is because Microcosm allows the installation of different sets of links (or Webs), and there may be other anchors within the document that are not currently available. This feature will be common to any distributed link service.",{"_36":160,"_38":4868,"_40":496,"_42":4869,"_67":4870,"_69":4871,"_71":70},"TmpMN89k",{"_273":2113},[],"Before leaving Microcosm, it is worth making two particular points.",{"_36":870,"_38":4873,"_40":496,"_42":4874,"_67":4875,"_69":4876,"_71":70},"fWJdgbeu",{"_273":323},[],"6.2. Microcosm fully aware",{"_32":4878,"_34":4908},[4879,4886,4893,4901],{"_32":4880,"_34":4881},[],{"_36":160,"_38":4882,"_40":496,"_42":4883,"_67":4884,"_69":4885,"_71":70},"18XTThHp",{},[],"Many of the classic Dexter systems expect that the application will own the anchor table. Such systems might store this table with the data, or might arrange to store the table outside the data in a separate but associated file. When a new anchor is created, its identifier is allocated by the viewer application and is unique within that context. The links that are stored within the linkservice have ends which consist of a (Document Name, AnchorID) pair. This situation can easily be handled by the OHP protocol as follows.",{"_32":4887,"_34":4888},[],{"_36":160,"_38":4889,"_40":496,"_42":4890,"_67":4891,"_69":4892,"_71":70},"seab4iO2",{},[],"The OHP protocol shim should be written to handle the storage and delivery of the anchor table for each document. Thus when the GetAnchorTable message is received by the protocol shim, it will retrieve the correct file (which it will identify from the channel information). The linkservice itself will never see this message. The viewer will communicate to the linkservice about anchors in terms of the anchorID and the channel (and perhaps the LocSpec), and the shim will convert this into messages about the anchorID and the document name, as shown in figure 3.",{"_32":4894,"_34":4895},[],{"_36":1875,"_38":4896,"_40":496,"_42":4897,"_67":4898,"_69":4899,"_71":4900},"5ZbX7sCS",{"_273":323},[],"Figure 3: Anchor Table Handling in Classic Dexter Systems.","ipfs://bafkreiccd6ui7qwoaq6nnyzca44eietbmrd4rch4qdisjctklr6jv562wy",{"_32":4902,"_34":4903},[],{"_36":160,"_38":4904,"_40":496,"_42":4905,"_67":4906,"_69":4907,"_71":70},"Z4O3xHeS",{},[],"Since such linkservices do not normally provide a service for allocating anchor identifiers, the protocol shim will need to provide the service instead. When the viewer sends a service request for a new anchor, the OHP shim will consult the appropriate anchor table and allocate the next available anchorID, which it will pass back to the viewer.",{"_36":870,"_38":4909,"_40":496,"_42":4910,"_67":4911,"_69":4912,"_71":70},"93qL0egP",{"_273":323},[],"6.3. Classic Dexter Systems",{"_32":4914,"_34":4936},[4915],{"_32":4916,"_34":4931},[4917,4924],{"_32":4918,"_34":4919},[],{"_36":160,"_38":4920,"_40":496,"_42":4921,"_67":4922,"_69":4923,"_71":70},"NYLLF08z",{},[],"They expect to allocate anchors that are globally unique, and they provide a service to allocate such identifiers. The linkservice must of course still know which document an anchor belongs within so that it can display the correct document when a link is followed to the anchor.",{"_32":4925,"_34":4926},[],{"_36":160,"_38":4927,"_40":496,"_42":4928,"_67":4929,"_69":4930,"_71":70},"C7fGFSrs",{},[],"They often expect to store the node contents. The protocol has the HeresDocument and Update node messages specially to deal with this case. In many cases the node contents may contain the (anchorID, LocSpec) table. If this is the case, the OHP protocol shim will need to arrange to separate the table from the raw node contents, so that the application may first load the contents, then call for the anchor table which will be sent on in a separate HeresAnchorTable message.",{"_36":160,"_38":4932,"_40":496,"_42":4933,"_67":4934,"_69":4935,"_71":70},"WGmAqqni",{"_273":2113},[],"Most hyperbase systems differ from the descriptions given so far in two respects:",{"_36":870,"_38":4937,"_40":496,"_42":4938,"_67":4939,"_69":4940,"_71":70},"2ASaK_R-",{"_273":323},[],"6.4. Hyperbase Systems",{"_32":4942,"_34":4957},[4943,4950],{"_32":4944,"_34":4945},[],{"_36":160,"_38":4946,"_40":496,"_42":4947,"_67":4948,"_69":4949,"_71":70},"qX3FfoyP",{},[],"Where a viewer is being specially built for a format that will only be used hypertext systems it is likely that the developer will specify data format in such a way that the persistent selections may be held as mark-up within the data. Such a format is htf used by Hyper-G. In such cases the anchorID will be encoded into the mark-up and passed to and from the link service to identify the ends of links. These anchorID's might be unique to the document or to the link service as a whole. It is important to realise, however, that not all the anchors held in the document will necessarily be currently valid. In many systems separate Webs of links may be installed, and the anchors that will be valid will depend on the choice of Web. ",{"_32":4951,"_34":4952},[],{"_36":160,"_38":4953,"_40":496,"_42":4954,"_67":4955,"_69":4956,"_71":70},"aVDiH6mF",{},[],"Therefore, if such a viewer is to work with the protocol it must still send the GetAnchorTable to the linkservice: only those anchors which the linkservice returns should be offered to the user.",{"_36":870,"_38":4958,"_40":496,"_42":4959,"_67":4960,"_69":4961,"_71":70},"HDslxcaB",{"_273":323},[],"6.5. Embedded Anchor Viewers",{"_36":870,"_38":4963,"_40":496,"_42":4964,"_67":4965,"_69":4966,"_71":70},"qBxlFUL3",{"_273":323},[],"6 . E x a m p l e S ce n a r i o s",{"_32":4968,"_34":5073},[4969,4997,5004,5053],{"_32":4970,"_34":4992},[4971,4978,4985],{"_32":4972,"_34":4973},[],{"_36":160,"_38":4974,"_40":506,"_42":4975,"_67":4976,"_69":4977,"_71":70},"hK7LgKdG",{},[],"how do we change the behaviour of the program so that it will send and receive the necessary messages? We can usually only achieve this is if the program has an internal macro language or else we can get access to the source code to extend its behaviour.",{"_32":4979,"_34":4980},[],{"_36":160,"_38":4981,"_40":506,"_42":4982,"_67":4983,"_69":4984,"_71":70},"kSaI300F",{},[],"how do we get the required information for the LocSpec? This requires that the application allows us to understand something about its data format.",{"_32":4986,"_34":4987},[],{"_36":160,"_38":4988,"_40":496,"_42":4989,"_67":4990,"_69":4991,"_71":70},"KEAHT_Rg",{},[],"how do we indicate the presence of anchors within the application data? This requires that we are able to alter the display characteristics of the application.",{"_36":160,"_38":4993,"_40":506,"_42":4994,"_67":4995,"_69":4996,"_71":70},"F8qBSlgQ",{"_273":274},[],"A question that has often been posed to the open hypermedia research community is, why do we not use existing standards such as OLE and CORBA? The usual answer has been that these standards do not provide the correct services, and anyway they are by no means standard across architectures, or are not in common use. It is worthwhile, however to consider at this point how existing and emerging standards might be of use in implementing an application to work with a protocol such as OHP. The prevailing problems, when it comes to hypertext enabling an application are:",{"_32":4998,"_34":4999},[],{"_36":160,"_38":5000,"_40":496,"_42":5001,"_67":5002,"_69":5003,"_71":70},"bkTvYojS",{},[],"Existing standards which are well worth noting are the Apple Event Object Model (AEOM) which is a Macintosh standard, and OpenDoc which is a multi-platform model which will shortly be able to interoperate with OLE.",{"_32":5005,"_34":5048},[5006,5013,5020,5027,5034,5041],{"_32":5007,"_34":5008},[],{"_36":160,"_38":5009,"_40":506,"_42":5010,"_67":5011,"_69":5012,"_71":70},"PspLi_0B",{},[],"The Apple Event Object Model (AEOM) consists of a number of standardised sets (or suites) of messages and abstract data objects, which are intended to cover both the inter-application exchange and manipulation of most forms of data, and the external control of applications.",{"_32":5014,"_34":5015},[],{"_36":160,"_38":5016,"_40":506,"_42":5017,"_67":5018,"_69":5019,"_71":70},"BVnk-mb2",{},[],"The Required Suite is a set of four basic messages which every Macintosh application is required to support. These are: Open Application, Open Document, Print Document and Quit Application.",{"_32":5021,"_34":5022},[],{"_36":160,"_38":5023,"_40":506,"_42":5024,"_67":5025,"_69":5026,"_71":70},"VCiURIdn",{},[],"The Core Suite must be supported by every AEOM compliant application. The messages allow chiefly for the retrieval and modification of data within applications, plus closing documents, and the making of selections.",{"_32":5028,"_34":5029},[],{"_36":160,"_38":5030,"_40":506,"_42":5031,"_67":5032,"_69":5033,"_71":70},"UUDieb2_",{},[],"Other suites are defined for specific data types, including text, pictures, tables, Quicklime and sound.",{"_32":5035,"_34":5036},[],{"_36":160,"_38":5037,"_40":506,"_42":5038,"_67":5039,"_69":5040,"_71":70},"vQo9Vxld",{},[],"Most suites define a set of objects to cover the data type that they handle. An application's data is arranged as a hierarchy of these objects. For example: at the top of the hierarchy is the \"application\" object. This will have a set of \"window\" elements. A window within an application can be specified by name, or by order: window 1 will be the frontmost, window 2 the second from the front, etc. A window has a number of properties, including name, position, bounding rectangle etc., and selection. It is therefore very easy to retrieve the user selection from the front window of any compliant application. Furthermore, the calling application can specify the form in which it wants the data: it can ask for the content of the selection, or for its offset and range, or for any other attributes that are applicable. If an application is unable to produce the data in the necessary type, it may substitute an alternative, but the form of data supplied is always specified in its reply.",{"_32":5042,"_34":5043},[],{"_36":160,"_38":5044,"_40":506,"_42":5045,"_67":5046,"_69":5047,"_71":70},"_5-ibzMR",{},[],"The AEOM is in many ways ideally suited for use with OHP. LocSpec requirements can be translated almost verbatim into AEOM queries, which can be sent to a target application. The application need not be written with any knowledge of OHP; it must simply be written to take full advantage of its own target platform. The AEOM is open to the creation of new suites, so an OHP suite can be defined and used to create applications with a higher level of awareness, using only established tools and techniques.",{"_36":870,"_38":5049,"_40":506,"_42":5050,"_67":5051,"_69":5052,"_71":70},"-F30Am4Z",{"_273":323},[],"7.1. The Apple Event Object Model",{"_32":5054,"_34":5068},[5055,5061],{"_32":5056,"_34":5057},[],{"_36":160,"_38":5058,"_40":496,"_42":5059,"_67":5060,"_69":3251,"_71":70},"VU3uvS6Y",{},[],{"_32":5062,"_34":5063},[],{"_36":160,"_38":5064,"_40":496,"_42":5065,"_67":5066,"_69":5067,"_71":70},"ZSP0kcVz",{},[],"OpenDoc includes the Open Scripting Architecture a highly versatile mechanism that includes an AEOM style communication architecture. Consequently the same kind of Shims that would work with the AEOM would work with properly built OpenDoc part editors, and hence with OpenDoc applications. OpenDoc is a multi-platform architecture, and if it is successful in establishing itself the implications are significant.",{"_36":870,"_38":5069,"_40":506,"_42":5070,"_67":5071,"_69":5072,"_71":70},"LwX9iqjz",{"_273":323},[],"7.2. OpenDoc",{"_36":870,"_38":5074,"_40":506,"_42":5075,"_67":5076,"_69":5077,"_71":70},"HbYIxv8Q",{"_273":323},[],"7. Existing Standards",{"_32":5079,"_34":5465},[5080,5087,5094,5129,5136],{"_32":5081,"_34":5082},[],{"_36":160,"_38":5083,"_40":496,"_42":5084,"_67":5085,"_69":5086,"_71":70},"Z3RHuK5a",{},[],"This paper has described the first draft of level 0 and level 1 of a protocol for client viewers to communicate with a link service. No doubt, as developers try to match the protocol to their own link service, deficiencies will emerge and enhancements will be required.",{"_32":5088,"_34":5089},[],{"_36":160,"_38":5090,"_40":496,"_42":5091,"_67":5092,"_69":5093,"_71":70},"qdWECjUi",{},[],"It is intended that almost any application may run as a level 0 viewer (launch and run with no hypertext), and that level one, as described here, will be the sort of functionality that should be possible to achieve by adapting third party applications. We envisage that level 2 of the protocol will be a much heavier weight implementation.",{"_32":5095,"_34":5124},[5096,5103,5110,5117],{"_32":5097,"_34":5098},[],{"_36":160,"_38":5099,"_40":496,"_42":5100,"_67":5101,"_69":5102,"_71":70},"w5CxQo4M",{},[],"The system described here is a fairly passive form of linkservice: clients send requests and get answers which they display. However, systems such as Multicard (Rizk & Sauter) which run server end scripts tend to be much more active, interacting with and changing the data in a node, updating the presentation characteristics, altering the menus interactively, etc. Such behaviour puts a greater onus on the application as there are a much larger number of link service requests that it must be able to handle. We envisage that such extensions will be in level 2 of the protocol.",{"_32":5104,"_34":5105},[],{"_36":160,"_38":5106,"_40":496,"_42":5107,"_67":5108,"_69":5109,"_71":70},"6P4NNx9H",{},[],"At present the protocol allows the passing of scripts, both to identify a persistent selection, and also as a message in its own right to carry out some process at the client end. At present the language of the script is not prescribed, and the linkservice must know what sort of script to dispatch to a particular viewer. It is possible that these scripts could be standardised in level 2 of the protocol.",{"_32":5111,"_34":5112},[],{"_36":160,"_38":5113,"_40":496,"_42":5114,"_67":5115,"_69":5116,"_71":70},"YmKkr5W3",{},[],"There are a number of other cases where the link service needs to communicate with the user. For example, as link anchors are identified it is necessary for the linkservice to send the user a dialogue for eliciting such information as the link attributes. Also, when a document is registered with the system the linkservice will need to be given the document attributes. Such dialogues will be highly dependant on the particular link service, but it is quite possible that the protocol could be extended to include the communication of these dialogues to some standard demon at the client end.",{"_32":5118,"_34":5119},[],{"_36":160,"_38":5120,"_40":496,"_42":5121,"_67":5122,"_69":5123,"_71":70},"dyVV9QSd",{},[],"The set of services which a link service can respond to is not defined by the protocol. It might be possible to identify a set of services that is a superset of all known systems. It is not clear, however that there is much benefit in this exercise.",{"_36":160,"_38":5125,"_40":496,"_42":5126,"_67":5127,"_69":5128,"_71":70},"0nu9pMEn",{"_273":2113},[],"There are a number of ways in which we can imagine the protocol expanding in the future.",{"_32":5130,"_34":5131},[],{"_36":160,"_38":5132,"_40":496,"_42":5133,"_67":5134,"_69":5135,"_71":70},"EH0ShBLD",{},[],"The best known hypertext system is without doubt the World Wide Web, and the standard html viewers played an important part in making the Web so popular. The Web does not currently use a link service, but there is plenty of research aimed at producing link services for the Web, e.g. the Distributed Link Service (Carr et al, 1995 ), and once the links are abstracted from the documents, then the Web will no longer be dependant on html to provide hypertext functionality. It will become possible to use any viewer. Perhaps this protocol could have a future in providing a standard interface to Web link services.",{"_32":5137,"_34":5460},[5138,5152,5173,5222,5243,5264,5285,5306,5341,5369],{"_32":5139,"_34":5147},[5140],{"_32":5141,"_34":5142},[],{"_36":2026,"_38":5143,"_40":506,"_42":5144,"_67":5145,"_69":5146,"_71":70},"qkTaojGT",{"_2029":70},[],"{\\ContentType \\Content \\Count [] \\ReverseCount []\\Name [] \\Script []} ",{"_36":870,"_38":5148,"_40":506,"_42":5149,"_67":5150,"_69":5151,"_71":70},"MW_Y5Vcp",{"_273":323},[],"LocSpec Definition",{"_32":5153,"_34":5168},[5154,5161],{"_32":5155,"_34":5156},[],{"_36":2026,"_38":5157,"_40":506,"_42":5158,"_67":5159,"_69":5160,"_71":70},"ziDGt20G",{"_2029":70},[],"\\Presentation",{"_32":5162,"_34":5163},[],{"_36":160,"_38":5164,"_40":506,"_42":5165,"_67":5166,"_69":5167,"_71":70},"egrFLTJR",{},[],"where the data that follows the presentation tag is opaque, and will be understood only by the viewer that created it in the first place.",{"_36":870,"_38":5169,"_40":506,"_42":5170,"_67":5171,"_69":5172,"_71":70},"Eh4FzMzI",{"_273":323},[],"Presentation Specification",{"_32":5174,"_34":5217},[5175,5196],{"_32":5176,"_34":5191},[5177,5184],{"_32":5178,"_34":5179},[],{"_36":160,"_38":5180,"_40":506,"_42":5181,"_67":5182,"_69":5183,"_71":70},"8j-xI5o7",{},[],"(messages that the linkserver sends to the client asking for some action.) ",{"_32":5185,"_34":5186},[],{"_36":2026,"_38":5187,"_40":496,"_42":5188,"_67":5189,"_69":5190,"_71":70},"8aR6NNXp",{"_2029":70},[],"\n\\Subject LaunchDocument \\DocumentName \\ReadOnly \\DocumentNickName []\n\\DocumentType \\DataCallBack \\Channel\n\\Subject DisplayAnchor \\AnchorID \\Presentation \\Channel\n\\Subject DisplayLocSpec \\LocSpec \\Presentation \\Channel \\Subject Interpret \\ScriptType \\Data {} \\Channel \\Subject CloseNode \\UpdateNode \\Channel\n",{"_36":870,"_38":5192,"_40":506,"_42":5193,"_67":5194,"_69":5195,"_71":70},"ZfzenBPb",{"_273":323},[],"Linkservice Requests",{"_32":5197,"_34":5212},[5198,5205],{"_32":5199,"_34":5200},[],{"_36":160,"_38":5201,"_40":496,"_42":5202,"_67":5203,"_69":5204,"_71":70},"BPrV2haC",{},[],"(messages that the linkserver sends in response to all client requests.)",{"_32":5206,"_34":5207},[],{"_36":2026,"_38":5208,"_40":496,"_42":5209,"_67":5210,"_69":5211,"_71":70},"02nnabm0",{"_2029":70},[],"\\Subject HeresServices \\Data {\\Menuitem\\Service }+ \\Channel \\Subject HeresDocument \\Data \\Channel \\Subject HeresAnchorTable \\Data {\\AnchorID \\LocSpec \\Direction \\Presentation \\Service}+ \\Channel \\Subject HeresNewAnchor \\Data {\\AnchorID \\LocSpec \\Direction \\Presentation \\Service} \\Channel \\Subject HeresNewChannel \\SendDocument \\DocumentNickName [] \\Channel",{"_36":870,"_38":5213,"_40":496,"_42":5214,"_67":5215,"_69":5216,"_71":70},"Bw_ATtvp",{"_273":323},[],"Linkservice Replies ",{"_36":870,"_38":5218,"_40":506,"_42":5219,"_67":5220,"_69":5221,"_71":70},"8CzL0Cra",{"_273":323},[],"Messages Classified by Type",{"_32":5223,"_34":5238},[5224,5231],{"_32":5225,"_34":5226},[],{"_36":160,"_38":5227,"_40":496,"_42":5228,"_67":5229,"_69":5230,"_71":70},"dub-sGh6",{},[],"(Messages that the client sends, typically at start-up, in order to initialise itself with the necessary linkservice information.)",{"_32":5232,"_34":5233},[],{"_36":2026,"_38":5234,"_40":496,"_42":5235,"_67":5236,"_69":5237,"_71":70},"gh1V1Dy7",{"_2029":70},[],"\\Subject GetNode \\DocumentName \\Channel\n\\Subject GetServices \\Channel\n\\Subject GetAnchorTable \\Channel\n\\Subject CreateNode \\DocumentName \\DocumentType \\Channel ",{"_36":870,"_38":5239,"_40":496,"_42":5240,"_67":5241,"_69":5242,"_71":70},"sGs72g5Z",{"_273":323},[],"Client Initialisation Requests",{"_32":5244,"_34":5259},[5245,5252],{"_32":5246,"_34":5247},[],{"_36":160,"_38":5248,"_40":496,"_42":5249,"_67":5250,"_69":5251,"_71":70},"MhlvlpW-",{},[],"(Messages that the client sends to the linkserver to inform the linkserver of changes to the linkservice information that have occurred at the client end.)",{"_32":5253,"_34":5254},[],{"_36":2026,"_38":5255,"_40":496,"_42":5256,"_67":5257,"_69":5258,"_71":70},"prTBEA1M",{"_2029":70},[]," \\Subject UpdateAnchors \\Data {\\AnchorID \\LocSpec \\Direction \\Presentation \\Service }+ \\Channel\n\\Subject UpdateNode \\DocumentType \\Data \\Channel\n\\Subject Closing \\Channel ",{"_36":870,"_38":5260,"_40":496,"_42":5261,"_67":5262,"_69":5263,"_71":70},"zuO6Th6z",{"_273":323},[],"Client Update Requests",{"_32":5265,"_34":5280},[5266,5273],{"_32":5267,"_34":5268},[],{"_36":160,"_38":5269,"_40":496,"_42":5270,"_67":5271,"_69":5272,"_71":70},"HE046ZCf",{},[],"(Messages that are sent when a sensitive area is clicked on, or a choice has been made from a link service supplied menu.)",{"_32":5274,"_34":5275},[],{"_36":2026,"_38":5276,"_40":496,"_42":5277,"_67":5278,"_69":5279,"_71":70},"NeCf07A9",{"_2029":70},[],"\\Subject RequestService \\Service \\AnchorID [] \\LocSpec [] \\Presentation \\Channel ",{"_36":870,"_38":5281,"_40":496,"_42":5282,"_67":5283,"_69":5284,"_71":70},"H0634xlq",{"_273":323},[],"Client Event Requests",{"_32":5286,"_34":5301},[5287,5294],{"_32":5288,"_34":5289},[],{"_36":160,"_38":5290,"_40":496,"_42":5291,"_67":5292,"_69":5293,"_71":70},"BQOCU8IH",{},[],"(Messages that are sent by the client in response to requests from the linkservice.)",{"_32":5295,"_34":5296},[],{"_36":160,"_38":5297,"_40":496,"_42":5298,"_67":5299,"_69":5300,"_71":70},"kMuP3lPu",{},[],"There are none in Level 1 of the Protocol",{"_36":870,"_38":5302,"_40":496,"_42":5303,"_67":5304,"_69":5305,"_71":70},"dCXpzFcw",{"_273":323},[],"Client Replies",{"_32":5307,"_34":5336},[5308,5315,5322,5329],{"_32":5309,"_34":5310},[],{"_36":160,"_38":5311,"_40":496,"_42":5312,"_67":5313,"_69":5314,"_71":70},"e1bz-kck",{},[],"(Messages that may be sent either way. )",{"_32":5316,"_34":5317},[],{"_36":2026,"_38":5318,"_40":496,"_42":5319,"_67":5320,"_69":5321,"_71":70},"SBGQhXsq",{"_2029":70},[],"\\Subject Error \\ErrorSubject \\ErrorMessage \\Channel \\Subject Other \\UserDefinedTag +\\Channel Channel",{"_32":5323,"_34":5324},[],{"_36":160,"_38":5325,"_40":496,"_42":5326,"_67":5327,"_69":5328,"_71":70},"CLQaD-3X",{},[],"There may also be an optional extra tag on the end of any message.",{"_32":5330,"_34":5331},[],{"_36":2026,"_38":5332,"_40":496,"_42":5333,"_67":5334,"_69":5335,"_71":70},"k3HPkoNu",{"_2029":70},[],"\\Other",{"_36":870,"_38":5337,"_40":496,"_42":5338,"_67":5339,"_69":5340,"_71":70},"j6vkkbGY",{"_273":323},[],"Bi-directional Messages",{"_32":5342,"_34":5364},[5343,5350,5357],{"_32":5344,"_34":5345},[],{"_36":160,"_38":5346,"_40":496,"_42":5347,"_67":5348,"_69":5349,"_71":70},"zttnABdq",{},[],"Level 0: Only Supports LaunchDocument and CloseNode messages from linkserver to client. No communication. No hypertext. Any application should be able to run as a Level 0 viewer.",{"_32":5351,"_34":5352},[],{"_36":160,"_38":5353,"_40":506,"_42":5354,"_67":5355,"_69":5356,"_71":70},"H6a1MfNi",{},[],"Level 1: Supports the functionality described in this paper. It is intended that it will be possible to achieve this level by adapting third party applications.",{"_32":5358,"_34":5359},[],{"_36":160,"_38":5360,"_40":496,"_42":5361,"_67":5362,"_69":5363,"_71":70},"MP_q7kK2",{},[],"Level 2: Not yet defined, but envisaged to support extensions to deal with content manipulation, presentation and standard client end scripts. It is expected that this level of conformity will only be achieved by writing specialised applications.",{"_36":870,"_38":5365,"_40":496,"_42":5366,"_67":5367,"_69":5368,"_71":70},"U0B6Orik",{"_273":323},[],"Levels of the Protocol",{"_32":5370,"_34":5455},[5371,5399],{"_32":5372,"_34":5394},[5373],{"_32":5374,"_34":5389},[5375,5382],{"_32":5376,"_34":5377},[],{"_36":160,"_38":5378,"_40":496,"_42":5379,"_67":5380,"_69":5381,"_71":70},"rGoxQlwX",{},[],"Accept Messages from Link Server, convert to OHP equivalent and pass to correct Client. ",{"_32":5383,"_34":5384},[],{"_36":160,"_38":5385,"_40":496,"_42":5386,"_67":5387,"_69":5388,"_71":70},"_KOFZrZE",{},[],"Accept Messages from Client side in OHP, convert and pass to link service in private protocol.",{"_36":160,"_38":5390,"_40":496,"_42":5391,"_67":5392,"_69":5393,"_71":70},"zXVTsk5Z",{"_273":274},[],"(Produced by Link Service suppliers).",{"_36":870,"_38":5395,"_40":496,"_42":5396,"_67":5397,"_69":5398,"_71":70},"MKcqfXBG",{"_273":323},[],"Server Side Protocol Shim.",{"_32":5400,"_34":5450},[5401],{"_32":5402,"_34":5445},[5403,5410,5417,5424,5431,5438],{"_32":5404,"_34":5405},[],{"_36":160,"_38":5406,"_40":496,"_42":5407,"_67":5408,"_69":5409,"_71":70},"LxyIJCDw",{},[],"Accept OHP messages from network and communicate message to correct viewer/editor.",{"_32":5411,"_34":5412},[],{"_36":160,"_38":5413,"_40":496,"_42":5414,"_67":5415,"_69":5416,"_71":70},"rqP80jv3",{},[],"Accept Messages from viewer editor and forward to linkservice in network protocol.",{"_32":5418,"_34":5419},[],{"_36":160,"_38":5420,"_40":496,"_42":5421,"_67":5422,"_69":5423,"_71":70},"D2MtuHoO",{},[],"Maintain table of applications on this platform which should be used for each data type.",{"_32":5425,"_34":5426},[],{"_36":160,"_38":5427,"_40":496,"_42":5428,"_67":5429,"_69":5430,"_71":70},"jtGLuZAm",{},[],"Maintain table showing what level of protocol can be expected from each viewer/editor.",{"_32":5432,"_34":5433},[],{"_36":160,"_38":5434,"_40":496,"_42":5435,"_67":5436,"_69":5437,"_71":70},"yY-px8pe",{},[],"Handle LaunchDocument messages at the client end, and, if a DataCallBack is required, send the GetNode message and handle the transfer of the data from the HeresDocument message to the application.",{"_32":5439,"_34":5440},[],{"_36":160,"_38":5441,"_40":496,"_42":5442,"_67":5443,"_69":5444,"_71":70},"cpcm_atW",{},[],"For level 0 applications, handle CloseNode messages, and return error messages for other linkservice requests.",{"_36":160,"_38":5446,"_40":496,"_42":5447,"_67":5448,"_69":5449,"_71":70},"vD5ASZKl",{"_273":274},[],"(One needs to be produced for each client platform, for each communication protocol conversion) ",{"_36":870,"_38":5451,"_40":496,"_42":5452,"_67":5453,"_69":5454,"_71":70},"UgIKkPOM",{"_273":323},[],"Client Side Communication Shim.",{"_36":870,"_38":5456,"_40":496,"_42":5457,"_67":5458,"_69":5459,"_71":70},"dyBrM8Y-",{"_273":323},[],"Responsibilities of the Shims",{"_36":870,"_38":5461,"_40":506,"_42":5462,"_67":5463,"_69":5464,"_71":70},"uNKh-KMA",{"_273":323},[],"Appendix: Summary of Protocol",{"_36":870,"_38":5466,"_40":506,"_42":5467,"_67":5468,"_69":5469,"_71":70},"yyLOxegg",{"_273":323},[],"8 . Conclusions",{"_32":5471,"_34":5549},[5472,5479,5486,5493,5500,5507,5514,5521,5528,5535,5542],{"_32":5473,"_34":5474},[],{"_36":160,"_38":5475,"_40":506,"_42":5476,"_67":5477,"_69":5478,"_71":70},"uu64jzAB",{},[],"Andrews K., Kappe, F. & Maurer, H. Hyper-G: Towards the Next Generation of Network Information Technology. Journal of Universal Computer Science, April 1995. Aßfalg, R. (ed.). The Proceedings of the Workshop on Open Hypertext Systems, Konstanz , May 1994. Carr, L.A., De Roure, D., Hall, W. & Hill, G.J. The Distributed Link Service: A Tool for Publishers, Authors and Readers. In: The Fourth International World Wide Web Conference Proceedings. pp 647-656. O'Reilly & Associates, Dec 1995.",{"_32":5480,"_34":5481},[],{"_36":160,"_38":5482,"_40":506,"_42":5483,"_67":5484,"_69":5485,"_71":70},"Bui7onmX",{},[],"Davis, H.C., Hall, W., Heath, I., Hill, G. & Wilkins, R. Towards an Integrated Information Environment with Open Hypermedia Systems . In: D. Lucarella, J. Nanard, M. Nanard, P. Paolini. eds. The Proceedings of the ACM Conference on Hypertext, ECHT '92 Milano , pp 181-190. ACM Press, 1992. Davis, H.C., Knight, S.K. & Hall, W. Light Hypermedia Link Services: A Study in Third Party Application Integration. In: The ACM Conference on Hypermedia Technology, ECHT '94 Proceedings. pp 41-50. ACM. Sept. 1994.",{"_32":5487,"_34":5488},[],{"_36":160,"_38":5489,"_40":506,"_42":5490,"_67":5491,"_69":5492,"_71":70},"szOoenx9",{},[],"Davis, H.C. To Embed or Not to Embed..., Communications of the ACM, Vol 38(8), pp 108-109. August 1995. DeRose, S.J & Durand, D.G. Making Hypermedia Work: A User's Guide to HyTime. Kluwer Academic Press. 1994",{"_32":5494,"_34":5495},[],{"_36":160,"_38":5496,"_40":506,"_42":5497,"_67":5498,"_69":5499,"_71":70},"JeV6f9Uf",{},[],"Grønbæk, K. & Trigg, R.H. Design Issues for a Dexter-Based Hypermedia System.",{"_32":5501,"_34":5502},[],{"_36":160,"_38":5503,"_40":506,"_42":5504,"_67":5505,"_69":5506,"_71":70},"VwGtQeuq",{},[],"In: D. Lucarella, J. Nanard, M. Nanard, P. Paolini. eds. The Proceedings of the ACM Conference on Hypertext, ECHT '92 Milano , pp 191- 200. ACM Press. Nov. 1992",{"_32":5508,"_34":5509},[],{"_36":160,"_38":5510,"_40":506,"_42":5511,"_67":5512,"_69":5513,"_71":70},"n4bVQ-I7",{},[],"Grønbæk, K. & Trigg, R.H. From Embedded References to Link Objects: Toward a New Data Model for Open Hypermedia Systems . To be published in The Proceedings of Hypertext '96. ACM 1996 Halasz, F. & Mayer, S. (edited by Grønbæk, K. & Trigg, R.H). The Dexter Hypertext Reference Model. Communications of the ACM. pp 30-39. 37(2). Feb. 1994.",{"_32":5515,"_34":5516},[],{"_36":160,"_38":5517,"_40":506,"_42":5518,"_67":5519,"_69":5520,"_71":70},"hn194sda",{},[],"Hall, W. Ending the Tyranny of the Button . IEEE Multimedia 1(1). 1994. Kacmar, C.J. & Leggett, J.J. PROXHY: A Process-Oriented Extensible Hypertext Architecture. ACM Trans. on Information Systems, 9(4) pp 299-419. Oct. 1991.",{"_32":5522,"_34":5523},[],{"_36":160,"_38":5524,"_40":506,"_42":5525,"_67":5526,"_69":5527,"_71":70},"gsQt9h5j",{},[],"Leggett, J. & Schnase, J. Dexter with Open Eyes. Communications of the ACM 37(2) pp 77-86. Feb. 1994 Østerbye, K. & Wiil, U.K. The Flag Taxonomy of Open Hypermedia Systems , To be published in The Proceedings of Hypertext '96. ACM 1996",{"_32":5529,"_34":5530},[],{"_36":160,"_38":5531,"_40":506,"_42":5532,"_67":5533,"_69":5534,"_71":70},"hDBTjTGw",{},[],"Rizk, A. The M2000 Protocol Description Manual. Euroclid. (Available from the author) 1991 Rizk, A. & Sauter, L. Multicard: An Open Hypermedia System .",{"_32":5536,"_34":5537},[],{"_36":160,"_38":5538,"_40":506,"_42":5539,"_67":5540,"_69":5541,"_71":70},"J-gjRiC1",{},[],"In: D. Lucarella, J. Nanard, M. Nanard, P. Paolini. eds. The Proceedings of the ACM Conference on Hypertext, ECHT '92 Milano , Italy, December 1992, pp 181-190. ACM Press. 1992",{"_32":5543,"_34":5544},[],{"_36":160,"_38":5545,"_40":506,"_42":5546,"_67":5547,"_69":5548,"_71":70},"fBKr4OEO",{},[],"Wiil, U.K & Østerbye, K. (eds.). The Proceedings of the ECHT '94 Workshop on Open Hypermedia Systems, Edinburgh, Sept. 1994. Technical Report R-94-2038. Aalborg University. Oct. 1994. Wiil, U.K. & Leggett, J.L. The HyperDisco Approach to Open Hypermedia Systems , To be published in The Proceedings of Hypertext '96. ACM 1996. View publication stats",{"_36":870,"_38":5550,"_40":506,"_42":5551,"_67":5552,"_69":3495,"_71":70},"w-3vrZyX",{"_273":323},[],[279],"/records/ohp-a-draft-proposal-for-a-standard-open-hypermedia-protocol-levels-0-and-1-revision-12","2025-07-07T17:52:01.543Z",{"_83":515},{},{"_38":493,"_95":54,"_55":5559,"_72":496,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,495],1773151562807,[149,493,496,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/ohp-a-draft-proposal-for-a-standard-open-hypermedia-protocol-levels-0-and-1-revision-12\",\"bafy2bzacecedtpecy4ftuuwgtjvkrevoht3qxodvaju3u5ia4k4fawg24hsy6\",true]",{"_110":5564,"_147":5807,"_150":5808},{"_112":5565,"_131":132,"_133":5806,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":5566,"_38":5804},{"_29":5567,"_72":521,"_73":54,"_74":5800,"_55":5801,"_77":528,"_79":528,"_81":5802,"_85":5803,"_87":521,"_89":90},[5568,5581,5595,5602,5615],{"_32":5569,"_34":5570},[],{"_36":160,"_38":5571,"_40":521,"_42":5572,"_67":5573,"_69":5580,"_71":70},"O1VnU70U",{},[5574],{"_36":204,"_167":5575,"_169":5577,"_42":5578,"_71":5579},[5576],69,[1699],{},"mailto:halasz@xerox.com","Frank G. Halasz \nXerox PARC 3333 Coyote Hill Rd. Palo Alto, CA 94304 halasz@xerox.com ",{"_32":5582,"_34":5583},[],{"_36":160,"_38":5584,"_40":521,"_42":5585,"_67":5586,"_69":5594,"_71":70},"g_AU3JzO",{},[5587],{"_36":204,"_167":5588,"_169":5590,"_42":5592,"_71":5593},[5589],75,[5591],103,{},"mailto:mayers@tekchips.labs.tek.com","Mayer Schwartz \nTektronix Labs P.O. Box 500, MS 50-662 Beaverton, OR 97077 mayers@tekchips.labs.tek.com",{"_32":5596,"_34":5597},[],{"_36":160,"_38":5598,"_40":521,"_42":5599,"_67":5600,"_69":5601,"_71":70},"TbcpFJqr",{},[],"Presented at the NIST Hypertext Standardization Workshop, Gaithersburg, MD, January 16-18, 1990",{"_32":5603,"_34":5611},[5604],{"_32":5605,"_34":5606},[],{"_36":160,"_38":5607,"_40":521,"_42":5608,"_67":5609,"_69":5610,"_71":70},"QvM_1C90",{},[]," This paper presents the Dexter hypertext reference model. The Dexter model is an attempt to capture, both formally and informally, the important abstractions found in a wide range of existing and future hypertext systems. The goal of the model is to provide a principled basis for comparing systems as well as for developing interchange and interoperability standards. The model is divided into three layers. The storage layer describes the network of nodes and links that is the essence of hypertext. The runtime layer describes mechanisms supporting the user’s interaction with the hypertext. The within-component layer covers the content and structures within hypertext nodes. The focus of the model is on the storage layer as well as on the mechanisms of anchoring and presentation specification that form the interfaces between the storage layer and the within-component and runtime layers, respectively. The model is formalized in the specification language Z [Spiv89], a specification language based on set theory. The paper briefly discusses the issues involved in comparing the characteristics of existing systems against the model.",{"_36":870,"_38":5612,"_40":521,"_42":5613,"_67":5614,"_69":1827,"_71":70},"O4r43Akn",{"_273":323},[],{"_32":5616,"_34":5796},[5617,5624,5631,5638,5645,5652,5659,5666],{"_32":5618,"_34":5619},[],{"_36":160,"_38":5620,"_40":521,"_42":5621,"_67":5622,"_69":5623,"_71":70},"67dBmgVd",{},[],"What do hypertext1 systems such as NoteCards [Hala88], Neptune [Deli86a], KMS [Aksc88a], Intermedia [Yank88a] and Augment [Enge84a] have in common? How do they differ? In what way do these systems differ from related classes of systems such as multimedia database systems. At a very abstract level, each of these hypertext systems provides its users with the ability to create, manipulate, and/or examine a network of information-containing nodes interconnected by relational links. Yet these systems differ markedly in the specific data models and sets of functionality that they provide to their users. Augment, Intermedia, NoteCards, and Neptune, for example, all provide their users with a universe of arbitrary-length documents. KMS and Hypercard, in contrast, are built around a model of a fixed-size canvas onto which items such as text and graphics can be placed. Given these two radically different designs, is there anything common between these systems in their notions of hypertext nodes?",{"_32":5625,"_34":5626},[],{"_36":160,"_38":5627,"_40":521,"_42":5628,"_67":5629,"_69":5630,"_71":70},"uLhw6-Gk",{},[],"In an attempt to provide a principled basis for answering these questions, this paper presents the Dexter hypertext reference model. The model provides a standard hypertext terminology coupled with a formal model of the important abstractions commonly found in a wide range of hypertext systems. Thus, the Dexter model serves as a standard against which to compare and contrast the characteristics and functionality of various hypertext (and non-hypertext) systems. The Dexter model also serves as a principled basis on which to develop standards for interoperability and interchange among hypertext systems.",{"_32":5632,"_34":5633},[],{"_36":160,"_38":5634,"_40":521,"_42":5635,"_67":5636,"_69":5637,"_71":70},"QMwCL0Os",{},[],"The Dexter reference model described in this paper was initiated as the result of two small workshops on hypertext. The first workshop was held in October, 1988 at the Dexter Inn in New Hampshire. Hence the name of the model. The workshops had representatives from many of the major existing hypertext systems2 . A large part of the discussion at these workshops was the elicitation of the abstractions common to the major hypertext systems. The Dexter model is an attempt to capture, fill-out, and formalize the results of these discussions.",{"_32":5639,"_34":5640},[],{"_36":160,"_38":5641,"_40":521,"_42":5642,"_67":5643,"_69":5644,"_71":70},"HtuCDAZu",{},[],"Another important focus of the workshops was an attempt to find a common terminology for the hypertext field. This turned out to be an extremely difficult task, especially so in the absence of an understanding of the common (and differing) abstractions among the various systems. The term \"node\" turned out to be especially difficult given the extreme variation in the use of the term across the various systems. By providing a well-defined set of named abstractions, the Dexter model provides a solution to the hypertext terminology problem. It does so, however, at some cost. In order to avoid confusion, the model does not use contentious terms such as \"node\", prefering neutral terms such as \"component\" for the abstraction in the model.",{"_32":5646,"_34":5647},[],{"_36":160,"_38":5648,"_40":521,"_42":5649,"_67":5650,"_69":5651,"_71":70},"mPXwVQ68",{},[],"In the present paper, the Dexter model is formulated in Z [Spiv89], a formal specification language based on typed set theory. The use of Z provides a rigorous basis for defining the necessary abstractions and for discussing their use and interrelationships. Although an understanding of the Z language is a prerequisite for fully understanding the details of the Dexter model as described in this paper, the paper attempts to provide a complete description of the model in the prose accompanying the formal specification. Readers unfamiliar with Z should be able to gain a full, if not precisely detailed, understanding of the model.",{"_32":5653,"_34":5654},[],{"_36":160,"_38":5655,"_40":521,"_42":5656,"_67":5657,"_69":5658,"_71":70},"jz3CQvfM",{},[],"This paper also refers in passing to architectural concepts found in a number of existing hypertext systems including Augment [Enge84a], Concordia/Document Examiner [Walk88a], Hypercard [Good87], Hyperties [Shne89d], IGD [Fein82], Intermedia [Yank88a], KMS [Aksc88a], Neptune/HAM [Deli86a], NoteCards [Hala88], the Sun Link Service [Pear89], and Textnet [Trig86a]. The reader is assumed to be familiar with the general characteristics and functionality of these systems. Appropriate background material on these systems can be found in Conklin [Conk87a] and in the proceedings of the Hypertext 87 [HT87] and Hypertext 89 [HT89] conferences.",{"_32":5660,"_34":5661},[],{"_36":160,"_38":5662,"_40":521,"_42":5663,"_67":5664,"_69":5665,"_71":70},"_tHbzoNN",{},[],"This paper is divided in 4 main sections. The first section provides a brief discursive overview of the entire model. The second section describes the storage layer of the model, both formally and informally. The third section describes the runtime layer of the model in a similar manner. The final section discusses issues involved in comparing existing systems against the model.",{"_32":5667,"_34":5791},[5668,5675,5691,5698,5705,5712,5719,5726,5734,5741,5748,5756,5763,5770,5777,5784],{"_32":5669,"_34":5670},[],{"_36":160,"_38":5671,"_40":521,"_42":5672,"_67":5673,"_69":5674,"_71":70},"KQIktB_7",{},[],"The Dexter model divides a hypertext system into three layers, the runtime layer, the storage layer and the within-component layer, as illustrated in Figure 1. The main focus of the model is on the storage layer, which models the basic node/link network structure that is the essence of hypertext. The storage layer describes a ‘database’ that is composed of a hierarchy of data-containing ‘‘components’’ which are interconnected by relational ‘‘links’’. Components correspond to what is typically thought of as nodes in a hypertext network: cards in NoteCards and HyperCard, frames in KMS, documents in Augment and Intermedia, or articles in Hyperties.",{"_32":5676,"_34":5686},[5677],{"_32":5678,"_34":5679},[],{"_36":1875,"_38":5680,"_40":521,"_42":5681,"_67":5683,"_69":5684,"_71":5685},"UhAatK9O",{"_273":323,"_2135":5682},664.6408839779006,[],"Figure 1: Layers of the Dexter model.","ipfs://bafkreibnw37tecfx6yw7ffxl4c6gl6mg66r4d2eyex2eyyyja6jjzkeghy",{"_36":160,"_38":5687,"_40":521,"_42":5688,"_67":5689,"_69":5690,"_71":70},"Qjj1XFW-",{"_273":323},[],"Components contain the chunks of text, graphics, images, animations, etc. that form the basic content in the hypertext network",{"_32":5692,"_34":5693},[],{"_36":160,"_38":5694,"_40":521,"_42":5695,"_67":5696,"_69":5697,"_71":70},"KWB89_8l",{},[],"The storage layer focuses on the mechanisms by which the components and links are ‘‘glued together’’ to form hypertext networks. The components are treated in this layer as generic containers of data. No attempt is made to model any structure within the container. Thus, the storage layer makes no differentiation between text components and graphics components. Nor does it provide any mechanisms for dealing with the well-defined structure inherent within a structured document (e.g., an ODA document) component.",{"_32":5699,"_34":5700},[],{"_36":160,"_38":5701,"_40":521,"_42":5702,"_67":5703,"_69":5704,"_71":70},"jQW7-33r",{},[],"In contrast, the within-component layer of the model is specifically concerned with the contents and structure within the components of the hypertext network. This layer is purposefully not elaborated within the Dexter model. The range of possible content/structure that can be included in a component is open-ended. Text, graphics, animations, simulations, images, and many more types of data have been used as components in existing hypertext systems. It would be folly to attempt a generic model covering all of these data types. Instead, the Dexter model treats within-component structure as being outside of the hypertext model per se. It is assumed that other reference models designed specifically to model the structure of particular applications, documents, or data types (ODA, IGES, etc) will be used in conjunction with the Dexter model to capture the entirety of the hypertext, including the with-component content and structure.",{"_32":5706,"_34":5707},[],{"_36":160,"_38":5708,"_40":521,"_42":5709,"_67":5710,"_69":5711,"_71":70},"Xmgt1f6M",{},[],"An extremely critical piece of the Dexter model, however, is the interface between the hypertext network and the within-component content and structure. The hypertext system requires a mechanism for addressing (refering to) locations or items within the content of an individual component. In the Dexter model, this mechanism is know as anchoring. The anchoring mechanism is necessary, for example, to support span-to-span links such as are found in Intermedia. In Intermedia, the components are complete structured documents. Links are possible not only between documents, but between spans of characters within one document and spans of characters within another document. Anchors are a mechanism that provides this functionality while maintaining a clean separation between the storage and within-component layers.",{"_32":5713,"_34":5714},[],{"_36":160,"_38":5715,"_40":521,"_42":5716,"_67":5717,"_69":5718,"_71":70},"i_ejeA_h",{},[],"The storage and within-component layers treat hypertext as an essentially passive data structure. Hypertext systems, however, go far beyond this in the sense that they provide tools for the user to access, view, and manipulate the network structure. This functionality is captured by the runtime layer of the model. As in the case of within-component structure, the range of possible tools for accessing, viewing, and manipulating a hypertext networks is far too broad and too diverse to allow a simple, generic model. Hence the Dexter model provides only a bare-bones model of the mechanism for presenting a hypertext to the user for viewing and editing. This presentation mechanism captures the essentials of the dynamic, interactional aspects of hypertext systems, but it does not attempt to cover the details of user interaction with the hypertext.",{"_32":5720,"_34":5721},[],{"_36":160,"_38":5722,"_40":521,"_42":5723,"_67":5724,"_69":5725,"_71":70},"n6TUoz0E",{},[],"As in the case of anchoring, a critical aspect of the Dexter model is the interface between the storage layer and the runtime layer. In the Dexter model this is accomplished using the notion of presentation specifications. Presentation specifications are a mechanism by which information about how a component/network is to be presented to the user can be encoded into the hypertext network at the storage layer. Thus, the way in which a component is presented to the user can be a function not only of the specific hypertext tool that is doing the presentation (i.e., the specific runtime layer), but can also be a property of the component itself and/or of the access path (link) taken to that component.",{"_32":5727,"_34":5728},[],{"_36":1875,"_38":5729,"_40":521,"_42":5730,"_67":5731,"_69":5732,"_71":5733},"GjYBwNIh",{"_273":323},[],"Figure 2: Illustration of the need for presentation specifications on the access\npath (i.e., links) as well as on the components themselves.","ipfs://bafkreidlfepnod62ggwejjcwdist4xs474qozxl4pz6lc565jeqdc7qooq",{"_32":5735,"_34":5736},[],{"_36":160,"_38":5737,"_40":521,"_42":5738,"_67":5739,"_69":5740,"_71":70},"Ndk4eS-H",{},[],"Figure 2 illustrates the importance of the presentation specifications mechanism. In this figure, there is an animation component taken from a computer-based training hypertext. This animation component can be accessed from two other components, a ‘‘teacher’’ component and a ‘‘student’’ component. When following the link from the student component, the animation should be brought up as a running animation. In contast, when coming from the teacher component, the animation should be brought up in editing mode ready to be altered. In order to separate these two cases, the runtime layer needs to access presentation information encoded into the links in the network. Presentation specifications are a generic way of doing just this. Like anchoring, it is an interface that allows the storage layer to communicate in generic way with the runtime layer without violating the separation between the two layers.",{"_32":5742,"_34":5743},[],{"_36":160,"_38":5744,"_40":521,"_42":5745,"_67":5746,"_69":5747,"_71":70},"rLJuDEzf",{},[],"Figure 3 attempts to give a flavor of the various layers of the Dexter model as they are embedded within an typical hypertext system. The figure depicts a 3 node/1 link hypertext network. The storage layer contains four entities: the three components (i.e., nodes) and the link. The actual contents (text and graphics) for the components are located to the right of the storage layer in the within-components layer. In the runtime layer, the single graphics component is being presented to the user. The link emanating from this node is marked by an arrowhead located near the bottom of the node’s window on the computer screen.",{"_32":5749,"_34":5750},[],{"_36":1875,"_38":5751,"_40":521,"_42":5752,"_67":5753,"_69":5754,"_71":5755},"JDKn59RP",{"_273":323},[],"Figure 3: A depiction of the three layers of the Dexter model as embedded in an actual hypertext system","ipfs://bafkreift6npwkc7u65ylrgkhsujwccuf7whp624q2wdpbdebkrkozvezhi",{"_32":5757,"_34":5758},[],{"_36":160,"_38":5759,"_40":521,"_42":5760,"_67":5761,"_69":5762,"_71":70},"mjp75l-q",{},[],"another composite is restricted to be a direct-acyclic graph (DAG), i.e., no composite may contain itself either directly or indirectly. Composite components are relative rare in the current generation of hypertext systems. One exception is the Augment system where a document is a tree-structured composition of atomic components called statements.",{"_32":5764,"_34":5765},[],{"_36":160,"_38":5766,"_40":521,"_42":5767,"_67":5768,"_69":5769,"_71":70},"SdbXKAFG",{},[],"Every component has a globally unique identity which is captured by its unique identifier (UID). UIDs are primitive in the model, but they are assumed to be uniquely assigned to components across the entire universe of discourse (not just within the context of a single hypertext). The accessor function of the hypertext is responsible for ‘‘accessing’’ a component given its UID, i.e., for mapping a UID into the component ‘‘assigned’’ that UID.",{"_32":5771,"_34":5772},[],{"_36":160,"_38":5773,"_40":521,"_42":5774,"_67":5775,"_69":5776,"_71":70},"OaqNEsjR",{},[],"UIDs provide a guaranteed mechanism for addressing any component in a hypertext. But the use of UIDs as a basic addressing mechanism in hypertext may be too restrictive. For example, it is possible in the Augment system to create a link to ‘‘the statement containing the word ‘pollywog’’’. The statement specified by this link may not exist or it may change over time as documents are edited. Therefore, the link cannot rely on a specific statement UID to address the target statement. Rather, when the link is followed, the specification must be ‘‘resolved’’ to a UID (if possible), which then can be used to access the correct component.",{"_32":5778,"_34":5779},[],{"_36":160,"_38":5780,"_40":521,"_42":5781,"_67":5782,"_69":5783,"_71":70},"iVVivgaj",{},[],"This kind of indirect addressing is supported in the storage layer using component specifications together with the resolver function. The resolver function is responsible for ‘‘resolving’’ a component specification into a UID, which can then be fed to the accessor function to retrieve the specified component. Note, however, that the resolver function is only a partial function. A given specification may not be resolvable into a UID, i.e., the component being specified may not exist. However, it is the case that for every component there is at least one specification that will resolve to the UID for that component. In particular, the UID itself may be used as a specifier, in which case the resolver function is the identity function.",{"_32":5785,"_34":5786},[],{"_36":160,"_38":5787,"_40":521,"_42":5788,"_67":5789,"_69":5790,"_71":70},"impMCGiY",{},[],"Implementing span-to-span links (e.g., in Intermedia) requires more than simply specifying entire components. Span-to-span linking depends on a mechanism for specifying substructure within components. But in order to preserve the boundary between the hypertext network per se and the content/structure within the components, this mechanism cannot depend in any way on knowledge about the internal structure of (atomic) components. In the Dexter model, this is accomplished by an indirect addressing entity called an anchor. An anchor has two parts: an anchor id and an anchor value. The anchor value is an arbitrary value that specifies some location, region, item, or substructure within a component. This anchor value is interpretable only by the applications responsible for handling the content/structure of the component. It is primitive and unrestricted from the viewpoint of the storage layer. The anchor id is an identifier which uniquely identifies its anchor within the scope of its component. Anchors can therefore be uniquely identified across the whole universe by a component UID, anchor id pair.",{"_36":870,"_38":5792,"_40":521,"_42":5793,"_67":5794,"_69":5795,"_71":70},"l_p2Cbz4",{"_273":323},[],"An Overview of the Model",{"_36":870,"_38":5797,"_40":521,"_42":5798,"_67":5799,"_69":874,"_71":70},"UDzBaw-E",{"_273":323},[],[279],"/records/the-dexter-hypertext-reference-model",{"_83":541},{},{"_38":518,"_95":54,"_55":5805,"_72":521,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,520],1773151562565,[149,518,521,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/the-dexter-hypertext-reference-model\",\"bafy2bzacecj6hopdys7isf3mhrk63bfjjl3ewaeww4sx5ainwe2x2xlopsh3i\",true]",{"_110":5810,"_147":7376,"_150":7377},{"_112":5811,"_131":132,"_133":7375,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":5812,"_38":7373},{"_29":5813,"_72":547,"_73":54,"_74":7368,"_55":7369,"_77":556,"_79":7370,"_81":7371,"_85":7372,"_87":557,"_89":90},[5814,5831,5849,5874,5930,6246,6714,6843,6906],{"_32":5815,"_34":5816},[],{"_36":160,"_38":5817,"_40":557,"_42":5818,"_67":5819,"_69":5830,"_71":70},"PmY0GNpK",{},[5820,5824],{"_36":919,"_167":5821,"_169":5822,"_42":5823,"_71":70},[137],[3184],{},{"_36":204,"_167":5825,"_169":5826,"_42":5828,"_71":5829},[3527],[5827],188,{},"mailto:hcd}@ecs.soton.ac.uk","Dave E. Millard, Luc Moreau, Hugh C. Davis\nMultimedia Research Group\nDepartment of Electronics & Computer Science\nUniversity of Southampton\nSO17 1BJ, UK\n{dem97r, lavm, hcd}@ecs.soton.ac.uk",{"_32":5832,"_34":5833},[],{"_36":160,"_38":5834,"_40":557,"_42":5835,"_67":5836,"_69":5848,"_71":70},"HgIzGG4W",{},[5837,5841],{"_36":919,"_167":5838,"_169":5839,"_42":5840,"_71":70},[137],[1488],{},{"_36":204,"_167":5842,"_169":5844,"_42":5846,"_71":5847},[5843],89,[5845],111,{},"mailto:sre@ifs.uni-linz.ac.at","Siegfried Reich\nDepartment of Information Systems\nUniversity of Linz, 4040 Linz, Austria\nsre@ifs.uni-linz.ac.at",{"_32":5850,"_34":5869},[5851,5858],{"_32":5852,"_34":5853},[],{"_36":160,"_38":5854,"_40":557,"_42":5855,"_67":5856,"_69":5857,"_71":70},"vQZNzmfD",{},[],"The Open Hypermedia Systems community has been largely concerned with interoperability between hypertext systems which share the same paradigm. It has evolved a component-based framework for this purpose, in which specific but incompatible middleware components are designed for each hypertext domain, such as navigational hypertext, spatial hypertext or taxonomic hypertext. This paper investigates the common features of these domains and introduces FOHM, a Fundamental Open Hypertext Model, which defines a common data model and set of related operations that are applicable for all three domains. Using this layer the paper explores the possible semantics of linking between different hypertext domains, and shows that each can introduce features which benefit the other domains.",{"_32":5859,"_34":5860},[],{"_36":160,"_38":5861,"_40":557,"_42":5862,"_67":5863,"_69":5868,"_71":70},"G9CbE7pz",{},[5864],{"_36":166,"_167":5865,"_169":5866,"_42":5867,"_71":70},[137],[1476],{},"KEYWORDS: Component-based Open Hypermedia System (CB-OHS), Open Hypermedia Protocol (OHP), Hypertext Domains, Fundamental Open Hypermedia Model (FOHM), Interoperability.",{"_36":870,"_38":5870,"_40":557,"_42":5871,"_67":5872,"_69":5873,"_71":70},"yFIL9VmP",{"_273":323},[],"ABSTRACT",{"_32":5875,"_34":5925},[5876,5883,5890,5897,5904,5911,5918],{"_32":5877,"_34":5878},[],{"_36":160,"_38":5879,"_40":557,"_42":5880,"_67":5881,"_69":5882,"_71":70},"Ll905OgE",{},[],"At the First Open Hypertext Systems (OHS) Workshop held at Hypertext '94, Antoine Rizk proposed that the workshop should design a protocol for communication between hypertext client programs and link servers [30]. The motivation for his suggestion was that the OHS community was wasting much time re-implementing client programs and wrappers for existing third-party applications. The premise of his proposal was that there were many features that were common to all hypertext systems, and that if we could produce a simple protocol that all clients used, then we would have interoperability of clients, and we could concentrate on research into link services and hyperbases.",{"_32":5884,"_34":5885},[],{"_36":160,"_38":5886,"_40":557,"_42":5887,"_67":5888,"_69":5889,"_71":70},"C_Nz11m2",{},[],"This goal seemed reasonable, and in 1996, Davis et al. reported back to the second OHS workshop with a draft proposal for such a protocol [4][17]. This proposal leant heavily on the authors’ own experiences in designing Microcosm and Multicard, and it had a few unfilled sections that the authors hoped that the Workshop would help to fill. However, when viewed by a wider community the draft proposal was seen to have many limitations [1]. One of the main problems was that the original protocol dealt only in a quite specific model of point-to-point navigational hypertext, and had no way of dealing with co-operation, distribution, or other models of hypertext such as taxonomic hypertext [19], spatial hypertext [10] or features such as transclusions in Xanadu [14].",{"_32":5891,"_34":5892},[],{"_36":160,"_38":5893,"_40":557,"_42":5894,"_67":5895,"_69":5896,"_71":70},"Gz4DKuge",{},[],"As a result the community moved on from a straightforward client/server approach to a component-based approach [29]. In this architecture, component-based middleware is implemented for each hypertext domain and is responsible for mapping the specific structures required by the client into and out of the structures stored in an all-purpose back-end server. This model provides an extensible architecture where new hypertext domains can be added by defining a new interface for this domain, and implementing an appropriate client and middleware component. This is fully reported in Reich et al. [21] and has been the subject of demonstrations in recent hypertext conferences, where components and systems from different research labs have been seen to interoperate.",{"_32":5898,"_34":5899},[],{"_36":160,"_38":5900,"_40":557,"_42":5901,"_67":5902,"_69":5903,"_71":70},"MHrOYuxW",{},[],"Having designed an architecture which allows multiple hypertext domains to operate alongside each other within a single framework, the community has recently become interested in the possibility of interoperability between the different hypertext domains themselves.",{"_32":5905,"_34":5906},[],{"_36":160,"_38":5907,"_40":557,"_42":5908,"_67":5909,"_69":5910,"_71":70},"Kl5SoPD_",{},[],"There are two distinct sorts of inter-domain interoperability that one might imagine. Let us imagine that there are two workspaces, the first which is a traditional navigational hypertext workspace, and the second which is a spatial hypertext. If there were a link from a node in the first workspace to a node in the second workspace, what would be the semantics of following this link? The first and perhaps most obvious outcome would be that as the link was followed into the spatial workspace, a spatial browser would open from where the user could continue to browse. However, an interesting second possibility could be that the navigational browser could remain open, and could continue to attempt to interpret the spatial workspace as if it was a navigational workspace. It was this second interpretation of inter-domain interoperability [16], that engendered the research reported in this paper.",{"_32":5912,"_34":5913},[],{"_36":160,"_38":5914,"_40":557,"_42":5915,"_67":5916,"_69":5917,"_71":70},"_InL-0DV",{},[],"In order for one hypertext domain to be able to interpret a second hypertext domain as if it were the first, then, using the current architecture, each middleware component must be adapted so that it can translate structures in all other domains into its own domain, and this solution will exhibit quadratic growth with the number of domains that intend to interoperate. Alternatively, we could attempt to define a common storage layer which would be sufficiently generic that it could store the structures required by all current domains, and hopefully all future domains.",{"_32":5919,"_34":5920},[],{"_36":160,"_38":5921,"_40":557,"_42":5922,"_67":5923,"_69":5924,"_71":70},"xWUlYcwf",{},[],"In this paper we start by describing the characteristics, similarities and differences between three of the existing hypertext domains (navigational, spatial and taxonomic). We then describe FOHM, a fundamental open hypertext model, which identifies data and permitted operations in a client/server style architecture. A formal specification of these operations and data is presented. We demonstrate that this model is sufficient to represent all the structural abstractions and operations of these three domains. We make the conjecture that our model is general enough to support other types of domains. Although it is not formally possible in the generic case to define a mapping back from the storage layer to any other domain, we discuss ways in which we can attempt this mapping, and we conclude by discussing the consequences of achieving such mappings, and the advantages and disadvantages that domains can introduce to each other.",{"_36":870,"_38":5926,"_40":557,"_42":5927,"_67":5928,"_69":5929,"_71":70},"sb1n8929",{"_273":323},[],"INTRODUCTION",{"_32":5931,"_34":6241},[5932,5939,5955,5962,5979,6025,6112,6168],{"_32":5933,"_34":5934},[],{"_36":160,"_38":5935,"_40":557,"_42":5936,"_67":5937,"_69":5938,"_71":70},"0fwmE9ep",{},[],"The application of hypertext is often seen in navigating information spaces with the World Wide Web serving as a prominent example. However, there are many more hypertext domains, each with their own specific needs and requirements. These domains include spatial hypertext, argumentation support, taxonomic hypertext, hypermedia art, hypermedia literature and others (for an overview see Nürnberg, 1997 [15]).",{"_32":5940,"_34":5949},[5941],{"_32":5942,"_34":5943},[],{"_36":1875,"_38":5944,"_40":557,"_42":5945,"_67":5946,"_69":5947,"_71":5948},"9pCZEaUv",{"_273":323},[],"Figure 1: The OHP Node Link model","ipfs://bafkreigrbfdajuklkysv266g42kuohvwidgkk6b4zkx4xsfsviv24za3um",{"_36":160,"_38":5950,"_40":5951,"_42":5952,"_67":5953,"_69":5954,"_71":70},"AyN47W6_","bafy2bzaceczj5pkxhxdspkpve4rkqixvqqkb2gw6lvquka2wdrj74fcyowxaw",{"_273":323},[],"These hypertext domains and the systems supporting them rely on different conceptual models [27]. The ultimate overall objective common to all these conceptual models is to “understand” information spaces [24]. Different criteria for measuring this objective may apply, e.g. metrics borrowed from software engineering such as “cohesion” and “coherence” [9], and the cognitive requirements of these domains differ. However, the domains could still be used together.",{"_32":5956,"_34":5957},[],{"_36":160,"_38":5958,"_40":5951,"_42":5959,"_67":5960,"_69":5961,"_71":70},"1l65rGvP",{},[],"For example, users navigating the Web may on arrival at a “new server” start by having a spatial overview of pages (nodes) available (e.g., by using a graphical map) before navigating them. Equally, after having read a set of nodes in a navigation browser, they may want to use a taxonomic tool in order to reason about the set of nodes they have read. For example, to determine whose opinions academic papers represent.",{"_32":5963,"_34":5964},[],{"_36":160,"_38":5965,"_40":5951,"_42":5966,"_67":5967,"_69":5978,"_71":70},"6gn5G9xE",{},[5968],{"_36":166,"_167":5969,"_169":5973,"_42":5977,"_71":70},[5970,5971,5972],133,157,180,[5974,5975,5976],155,174,199,{},"In the following, we will briefly describe some of these domains and reflect on their specific properties. The domains described are navigational hypertext, spatial hypertext, and taxonomic hypertext.",{"_32":5980,"_34":6020},[5981,5988,5995,6008],{"_32":5982,"_34":5983},[],{"_36":160,"_38":5984,"_40":5951,"_42":5985,"_67":5986,"_69":5987,"_71":70},"z1YEyH06",{},[],"Navigational hypertext is concerned with partitioning information spaces into nodes and establishing relationships between them such that users can navigate them. The concept is simple but powerful and usable. Links store connections between “hotspots” in documents. By clicking on one hotspot the user navigates to the one at the other end of the link. It is probably the oldest conceptual model of hypertext and is already mentioned by the pioneers [2,6,13]. Modern Open Hypermedia Systems (OHSs) combine many features of early systems, keeping linking information separate from documents and allowing for more powerful link structures, for example bi-directional or n-ary links.",{"_32":5989,"_34":5990},[],{"_36":160,"_38":5991,"_40":5951,"_42":5992,"_67":5993,"_69":5994,"_71":70},"1YwpeXpJ",{},[],"The model that we present here follows closely the data model specified by the Open Hypermedia Systems Working Group (OHSWG) [21]. It is based firmly on the definition of several important objects that make up a link structure. Consider the two links shown in Figure 1.",{"_32":5996,"_34":5997},[],{"_36":160,"_38":5998,"_40":5951,"_42":5999,"_67":6000,"_69":6007,"_71":70},"3ArEXrQV",{},[6001],{"_36":166,"_167":6002,"_169":6004,"_42":6006,"_71":70},[6003],315,[6005],323,{},"In this diagram there are two node objects. These represent the system’s notion of a document or a file. Each node may have several anchors associated with it. These are objects that define a region inside the node to use as a hotspot (for example, there could be an anchor from word twelve to word seventeen). The endpoint objects bind an anchor to a particular link. As an anchor can be bound to several links (see anchor 2 in the Figure), the endpoint contains all the information that is relevant to this anchor in the context of one particular link.",{"_32":6009,"_34":6010},[],{"_36":160,"_38":6011,"_40":5951,"_42":6012,"_67":6013,"_69":6019,"_71":70},"bgImLFGK",{},[6014],{"_36":2026,"_167":6015,"_169":6016,"_42":6018,"_71":70},[208],[6017],129,{},"Operations applied to objects include creation and deletion primitives for all the objects in the system as well as a Follow Link function that returns a set of endpoints based on a single input endpoint parameter according to the underlying link structures.",{"_36":870,"_38":6021,"_40":5951,"_42":6022,"_67":6023,"_69":6024,"_71":70},"tyUvr8Af",{"_273":323},[],"The Navigational Domain",{"_32":6026,"_34":6107},[6027,6042,6057,6074,6086,6099],{"_32":6028,"_34":6029},[],{"_36":160,"_38":6030,"_40":5951,"_42":6031,"_67":6032,"_69":6041,"_71":70},"scvWAVyG",{},[6033],{"_36":166,"_167":6034,"_169":6037,"_42":6040,"_71":70},[6035,6036],399,412,[6038,6039],407,420,{},"This domain of hypertext is also referred to as “Information Analysis” [9] or “Information Triage” [11]. It emerged from activities like collecting, comprehending, or interpreting diverse sets of information and the need to support such activities. Thus, as opposed to navigational hypertext, what matters is the ability to create and move nodes freely. The key characteristic is to leave structure implicit and informal (at least as presented to the user) [10].",{"_32":6043,"_34":6044},[],{"_36":160,"_38":6045,"_40":5951,"_42":6046,"_67":6047,"_69":6056,"_71":70},"MB1jMZhI",{},[6048],{"_36":166,"_167":6049,"_169":6052,"_42":6055,"_71":70},[6050,6051],560,574,[6053,6054],564,578,{},"Relationships between nodes are simply expressed by their visual characteristics such as spatial proximity, color, or shape. This results in some interesting properties. If, for instance, a node is slightly misaligned with other nodes, then this might express an uncertainty about whether this node is actually part of this relationship. In other words, it expresses classification within relationships, where some nodes are “more” related than others. Spatial hypertext systems are therefore inherently flexible. Examples of spatial hypertext systems include VIKI [10] and CAOS [22].",{"_32":6058,"_34":6059},[],{"_36":160,"_38":6060,"_40":5951,"_42":6061,"_67":6062,"_69":6073,"_71":70},"BEHLbEQP",{},[6063],{"_36":166,"_167":6064,"_169":6068,"_42":6072,"_71":70},[6065,954,6066,6067],71,518,545,[6069,6070,6071,6051],76,296,523,{},"The following conceptual model therefore summarizes spatial hypertext. Nodes are visual symbols servicing as wrappers to documents, therefore they have characteristics such as color, location, and shape. Nodes can be aggregated (visually), thus building collections of related objects. Composites are the visual representations of these collections, they also have visual characteristics and therefore can also be aggregated into other composites, although this relationship may not be circular. These collections are typed, i.e., they may form lists, matrices, sets, stacks, etc. This affects their visual presentation but also acts as an organizational aid, adding both order and internal structure to the collections (e.g., one node may be placed before another, or the proximity of one node to another could reflect the strength of their association).",{"_32":6075,"_34":6076},[],{"_36":160,"_38":6077,"_40":5951,"_42":6078,"_67":6079,"_69":6085,"_71":70},"6qzROyHH",{},[6080],{"_36":166,"_167":6081,"_169":6082,"_42":6084,"_71":70},[3453,1709],[182,6083],229,{},"Any spatial system has to make all of these relationships explicit in the system so that queries can be made of the information and that visual information can be stored economically. To this end, many systems use spatial parsers to convert the implicit spatial relationships into explicit associations within the system. It is this parser that recognizes the way in which nodes have been laid down and decides on an appropriate structure to store the information such as a list or a set.",{"_32":6087,"_34":6088},[],{"_36":160,"_38":6089,"_40":5951,"_42":6090,"_67":6091,"_69":6098,"_71":70},"xq_kWYto",{},[6092],{"_36":166,"_167":6093,"_169":6095,"_42":6097,"_71":70},[6094],106,[6096],112,{},"Operations on objects include creation and deletion, adding and removing objects to composites and also a ‘zoom’ function that allows a user to zoom into a composite’s sub-components.",{"_32":6100,"_34":6101},[],{"_36":1875,"_38":6102,"_40":5951,"_42":6103,"_67":6104,"_69":6105,"_71":6106},"UB4hxOtG",{"_273":323},[],"Figure 2: Example Taxonomy","ipfs://bafkreihrmhg3ci7u35ytvcoj7tzdxamrrna5iknz2d26eekw2l7ws2udju",{"_36":870,"_38":6108,"_40":5951,"_42":6109,"_67":6110,"_69":6111,"_71":70},"apnwW6sQ",{"_273":323},[],"The Spatial Domain",{"_32":6113,"_34":6163},[6114,6121,6128,6135,6156],{"_32":6115,"_34":6116},[],{"_36":160,"_38":6117,"_40":5951,"_42":6118,"_67":6119,"_69":6120,"_71":70},"1bOTc-As",{},[],"Taxonomic hypertext applies hypertext concepts such as non-linear information access and individualized views to the domain of reasoning about taxonomies, e.g. in biology, linguistics and other application areas [19, 27, 28].",{"_32":6122,"_34":6123},[],{"_36":160,"_38":6124,"_40":5951,"_42":6125,"_67":6126,"_69":6127,"_71":70},"FbzO19R4",{},[],"For this kind of knowledge task a model based on set theory is used [27]. Users sort artifacts (the equivalent of nodes) into categories (sets) based on their characteristics. Different users may have different views of how the artifacts are partitioned. Taxonomic reasoning is the process of moving around the structure by crossing the boundaries between overlapping sets.",{"_32":6129,"_34":6130},[],{"_36":160,"_38":6131,"_40":5951,"_42":6132,"_67":6133,"_69":6134,"_71":70},"yQ1Mep8N",{},[],"Figure 2 gives an example of a Taxonomy. Here two people have categorized five artifacts. They both agree that all five lie within category one and that artifacts one and two also lie within sub-category two. However they disagree on how the remaining three artifacts should be split up. The first view (perspective one) says that artifacts four and five lie in category four while artifact three lies in category five. The second view (perspective two) agrees that artifact three should be in category five but thinks that artifacts four and five are different enough to be categorized separately (in categories six and seven respectively).",{"_32":6136,"_34":6151},[6137,6144],{"_32":6138,"_34":6139},[],{"_36":160,"_38":6140,"_40":5951,"_42":6141,"_67":6142,"_69":6143,"_71":70},"8xWySiR_",{},[],"Whenever a taxonomy splits via perspectives the same artifacts can be reached down each branch, it is merely their categorization that changes.",{"_32":6145,"_34":6146},[],{"_36":160,"_38":6147,"_40":5951,"_42":6148,"_67":6149,"_69":6150,"_71":70},"skOrhFTm",{},[],"All categories are single parented within a single taxonomy (i.e., an artifact may be in two categories only when each parent category is within a different taxonomy).",{"_36":160,"_38":6152,"_40":5951,"_42":6153,"_67":6154,"_69":6155,"_71":70},"8BUh7kzd",{"_273":2113},[],"There are two important rules that govern the shape of taxonomies.",{"_32":6157,"_34":6158},[],{"_36":160,"_38":6159,"_40":5951,"_42":6160,"_67":6161,"_69":6162,"_71":70},"R2W2DbgH",{},[],"Artifacts can be added to categories and also removed. Categories are organized hierarchically so categories may be added and removed as well. Categories cannot be circular, as this is semantically meaningless [27]. In addition some set like operations are also required so as to reason about multiple taxonomies, such as set union and intersection.",{"_36":870,"_38":6164,"_40":5951,"_42":6165,"_67":6166,"_69":6167,"_71":70},"XUyK2O3s",{"_273":323},[],"The Taxonomic Domain",{"_32":6169,"_34":6236},[6170,6218,6229],{"_32":6171,"_34":6206},[6172,6183,6195],{"_32":6173,"_34":6174},[],{"_36":160,"_38":6175,"_40":5951,"_42":6176,"_67":6177,"_69":6182,"_71":70},"houBMpnS",{},[6178],{"_36":166,"_167":6179,"_169":6180,"_42":6181,"_71":70},[3476],[998],{},"The navigational domain contains anchors that allow links to point into documents rather than be anchored on entire documents.",{"_32":6184,"_34":6185},[],{"_36":160,"_38":6186,"_40":5951,"_42":6187,"_67":6188,"_69":6194,"_71":70},"-Zagm0IS",{},[6189],{"_36":166,"_167":6190,"_169":6191,"_42":6193,"_71":70},[1573],[6192],46,{},"The spatial domain introduces typed structures (e.g., lists, sets, etc.) to the relationships.",{"_32":6196,"_34":6197},[],{"_36":160,"_38":6198,"_40":5951,"_42":6199,"_67":6200,"_69":6205,"_71":70},"caRbWtIX",{},[6201],{"_36":166,"_167":6202,"_169":6203,"_42":6204,"_71":70},[1573],[3261],{},"The taxonomic domain contains perspective objects that allow the relationship structures to diverge according to different views.",{"_36":160,"_38":6207,"_40":5951,"_42":6208,"_67":6209,"_69":6217,"_71":70},"A_p-vxLJ",{"_273":274},[6210],{"_36":166,"_167":6211,"_169":6213,"_42":6216,"_71":70},[5845,6212],197,[6214,6215],115,208,{},"There are a number of similarities between the different hypertext domains: in all domains, we find notions of data (node in navigational, visual in spatial, or artifact in taxonomic hypertext) or association (link in navigational, composite in spatial or category in taxonomic hypertext). On the other hand, there are features that only appear in a single specific hypertext domain:",{"_32":6219,"_34":6220},[],{"_36":160,"_38":6221,"_40":5951,"_42":6222,"_67":6223,"_69":6228,"_71":70},"QsrEJmth",{},[6224],{"_36":166,"_167":6225,"_169":6226,"_42":6227,"_71":70},[6094],[3339],{},"Other differences concern restricting the possible composite structures for various domains. For example, circularity is allowed in navigational hypertext but not in taxonomic or spatial. A more elaborate comparison of hypertext domains based on different features can be found in [15].",{"_32":6230,"_34":6231},[],{"_36":160,"_38":6232,"_40":5951,"_42":6233,"_67":6234,"_69":6235,"_71":70},"TqTFce8x",{},[],"In the following section we will introduce a formal model of these domains which we shall then use to explore the common ground between them.",{"_36":870,"_38":6237,"_40":5951,"_42":6238,"_67":6239,"_69":6240,"_71":70},"kQBHMlBb",{"_273":323},[],"Comparison of Domains",{"_36":870,"_38":6242,"_40":557,"_42":6243,"_67":6244,"_69":6245,"_71":70},"DwDAWDYT",{"_273":323},[],"HYPERTEXT DOMAINS",{"_32":6247,"_34":6709},[6248,6306,6365,6507,6592,6663],{"_32":6249,"_34":6301},[6250,6269,6281,6288],{"_32":6251,"_34":6252},[],{"_36":160,"_38":6253,"_40":5951,"_42":6254,"_67":6255,"_69":6268,"_71":70},"glTAzYLf",{},[6256],{"_36":166,"_167":6257,"_169":6262,"_42":6267,"_71":70},[6258,1904,6259,6260,6261],99,366,504,519,[5845,6263,6264,6265,6266],238,398,510,527,{},"There are numerous formal models of hypertexts, but they differ according to their motivation. The Dexter model [8] defines a common vocabulary and its meaning in order to talk about hypertext systems. The hypertext abstract machine (HAM) [3] is an architectural description of a general-purpose, transaction-based, multi-user server for a hypertext storage system. Furuta and Stotts’ Trellis model [7] is a formal specification of hypertexts based on petri nets. Hypertexts have also been formalized as graphs [25] or automata [12, 20].",{"_32":6270,"_34":6271},[],{"_36":160,"_38":6272,"_40":5951,"_42":6273,"_67":6274,"_69":6280,"_71":70},"1d02gLFT",{},[6275],{"_36":919,"_167":6276,"_169":6277,"_42":6279,"_71":70},[3409],[6278],110,{},"Several authors [12, 20, 23] have studied the dynamic properties of hypertexts in terms of reader’s experience, formalizing what readers see when they interact with a hypertext system.",{"_32":6282,"_34":6283},[],{"_36":160,"_38":6284,"_40":5951,"_42":6285,"_67":6286,"_69":6287,"_71":70},"utfSLmXP",{},[],"In this paper, our motivation is to make data structures and operations pertaining to them explicit, so that we can define a model that is common to the different hypertext domains and investigate interoperability.",{"_32":6289,"_34":6290},[],{"_36":160,"_38":6291,"_40":6292,"_42":6293,"_67":6294,"_69":6300,"_71":70},"5tB6i6dL","bafy2bzacebm7tcambnzaerkt3yy7e33wvap6gehwb6vwmjgzpstp5pausq6xy",{},[6295],{"_36":166,"_167":6296,"_169":6298,"_42":6299,"_71":70},[6297],163,[246],{},"Since both data and operations have to be formalized, we adopt the same approach as Moreau and Hall [12] for our formalization of a hypertext domain. We define an abstract machine characterizing the states of hypertext clients and servers. We define the client as the browser, or user interface, displaying documents, whereas the server maintains the documents and all hyperstructures in its hyperbase. Supported operations are modeled by transitions of the abstract machine, possibly changing the internal states of the client and the server. In a first instance, we do not make distribution explicit, and we consider only one server in the system.",{"_36":870,"_38":6302,"_40":5951,"_42":6303,"_67":6304,"_69":6305,"_71":70},"wnqL9tXZ",{"_273":323},[],"What is a Formalization of a Hypertext Domain?",{"_32":6307,"_34":6360},[6308,6326,6339,6346,6353],{"_32":6309,"_34":6310},[],{"_36":160,"_38":6311,"_40":6292,"_42":6312,"_67":6313,"_69":6325,"_71":70},"2f3g9jfl",{},[6314],{"_36":919,"_167":6315,"_169":6320,"_42":6324,"_71":70},[6316,6317,6318,6319],94,170,194,370,[6321,5972,6322,6323],105,220,375,{},"Let us consider the navigational domain. The first step in the formalization is to define the state space of the abstract machine. The state space not only comprises the data model but also the architectural organization. The data model defines the different data that can be encountered: node, anchor, endpoint and link. The architectural organization is composed of a store containing all hyperstructures and the state of the client, which is the currently displayed document. Multiple windows, history lists, etc. are also possible to model but are beyond the scope of this work.",{"_32":6327,"_34":6328},[],{"_36":160,"_38":6329,"_40":6292,"_42":6330,"_67":6331,"_69":6338,"_71":70},"ANUIIrqz",{},[6332],{"_36":919,"_167":6333,"_169":6335,"_42":6337,"_71":70},[6334],54,[6336],64,{},"The second step in the formalization is to define the operations that may be performed: they include creating links (or any other data), retrieving data from the store, or even performing a query such as getting endpoints for a given data.",{"_32":6340,"_34":6341},[],{"_36":160,"_38":6342,"_40":6292,"_42":6343,"_67":6344,"_69":6345,"_71":70},"Fw3JfgHh",{},[],"Given a state S1NS_1^NS1N of the navigational abstract machine, executing an operation leads to a new state S2NS_2^NS2N, which we note as:",{"_32":6347,"_34":6348},[],{"_36":1875,"_38":6349,"_40":6292,"_42":6350,"_67":6351,"_69":70,"_71":6352},"rmOSN4ws",{"_273":323},[],"ipfs://bafkreig7tchth5bkiiakexfvetrezmjsw3zvb23n2qckbwjya7fymrdske",{"_32":6354,"_34":6355},[],{"_36":160,"_38":6356,"_40":6292,"_42":6357,"_67":6358,"_69":6359,"_71":70},"CC3XJSwg",{},[],"where ↦N denotes a transition following an operation in the navigational domain. Each hypertext domain may be formalized in a similar manner, which gives us transition relations ↦S for spatial hypertext and ↦T for taxonomic hypertext.",{"_36":870,"_38":6361,"_40":6292,"_42":6362,"_67":6363,"_69":6364,"_71":70},"URWN2VkW",{"_273":323},[],"Abstract Machine Transition",{"_32":6366,"_34":6502},[6367,6386,6418,6426,6440,6453,6467,6490],{"_32":6368,"_34":6369},[],{"_36":160,"_38":6370,"_40":6292,"_42":6371,"_67":6372,"_69":6385,"_71":70},"xukLwHtc",{},[6373,6380],{"_36":919,"_167":6374,"_169":6376,"_42":6379,"_71":70},[6065,6375],234,[6377,6378],88,266,{},{"_36":166,"_167":6381,"_169":6383,"_42":6384,"_71":70},[6382],282,[954],{},"Given the similarities between the different domains we have defined a fundamental layer as composed of data structures that are general enough to “encode” any data structure of each hypertext domain. These operations and data form a fundamental open hypertext model, which we call FOHM. We also define general operations on these data structures. Figure 3 contains the data model, whereas Figure 4 displays some operations on these data, which we now describe.",{"_32":6387,"_34":6388},[],{"_36":160,"_38":6389,"_40":6292,"_42":6390,"_67":6391,"_69":6417,"_71":70},"45s4fQIC",{},[6392,6402],{"_36":166,"_167":6393,"_169":6397,"_42":6401,"_71":70},[1464,6394,6395,6396],329,471,620,[1011,6398,6399,6400],341,478,638,{},{"_36":2026,"_167":6403,"_169":6409,"_42":6416,"_71":70},[2660,6404,3339,6405,6406,6407,1917,6408],108,141,305,425,466,[2531,6278,6410,6411,6412,6413,6414,6415],119,143,306,426,444,467,{},"The set of identifiers I is formed by the union of three sets of identifiers, respectively for associations Ia, data Id, and data references Ir (abbreviated refs). Data, typically documents, are not formalized in the hypertext layer; however, as we need to refer to them, we assume the existence of a set D of Data. The set A of associations is defined by the cartesian product of three sets, respectively of binding vectors B, relation types T and structural types S. A binding is composed of a ref ID and a vector of features; the former is meant to be the identifier of a reference, which “attaches” on a document. A vector of features can be regarded as an ordered set of properties, where each property identifies a value in a set of features, such as direction of a binding, geometric property, etc. ",{"_32":6419,"_34":6420},[],{"_36":1875,"_38":6421,"_40":5951,"_42":6422,"_67":6423,"_69":6424,"_71":6425},"PJ3svp4D",{"_273":323},[],"Figure 3: The Fundamental Data Model","ipfs://bafkreigfx7lichr6aeweow23ht3wkfblokms5e6p4ge3aeog5azvxjnig4",{"_32":6427,"_34":6428},[],{"_36":160,"_38":6429,"_40":6292,"_42":6430,"_67":6431,"_69":6439,"_71":70},"GuheTwVb",{},[6432],{"_36":166,"_167":6433,"_169":6435,"_42":6438,"_71":70},[2070,6434],431,[6436,6437],193,448,{},"By construction, we require the vector of features of all the bindings in a given association to have the same dimension as the feature space vector in the association. The feature space vector enumerates, by name, the different properties that must be defined in each binding of an association: this allows clients to construct bindings that are understood by servers and other clients. We can regard the vector of features as an extensible record, whose components are identified by the feature space vector. The extensible record is a critical technique to support other hypertext domains, as it allows us to implement data structures with a variable number of features. Finally, an association is also characterized by a structural type, such as heap, list, or stack, which exhibit different behaviors when the association is traversed.",{"_32":6441,"_34":6442},[],{"_36":160,"_38":6443,"_40":6292,"_42":6444,"_67":6445,"_69":6452,"_71":70},"QCGlX0IE",{},[6446],{"_36":166,"_167":6447,"_169":6449,"_42":6451,"_71":70},[6448,185],18,[2531,6450],79,{},"We define the set Object as the union of Data, Associations and Refs. The store, which is defined as the permanent memory of a server, maps identifiers onto objects.",{"_32":6454,"_34":6455},[],{"_36":160,"_38":6456,"_40":6292,"_42":6457,"_67":6458,"_69":6466,"_71":70},"huXm8jdb",{},[6459],{"_36":2026,"_167":6460,"_169":6462,"_42":6465,"_71":70},[1892,6461],474,[6463,6464],104,497,{},"Figure 4 displays some of the operations that are permitted on the data: for instance, createAssociation expects an association and a store, and if successful, returns a new identifier for the association, and an updated store, containing a mapping between the identifier and the association. As a result, retrieving an object associated with a valid identifier is performed by applying the store to the identifier. Along the same lines, adding a binding to an association (addBindingToAssociation) consists of retrieving the association and storing a new association with a new binding in the binding vector.",{"_32":6468,"_34":6469},[],{"_36":160,"_38":6470,"_40":6292,"_42":6471,"_67":6472,"_69":6489,"_71":70},"1jjW3ZWu",{},[6473,6483],{"_36":166,"_167":6474,"_169":6478,"_42":6482,"_71":70},[6475,6476,6477,1704],60,154,442,[6479,6480,1917,6481],70,161,493,{},{"_36":2026,"_167":6484,"_169":6486,"_42":6488,"_71":70},[6485],379,[6487],396,{},"Note that the specification of all functions in Figure 4 is executable. There are however operations whose specification is not executable, which we call queries. The specification constrains the type of results such queries should produce, but it does not indicate how the result should be obtained because we do not want to preclude any implementation. For instance, the query getBindingForData returns bindings with a given feature vector f and whose Data Ref refers to a given identifier i.",{"_32":6491,"_34":6492},[],{"_36":160,"_38":6493,"_40":6292,"_42":6494,"_67":6495,"_69":6501,"_71":70},"YWmOjwI_",{},[6496],{"_36":166,"_167":6497,"_169":6498,"_42":6500,"_71":70},[2280],[6499],405,{},"It is possible to formalize a complete abstract machine, composed of a client executing a sequence of operations and a server containing a store. Transitions will be defined in terms of the supported operations, and their effect on the client and server is defined using the definitions of Figure 4. As a result, we can define a transition relation for the fundamental hypertext machine, which we note ↦ F.",{"_36":870,"_38":6503,"_40":6292,"_42":6504,"_67":6505,"_69":6506,"_71":70},"0dkHrLxX",{"_273":323},[],"A Fundamental Hypertext Layer",{"_32":6508,"_34":6587},[6509,6521,6537,6546,6552,6559,6566,6573,6580],{"_32":6510,"_34":6511},[],{"_36":160,"_38":6512,"_40":6292,"_42":6513,"_67":6514,"_69":6520,"_71":70},"wJt0oxuo",{},[6515],{"_36":166,"_167":6516,"_169":6518,"_42":6519,"_71":70},[6517],177,[5827],{},"The claim that the fundamental layer is general enough to encode any of our three selected hypertext domains may itself be formalized. For each hypertext domain, there exists a translation that converts any state of the abstract machine into a configuration of the fundamental hypertext abstract machine. Similarly, for each hypertext domain, each transition of the abstract machine may be translated into one (or more) transition(s) of the fundamental hypertext abstract machine.",{"_32":6522,"_34":6523},[],{"_36":160,"_38":6524,"_40":6292,"_42":6525,"_67":6526,"_69":6536,"_71":70},"ZfYk5iyi",{},[6527],{"_36":166,"_167":6528,"_169":6531,"_42":6535,"_71":70},[6529,6530,3339],63,98,[6532,6533,6534],65,100,123,{},"For the navigational domain, the translation function is noted Tₙ, and given a navigational state Sₙ, the expression Tₙ⟦Sₙ⟧ denotes the corresponding fundamental state.",{"_32":6538,"_34":6539},[],{"_36":1875,"_38":6540,"_40":6541,"_42":6542,"_67":6543,"_69":6544,"_71":6545},"FT_KPXXE","bafy2bzacec24kj53njhajtetvwk62g7uef453m5eor4h3d7himepsavah3ynu",{"_273":323},[],"Figure 4: Some Fundamental Functions and Queries","ipfs://bafkreiame35p55pgzxp74zmenseafiarqa7kusqmnt3rnyukvcaudwtha4",{"_32":6547,"_34":6548},[],{"_36":160,"_38":6549,"_40":6292,"_42":6550,"_67":6551,"_69":70,"_71":70},"egKqh40U",{},[],{"_32":6553,"_34":6554},[],{"_36":160,"_38":6555,"_40":6541,"_42":6556,"_67":6557,"_69":6558,"_71":70},"GIXT4KGc",{},[],"endpoint is mapped onto a binding whose feature vector contains a single entry whose value is in the set Dir. ii) A composite of the spatial domain is defined by an association with a three dimensional vector space for shape, color and location. There is no direct equivalent of a binding in the spa- tial domain, however, the translation creates such a binding, with a feature vector containing the shape, color and location of the data in the composite.",{"_32":6560,"_34":6561},[],{"_36":160,"_38":6562,"_40":6541,"_42":6563,"_67":6564,"_69":6565,"_71":70},"smr6Mfhy",{},[],"There is a strong relationship between the transition relations that we defined for each hypertext domain and the translation to the fundamental layer. It takes the form of a diamond prop- erty property, which we can state as follows. Let S₁ᴺ, S₂ᴺ be two states of the navigational domain and S₁ᶠ a state of the fundamental one. If there is a translation from S₁ᴺ to S₁ᶠ, and if there is a transition from S₁ᴺ to S₂ᴺ, then there exists S₂ᶠ, such that there is one (or more) transitions from S₁ᶠ to S₂ᶠ, and S₂ᶠ is the result of the translation of S₂ᴺ into the fundamental layer. Such a property is summarized by the following commutative diagram:",{"_32":6567,"_34":6568},[],{"_36":2026,"_38":6569,"_40":6541,"_42":6570,"_67":6571,"_69":6572,"_71":70},"VEbEg7qc",{"_2029":70},[]," S₁ᴺ ⟶ᴺ S₂ᴺ \n ↓ Tᴺ ↓ Tᴺ \n S₁ᶠ ⟶⁺ᶠ S₂ᶠ ",{"_32":6574,"_34":6575},[],{"_36":160,"_38":6576,"_40":6541,"_42":6577,"_67":6578,"_69":6579,"_71":70},"M44ka8ZH",{},[],"Similar properties also hold for the spatial and taxonomic hypertexts.",{"_32":6581,"_34":6582},[],{"_36":160,"_38":6583,"_40":6541,"_42":6584,"_67":6585,"_69":6586,"_71":70},"Odt2tt7H",{},[],"Intuitively, this property states that the fundamental layer is expressive enough to encode any of the three hypertext do- mains and simulate its behavior. We make the conjecture that our model is general enough to simulate other hypertext domains: in particular, extensible records can accommodate features that are not present in the three investigated domains.",{"_36":870,"_38":6588,"_40":6541,"_42":6589,"_67":6590,"_69":6591,"_71":70},"fCl0c2HK",{"_273":323},[],"A Translation to the Fundamental Hypertext Layer",{"_32":6593,"_34":6658},[6594,6602,6609,6616,6623,6630,6651],{"_32":6595,"_34":6596},[],{"_36":160,"_38":6597,"_40":6598,"_42":6599,"_67":6600,"_69":6601,"_71":70},"LOu_flo7","bafy2bzaceagvsgsvcpq7i2sxmlhoisk325ax4m3kj4rowt6gdvdsoi62abr3e",{},[],"Interestingly, each translation to the fundamental layer is reversible. Let us call Tᴺ⁻¹ the inverse translation of Tᴺ. The following property holds: for any state Sᴺ of the navigational hypertext machine,",{"_32":6603,"_34":6604},[],{"_36":2026,"_38":6605,"_40":6541,"_42":6606,"_67":6607,"_69":6608,"_71":70},"EZv_LUNR",{"_2029":70},[]," Tᴺ⁻¹[Tᴺ[Sᴺ]] = Sᴺ.",{"_32":6610,"_34":6611},[],{"_36":160,"_38":6612,"_40":6598,"_42":6613,"_67":6614,"_69":6615,"_71":70},"LN7KQTmU",{},[],"A similar property holds for the other translations from spatial and taxonomic. Consequently, the above commutative diagram may be rewritten as follows.",{"_32":6617,"_34":6618},[],{"_36":2026,"_38":6619,"_40":6598,"_42":6620,"_67":6621,"_69":6622,"_71":70},"EkijFwzi",{"_2029":70},[]," S₁ᴺ ⟶ᴺ S₂ᴺ \n ↓ Tᴺ ↑ Tᴺ⁻¹ \n S₁ᶠ ⟶⁺ᶠ S₂ᶠ \n",{"_32":6624,"_34":6625},[],{"_36":160,"_38":6626,"_40":6598,"_42":6627,"_67":6628,"_69":6629,"_71":70},"gfMpXSz7",{},[],"This diagram proves that the fundamental layer can be used to implement any hypertext domain. Given a state, it suffices to convert it to the fundamental representation, to perform the operation in the fundamental layer, and to convert the state back to the initial domain.",{"_32":6631,"_34":6646},[6632,6639],{"_32":6633,"_34":6634},[],{"_36":160,"_38":6635,"_40":6598,"_42":6636,"_67":6637,"_69":6638,"_71":70},"gX8ZMiyh",{},[],"behaviors of any domain can be explained in terms of the fundamental layer,",{"_32":6640,"_34":6641},[],{"_36":160,"_38":6642,"_40":6598,"_42":6643,"_67":6644,"_69":6645,"_71":70},"hqRE_-ED",{},[],"execution in the fundamental layer suffices, and domain specific information has to be converted only when made visible to the user:",{"_36":160,"_38":6647,"_40":6598,"_42":6648,"_67":6649,"_69":6650,"_71":70},"lfx2zSLa",{"_273":2113},[],"Note that we do not recommend that any hypertext is implemented by this complex double translation; however, this result shows that:",{"_32":6652,"_34":6653},[],{"_36":2026,"_38":6654,"_40":6598,"_42":6655,"_67":6656,"_69":6657,"_71":70},"mstDjIwy",{"_2029":70},[]," S₁ᴺ ⟶ᴺ S₂ᴺ \n ↑ Tᴺ⁻¹ ↑ Tᴺ⁻¹ \n S₁ᶠ ⟶⁺ᶠ S₂ᶠ ",{"_36":870,"_38":6659,"_40":6598,"_42":6660,"_67":6661,"_69":6662,"_71":70},"QVUQi-7B",{"_273":323},[],"A Fundamental Implementation Technique",{"_32":6664,"_34":6704},[6665,6678,6685,6692],{"_32":6666,"_34":6667},[],{"_36":160,"_38":6668,"_40":6598,"_42":6669,"_67":6670,"_69":6677,"_71":70},"B-uOOpS3",{},[6671],{"_36":2026,"_167":6672,"_169":6673,"_42":6676,"_71":70},[3476,6258,1032],[6674,5591,6675],52,147,{},"Note that the symmetric property Tᴺ[[Tᴺ⁻¹[Sᶠ]]] = Sᶠ does not hold because the inverse translation Tᴺ⁻¹ is not defined for any fundamental state Sᶠ. However, the inverse translation is the route to interoperability between hypertext domains.",{"_32":6679,"_34":6680},[],{"_36":160,"_38":6681,"_40":6598,"_42":6682,"_67":6683,"_69":6684,"_71":70},"SkkPSbTJ",{},[],"Inverse translations may be extended to support data that come from different domains. It then becomes possible to define the meaning of domain-specific operations on data that do not belong to that domain. For instance, mapping a navigational hypertext to spatial hypertext is defined as follows:",{"_32":6686,"_34":6687},[],{"_36":2026,"_38":6688,"_40":6598,"_42":6689,"_67":6690,"_69":6691,"_71":70},"LHr5tBOS",{"_2029":70},[],"Tₛ⁻¹[[Tᴺ[[Sᴺ]]]]",{"_32":6693,"_34":6694},[],{"_36":160,"_38":6695,"_40":6598,"_42":6696,"_67":6697,"_69":6703,"_71":70},"C3S9DJQV",{},[6698],{"_36":2026,"_167":6699,"_169":6700,"_42":6702,"_71":70},[2660],[6701],27,{},"but requires extending Tₛ⁻¹ to objects of the navigational domain.",{"_36":870,"_38":6705,"_40":6598,"_42":6706,"_67":6707,"_69":6708,"_71":70},"ajId56Ba",{"_273":323},[],"Investigating Interoperability",{"_36":870,"_38":6710,"_40":5951,"_42":6711,"_67":6712,"_69":6713,"_71":70},"bIDw6ZOu",{"_273":323},[],"FORMALIZATION",{"_32":6715,"_34":6838},[6716,6723,6745,6787,6795,6803,6810],{"_32":6717,"_34":6718},[],{"_36":160,"_38":6719,"_40":6598,"_42":6720,"_67":6721,"_69":6722,"_71":70},"Anp_4xXH",{},[],"We have already stated that there are several features that only appear in any one of the three domains. The key to creating an inverse translation is to define corresponding features in the other two domains. These features should not be arbitrary but meaningful; bringing something to the domain that was not previously present. In this section, we suggest cross-domain translations of data-structures and their consequences.",{"_32":6724,"_34":6740},[6725,6732],{"_32":6726,"_34":6727},[],{"_36":160,"_38":6728,"_40":6598,"_42":6729,"_67":6730,"_69":6731,"_71":70},"yrpDNOay",{},[],"Anchors allow navigational clients to reference parts of documents that they would otherwise have to refer to in their entirety. This is particularly useful when defining hotspots but can also be useful when defining destination points, particularly in large documents or temporal media. The notion of an anchor could easily be extended to the other domains. Allowing parts of larger documents to be organized spatially or taxonomically and improving the granularity of referencing.",{"_32":6733,"_34":6734},[],{"_36":1875,"_38":6735,"_40":6598,"_42":6736,"_67":6737,"_69":6738,"_71":6739},"sZFDldNA",{"_273":323},[],"Figure 5: Link Structures","ipfs://bafkreicw47opvk66dwkfjdtticnjhk7xv23mjbr4vsehag6qdatgjuefay",{"_36":870,"_38":6741,"_40":6598,"_42":6742,"_67":6743,"_69":6744,"_71":70},"uaTv1qmv",{"_273":323},[],"Navigational Anchors",{"_32":6746,"_34":6782},[6747,6754,6761,6768,6775],{"_32":6748,"_34":6749},[],{"_36":160,"_38":6750,"_40":6598,"_42":6751,"_67":6752,"_69":6753,"_71":70},"a9Q95ftL",{},[],"Spatial structures are different from other associations in that they contain internal structure. This provides the ability to produce sequences of nodes (using queues, lists and stacks) as well as maps that provide information about the distance of one link endpoint from another (through the use of matrixes). In taxonomic hypertext this would become another distinguishing feature of a category, allowing perspectives to split over structure as well as content. In navigation it could provide more structured movement through the information space. Navigational hypertext involves associations in two ways: traversal and arrival and each would be effected by internal structure.",{"_32":6755,"_34":6756},[],{"_36":160,"_38":6757,"_40":6598,"_42":6758,"_67":6759,"_69":6760,"_71":70},"OokOROJ3",{},[],"Traversal is the act of following a link [26]. At the moment a link is effectively a set, if it could have different internal structure then the behavior of the traversal could vary according to that structure. Arrival is the act of viewing a structure (for example at the end of a traversal). Here internal structure could effect the way in which members of the association are viewed. Table 1 shows some possible semantics for traversal and arrival over different structures.",{"_32":6762,"_34":6763},[],{"_36":160,"_38":6764,"_40":6598,"_42":6765,"_67":6766,"_69":6767,"_71":70},"igeRUQqe",{},[],"These structural types would add valuable organization to otherwise disorganized hyperwebs. For example take a look at Figure 5.",{"_32":6769,"_34":6770},[],{"_36":160,"_38":6771,"_40":6598,"_42":6772,"_67":6773,"_69":6774,"_71":70},"5Jm5TnTf",{},[],"In Figure 5, the left hand link is represented as a Set, this means it is unordered but that no endpoint (A, B, C, D and E respectively) appears more then once. The right hand link is represented as a Stack; similar to a Set except it contains some internal structure, such that endpoint A is on the top of the stack while endpoint D is on the bottom. Our link semantics dictate that when users arrive at a Set they see all of the endpoints contained, thus if users arrive at the left hand link they see all the endpoints A through E. However, when they arrive at a Stack they see only the top endpoint of the stack, so in the case of the right hand link, this means they see endpoint A.",{"_32":6776,"_34":6777},[],{"_36":160,"_38":6778,"_40":6598,"_42":6779,"_67":6780,"_69":6781,"_71":70},"hEf2YK48",{},[],"When traversing a link the user always uses an endpoint that is a member of that link as a starting point. When traversing a Set the user arrives at all the endpoints except the starting one. So if the user started from endpoint B on the left hand...",{"_36":870,"_38":6783,"_40":6598,"_42":6784,"_67":6785,"_69":6786,"_71":70},"LksjSwDA",{"_273":323},[],"Spatial Structures",{"_32":6788,"_34":6789},[],{"_36":1875,"_38":6790,"_40":6598,"_42":6791,"_67":6792,"_69":6793,"_71":6794},"8RYyvPaH",{"_273":323},[],"Table 1: Semantics of Traversal and Arrival","ipfs://bafkreiceuhuiti57awh3bcdp5sk2k5h76eiyqll3fkaiumug44fjxvezom",{"_32":6796,"_34":6797},[],{"_36":1875,"_38":6798,"_40":6598,"_42":6799,"_67":6800,"_69":6801,"_71":6802},"tygrC2gm",{"_273":323},[],"Figure 6: A Perspective over two Nodes","ipfs://bafkreidpg6ldyidkz63j5pveifdnh2pngq67m3okie54kcebu43etanoyy",{"_32":6804,"_34":6805},[],{"_36":160,"_38":6806,"_40":6598,"_42":6807,"_67":6808,"_69":6809,"_71":70},"EanKWN17",{},[],"link then they would arrive at endpoints A, C, D and E. However, when a user traverses a stack they arrive at the endpoints to either side of their starting point. So if they started from endpoint B on the right hand link then they would arrive only at endpoints A and C.",{"_32":6811,"_34":6833},[6812,6819,6826],{"_32":6813,"_34":6814},[],{"_36":160,"_38":6815,"_40":6598,"_42":6816,"_67":6817,"_69":6818,"_71":70},"gqED_tf3",{},[],"Taxonomic perspectives allow different views of the organizations of some set of nodes within a branch of a hierarchy. Perspective is an abstraction that is in many ways similar to that of “context” as used in some navigational hypertext systems. Although a definition of context is beyond the scope of this paper (for an overview see [5]), it is generally understood that data (nodes and links etc.) will be arranged in a number of different contexts, and that the arrangement that will be seen by a user will depend in some way on a model that is known about this user, for example, what they have seen before, or their skill level.",{"_32":6820,"_34":6821},[],{"_36":160,"_38":6822,"_40":6598,"_42":6823,"_67":6824,"_69":6825,"_71":70},"6Uk28cpw",{},[],"Modeling perspectives as associations has the interesting property of allowing users to move between the different views just as if you were following a link. It also provides a convenient way of choosing a view. For example, in Figure 6, arriving by link 2 takes you directly into a particular view, whereas arriving by link 1 takes you to the perspective itself, where the system (or the user) can decide which view to provide. These are very much the properties that are required by context in other hypertext systems.",{"_32":6827,"_34":6828},[],{"_36":160,"_38":6829,"_40":6598,"_42":6830,"_67":6831,"_69":6832,"_71":70},"FjsEhPNc",{},[],"FOHM does not currently have any model of context, but these observations indicate the need for this extension, and demonstrate the way in which the features of one domain can add to and improve the features in another.",{"_36":870,"_38":6834,"_40":6598,"_42":6835,"_67":6836,"_69":6837,"_71":70},"CyQKTsGQ",{"_273":323},[],"Taxonomic Perspectives",{"_36":870,"_38":6839,"_40":6598,"_42":6840,"_67":6841,"_69":6842,"_71":70},"V8exs9wm",{"_273":323},[],"INTEROPERABILITY BETWEEN DOMAINS",{"_32":6844,"_34":6901},[6845,6852,6859,6866,6873,6880,6887,6894],{"_32":6846,"_34":6847},[],{"_36":160,"_38":6848,"_40":6598,"_42":6849,"_67":6850,"_69":6851,"_71":70},"NmY6-KkC",{},[],"Inter-domain interoperability is a relatively new concern to the hypermedia community. This paper has presented one solution involving the definition of FOHM, a common model capable of representing structures and implementing operations from any of the three domains presented. Thanks to our use of extensible records, we make the conjecture that FOHM is general enough to support other hypertext domains.",{"_32":6853,"_34":6854},[],{"_36":160,"_38":6855,"_40":6598,"_42":6856,"_67":6857,"_69":6858,"_71":70},"SoNsfJ6P",{},[],"This is somewhat in contrast to [21] where a dynamic arrangement of middleware components (known as structure servers) are responsible for dealing with the differing semantics of various domains stored in a storage layer. The advantage of this is that the system is able to cope with a wide range of different domains and adapt to the introduction of new ones. However, because it is not known which structure servers will be built on top of the storage layer the interface between the two has to be very general and system performance can suffer as a result. FOHM avoids these problems because it restricts itself to three common domains and is therefore able to “know” about certain fundamental properties (such as structure type). An additional advantage is that frontend entities serving one domain (e.g. navigational hypertext) are to a certain extent able to reason about other domains (e.g. spatial hypertext).",{"_32":6860,"_34":6861},[],{"_36":160,"_38":6862,"_40":6598,"_42":6863,"_67":6864,"_69":6865,"_71":70},"SK8qn9fs",{},[],"In particular FOHM captures the hypertext structure of the various domains so that middleware components become optional rather than a necessity and clients inherit the responsibility of fulfilling structural requirements. For example a link created in a navigational client would need to be interpreted as a set by a spatial browser. In FOHM no interpretation is needed as the concept of association structure (lists, sets etc.) is captured in the model. In other words both navigational and spatial browsers know about sets and therefore the navigational client would already have added this itself.",{"_32":6867,"_34":6868},[],{"_36":160,"_38":6869,"_40":6598,"_42":6870,"_67":6871,"_69":6872,"_71":70},"uZjFeDuj",{},[],"Non-critical information that has not been captured in the model could still be dealt with by middleware. Presentation information, such as color, is a particularly good example. In this case it is the responsibility of either the client or the server to use sensible defaults to fill in information that it requires but that is not stipulated in the model. Such information is dependent on that particular client or server (for example a client that displays only greyscale) and has no place in the model presented here.",{"_32":6874,"_34":6875},[],{"_36":160,"_38":6876,"_40":6598,"_42":6877,"_67":6878,"_69":6879,"_71":70},"4Rk-49yw",{},[],"We have also shown that the exercise of defining a common model for these selected hypertext domains potentially results in a type of “cross fertilization” in that domains may benefit from each other. For instance, structure types as required in spatial hypertext may well be applied to navigation or taxonomic hypertext as well. Equally, perspectives as known from taxonomic hypertext contribute to both the other domains. It is particularly interesting to note that the functionality added seems to reflect many of the features previously worked into hypermedia systems. For example perspectives seem to reflect the need for context and when viewed in a navigational browser lists appear to be very similar to the notion of a tour or a trail.",{"_32":6881,"_34":6882},[],{"_36":160,"_38":6883,"_40":6598,"_42":6884,"_67":6885,"_69":6886,"_71":70},"pDgLgLZb",{},[],"We believe that the fact that FOHM reflects these requirements is very encouraging and intend to extend the formal definition to include the inverse mappings described. In addition a comprehensive set of structural types needs to be decided and the semantics of link traversal and arrival on these structures defined.",{"_32":6888,"_34":6889},[],{"_36":160,"_38":6890,"_40":6598,"_42":6891,"_67":6892,"_69":6893,"_71":70},"30QmMO8y",{},[],"As a practical proof of concept a navigational and a spatial browser have been implemented, both of which use the FOHM server. It is envisaged that a taxonomic browser will also be written with the intention of exploring the quality and validity of macro-structures (such as a whole taxonomic hierarchy) that have been through a map-inverse map process.",{"_32":6895,"_34":6896},[],{"_36":160,"_38":6897,"_40":6598,"_42":6898,"_67":6899,"_69":6900,"_71":70},"TlqkzBh0",{},[],"The potential of FOHM to be included in the component based approach also needs to be evaluated. For example it could build a basis for a structural computing environment [18]. The model forms a layer that is both general enough to serve multiple domains and specific enough to allow the particular features of these domains to be expressed fully. Most importantly, by identifying the commonalities of the domains, it minimizes the performance cost normally associated with such a generic approach.",{"_36":870,"_38":6902,"_40":6598,"_42":6903,"_67":6904,"_69":6905,"_71":70},"8qRPX7bI",{"_273":323},[],"SUMMARY AND CONCLUSIONS",{"_32":6907,"_34":7363},[6908,6923,6938,6954,6973,6989,7000,7016,7032,7047,7063,7078,7093,7108,7119,7137,7153,7170,7185,7201,7218,7235,7251,7267,7282,7300,7316,7333,7348],{"_32":6909,"_34":6910},[],{"_36":160,"_38":6911,"_40":6598,"_42":6912,"_67":6913,"_69":6922,"_71":70},"sgEcn16H",{},[6914,6918],{"_36":166,"_167":6915,"_169":6916,"_42":6917,"_71":70},[137],[6674],{},{"_36":919,"_167":6919,"_169":6920,"_42":6921,"_71":70},[225],[1805],{},"Anderson, K. M., Taylor, R. N., and Whitehead, E. J. A critique of the open hypermedia protocol. Journal of Digital Information (JoDI). Special Issue on Open Hypermedia Systems 1, 2 (1997).",{"_32":6924,"_34":6925},[],{"_36":160,"_38":6926,"_40":6598,"_42":6927,"_67":6928,"_69":6937,"_71":70},"xHYuuq34",{},[6929,6933],{"_36":166,"_167":6930,"_169":6931,"_42":6932,"_71":70},[137],[240],{},{"_36":919,"_167":6934,"_169":6935,"_42":6936,"_71":70},[3363],[3545],{},"Bush, V. As we may think. The Atlantic Monthly 176, 1 (1945), 101–108.",{"_32":6939,"_34":6940},[],{"_36":160,"_38":6941,"_40":6598,"_42":6942,"_67":6943,"_69":6953,"_71":70},"SIYYqzQ7",{},[6944,6948],{"_36":166,"_167":6945,"_169":6946,"_42":6947,"_71":70},[137],[987],{},{"_36":919,"_167":6949,"_169":6951,"_42":6952,"_71":70},[6950],84,[6096],{},"Campbell, B., and Goodman, J. M. HAM: A General Purpose Hypertext Abstract Machine. Communications of the ACM 31, 7 (July 1988), 856–861.",{"_32":6955,"_34":6956},[],{"_36":160,"_38":6957,"_40":6598,"_42":6958,"_67":6959,"_69":6972,"_71":70},"Tp5QY08U",{},[6960,6964],{"_36":166,"_167":6961,"_169":6962,"_42":6963,"_71":70},[137],[998],{},{"_36":919,"_167":6965,"_169":6968,"_42":6971,"_71":70},[6966,6967,3126],107,204,[973,6969,6970],215,338,{},"Davis, H. C., Rizk, A., and Lewis, A. J. OHP: A draft proposal for a standard open hypermedia protocol. In Proceedings of the 2nd Workshop on Open Hypermedia Systems, ACM Hypertext ’96, Washington, D.C., March 16–20. Available as Report No. ICS-TR-96-10 from the Dept. of Information and Computer Science, University of California, Irvine (1996), U. K. Wiil and S. Demeyer, Eds., pp. 27–53.",{"_32":6974,"_34":6975},[],{"_36":160,"_38":6976,"_40":6598,"_42":6977,"_67":6978,"_69":6988,"_71":70},"oYlJLIw_",{},[6979,6984],{"_36":166,"_167":6980,"_169":6981,"_42":6983,"_71":70},[137],[6982],10,{},{"_36":919,"_167":6985,"_169":6986,"_42":6987,"_71":70},[6258],[6017],{},"Dervin, B. Given a context by any other name: Methodological tools for taming the unruly beast. In Information Seeking in Context (1997), Taylor Graham, London, pp. 13–38.",{"_32":6990,"_34":6991},[],{"_36":160,"_38":6992,"_40":6598,"_42":6993,"_67":6994,"_69":6999,"_71":70},"WRT7LqDn",{},[6995],{"_36":166,"_167":6996,"_169":6997,"_42":6998,"_71":70},[137],[1488],{},"Engelbart, D. C. Augmenting human intellect: A conceptual framework. Tech. Rep. AFOSR-3223, Contract AF 49(638)-1024, Stanford Research Institute Technical Report, Palo Alto, CA, Oct. 1962.",{"_32":7001,"_34":7002},[],{"_36":160,"_38":7003,"_40":6598,"_42":7004,"_67":7005,"_69":7015,"_71":70},"yvTQeBJF",{},[7006,7010],{"_36":166,"_167":7007,"_169":7008,"_42":7009,"_71":70},[137],[3407],{},{"_36":919,"_167":7011,"_169":7013,"_42":7014,"_71":70},[7012],77,[6463],{},"Furuta, R., and Stotts, P. D. Programmable Browsing Semantics in Trellis. In Proceedings of Hypertext’89 (Nov. 1989), pp. 27–42.",{"_32":7017,"_34":7018},[],{"_36":160,"_38":7019,"_40":6598,"_42":7020,"_67":7021,"_69":7031,"_71":70},"PjPt2vxQ",{},[7022,7026],{"_36":166,"_167":7023,"_169":7024,"_42":7025,"_71":70},[137],[3374],{},{"_36":919,"_167":7027,"_169":7029,"_42":7030,"_71":70},[7028],67,[921],{},"Halasz, F., and Schwartz, M. The dexter hypertext reference model. Communications of the ACM 37, 2 (1994), 30–39.",{"_32":7033,"_34":7034},[],{"_36":160,"_38":7035,"_40":6598,"_42":7036,"_67":7037,"_69":7046,"_71":70},"L_Zduggd",{},[7038,7042],{"_36":166,"_167":7039,"_169":7040,"_42":7041,"_71":70},[137],[1011],{},{"_36":919,"_167":7043,"_169":7044,"_42":7045,"_71":70},[2660],[5576],{},"Lowe, D., and Hall, W. Hypermedia & the Web. An Engineering Approach. John Wiley & Sons, Chichester, 1999.",{"_32":7048,"_34":7049},[],{"_36":160,"_38":7050,"_40":6598,"_42":7051,"_67":7052,"_69":7062,"_71":70},"KlZ4FrXI",{},[7053,7057],{"_36":166,"_167":7054,"_169":7055,"_42":7056,"_71":70},[137],[2261],{},{"_36":919,"_167":7058,"_169":7059,"_42":7061,"_71":70},[225],[7060],182,{},"Marshall, C. C., and Shipman, F. M. Spatial hypertext and the practice of information triage. In Proceedings of the ’97 ACM Conference on Hypertext, April 6-11, 1997, Southampton, UK (1997), pp. 124–133.",{"_32":7064,"_34":7065},[],{"_36":160,"_38":7066,"_40":6598,"_42":7067,"_67":7068,"_69":7077,"_71":70},"2wHbzY6K",{},[7069,7073],{"_36":166,"_167":7070,"_169":7071,"_42":7072,"_71":70},[137],[2531],{},{"_36":919,"_167":7074,"_169":7075,"_42":7076,"_71":70},[1543],[227],{},"Moreau, L., and Hall, W. On the Expressiveness of Links in Hypertext Systems. The Computer Journal 41, 7 (1998), 459–473.",{"_32":7079,"_34":7080},[],{"_36":160,"_38":7081,"_40":6598,"_42":7082,"_67":7083,"_69":7092,"_71":70},"U3Bh85-L",{},[7084,7088],{"_36":166,"_167":7085,"_169":7086,"_42":7087,"_71":70},[137],[1520],{},{"_36":919,"_167":7089,"_169":7090,"_42":7091,"_71":70},[1000],[1892],{},"Nelson, T. H. Getting it out of our system. In Information Retrieval: A Critical Review, G. Schechter, Ed. Thompson Books, Washington, D.C., 1967, pp. 191–210.",{"_32":7094,"_34":7095},[],{"_36":160,"_38":7096,"_40":6598,"_42":7097,"_67":7098,"_69":7107,"_71":70},"weCav6DK",{},[7099,7103],{"_36":166,"_167":7100,"_169":7101,"_42":7102,"_71":70},[137],[1520],{},{"_36":919,"_167":7104,"_169":7105,"_42":7106,"_71":70},[171],[987],{},"Nelson, T. H. Literary Machines. Published by the author. Mindful Press, 1987.",{"_32":7109,"_34":7110},[],{"_36":160,"_38":7111,"_40":6598,"_42":7112,"_67":7113,"_69":7118,"_71":70},"eZM2yF9i",{},[7114],{"_36":166,"_167":7115,"_169":7116,"_42":7117,"_71":70},[137],[2828],{},"Nürnberg, P. J. HOSS: An Environment to Support Structural Computing. PhD thesis, Department of Computer Science, Texas A&M University, College Station, TX, 1997.",{"_32":7120,"_34":7121},[],{"_36":160,"_38":7122,"_40":6598,"_42":7123,"_67":7124,"_69":7136,"_71":70},"dH6jW6ma",{},[7125,7130],{"_36":166,"_167":7126,"_169":7127,"_42":7129,"_71":70},[137],[7128],83,{},{"_36":919,"_167":7131,"_169":7133,"_42":7135,"_71":70},[7132],162,[7134],201,{},"Nürnberg, P. J., Grønbæk, K., Bucka-Lassen, D., Pedersen, C. A., and Reinert, O. A. A component-based open hypermedia approach to integrating structure services. New Review of Hypermedia and Multimedia (1999). Accepted for publication.",{"_32":7138,"_34":7139},[],{"_36":160,"_38":7140,"_40":6598,"_42":7141,"_67":7142,"_69":7152,"_71":70},"M4fmKLV3",{},[7143,7147],{"_36":166,"_167":7144,"_169":7145,"_42":7146,"_71":70},[137],[2261],{},{"_36":919,"_167":7148,"_169":7149,"_42":7151,"_71":70},[185],[7150],153,{},"Nürnberg, P. J., and Leggett, J. J. A vision for open hypermedia systems. Journal of Digital Information (JoDI). Special Issue on Open Hypermedia Systems 1, 2 (1997).",{"_32":7154,"_34":7155},[],{"_36":160,"_38":7156,"_40":6598,"_42":7157,"_67":7158,"_69":7169,"_71":70},"maeJ5TG2",{},[7159,7164],{"_36":166,"_167":7160,"_169":7161,"_42":7163,"_71":70},[137],[7162],53,{},{"_36":919,"_167":7165,"_169":7166,"_42":7168,"_71":70},[6950],[7167],169,{},"Nürnberg, P. J., Leggett, J. J., and Schneider, E. R. As we should have thought. In Proceedings of the ’97 ACM Conference on Hypertext, April 6-11, 1997, Southampton, UK (1997), pp. 96–101.",{"_32":7171,"_34":7172},[],{"_36":160,"_38":7173,"_40":6598,"_42":7174,"_67":7175,"_69":7184,"_71":70},"kRzSQ5ij",{},[7176,7180],{"_36":166,"_167":7177,"_169":7178,"_42":7179,"_71":70},[137],[7162],{},{"_36":919,"_167":7181,"_169":7182,"_42":7183,"_71":70},[6278],[6675],{},"Nürnberg, P. J., Schneider, E. R., and Leggett, J. J. Designing digital libraries for the hyper-literate age. Journal of Universal Computer Science 2, 9 (1996).",{"_32":7186,"_34":7187},[],{"_36":160,"_38":7188,"_40":6598,"_42":7189,"_67":7190,"_69":7200,"_71":70},"nogR1f1B",{},[7191,7195],{"_36":166,"_167":7192,"_169":7193,"_42":7194,"_71":70},[137],[240],{},{"_36":919,"_167":7196,"_169":7197,"_42":7199,"_71":70},[1412],[7198],132,{},"Park, S. Structural Properties of Hypertext. In Proceedings of the ’98 ACM Conference on Hypertext, June 20-24, 1998, Pittsburgh, PA (1998), pp. 180–187.",{"_32":7202,"_34":7203},[],{"_36":160,"_38":7204,"_40":6598,"_42":7205,"_67":7206,"_69":7217,"_71":70},"lWrW--pT",{},[7207,7211],{"_36":166,"_167":7208,"_169":7209,"_42":7210,"_71":70},[137],[3339],{},{"_36":919,"_167":7212,"_169":7214,"_42":7216,"_71":70},[7213],210,[7215],249,{},"Reich, S., Wiil, U. K., Nürnberg, P. J., Davis, H. C., Grønbæk, K., Anderson, K. M., Millard, D. E., and Haake, J. M. Addressing interoperability in open hypermedia: The design of the open hypermedia protocol. New Review of Hypermedia and Multimedia (1999). Accepted for publication.",{"_32":7219,"_34":7220},[],{"_36":160,"_38":7221,"_40":6598,"_42":7222,"_67":7223,"_69":7234,"_71":70},"d4YfUqaU",{},[7224,7228],{"_36":166,"_167":7225,"_169":7226,"_42":7227,"_71":70},[137],[7028],{},{"_36":919,"_167":7229,"_169":7231,"_42":7233,"_71":70},[7230],172,[7232],264,{},"Reinert, O., Bucka-Lassen, D., Pedersen, C. A., and Nürnberg, P. J. CAOS: A collaborative and open spatial structure service component with incremental spatial parsing. In Proceedings of the ’99 ACM Conference on Hypertext, February 21-25, 1999, Darmstadt, Germany (Feb. 1999), pp. 49–50.",{"_32":7236,"_34":7237},[],{"_36":160,"_38":7238,"_40":6598,"_42":7239,"_67":7240,"_69":7250,"_71":70},"A0f8tK2m",{},[7241,7245],{"_36":166,"_167":7242,"_169":7243,"_42":7244,"_71":70},[137],[3407],{},{"_36":919,"_167":7246,"_169":7247,"_42":7249,"_71":70},[6479],[7248],128,{},"Stotts, P. D., and Furuta, R. Hypertext 2000: Databases or documents? Electronic Publishing—Origination Dissemination and Design 4 (June 1991), 119–122.",{"_32":7252,"_34":7253},[],{"_36":160,"_38":7254,"_40":6598,"_42":7255,"_67":7256,"_69":7266,"_71":70},"O-YMGikl",{},[7257,7262],{"_36":166,"_167":7258,"_169":7259,"_42":7261,"_71":70},[137],[7260],44,{},{"_36":919,"_167":7263,"_169":7264,"_42":7265,"_71":70},[6533],[3376],{},"Thüring, M., Hannemann, J., and Haake, J. M. Hypermedia and cognition: Designing for comprehension. Communications of the ACM 38, 8 (Aug. 1995), 57–66.",{"_32":7268,"_34":7269},[],{"_36":160,"_38":7270,"_40":6598,"_42":7271,"_67":7272,"_69":7281,"_71":70},"_ws_sbH6",{},[7273,7277],{"_36":166,"_167":7274,"_169":7275,"_42":7276,"_71":70},[137],[1542],{},{"_36":919,"_167":7278,"_169":7279,"_42":7280,"_71":70},[7028],[6094],{},"Tompa, F. W. A Data Model for Flexible Hypertext Database Systems. ACM Transactions of Information Systems 7, 1 (Jan. 1989), 85–100.",{"_32":7283,"_34":7284},[],{"_36":160,"_38":7285,"_40":6598,"_42":7286,"_67":7287,"_69":7299,"_71":70},"d_4SMxnE",{},[7288,7292],{"_36":166,"_167":7289,"_169":7290,"_42":7291,"_71":70},[137],[1476],{},{"_36":919,"_167":7293,"_169":7295,"_42":7298,"_71":70},[185,7294],192,[7296,7297],191,301,{},"Trigg, R. A straw model for link traversal in open hypermedia systems. In Proceedings of the 4th Workshop on Open Hypermedia Systems, ACM Hypertext ’98 Conference, Pittsburgh, PA, June 20-24. Available as Report No. CS-98-01 from the Dept. of Computer Science, 6700 Aalborg University Esbjerg, Denmark (1998), pp. 69–62.",{"_32":7301,"_34":7302},[],{"_36":160,"_38":7303,"_40":6598,"_42":7304,"_67":7305,"_69":7315,"_71":70},"H0ZfrZpN",{},[7306,7311],{"_36":166,"_167":7307,"_169":7308,"_42":7310,"_71":70},[137],[7309],20,{},{"_36":919,"_167":7312,"_169":7313,"_42":7314,"_71":70},[6377],[2070],{},"Van Dyke Parunak, H. Don’t link me in: Set-based hypermedia for taxonomic reasoning. In Proceedings of the ’91 ACM Conference on Hypertext, Dec. 15-18, 1991, San Antonio, TX (1991), pp. 233–242.",{"_32":7317,"_34":7318},[],{"_36":160,"_38":7319,"_40":6598,"_42":7320,"_67":7321,"_69":7332,"_71":70},"ErxMUyyd",{},[7322,7326],{"_36":166,"_167":7323,"_169":7324,"_42":7325,"_71":70},[137],[7309],{},{"_36":919,"_167":7327,"_169":7329,"_42":7331,"_71":70},[7328],102,[7330],183,{},"Van Dyke Parunak, H. Hypercubes grow on trees (and other observations from the land of hypersets). In Proceedings of the ’93 ACM Conference on Hypertext, Nov. 14-18, 1993, Seattle, WA (1993), pp. 73–81.",{"_32":7334,"_34":7335},[],{"_36":160,"_38":7336,"_40":6598,"_42":7337,"_67":7338,"_69":7347,"_71":70},"UVwCubLJ",{},[7339,7343],{"_36":166,"_167":7340,"_169":7341,"_42":7342,"_71":70},[137],[987],{},{"_36":919,"_167":7344,"_169":7345,"_42":7346,"_71":70},[5591],[7296],{},"Wiil, U. K., and Nürnberg, P. J. Evolving hypermedia middleware services: Lessons and observations. In Proceedings of of the 1999 ACM Symposium on Applied Computing (SAC ’99), San Antonio, TX (Feb. 1999), pp. 427–436.",{"_32":7349,"_34":7350},[],{"_36":160,"_38":7351,"_40":6598,"_42":7352,"_67":7353,"_69":7362,"_71":70},"Ke-E0qei",{},[7354,7358],{"_36":166,"_167":7355,"_169":7356,"_42":7357,"_71":70},[137],[1573],{},{"_36":919,"_167":7359,"_169":7360,"_42":7361,"_71":70},[1013],[6258],{},"Wiil, U. K., and Østerbye, K., Eds. Proceedings of the ECHT ’94 Workshop on Open Hypermedia Systems (1994). Technical Report R-94-2038, Dept. of Computer Science, Aalborg University.",{"_36":870,"_38":7364,"_40":6598,"_42":7365,"_67":7366,"_69":7367,"_71":70},"v9cy-d2J",{"_273":2113},[],"REFERENCES",[279],"/records/fohm-a-fundamental-open-hypertext-model-for-investigating-interoperability-between-hypertext-domains","2025-07-06T21:35:17.922Z",{"_83":570},{},{"_38":544,"_95":54,"_55":7374,"_72":547,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,546],1773151562855,[149,544,547,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/fohm-a-fundamental-open-hypertext-model-for-investigating-interoperability-between-hypertext-domains\",\"bafy2bzaceazfbkeiizkojnccrl2op4rrtmd34c2k2g3ig6vwstm7aky6k7cnm\",true]",{"_110":7379,"_147":7500,"_150":7501},{"_112":7380,"_131":132,"_133":7499,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":7381,"_38":7497},{"_29":7382,"_72":576,"_73":54,"_74":7493,"_55":7494,"_77":583,"_79":583,"_81":7495,"_85":7496,"_87":576,"_89":90},[7383,7390,7397,7404,7411,7418,7430,7437,7444,7451,7458,7465,7472,7479,7486],{"_32":7384,"_34":7385},[],{"_36":1875,"_38":7386,"_40":576,"_42":7387,"_67":7388,"_69":70,"_71":7389},"p4AMUIgQ",{"_273":323},[],"ipfs://bafkreiewyltfarlgdabtxg2xweqwqrjpgdfpqrnx2xtb5dy6674jrjuefm",{"_32":7391,"_34":7392},[],{"_36":160,"_38":7393,"_40":576,"_42":7394,"_67":7395,"_69":7396,"_71":70},"-DF73eNe",{},[],"Douglas C. Engelbart Stanford Research Institute Menlo Park, California",{"_32":7398,"_34":7399},[],{"_36":160,"_38":7400,"_40":576,"_42":7401,"_67":7402,"_69":7403,"_71":70},"XXw4jC7M",{},[],"May 24, 1962",{"_32":7405,"_34":7406},[],{"_36":160,"_38":7407,"_40":576,"_42":7408,"_67":7409,"_69":7410,"_71":70},"wf6V5Qjp",{},[],"Dr. Vannevar Bush Professor Emeritus Massachusetts Institute of Technology Cambridge, Massachusetts",{"_32":7412,"_34":7413},[],{"_36":160,"_38":7414,"_40":576,"_42":7415,"_67":7416,"_69":7417,"_71":70},"ecXgnTvS",{},[],"Dear Dr. Bush:",{"_32":7419,"_34":7420},[],{"_36":160,"_38":7421,"_40":576,"_42":7422,"_67":7423,"_69":7429,"_71":70},"SNRapKYU",{},[7424],{"_36":204,"_167":7425,"_169":7426,"_42":7427,"_71":7428},[6533],[208],{},"https://web.archive.org/web/20110730055322/http://sloan.stanford.edu/mousesite/Secondary/Bushframe.html","I wish permission from you to extract lengthy and definitely acknowledged quotes from your article, \"As We May Think,\" that appeared in The Atlantic Monthly, July, 1945. These quotes would appear in a report that I am writing for the Air Force Office of Scientific Research, and I am sending a parallel request to The Atlantic Monthly.",{"_32":7431,"_34":7432},[],{"_36":160,"_38":7433,"_40":576,"_42":7434,"_67":7435,"_69":7436,"_71":70},"Ff-7FExs",{},[],"For your information I am enclosing a relatively brief and quite general writeup describing the program that I am trying to develop here at Stanford Research Institute. The report which I am writing (and for which I am requesting quotation permission from you) is a detailed description of the conceptual structure that I have developed over the years to orient my pursuit of this objective of increasing the individual human's intellectual effectiveness. It will also contain a number of examples of the way in which new equipment can lead to new methods and improved effectiveness, to illustrate my more general (but nonnumerical) framework, and your article is quite the best that I have found in print to offer examples of this.",{"_32":7438,"_34":7439},[],{"_36":160,"_38":7440,"_40":576,"_42":7441,"_67":7442,"_69":7443,"_71":70},"6Ok4zA2B",{},[],"I might add that this article of yours has probably influenced me quite basically. I remember finding it and avidly reading it in a Red Cross library on the edge of the jungle on Leyte, one of the Phillipine [sic] Islands, in the Fall of 1945. Subsequently, l went back and finished my B.S. in E.E. after the war (Oregon State), and worked for the NACA at Moffett Field (near here) until 1951, when I got fed up with my goalless role. I formulated then the goal for which this program represents the pursuit vehicle, spent years in graduate school at the University of California (Berkeley), taught there a while, and finally ended up here-- choosing SRI as a place where I would have a good chance to work toward developing such a program. I had had almost nothing but negative reactions from people up to then, and for several years here, too.",{"_32":7445,"_34":7446},[],{"_36":160,"_38":7447,"_40":576,"_42":7448,"_67":7449,"_69":7450,"_71":70},"uLK39BOg",{},[],"But the climate has changed of late, and for two years I have personally been able to spend almost full time trying to lay the conceptual groundwork for launching a serious research program on \"human intellectual effectiveness.\" I think I have a good approach developed for such a program, and we are trying to get it supported and started. Our OSR support has been for half of my time in this pre-program study, and the report for them will hopefully lay out considerations and reasoning that can show most readers where the promise and possibilities are for future improvement of our intellectual capability, and what is a reasonable approach to pursue these possibilities.",{"_32":7452,"_34":7453},[],{"_36":160,"_38":7454,"_40":576,"_42":7455,"_67":7456,"_69":7457,"_71":70},"qMpJYwX8",{},[],"I re-discovered your article about three years ago, and was rather startled to realize how much I had aligned my sights along the vector you had described. I wouldn't be surprised at all if the reading of this article sixteen and a half years ago hadn't had a real influence upon the course of my thoughts and actions.",{"_32":7459,"_34":7460},[],{"_36":160,"_38":7461,"_40":576,"_42":7462,"_67":7463,"_69":7464,"_71":70},"7jOFHNXI",{},[],"If you still have interest in this area and have the time and energy to give it some occasional consideration, l would be most happy to send you a copy of the report. (It is more than just a report to a government agency. For me it is more the public debut of a dream, and the overdue birth attests to my emotional involvement.)",{"_32":7466,"_34":7467},[],{"_36":160,"_38":7468,"_40":576,"_42":7469,"_67":7470,"_69":7471,"_71":70},"IBdD-V09",{},[],"Thank you for your consideration.",{"_32":7473,"_34":7474},[],{"_36":160,"_38":7475,"_40":576,"_42":7476,"_67":7477,"_69":7478,"_71":70},"vp1UxcBQ",{},[],"Sincerely,",{"_32":7480,"_34":7481},[],{"_36":160,"_38":7482,"_40":576,"_42":7483,"_67":7484,"_69":7485,"_71":70},"UtuD5XVo",{},[],"Douglas C. Engelbart",{"_32":7487,"_34":7488},[],{"_36":160,"_38":7489,"_40":576,"_42":7490,"_67":7491,"_69":7492,"_71":70},"XcfL-Vuc",{},[],"Senior Research Engineer",[54],"/records/letter-to-vannevar-bush-from-engelbart",{"_83":592},{},{"_38":573,"_95":54,"_55":7498,"_72":576,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,575],1773151562846,[149,573,576,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/letter-to-vannevar-bush-from-engelbart\",\"bafy2bzaceapz6vfyjvnouujsswjhsgtdhxldaa6er7ertvvtf2uc5anyy7rjm\",true]",{"_110":7503,"_147":8494,"_150":8495},{"_112":7504,"_131":132,"_133":8493,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":7505,"_38":8491},{"_29":7506,"_72":598,"_73":54,"_74":8487,"_55":8488,"_77":604,"_79":604,"_81":8489,"_85":8490,"_87":598,"_89":90},[7507,7514,7521,7528,7535,7542,7549,7556,7563,7570,7577,7584,7591,7598,7605,7612,7619,7626,7633,7640,7647,7654,7661,7668,7675,7682,7689,7696,7703,7710,7717,7724,7731,7738,7745,7752,7759,7766,7773,7780,7787,7857,7952,7987,8099,8169,8239,8309,8448],{"_32":7508,"_34":7509},[],{"_36":160,"_38":7510,"_40":598,"_42":7511,"_67":7512,"_69":7513,"_71":70},"XYF1sRch",{},[],"[Source: AUG. 24/11:00-12:30/GOLD ROOM 84 • ACM 20th National Conference/1965 SESSION 4: Complex Information Processing T. H. Nelson Vassar College, Poughkeepsie, N.Y. ]",{"_32":7515,"_34":7516},[],{"_36":160,"_38":7517,"_40":598,"_42":7518,"_67":7519,"_69":7520,"_71":70},"LSUAdnex",{},[],"THE KINDS OF FILE structures required if we are to use the computer for personal files and as an adjunct to creativity are wholly different in character from those customary in business and scientific data processing. They need to provide the capacity for intricate and idiosyncratic arrangements, total modifiability, undecided alternatives, and thorough internal documentation.",{"_32":7522,"_34":7523},[],{"_36":160,"_38":7524,"_40":598,"_42":7525,"_67":7526,"_69":7527,"_71":70},"PUc18Zjn",{},[],"The original idea was to make a file for writers and scientists, much like the personal side of Bush's Memex, that would do the things such people need with the richness they would want. But there are so many possible specific functions that the mind reels. These uses and considerations become so complex that the only answer is a simple and generalized building-block structure, user-oriented and wholly general-purpose.",{"_32":7529,"_34":7530},[],{"_36":160,"_38":7531,"_40":598,"_42":7532,"_67":7533,"_69":7534,"_71":70},"rKcvID-D",{},[],"The resulting file structure is explained and examples of its use are given. It bears generic similarities to list-processing systems but is slower and bigger. It employs zippered lists plus certain facilities for modification and spin-off of variations. This is technically accomplished by index manipulation and text patching, but to the user it acts like a multifarious, polymorphic, many-dimensional, infinite blackboard.",{"_32":7536,"_34":7537},[],{"_36":160,"_38":7538,"_40":598,"_42":7539,"_67":7540,"_69":7541,"_71":70},"tbcRmSb4",{},[],"The ramifications of this approach extend well beyond its original concerns, into such places as information retrieval and library science, motion pictures and the programming craft; for it is almost everywhere necessary to deal with deep structural changes in the arrangements of ideas and things.",{"_32":7543,"_34":7544},[],{"_36":160,"_38":7545,"_40":598,"_42":7546,"_67":7547,"_69":7548,"_71":70},"Z1Qivyss",{},[],"I want to explain how some ideas developed and what they are. The original problem was to specify a computer system for personal information retrieval and documentation, able to do some rather complicated things in clear and simple ways. The investigation gathered generality, however, and has eventuated in a number of ideas. These are an information structure, a file structure, and a file language, each progressively more complicated. The information structure I call zippered lists; the file structure is the ELF, or ]Evolutionary Lis't File; and the file language (proposed) is called PRIDE.",{"_32":7550,"_34":7551},[],{"_36":160,"_38":7552,"_40":598,"_42":7553,"_67":7554,"_69":7555,"_71":70},"mpmbIbW4",{},[],"In this paper I will explain the original problem. Then I will explain why the problem is not simple, and why the solution (a file structure) must yet be very simple. The file structure suggested here is the Evolutionary List File, to be built of zippered lists. A number of uses will be suggested for such a file, to show the breadth of its potential usefulness. Finally, I want to explain the philosophical implications of this approach for information retrieval and data structure in a changing world.",{"_32":7557,"_34":7558},[],{"_36":160,"_38":7559,"_40":598,"_42":7560,"_67":7561,"_69":7562,"_71":70},"Lb7OHzRA",{},[],"This work was begun in 1960 - without any assistance. Its purpose was to create techniques for handling personal file systems and manuscripts in progress. These two purposes are closely related and not sharply distinct. Many writers and research professionals have files or collections of notes which are tied to manuscripts in progress. Indeed, often personal files shade into manuscripts, and the assembly of textual notes becomes the writing of text without a sharp break.",{"_32":7564,"_34":7565},[],{"_36":160,"_38":7566,"_40":598,"_42":7567,"_67":7568,"_69":7569,"_71":70},"LFdaUqkz",{},[],"I knew from my own experiment what can be done for these purposes with card file, notebook, index tabs, edge-punching, file folders, scissors and paste, graphic boards, index-strip frames, Xerox machine and the roll-top desk. My intent was not merely to computerize these tasks but to think out (and eventually program) the dream file: the file system that would have every feature a novelist or absent-minded professor could want, holding everything he wanted in just the complicated way he wanted it held, and handling notes and manuscripts in as subtle and complex ways as he wanted them handled.",{"_32":7571,"_34":7572},[],{"_36":160,"_38":7573,"_40":598,"_42":7574,"_67":7575,"_69":7576,"_71":70},"ZL16mUB_",{},[],"Only a few obstacles impede our using computer-based systems for these purposes. These have been high cost, little sense of need, and uncertainty about system design.",{"_32":7578,"_34":7579},[],{"_36":160,"_38":7580,"_40":598,"_42":7581,"_67":7582,"_69":7583,"_71":70},"x4_yva5-",{},[],"The costs are now down considerably. A small computer with mass memory and video-type display now costs $37,000; amortized over time this would cost less than a secretary, and several people could use it around the clock. A larger installation servicing an editorial office or a newspaper morgue, or a dozen scientists or scholars, could cost proportionately less and give more time to each user.",{"_32":7585,"_34":7586},[],{"_36":160,"_38":7587,"_40":598,"_42":7588,"_67":7589,"_69":7590,"_71":70},"tbiZYrGw",{},[],"The second obstacle, sense of need, Is a matter of fashion. Despite changing economies, it is fashionably believed that computers are possessed only by huge organizations to be used only for vast corporate tasks or intricate scientific calculations. As long as people think that, machines will be brutes and not friends, bureaucrats and not helpmates. But since (as I will indicate) computers could do the dirty work of personal file and text handling, and do it with richness and subtlety beyond anything we know, there ought to be a sense of need. Unfortunately, there are no ascertainable statistics on the amount of time we waste fussing among papers and mislaying things. Surely half the time spent in writing is spent physically rearranging words and paper and trying to find things already written; if 95% of this time could be saved, it would only take half as long to write something.",{"_32":7592,"_34":7593},[],{"_36":160,"_38":7594,"_40":598,"_42":7595,"_67":7596,"_69":7597,"_71":70},"3Ec67mSH",{},[],"The third obstacle, design, is the only substantive one, the one to which this paper speaks.",{"_32":7599,"_34":7600},[],{"_36":160,"_38":7601,"_40":598,"_42":7602,"_67":7603,"_69":7604,"_71":70},"GLlaNPbS",{},[],"Let me speak first of the automatic personal filing system. This idea is by no means new. To go back only as far as 1945, Vannevar Bush, in his famous article \"As We May Think \"1 , described a system of this type. Bush's paper is better remembered for its predictions in the field of information retrieval, as he foresaw the spread and power of automatic document handling and the many new indexing techniques it would necessitate. But note his predictions for personal filing:",{"_32":7606,"_34":7607},[],{"_36":160,"_38":7608,"_40":598,"_42":7609,"_67":7610,"_69":7611,"_71":70},"34I-c2bl",{},[],"\"Consider a future device for individual use, which is a sort of mechanized private file and library. It needs a name, and, to coin one at random, \"memex\" will do. A memex is a device in which an individual stores all his books, records, and communications, and which is mechanized so that it may be consulted with exceeding speed and flexibility. It is an enlarged intimate~ supplement to his memory.",{"_32":7613,"_34":7614},[],{"_36":160,"_38":7615,"_40":598,"_42":7616,"_67":7617,"_69":7618,"_71":70},"qfIjtMrs",{},[],"\"It consists of a desk, and while it can pres~mebly be operated from a distance, it is primarily the piece of furniture at which he works. On the top are slanting translucent screens, on which material can be projected for convenient reading. There is a keyboard, and sets of buttons and levers. Otherwise it looks like an ordinary desk.",{"_32":7620,"_34":7621},[],{"_36":160,"_38":7622,"_40":598,"_42":7623,"_67":7624,"_69":7625,"_71":70},"iaQSpfap",{},[],"\"A special button transfers him immediately to the first page of the index. Any given book of his library / and presumably other textual material, such as notes/ can thus be called up and consulted with far greater facility than if it were taken from a shelf. As he has several projection positions, he can leave one item in position while he calls up another. He can add marginal notes and comments, .... \" (i, 106-7)",{"_32":7627,"_34":7628},[],{"_36":160,"_38":7629,"_40":598,"_42":7630,"_67":7631,"_69":7632,"_71":70},"WR3BJhXd",{},[],"Understanding that such a machine required new kinds of filing arrangements, Bush stressed his file's ability to store related materials in associative trails, lists or chains of documents joined together.",{"_32":7634,"_34":7635},[],{"_36":160,"_38":7636,"_40":598,"_42":7637,"_67":7638,"_69":7639,"_71":70},"aqdQeHU1",{},[],"\"When the user is building a trail, he names it, inserts the name in his code book, and taps it out on his keyboard. Before him are the two items to be joined, projected onto adjacent viewing positions. At the bottom of each there are a number of blank code spaces, and a pointer is set to indicate one of these on each item. The user taps a single key, and the items are permanently joined ....",{"_32":7641,"_34":7642},[],{"_36":160,"_38":7643,"_40":598,"_42":7644,"_67":7645,"_69":7646,"_71":70},"nLbezgSK",{},[],"\"Thereafter, at any time, when one of these items is in view, the other can be instantly recalled merely by tapping a button below the corresponding code space. Moreover, when numerous items have been thus joined together to form a trail, they can be reviewed in turn, rapidly or slowly, by deflecting a lever like that used for turning the pages of a book. It is exactly as though the physical items had been gathered together from widely separated sources and bound together to form a new book. It is more than this, for any item can be joined into numerous trails ....",{"_32":7648,"_34":7649},[],{"_36":160,"_38":7650,"_40":598,"_42":7651,"_67":7652,"_69":7653,"_71":70},"grmPYWGl",{},[],"\"Thus he goes, building a trail of many items. Occasionally he inserts a comment of his own, either linking it into the main trail or joining it by a side trail to a particular item .... \" (1, 107)",{"_32":7655,"_34":7656},[],{"_36":160,"_38":7657,"_40":598,"_42":7658,"_67":7659,"_69":7660,"_71":70},"_edI3oUg",{},[],"Two decades later, this machine is still unavailable*.",{"_32":7662,"_34":7663},[],{"_36":160,"_38":7664,"_40":598,"_42":7665,"_67":7666,"_69":7667,"_71":70},"NNOWzSFE",{},[],"The hardware is ready. Standard computers can handle huge bodies of written information, storing them on magnetic recording media and displaying their contents on CRT consoles, which far outshine desktop projectors. But no programs, no file software are standing ready to do the intricate filing job (keeping track of associative trails and other stKuctures) Ithat the active scientist or thinker wants and needs. While WallaceZ reports that the System Development Corporation has found it worthwhile to give its employees certain limited computer facilities for their own filing systems, this is a bare beginning.",{"_32":7669,"_34":7670},[],{"_36":160,"_38":7671,"_40":598,"_42":7672,"_67":7673,"_69":7674,"_71":70},"s_rj_pYb",{},[],"Let us consider the other desideratum, manuscript handling. The remarks that follow are intended to apply to all forms of writing, including fiction, philosophy, sermons, news and technical writing.",{"_32":7676,"_34":7677},[],{"_36":160,"_38":7678,"_40":598,"_42":7679,"_67":7680,"_69":7681,"_71":70},"rxIEh9Rs",{},[],"The problems of writing are little understood, even by writers. Systems analysis in this area is scanty; as elsewhere, the best doers may not understand what they do. Although there is considerable anecdote and lore about the different physical manuscript and file techniques of different authors, literary tradition demerits any concern with technical systems as detracting from \"creativity.\" (Conversely, technical people do not always appreciate the difficulty of organizing text, since in technical writing much of the organization and phraseology is given, or appears to be.) But in the computer sciences we are profoundly aware of the importance of systems details, and of the variety of consequences for both quality and quantity of work that result from different systems. Yet to design and evaluate systems for writing, we need to know what the process of writing is.",{"_32":7683,"_34":7684},[],{"_36":160,"_38":7685,"_40":598,"_42":7686,"_67":7687,"_69":7688,"_71":70},"Ik6nj42Y",{},[],"There are three false or inadequate theories of how writing is properly done. The first is that writing is a matter of inspiration. While inspiration is useful, it is rarely enough in itself. \"Writing is 10% inspiration, 90% perspiration,\" is a common saying. But this leads us to the second false theory, that \"writing consists of applying the seat of the pants to the seat of the chair.\" Insofar as sitting facilitates work, this view seems reasonable, but it also suggests that what is done while sitting is a matter of comparative indifference; probably not.",{"_32":7690,"_34":7691},[],{"_36":160,"_38":7692,"_40":598,"_42":7693,"_67":7694,"_69":7695,"_71":70},"VYSxYixk",{},[],"The third false theory is that all you really need is a good outline, created on prior consideration, and that if the outline is correctly followed the required text will be produced. For most good writers this theory is quite wrong. Rarely does the original outline predict well what headings and sequence will create the effects desired: the balance of emphasis, sequence of interrelating points, texture of insight, rhythm, etc. We may better call the outlining process inductive: certain interrelations appear to the author in the material itself, some at the outset and some as he works. He can only decide which to emphasize, which to use as unifying ideas and principles, and which to slight or delete, by trying. Outlines in general are spurious, made up after the fact by examining the segmentation of a finished work. If a finished work clearly follows an outline, that online probably has been han~nered out of many inspirations, comparisons and tests .",{"_32":7697,"_34":7698},[],{"_36":160,"_38":7699,"_40":598,"_42":7700,"_67":7701,"_69":7702,"_71":70},"1OWtMclV",{},[],"Between the inspirations, then, and during the sitting, the task of writing is one of rearrangement and reprocessing, and the real outline develops slowly. The original ~rude or fragmentary texts created at the outset generally undergo many revision processes before they are finished. Intellectually they are pondere~ juxtaposed, compared, adapted, transposed, and judged; mechanically they are copied, overwritten with revision markings, rearranged and copied again. This cycle may be repeated many times. The whole grows by trial and error in the processes of arrangement, comparison and retrenchment. By examining and mentally noting many different versions, some whole but most fragmentary the intertwining and organizing of the final written work gradually takes place***.",{"_32":7704,"_34":7705},[],{"_36":160,"_38":7706,"_40":598,"_42":7707,"_67":7708,"_69":7709,"_71":70},"Qi8odcDV",{},[],"Certain things have been done in the area of computer manuscript handling. IBM recently announced its \"Administrative Terminal System\"5,6,7, 8 which permits the storage of unfinished sections of text in computer memory, permits various modifications by the user, and types up the final draft with page numbers, right justification and headers.",{"_32":7711,"_34":7712},[],{"_36":160,"_38":7713,"_40":598,"_42":7714,"_67":7715,"_69":7716,"_71":70},"uLpDxBlL",{},[],"While this is a good thing, its function for manuscripts is cosmetic rather than organizing. Such a system can be used only with textual sections which are already well organized, the visible part of the iceberg. The major and strenuous part of such writing must already have been done.",{"_32":7718,"_34":7719},[],{"_36":160,"_38":7720,"_40":598,"_42":7721,"_67":7722,"_69":7723,"_71":70},"1BMXyKIC",{},[],"If a writer is really to be helped by an automated system, it ought to do more than retype and transpose: it should stand by him during the early periods of muddled confusion, when his ideas are scraps, fragments, phrases, and contradictory overall designs. And it must help him through to the final draft with every feasible mechanical aid-- making the fragments easy to find, and making easier the tentative sequencing and juxtaposing and comparing.",{"_32":7725,"_34":7726},[],{"_36":160,"_38":7727,"_40":598,"_42":7728,"_67":7729,"_69":7730,"_71":70},"XvRhpM44",{},[],"It was for these two purposes, taken together-- personal filing and manuscript assembly-- that the following specifications were drawn up.",{"_32":7732,"_34":7733},[],{"_36":160,"_38":7734,"_40":598,"_42":7735,"_67":7736,"_69":7737,"_71":70},"9eRQ7C_g",{},[],"Here were the preliminary specifications of the system: It would provide an up-to-date index of its own contents (supplanting the \"code book\" suggested by Bush). It would accept large and growing bodies of text and commentary, listed in such complex forms as the user might stipulate. No hierarchical file relations were to be built in; the system would hold any shape imposed on it. It would file texts in any form and arrangement desired-- combining, at will, the functions of the card file, loose-leaf notebook, and so on. It would file under an unlimited number of categories. It would provide for filing in Bush trails. Besides the file entries themselves, it would hold co~mnentaries and explanations connected with them. These annotations would help the writer or scholar keep track of his previous ideas, reactions and plans, often confusingly forgotten.",{"_32":7739,"_34":7740},[],{"_36":160,"_38":7741,"_40":598,"_42":7742,"_67":7743,"_69":7744,"_71":70},"9myc6c-r",{},[],"In addition to these static facilities, the system would have various provisions for change. The user must be able to change both the contents of his file and the way they are arranged. Facilities would be available for the revising and rewording of text. Moreover, changes in the arrangements of the file's component parts should be possible, including changes in sequence, labelling, indexing and comments.",{"_32":7746,"_34":7747},[],{"_36":160,"_38":7748,"_40":598,"_42":7749,"_67":7750,"_69":7751,"_71":70},"tD5TybwB",{},[],"It was also intended that the system would allow index manipulations which we may call dynamic outlining (or dynamic ~indexing). Dynamic outlining uses the change in one text sequence to guide an automatic change in another text sequence. That is, changing an outline (or an index) changes the sequence of the main text which is linked with it. This would permit a writer to create new drafts with a relatively small amount of effort, not counting rewordings.",{"_32":7753,"_34":7754},[],{"_36":160,"_38":7755,"_40":598,"_42":7756,"_67":7757,"_69":7758,"_71":70},"zmcZdmQl",{},[],"However, because it is necessary to examine changes and new arrangements before deciding to use or keep them, the system must not commit the user to a new version until he is ready. Indeed, the system would have to provide spin-off facilities, allowing a draft of a work to be preserved while its successor was created. Consequently the system must be able to hold several-- in fact, many-- different versions of the same sets of materials. Moreover, these alternate versions would remain indexed to one another, so that however he might have changed their sequences, the user could compare their equivalent parts.",{"_32":7760,"_34":7761},[],{"_36":160,"_38":7762,"_40":598,"_42":7763,"_67":7764,"_69":7765,"_71":70},"6oQck4er",{},[],"Three particular features, then, would be specially adapted to useful change. The system would be able to sustain changers in the bulk and block arrangements of its contents. It would permit dynamic outlining. And it would permit the spinoff of many different drafts, either successors or variants, all to remainwithin the file for comparison or use as long as needed. These features we may call evolutionary.",{"_32":7767,"_34":7768},[],{"_36":160,"_38":7769,"_40":598,"_42":7770,"_67":7771,"_69":7772,"_71":70},"83Wwrsk7",{},[],"The last specification, of course, one that emerged from all the others, was that it should not be complicated.",{"_32":7774,"_34":7775},[],{"_36":160,"_38":7776,"_40":598,"_42":7777,"_67":7778,"_69":7779,"_71":70},"OEn5EZSC",{},[],"These were the original desiderata. It was not expected at first that a system for this purpose would have wider scope of application; these jobs seemed to be quite enough. As work continued, however, the structure began to look more simple, powerful and general, and a variety of new possible uses appeared. It became apparent that the System might be suited to many unplanned applications involving multiple categories, text summaries or other parallel documents, complex data structures requiring human attention, and files whose relations would be in continuing change.",{"_32":7781,"_34":7782},[],{"_36":160,"_38":7783,"_40":598,"_42":7784,"_67":7785,"_69":7786,"_71":70},"g9s62Dw_",{},[],"Note that in the discussion that follows we will pretend we can simply see into the machine, and not worry for the present about how we can actually see, understand and manipulate these files. These are problems of housekeeping, I/0 and display, for which many solutions are possible.",{"_32":7788,"_34":7852},[7789,7796,7803,7810,7817,7824,7831,7838,7845],{"_32":7790,"_34":7791},[],{"_36":160,"_38":7792,"_40":598,"_42":7793,"_67":7794,"_69":7795,"_71":70},"50U-4Q6p",{},[],"What was required we may call an evolutionary file structure: a file structure that can be shaped into various forms, changed from one arrangement to another in accordance with the user's changing need. It was apparent also that some type of list structure was necessary. Making the file out of lists would allow different categories of personal notes, separate drafts, outlines and master indices all to be handled as lists of some sort; their segments could then be manipulated through automatic handling of index numbers. The resulting file structure I will, accordingly, call the Evolutionary List File, or ELF, since it is an evolutionary file structure constructed with lists. The system proposed here is not the only ELF possible. It is built upon a specific technique of attaching lists together which has a natural resistance to becoming confused and messy.",{"_32":7797,"_34":7798},[],{"_36":160,"_38":7799,"_40":598,"_42":7800,"_67":7801,"_69":7802,"_71":70},"Ys5cFmxC",{},[],"As computer-based systems grow in capability and diversity of uses, they tend to become more and more cluttered with niggling complications, hidden passageways, and lurking, detailed interlocks, restrictions, specializations, provisos. These should be forsworn, if possible, in the system under discussion, so that it might be attractive to laymen (including artists and writers) who feel unkindly disposed toward computers. It should readily adapt to their own styles of handling things, imposing few conventions or methods of use. How could this imposition be avoided? And among so many interesting and possible system functions and file relations, how may the users know what connections to make, how may they understand what they are doing, and how may they avoid muddling and losing the things they are working with?",{"_32":7804,"_34":7805},[],{"_36":160,"_38":7806,"_40":598,"_42":7807,"_67":7808,"_69":7809,"_71":70},"dkkglbl1",{},[],"The answer, I think you see, is to choose a very simple structure that can be used and compounded in many different ways. The basic arrangement chosen for these purposes is an information structure I will refer to as zippered lists. (We might call it permutation-invariant one-for-one inter-list entry-linking, but that is not necessary.)",{"_32":7811,"_34":7812},[],{"_36":160,"_38":7813,"_40":598,"_42":7814,"_67":7815,"_69":7816,"_71":70},"adyWF1ze",{},[],"There are only three kinds of things in the zippered-list ELF, with no predetermined relations among them-- no hierarchies, machine-based features or trick exceptions. The system is user-oriented and open-faced, and its clear and simple rules may be adapted to all purposes.",{"_32":7818,"_34":7819},[],{"_36":160,"_38":7820,"_40":598,"_42":7821,"_67":7822,"_69":7823,"_71":70},"Ts1nfhXQ",{},[],"The ELF has three elements: entries, lists and links. An entry is a discrete unit of information designated by the user. It can be a piece of text (long or short), a string of symbols, a picture or a control designation for physical objects or operations.",{"_32":7825,"_34":7826},[],{"_36":160,"_38":7827,"_40":598,"_42":7828,"_67":7829,"_69":7830,"_71":70},"49jb63ve",{},[],"A list is an ordered set of entries designated by the user. A given entry may be in any number of lists.",{"_32":7832,"_34":7833},[],{"_36":160,"_38":7834,"_40":598,"_42":7835,"_67":7836,"_69":7837,"_71":70},"j4TmbHCR",{},[],"A link is a connector, designated by the user, between two particular entries which are in different lists; Figure I. An entry in one list may be linked to only one entry in another list.",{"_32":7839,"_34":7840},[],{"_36":160,"_38":7841,"_40":598,"_42":7842,"_67":7843,"_69":7844,"_71":70},"bTy60-BH",{},[],"On the left we see two zippered lists. Between the entries of list A and those of B are dashed lines, representing the links between the two lists. On the right is the table of links as it might look to a machine. The machine can read this table from right to left or left to right, finding entries in B that correspond to given entries in A, or vice versa. A change in the sequence of either list, or additions to either list, will not: change the links that stand between them. Changes in the link structure will occur only if the user specifically changes the links, or if he destroys entries which are linked to others.",{"_32":7846,"_34":7847},[],{"_36":160,"_38":7848,"_40":598,"_42":7849,"_67":7850,"_69":7851,"_71":70},"Gm2FAclR",{},[],"To be technical, then, two lists are zippered if there are any pairwise links between their respective elements, each element is in no more than one link pair, and these links are unaffected by permutation of the lists, remaining affixed to the same pairs of elements. It is not required that the two lists be of the same length, or, even if they are, that all entries have a link to the other list.",{"_36":870,"_38":7853,"_40":598,"_42":7854,"_67":7855,"_69":7856,"_71":70},"wDZc2s7b",{},[],"Elements of the ELF",{"_32":7858,"_34":7947},[7859,7866,7881,7896,7911,7926,7933,7940],{"_32":7860,"_34":7861},[],{"_36":160,"_38":7862,"_40":598,"_42":7863,"_67":7864,"_69":7865,"_71":70},"jUnrNB7J",{},[],"Zippered lists are an information structure; the Evolutionary List File is a file structure. The ELF described in this paper holds its contents exclusively as zippered (or unzippered) lists. But the file structure must also include a set of operations by which it may be modified. These file operations exist for creating, adjusting or removing the entry, list and link, and for manipulating the sequence relation. An ELF is actually any machine which will, on command, carry out the basic operations on entry, list, link and sequence.",{"_32":7867,"_34":7868},[],{"_36":160,"_38":7869,"_40":598,"_42":7870,"_67":7871,"_69":7880,"_71":70},"Uo0aqLc1",{},[7872,7876],{"_36":166,"_167":7873,"_169":7874,"_42":7875,"_71":70},[137],[221],{},{"_36":919,"_167":7877,"_169":7878,"_42":7879,"_71":70},[137],[221],{},"Entries**.** The user may create new entries at any time, putting anything in them that he thinks appropriate. Entries ~y be combined or divided (unless indivisible, like objects, commands, etc.) Entries may be put in any list, and the same entry may be put in different lists. The user may direct that entries of one list be automatically copied onto another list, without affecting the original list.",{"_32":7882,"_34":7883},[],{"_36":160,"_38":7884,"_40":598,"_42":7885,"_67":7886,"_69":7895,"_71":70},"WYIKHmRk",{},[7887,7891],{"_36":166,"_167":7888,"_169":7889,"_42":7890,"_71":70},[137],[201],{},{"_36":919,"_167":7892,"_169":7893,"_42":7894,"_71":70},[137],[201],{},"Lists. The user may create lists and assign entries to them. He may at will make new copies of lists. He may rearrange the sequence of a list, or copy the list and change the sequence of that copy. Lists may be combined; lists may be cut into sublists.",{"_32":7897,"_34":7898},[],{"_36":160,"_38":7899,"_40":598,"_42":7900,"_67":7901,"_69":7910,"_71":70},"ja47TNVN",{},[7902,7906],{"_36":166,"_167":7903,"_169":7904,"_42":7905,"_71":70},[137],[201],{},{"_36":919,"_167":7907,"_169":7908,"_42":7909,"_71":70},[137],[201],{},"Links. Ths user may create links between entries that are in different lists. Any number of legal links may be created, although the upper limit of links between any two lists is determined by the l-for-I rule. When an entry or a list is copied into a list, links will remain between parent and daughter entries. Moreover, after a list-copying operation, the daughter list will have the same links to all other lists as does the parent list.",{"_32":7912,"_34":7913},[],{"_36":160,"_38":7914,"_40":598,"_42":7915,"_67":7916,"_69":7925,"_71":70},"QeUcKKO1",{},[7917,7921],{"_36":166,"_167":7918,"_169":7919,"_42":7920,"_71":70},[137],[1476],{},{"_36":919,"_167":7922,"_169":7923,"_42":7924,"_71":70},[137],[1476],{},"Sequences. The user may put a list in any sequence he wishes. (A copied list will maintain the original sequence until modified.) Sequences may be transferred between lists via the links: if the sequence of A is transferred to B, each entry of A linked to an entry in B takes tile sequential position of its linked entry in B.",{"_32":7927,"_34":7928},[],{"_36":160,"_38":7929,"_40":598,"_42":7930,"_67":7931,"_69":7932,"_71":70},"BZaEupmx",{},[],"No definite meaning is assigned to these entities or operations by the system; the user is free to let them mean anything he likes. A list may be a category, trail, index, dialogue, catalogue or poem, and lists may be assembled into larger structures. The ELF may be thought of as a place; not a machine, but a piece of stationery or office equipment with many little locations which may be rearranged with regard to one another****.",{"_32":7934,"_34":7935},[],{"_36":160,"_38":7936,"_40":598,"_42":7937,"_67":7938,"_69":7939,"_71":70},"NVuJx_Bu",{},[],"Note that zippered lists generate only one of various possible Evolutionary List Files. Indeed, the description of the file structure given here is in some ways restrictive: the ELF could take a number of other, closely similar forms and still be much the same thing. For example, it would be possible to allow subentries and superentries into the file, to behave and link up like normal entries, even though they contained or were contained in other entries. But the equivalent can be done with the current system. Another possibility would be to allow links other than 1-for-l; these could be modal, the different link-modes having different meanings to the user. Or we might make it an evolutionary network file, allowing any two entries to be connected. Or, besides such general changes in the rules, plausible changes and accessory functions for any purposes could be introduced outside the given file structure, even including modifications and widgets to do some of the same things \"more easily.\"",{"_32":7941,"_34":7942},[],{"_36":160,"_38":7943,"_40":598,"_42":7944,"_67":7945,"_69":7946,"_71":70},"DiP2Qcqn",{},[],"But to the user such complication might render the system far less handy or perspicuous. The ELF, with its associated techniques as described above, is simple and unified. Many tasks can be handled within the file structure. This means it can be of particular benefit to people who want to learn without complications and use it in ways they understand. For psychological, rather than technical reasons, the system should be lucid and simple. I believe that this ELF best meets these requirements.",{"_36":870,"_38":7948,"_40":598,"_42":7949,"_67":7950,"_69":7951,"_71":70},"twcRd193",{},[],"The ELF's File Operations",{"_32":7953,"_34":7982},[7954,7961,7968,7975],{"_32":7955,"_34":7956},[],{"_36":160,"_38":7957,"_40":598,"_42":7958,"_67":7959,"_69":7960,"_71":70},"xVp10V6x",{},[],"Since the ELF description above bears some resemblance to the list languages, such as IPL, SLIP, etc., a distinction should be drawn. These list languages ~ are particularly suited to processing data, fast and iteratively, whose elements are manipulable in Newell-Shaw-Simon lists. Essentially they my be thought of as organizations of memory which facilitate sequential operations on unpredictably branching or hierarchical data. These data may change far too quickly for human intervention. Evolutionary file structures, and the ELF in particular, are designed to be changed piecemeal by a human individual. While it might be convenient to program an ELF in one of these languages, the low speed at which user file commands need to be executed makes such high-powered implementation unnecessary; the main problem is to keep track of the file's arrangements, not to perform computation on its contents. Although work has been done to accomodate the list-language approach to larger chunks of material than usual I0, the things people will want to put into an ELF will typically be too big for core memory.",{"_32":7962,"_34":7963},[],{"_36":160,"_38":7964,"_40":598,"_42":7965,"_67":7966,"_69":7967,"_71":70},"XvLHpeZJ",{},[],"The ELF does in fact share some of the problems of the list languages: not available-storage accounting or garbage collection (concerns associated with organization of fast memory for processing, which may be avoided at slower speeds), but the problems of checkout for disposal (what other lists is an entry on?) and list naming. The former problem is rather straightforwardly solved II, P\" 164; the latter is complicated in ways we cannot cover here.",{"_32":7969,"_34":7970},[],{"_36":160,"_38":7971,"_40":598,"_42":7972,"_67":7973,"_69":7974,"_71":70},"XjfzIq33",{},[],"The ELF appears to be closest, topologically and in other organizing features, to the Multilist system described by Prywes and Gray 12. Like that system, it permits putting entries in many different lists at once. However, in current intent 13 that system is firmly hierarchical, and thus somewhat removed from the ELF's scope of application. Another closely related system is the Integrated Data Store of Bachmanl 4,15,16,17,18; this is intended as a hardware-software system for disc I/0 and storage arrangement, but in its details it seems the ELF's close relative. Each of these systems has a connection logic that might be feasible as a basis for an ELF different from this one. Or, either might prove a convenient programming base for the implementation of this file structure.",{"_32":7976,"_34":7977},[],{"_36":160,"_38":7978,"_40":598,"_42":7979,"_67":7980,"_69":7981,"_71":70},"hHtIze5D",{},[],"Another obvious technical question must be considered. How can the ELF allow \"unlimited\" copies of entries and lists? By patching techniques, of course. Variant entries and lists can take virtually no space, being modification data plus pointers to the original. When a modified version of a list or entry is created, the machine patches the original with the changes necessary to make the modified version: Figure 2.",{"_36":870,"_38":7983,"_40":598,"_42":7984,"_67":7985,"_69":7986,"_71":70},"9CEb7iet",{},[],"Technical Aspects",{"_32":7988,"_34":8094},[7989,7996,8003,8010,8017,8024,8031,8038,8045,8052,8059,8066,8073,8080,8087],{"_32":7990,"_34":7991},[],{"_36":160,"_38":7992,"_40":598,"_42":7993,"_67":7994,"_69":7995,"_71":70},"v8BHYmui",{},[],"In the discussion that follows, we will examine various possible applications of zippered lists and the ELF, and postpone discussing the file language they require. Finally we will return to this problem, and describe the file language PRIDE whose additional features are neededto adapt the ELF for the uses originally discussed.",{"_32":7997,"_34":7998},[],{"_36":160,"_38":7999,"_40":598,"_42":8000,"_67":8001,"_69":8002,"_71":70},"eQoeI8qL",{},[],"By assigning entries to lists, the ELF may be used as a glorified card file, with separate lists used for categories, trails, etc. This permits extensive cross-indexing by the assignment of one entry to different lists. It permits subsets and sub-sequences for any use to be held apart and examined without disturbing the lists from which they have been drawn, by copying them onto other, new lists. The ELF permits the filing of historical trails or associative (Bush) trails through documents, business correspondence, belles-lettres, case law, treaties, scholarly fields and history, and the mixture of trail with categorical filing.",{"_32":8004,"_34":8005},[],{"_36":160,"_38":8006,"_40":598,"_42":8007,"_67":8008,"_69":8009,"_71":70},"wMrr4E4J",{},[],"These are the simple uses; the compound uses are much more interesting. But since we cannot intuitively fit every possible conceptual relationship into zippered lists, imaginative use is necessary. Remember that there is no correct way to use the system. Given its structure, the user may figure out any method useful to him. A number of different arrangements can be constructed in the ELF, using only the basic elements of entry, list and link. Zippered lists may be assembled into rectangular arrays, lattices and more intricate configurations. These assemblies of lists may be assigned meaning in combination by the user, and the system will permit them to be stored, displayed, taken apart for examination, and corrected, updated, or modified.",{"_32":8011,"_34":8012},[],{"_36":160,"_38":8013,"_40":598,"_42":8014,"_67":8015,"_69":8016,"_71":70},"pFt1VreJ",{},[],"By using such combining arrangements on lists composed of text, the file can be self-documenting, with all labelling and documentation kept integrally within the file structure. It is thus possible to incorporate, in a body of information filed in the ELF, various levels of index, summary, explanation, and commentary. Many useful ways of listing and linking such documentation are possible. In Figure 3 we see some of the ways that documentary lists may be linked together. The lists shown are outline, suboutline, draft, subdraft, summary, commentary and source list. These are not all the possible types of documentary lists; for example, \"footnotes\" are omitted. The ELF will permit any number of these documentary lists; for example, \"footnotes\" are omitted. The ELF will permit any number of these documentary lists; observe that they can be built on one another, and indefinitely compounded. The system will have no trouble accepting a commentary on a commentary on a subdraft of an outline for a variant list of source materials.",{"_32":8018,"_34":8019},[],{"_36":160,"_38":8020,"_40":598,"_42":8021,"_67":8022,"_69":8023,"_71":70},"x3-LQR8L",{},[],"Figure 3 shows also how two lists may contain some of the same entries. The dashed line represents linkage between entries, the solid line shows that both lists contain the same entry. This may be useful for creating alternate versions, or, as in this example, the lists containing the same entry may have different purposes. Here, for instance, an entry in the summary is also to be found in the main draft.",{"_32":8025,"_34":8026},[],{"_36":160,"_38":8027,"_40":598,"_42":8028,"_67":8029,"_69":8030,"_71":70},"jkhhaXSF",{},[],"This self-documentation feature permits any string of text in the ELF, long or short, to be annotated or footnoted for scholarly or other purposes. Such marginalia can be temporary or permanent, for the private memoranda of an individual or for communication among different persons using the file.",{"_32":8032,"_34":8033},[],{"_36":160,"_38":8034,"_40":598,"_42":8035,"_67":8036,"_69":8037,"_71":70},"8kqVAFAr",{},[],"In a like manner, the ELF is capable of storing many texts in parallel, if they are equivalent or linked in some way. For example, instruction manuals for different models o~ the same machine may be kept in the file as linked lists, and referred to when machines are to be compared, used or fixed. This is of special use to repairmen, project managers and technical writers.",{"_32":8039,"_34":8040},[],{"_36":160,"_38":8041,"_40":598,"_42":8042,"_67":8043,"_69":8044,"_71":70},"iPRWTGod",{},[],"Moreover, the ELF's cross-sequencing feature -- the fact that links ignore permutations-- permits the collation of very different cognate textual materials for comparison and understanding. In law, this would help in comparing statutes (or whole legal systems); in literature, variorum editions and parodies. Thus such bodies as the Interpreter's Bible and a Total Shakespeare (incorporating Folios, bowdlerizations, satires and all critical commentary) could be assembled for study.",{"_32":8046,"_34":8047},[],{"_36":160,"_38":8048,"_40":598,"_42":8049,"_67":8050,"_69":8051,"_71":70},"VemIZRIl",{},[],"Let me try to illustrate the possible comprehensiveness and versatility of this file structure as applied to texts. Figure 4 shows the different arrangements that might be used by one man-- in this case an historian writing a book-- to assemble and integrate his intellectual and professional concerns. Although it is impossible to show the links between all the separate entries of these lists-- the entries are not themselves discernible in this drawing-- it is possible to note the kinds of links between lists. A thin line between lists shows that some links exist; a solid line indicates that some entries of both lists are the same.",{"_32":8053,"_34":8054},[],{"_36":160,"_38":8055,"_40":598,"_42":8056,"_67":8057,"_69":8058,"_71":70},"yydedsEL",{},[],"Perhaps this looks complicated. In fact, each of the connectors shows an indexing of one body of information to another; this user may query his file in any direction along these links, and look up the parts of one list which are related to parts of another. Therefore the lines mean knowledge and order. Note that in such uses it is the man's job to draw the connections, not the machine's. The machine is a repository and not a judge.",{"_32":8060,"_34":8061},[],{"_36":160,"_38":8062,"_40":598,"_42":8063,"_67":8064,"_69":8065,"_71":70},"OhPz96nj",{},[],"The ELF may be an aid to the mind in creative tasks, allowing the user to compare arrangements and alternatives with some prior ideal. This is helpful in planning nonlinear assemblages (museum exhibits, casting for a play,) or linear constructions of any kind. Such linear constructions include not only written texts; they can be any complicated sequences of things, such as motion pictures (in the editing stage) and computer programs.",{"_32":8067,"_34":8068},[],{"_36":160,"_38":8069,"_40":598,"_42":8070,"_67":8071,"_69":8072,"_71":70},"HHYmHWsn",{},[],"Indeed, computer programming with an on-line display and the ELF would have a number of advantages. Instructions might be interleaved indefinitely without resorting to tiny writing. Moreover, the programmer could keep up work on several variant approaches and versions at the same time and easily document their overall features, their relations to one another, and their corresponding parts. Adding a load-and-go compiler would create a self-documenting programming scratchpad.",{"_32":8074,"_34":8075},[],{"_36":160,"_38":8076,"_40":598,"_42":8077,"_67":8078,"_69":8079,"_71":70},"_590ZS8G",{},[],"The natural shape of information, too, may call for the ELF. For instance, sections of information often arrange themselves naturally in a lattice structure, whose strands need to be separately examined, pondered, or tested. Such lattices include PERT networks, programmed instruction sequences, history books and genealogical records. (The ELF can handle genealogical source documentation and its original text as well.) Indeed, any informational networks that require storage, handling and consideration will fit the ELF; a feature that could have applications in plant layout, social psychology, contingency planning, circuit design and itineraries.",{"_32":8081,"_34":8082},[],{"_36":160,"_38":8083,"_40":598,"_42":8084,"_67":8085,"_69":8086,"_71":70},"OEQFuxB_",{},[],"The ELF may, through its mutability:, its expansibility, and its self-documentation features, aid in the integration, understanding and channeling of ideas and problems that will not yield to ordinary analysis or customary reductions; for instance, the contingencies of planning, which are only partially Boolean. Often the reason for a so-called Grand Strategy in a setting is that we cannot keep track of the interrelations of particular contingencies. The ELF could help us understand the interrelations of possibilities, consequences, and strategic options. In a logically similar case, evaluating espionage, it might help trace consistencies and contradictions among reports from different spies.",{"_32":8088,"_34":8089},[],{"_36":160,"_38":8090,"_40":598,"_42":8091,"_67":8092,"_69":8093,"_71":70},"7Oik1zcC",{},[],"The use of an ELF as the basis for a management information system is not inconceivable. Its evolutionary capability would provide a smooth transition from the prior systems, phasing out old paperwork forms and information channels piecemeal. Beginning with conventional accounting arrays and information flow, and moving through discrete evolutionary steps, the ELF might help restructure an entire corporate system. Numerical subroutining could permit the system to encompass all bookkeeping. The addresses of all transaction papers, zippered to lists of their dates and contents, would aid in controlling shipments, inventory and cash. The ELF's cross-sequencing feature could be put to concrete uses, helping to rearrange warehouses (and the company library) by directing the printout of new labels to guide physical rearrangement. Inventories, property numbers and patents could be so catalogued and recatalogued in the ELF. Legal documents, correspondence, company facts and history could be indexed or filed in historical and category trails. And upper management could add private annotations to the public statements, reports and research of both the organization and its competitors, with amendments, qualifications, and inside dope.",{"_36":870,"_38":8095,"_40":598,"_42":8096,"_67":8097,"_69":8098,"_71":70},"XSAedf3j",{},[],"USES",{"_32":8100,"_34":8164},[8101,8108,8115,8122,8129,8136,8143,8150,8157],{"_32":8102,"_34":8103},[],{"_36":160,"_38":8104,"_40":598,"_42":8105,"_67":8106,"_69":8107,"_71":70},"TBpgvqZU",{},[],"While the ELF as described is expected to be general and useful, the original purposes described at the beginning of this paper call for certain further provisions. Now I would like to describe a desirable file and information handling language that will meet these needs, called the PRIDE (Personalized Retrieval, Indexing, and Documentation Evolutionary) System. Its purpose is to facilitate the use of an ELF. The system described is not yet implemented, nor even fully specified, but let us speak as though it is.",{"_32":8109,"_34":8110},[],{"_36":160,"_38":8111,"_40":598,"_42":8112,"_67":8113,"_69":8114,"_71":70},"YoLOJacw",{},[],"PRIDE includes the ELF operations. However, for safety and convenience nearly every operation has an inverse. The u~er must be permitted, given a list of what he has done recently, to undo it. It: follows that \"destroy\" instructions must fail safe; if given accidentally, they are to be revocable. For safety's sake, it should take several steps to throw a thing away completely. An important option would permit the user to retrace chronologically everything he does on the system.",{"_32":8116,"_34":8117},[],{"_36":160,"_38":8118,"_40":598,"_42":8119,"_67":8120,"_69":8121,"_71":70},"TtfDmblP",{},[],"Most of PRIDE's applications will involve text handling, either as a primary purpose or in the documentation of some other task. Hence a number of features exist for convenient text usage. Text handling con~ands (for modifying entries) include the equivalents of standard proofreader's marks for insertion, deletion and switching of sections.",{"_32":8123,"_34":8124},[],{"_36":160,"_38":8125,"_40":598,"_42":8126,"_67":8127,"_69":8128,"_71":70},"-YiOzFVh",{},[],"Also for text usage and user comfort, there are certain system non-restrictions. There is no practical restriction on the length of an input entry, and it need follow only the most trivial format conventions. In addition, the machine will interrupt any other PRIDE function to receive input text (inspiration mode). It is necessary that entries of unspecified length be acceptable to the system without fuss or warning. PRIDE does not stipulate fixed record lengths, either for input or storage; any such restrictions would have a psychologically cramping effect. There is no reason the system cannot appear to the user to have no fixed or standard unit lengths; the machine's operating units and sections should not concern him.",{"_32":8130,"_34":8131},[],{"_36":160,"_38":8132,"_40":598,"_42":8133,"_67":8134,"_69":8135,"_71":70},"f1ka6_yC",{},[],"Ideally, neither the length of entries, the number of lists, or any other parameter of a file is restricted by anything but the absolute size of all memory. This is a difficult requirement for the progra~ner. Routinely, however, the system should be able to accept entries thousands of characters long, accept hundreds of entries to a list, and accept hundreds of lists in the file. Otherwise, extraneous consideration by the user of whether there's room to add material or try out an offshoot begins to interfere with the system's use.",{"_32":8137,"_34":8138},[],{"_36":160,"_38":8139,"_40":598,"_42":8140,"_67":8141,"_69":8142,"_71":70},"rn5-scNj",{},[],"Although I have avoided discussing the means by which the user sees his file, PRIDE must, of course, have functions and con~nands for .this purpose. For a CRT these include quick lookup schemes 19, preferably with moving menus and means of readily changing the hierarchy of lookup structure; as well as visual cuing and mnemonic formats, including cursor maneuvers, overlays and animated wipes and other transitions. But such glamorous features do not reduce the challenge or worth of working through a line printer, or seeking to make the system useful under a batchprocessing monitor.",{"_32":8144,"_34":8145},[],{"_36":160,"_38":8146,"_40":598,"_42":8147,"_67":8148,"_69":8149,"_71":70},"-JZgp06o",{},[],"Many instructions aside from those already mentioned will be needed by the user; particular applications will require such operations as text lookup and integer arithmetic. And surely all the uses of the system have not been anticipated. Hence a subroutining facility is to be available, reaching to assembly language or opening into the machine's other languages. This could be used for processing the file's contents (e.g., numbers or character strings), or for creating more convenient combined operations out of the different operations dealing with file structure, input-output and text.",{"_32":8151,"_34":8152},[],{"_36":160,"_38":8153,"_40":598,"_42":8154,"_67":8155,"_69":8156,"_71":70},"fEtgYW0R",{},[],"PRIDE is one possible way to make an ELF, or any evolutionary file structure, useful. PRIDE would be a foreground, free-standing language with the primary mission of handling files and manuscripts, as discussed at the beginning, and secondary applications in ordering and documenting other kinds of complex information. Its major use would presumably be in connection with time-shared display and information systems. But such a language is only one suggestion. Actually, there is not much reason that the ELF could not be made a standard file structure for all purposes; unused capabilities would not intrude, but would still be there if unexpectedly wanted. ELF systems could be built into the file capabilities of general utility software. The actual computation involved is relatively trivial, and the ELF could easily be incorporated into I/O routines or data channel languages. Even small-scale hardware implementations are not unthinkable; a control box between a typewriter and a tape recorder, for instance.",{"_32":8158,"_34":8159},[],{"_36":160,"_38":8160,"_40":598,"_42":8161,"_67":8162,"_69":8163,"_71":70},"ywOhpk9X",{},[],"All these applications depend, of course, on the system being actually useful, which is an empirical question. A number of possible applications have been mentioned. But, except as a crutch to man's fallible mind, is there any reason to suppose that the system has any general applicability in principle?",{"_36":870,"_38":8165,"_40":598,"_42":8166,"_67":8167,"_69":8168,"_71":70},"MMUingMw",{},[],"PRIDE",{"_32":8170,"_34":8234},[8171,8178,8185,8192,8199,8206,8213,8220,8227],{"_32":8172,"_34":8173},[],{"_36":160,"_38":8174,"_40":598,"_42":8175,"_67":8176,"_69":8177,"_71":70},"6MUUElO9",{},[],"As \"philosophy\" I want to speak of two major things. First, complex file structures (like the ELF) make possible the creation of complex and significant new mediam, the hypertext and hyperfilm. Second, evolutionary file structures (like the ELF) make it possible to keep track of things that have been changing, without our awareness, all along. These include the major categories of hu, mn thought, which will go on changing.",{"_32":8179,"_34":8180},[],{"_36":160,"_38":8181,"_40":598,"_42":8182,"_67":8183,"_69":8184,"_71":70},"ZVD9A80k",{},[],"Systems of paper have grave limitations for either organizing or presenting ideas. A book is never perfectly suited to the reader; one reader is bored, another confused by the same pages. No system of paper-- book or programmed text-- can adapt very far to the interests or needs of a particular reader or student.",{"_32":8186,"_34":8187},[],{"_36":160,"_38":8188,"_40":598,"_42":8189,"_67":8190,"_69":8191,"_71":70},"CWsgnyzh",{},[],"However, with the computer-driven display and mass memory, it has become possible to create a new, readable medium, for education and enjoyment, that will let the reader find his level, suit his taste, and find the parts that take on special meaning for him, as instruction or entertainment.",{"_32":8193,"_34":8194},[],{"_36":160,"_38":8195,"_40":598,"_42":8196,"_67":8197,"_69":8198,"_71":70},"SY02UKTx",{},[],"Let me introduce the word \"hypertext\"**** to mean a body of written or pictorial material interconnected in such a complex way that it could not conveniently be presented or represented on paper. It may contain summaries or maps of its contents and their interrelations; it may contain annotations, additions, and footnotes from scholars who have examined it. Let me suggest that such an object and system, properly designed and administered, could have great potential for education, increasing the student's range of choices, his sense of freedom, his motivation, and his intellectual grasp*****. Such a system could grow indefinitely, gradually including more and more of the ~rld's written knowledge. However, its internal file structure would have to be built to accept growth, change and complex informational arrangements. The ELF is such a file structure.",{"_32":8200,"_34":8201},[],{"_36":160,"_38":8202,"_40":598,"_42":8203,"_67":8204,"_69":8205,"_71":70},"Y_K24imU",{},[],"Films, sound recordings, and video recordings are also linear strings, basically for mechanical reasons. But these, too, can now be arranged as non-linear systems-- for instance, lattices-- for editing purposes or for display with different emphasis. (This would naturally require computer control, using the ELF or a related system, and various cartridge or re-recording devices.) The hyperfilm-- a browsable or vari-sequenced movie-- is only one of the possible hypermedia that require our attention.",{"_32":8207,"_34":8208},[],{"_36":160,"_38":8209,"_40":598,"_42":8210,"_67":8211,"_69":8212,"_71":70},"ZgtLROtX",{},[],"So much for what we can create afresh with this structure. What about the things that have already been around awhile?",{"_32":8214,"_34":8215},[],{"_36":160,"_38":8216,"_40":598,"_42":8217,"_67":8218,"_69":8219,"_71":70},"MK0ffiAX",{},[],"The physical universe is not all that decays. So do abstractions and categories. Human ideas, science, scholarship and language are constantly collapsing and unfolding. Any field, and the corpus of all fields, is a bundle of relationships subject to all kinds of twists, inversions, involutions and rearrangement: these changes are frequent but unpredictable. Recall that computers, once a branch of mathematics, are now their own field (but the development of fluid logic indicates a possible merger with the art of wind instruments). Social relations, psycholinguistics and psychonomics are new fields, even though they rest on no special discoveries; political economy, natural history and social ethics are gone. Within a given area, too, the subheadings of importance are in constant flux. In the social sciences, for instance, the topic headings of the nineteen-thirties now sound quaint.",{"_32":8221,"_34":8222},[],{"_36":160,"_38":8223,"_40":598,"_42":8224,"_67":8225,"_69":8226,"_71":70},"F6SoEoFA",{},[],"While the disappearance and up-ending of categories and subjects may be erratic,, it never stops; and the meaning of this for information retrieval should be clear. Last week's categories, perhaps last night's field, may be gone today. To the extent that information retrieval is concerned with seeking true or ideal or permanent codes and categories-- and even the most sophisticated \"role indicator\" syntaxes are a form of this endeavor-- to this extent, information retrieval seems to me to be fundamentally mistaken. The categories are chimerical (or temporal) and our categorization systems must evolve as they do. Information systems must have built in the capacity to accept the new categorization systems as they evolve from, or outside, the framework of the old. Not just the new material, but the capacity for new arrangements and indefinite rearrangements of the old, must be possible. In this light, the ELF, indefinitely revisible and unperturbed by changes in overall structural relations, offers some promise.",{"_32":8228,"_34":8229},[],{"_36":160,"_38":8230,"_40":598,"_42":8231,"_67":8232,"_69":8233,"_71":70},"TSbSSVkZ",{},[],"There is, then, a general rationale. I believe that such a system as the ELF actually ties in better than anything previously used with the actual processes by which thought is progressively organized, whether into stories or hypertext or library categories. Thus it may help integrate, for human understanding, bodies of material so diversely connected that they could not be untangled by the unaided mind. For both logistic and psychological reasons it should be an important adjunct to imaginative, integrating and creative enterprises. It is useful where relationships are unclear; where contingencies and tasks are undefined and unpredictable; where the structures or final outcome it must represent are not yet folly known; where we do not know the file's ultimate arrangement; where we do not know what parts of the file are most important; or where things are in permanent and unpredictable flux. Perhaps this includes more places than we think. And perhaps here, as in biology, the only ultimate structure is change itself.",{"_36":870,"_38":8235,"_40":598,"_42":8236,"_67":8237,"_69":8238,"_71":70},"W1agzarw",{},[],"Philosophy",{"_32":8240,"_34":8304},[8241,8248,8255,8262,8269,8276,8283,8290,8297],{"_32":8242,"_34":8243},[],{"_36":160,"_38":8244,"_40":598,"_42":8245,"_67":8246,"_69":8247,"_71":70},"vil6PfRd",{},[],"This paper has proposed a different kind of structure for handling information.",{"_32":8249,"_34":8250},[],{"_36":160,"_38":8251,"_40":598,"_42":8252,"_67":8253,"_69":8254,"_71":70},"euNs9O4g",{},[],"Essentially it is a file with certain storage provisions which, combined, permit the file's contents to be arranged any-which-way, and in any number of ways at once. A set of manipulation functions permits making changes or keeping track of developments. The file is capable of maintaining many different arrangements at the same time, many of which may be dormant. This makes ordinary measures of efficiency inappropriate; as with high fidelity music systems, enrichment is derived from the lavish use of surplus capacity.",{"_32":8256,"_34":8257},[],{"_36":160,"_38":8258,"_40":598,"_42":8259,"_67":8260,"_69":8261,"_71":70},"r-nXVNgr",{},[],"The key ideas of the system are the inter-linking of different lists, regardless of sequence or additions; the re-configurable character of a list complex into any humanly conceivable forms; and the ability to make copies of a whole list, or list complex-- in proliferation, at will-- to record its sequence, contents or arrangement at a given moment. The Evolutionary List File is a member of the class of evolutionary file structures; and its particular advantages are thought to be psychological, not technical. Despite this file's adaptability to complex purposes, it has the advantage of being conceptually very simple. Its structure is complete, closed, and unified as a concept. This is its psychological virtue. Its use can be easily taught to people who do not understand computers. We can use it to try out combinations that interest us, to make alternatives clear in their details and relationships, to keep track of developments as they occur, to sketch things we know, like, or currently require, and it will stand by for modifications. It can be extended for all sorts of purposes, and implemented or incorporated in any programming language.",{"_32":8263,"_34":8264},[],{"_36":160,"_38":8265,"_40":598,"_42":8266,"_67":8267,"_69":8268,"_71":70},"VvNgCVZ8",{},[],"There are probably various possible file structures that will be useful in aiding creative thought. This one operates, as it were, on lists that hook together sideways, and their copies. There may be many more.",{"_32":8270,"_34":8271},[],{"_36":160,"_38":8272,"_40":598,"_42":8273,"_67":8274,"_69":8275,"_71":70},"utmMKr14",{},[],"* The Bush Rapid Selector 2 is a powerful microfilm instrument, but it is not suited to idiosyncratic personal uses, nor to evolutionary modification, as described.",{"_32":8277,"_34":8278},[],{"_36":160,"_38":8279,"_40":598,"_42":8280,"_67":8281,"_69":8282,"_71":70},"qvdApsCp",{},[],"** It is believed that this account is reasonably correct for such writers as Tolstoy, Winston Churchill and Katherine Anne Porter. Those who can adhere to a prior outline faithfully, like James Fenimore Cooper, tend to be either hacks or prodigres, and do not need this system",{"_32":8284,"_34":8285},[],{"_36":160,"_38":8286,"_40":598,"_42":8287,"_67":8288,"_69":8289,"_71":70},"J20Hgxnh",{},[],"*** For a poignant, mordant portrayal of the writer's struggle, the reader is directed to Gorey's \"The Unstrung Harp\", or \"Mr Earbass Writer.s a Novel\".",{"_32":8291,"_34":8292},[],{"_36":160,"_38":8293,"_40":598,"_42":8294,"_67":8295,"_69":8296,"_71":70},"VagoetmH",{},[],"**** An ELF might even be constructed out of cards, blocks, sticks, and strings using techniques of puppetry, but this would not be a convenient object.",{"_32":8298,"_34":8299},[],{"_36":160,"_38":8300,"_40":598,"_42":8301,"_67":8302,"_69":8303,"_71":70},"QbGf8Nlp",{},[],"***** The sense of \"hyper-\" used here connotes extension and generality; cf. \"hyperspace.\" The criterion for this prefix is the inability of these objects to be comprised sensibly into linear media, like the text string, or even media of somewhat higher complexity. The ELF is a hyperfile.",{"_36":870,"_38":8305,"_40":598,"_42":8306,"_67":8307,"_69":8308,"_71":70},"m0CwQfuY",{},[],"CONCLUSION",{"_32":8310,"_34":8444},[8311,8318,8325,8332,8339,8346,8353,8360,8367,8374,8381,8388,8395,8402,8409,8416,8423,8430,8437],{"_32":8312,"_34":8313},[],{"_36":160,"_38":8314,"_40":598,"_42":8315,"_67":8316,"_69":8317,"_71":70},"nbc06OEu",{},[],"Bush, V., \"As We May Think.\" :['he Atlantic Monthly, p. 101-108; July, 1945.",{"_32":8319,"_34":8320},[],{"_36":160,"_38":8321,"_40":598,"_42":8322,"_67":8323,"_69":8324,"_71":70},"gvbiK-6J",{},[],"Hirsch, P., \"The Bush :Ropid Selector.\" Datamation, p. 56-57; June, 1965.",{"_32":8326,"_34":8327},[],{"_36":160,"_38":8328,"_40":598,"_42":8329,"_67":8330,"_69":8331,"_71":70},"2kidwpb4",{},[],"Wallace, E. M., \"Experience with EDP Support of Individuals' File Maintenance.\" Parameters of Information Science: Proceedings of the American. Documentotion Institute (American Documentation Institute), p. 259-261; 1/1964.",{"_32":8333,"_34":8334},[],{"_36":160,"_38":8335,"_40":598,"_42":8336,"_67":8337,"_69":8338,"_71":70},"brjllhDj",{},[],"Gorey, E., \"The Unstrung Harp; or, Mr. Earbrass Writes a Novel,\" Duell, Sloan and Pearce, N. Y.; 1953.",{"_32":8340,"_34":8341},[],{"_36":160,"_38":8342,"_40":598,"_42":8343,"_67":8344,"_69":8345,"_71":70},"j6DZ_V0z",{},[],"IBM Data Processing Division, \"The IBM Administrative Terminal System,\" Brochure 520-1146.",{"_32":8347,"_34":8348},[],{"_36":160,"_38":8349,"_40":598,"_42":8350,"_67":8351,"_69":8352,"_71":70},"Elv4c1-7",{},[],"IBM Technical Publications Department, \"14~0/1460 Administrative Terminal System Application Description,\" White Plains, New York.",{"_32":8354,"_34":8355},[],{"_36":160,"_38":8356,"_40":598,"_42":8357,"_67":8358,"_69":8359,"_71":70},"VXgj2HKv",{},[],"Timberlake, W. D., \"Administrative Terminal System\" (abstract.) STWP Proceedings; May, 1965.",{"_32":8361,"_34":8362},[],{"_36":160,"_38":8363,"_40":598,"_42":8364,"_67":8365,"_69":8366,"_71":70},"sweYTw0R",{},[],"Farrell, A. C., \"Evolution of Automated Writing.\" STWP Proceedings; May, 1965.",{"_32":8368,"_34":8369},[],{"_36":160,"_38":8370,"_40":598,"_42":8371,"_67":8372,"_69":8373,"_71":70},"-MYkGB9e",{},[],"Bobrow, D. G., and Bertram, R., \"A Comparison of ListProcessing Languages.\" Comm. ACM, p. 231-240; April, 1964.",{"_32":8375,"_34":8376},[],{"_36":160,"_38":8377,"_40":598,"_42":8378,"_67":8379,"_69":8380,"_71":70},"-BMvkrba",{},[],"Comfort, W. T., \"Multiword List Items.\" Comm. ACM, p. 357-362; June, 1964.",{"_32":8382,"_34":8383},[],{"_36":160,"_38":8384,"_40":598,"_42":8385,"_67":8386,"_69":8387,"_71":70},"zhPgIVOa",{},[],"Weizenbaum, J., \"Knotted List Structures.\" Comm. ACM, p. 161-165; Mar., 1962.",{"_32":8389,"_34":8390},[],{"_36":160,"_38":8391,"_40":598,"_42":8392,"_67":8393,"_69":8394,"_71":70},"OIfPmIuo",{},[],"Prywes, N. S,, and Gray, H. J., \"The Multilist System for Real Time Storage and Retrieval,\" Proceedings of IFIP Conference, p. 112-116; 1962.",{"_32":8396,"_34":8397},[],{"_36":160,"_38":8398,"_40":598,"_42":8399,"_67":8400,"_69":8401,"_71":70},"6DBy3V5o",{},[],"Prywes, N. S., \"Interim Technical Report: The Organization of Files for Command and Control,\" Moore School o[ Engineering; March, 1964.",{"_32":8403,"_34":8404},[],{"_36":160,"_38":8405,"_40":598,"_42":8406,"_67":8407,"_69":8408,"_71":70},"noLe9wK8",{},[],"Bachman, C. W., and Williams, S. B., \"The Integrated Data Store--A General Purpose Programming System for Random Access Memories,\" AFIPS Conference Proceedings, p. 411-422; 1964.",{"_32":8410,"_34":8411},[],{"_36":160,"_38":8412,"_40":598,"_42":8413,"_67":8414,"_69":8415,"_71":70},"W4FVfs-l",{},[],"General Electric Computer Department, \"I-D-S:\" Company Brochure CPB-425.",{"_32":8417,"_34":8418},[],{"_36":160,"_38":8419,"_40":598,"_42":8420,"_67":8421,"_69":8422,"_71":70},"R9miEYK9",{},[],"General Electric Computer Department, \"Introduction to Integrated Data Store,\" Company Brochure CPB-1048; 1965.",{"_32":8424,"_34":8425},[],{"_36":160,"_38":8426,"_40":598,"_42":8427,"_67":8428,"_69":8429,"_71":70},"6y6dvbQc",{},[],"Bachman, C. W., \"Software for Random Access Processing,\" Datamation; April, 1965.",{"_32":8431,"_34":8432},[],{"_36":160,"_38":8433,"_40":598,"_42":8434,"_67":8435,"_69":8436,"_71":70},"s7sj3fqn",{},[],"General Electric Computer Department, \"Integrated Data Store: New General Electric Technique for Organizing Business Data\"; January, 1965",{"_32":8438,"_34":8439},[],{"_36":160,"_38":8440,"_40":598,"_42":8441,"_67":8442,"_69":8443,"_71":70},"dN4rcSg2",{},[],"Corbin, H. S., and Stock, G. J., \"On-Line Querying via a Display Console,\" Fourth National Symposium on Information Display: Technical Session Proceedings, p. 127-154; 1964",{"_36":870,"_38":8445,"_40":598,"_42":8446,"_67":8447,"_69":3495,"_71":70},"uqI6a1JS",{"_273":2113},[],{"_32":8449,"_34":8482},[8450,8458,8466,8474],{"_32":8451,"_34":8452},[],{"_36":1875,"_38":8453,"_40":598,"_42":8454,"_67":8455,"_69":8456,"_71":8457},"NgIj3tuB",{"_273":323},[],"FIGURE 1 -- Zippered lists: l-for-1 links between entries are invariant under list permutation. ","ipfs://bafkreibl7ifcpyr67u4olo4ohic32kko7x5gato4nlmw7j5xlnwprpcad4",{"_32":8459,"_34":8460},[],{"_36":1875,"_38":8461,"_40":598,"_42":8462,"_67":8463,"_69":8464,"_71":8465},"CdTbIhWM",{"_273":323},[],"FIGURE 2 -- Spinoff of variants: extra versions need little space. ","ipfs://bafkreiadfa7mmsdz53qmhvby672bnwtycms3owbqddu4xqpe7pnkepi7a4",{"_32":8467,"_34":8468},[],{"_36":1875,"_38":8469,"_40":598,"_42":8470,"_67":8471,"_69":8472,"_71":8473},"q8vrVFNn",{"_273":323},[],"FIGURE 3 -- All levels of documentation in the ELF. ","ipfs://bafkreig5gzkizxsjzlsmc3b3poojhl4jqdnglfwedrmwl7q7ilssautoku",{"_32":8475,"_34":8476},[],{"_36":1875,"_38":8477,"_40":598,"_42":8478,"_67":8479,"_69":8480,"_71":8481},"m19q9xbJ",{"_273":323},[],"FIGURE 4 -- ELF's capacity for total filing: hypothetical use by historian. Thin lines indicate links; heavy rules indicate some of same entries. ","ipfs://bafybeicytkj5rhjnrnuuitmhp22z5merjfagbnsgyylu67j25655mod2ii",{"_36":870,"_38":8483,"_40":598,"_42":8484,"_67":8485,"_69":8486,"_71":70},"hfbOZDKK",{},[],"Figures",[54],"/records/42-a-file-structure-for-the-complex-the-charging-and-the-indeterminate",{"_83":613},{},{"_38":595,"_95":54,"_55":8492,"_72":598,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,597],1773151562601,[149,595,598,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/42-a-file-structure-for-the-complex-the-charging-and-the-indeterminate\",\"bafy2bzacedycyq4lxmpja5dwroz5tgu5jkjckbpthslber6ultftqv4ftg22s\",true]",{"_110":8497,"_147":8788,"_150":8789},{"_112":8498,"_131":132,"_133":8787,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":8499,"_38":8785},{"_29":8500,"_72":619,"_73":54,"_74":8781,"_55":8782,"_77":626,"_79":626,"_81":8783,"_85":8784,"_87":619,"_89":90},[8501,8508,8515,8522,8533,8546,8749],{"_32":8502,"_34":8503},[],{"_36":160,"_38":8504,"_40":619,"_42":8505,"_67":8506,"_69":8507,"_71":70},"20cy6VeO",{},[],"A Critique",{"_32":8509,"_34":8510},[],{"_36":160,"_38":8511,"_40":619,"_42":8512,"_67":8513,"_69":8514,"_71":70},"sQLsV_Z-",{},[],"Jef Raskin",{"_32":8516,"_34":8517},[],{"_36":160,"_38":8518,"_40":619,"_42":8519,"_67":8520,"_69":8521,"_71":70},"Z2xKDFDU",{},[],"Information Appliance 1014 Hamilton Court Menlo Park, CA 94025",{"_32":8523,"_34":8524},[],{"_36":8525,"_38":8526,"_40":619,"_42":8527,"_67":8531,"_69":70,"_71":8532},"File","fCVdbVO9",{"_8528":8529,"_83":8530},"size",609579,"317426.317449.pdf",[],"ipfs://bafybeibpfopsn2zgzrvgglv4rgvkt34qq4crmkr3xysybv2mhe44jxlnai",{"_32":8534,"_34":8542},[8535],{"_32":8536,"_34":8537},[],{"_36":160,"_38":8538,"_40":619,"_42":8539,"_67":8540,"_69":8541,"_71":70},"4cDicjfV",{},[],"Hypertext has received a lot of mostly uncritical attention. The author sees it as one part inspiration and nine parts hyperbole. A number of user interface and technical problems are discussed.",{"_36":870,"_38":8543,"_40":619,"_42":8544,"_67":8545,"_69":5873,"_71":70},"a_-1R5YL",{},[],{"_32":8547,"_34":8744},[8548,8555,8562,8569,8576,8583,8590,8597,8604,8611,8618,8625,8632,8639,8646,8653,8660,8667,8674,8681,8688,8695,8702,8709,8716,8723,8730,8737],{"_32":8549,"_34":8550},[],{"_36":160,"_38":8551,"_40":619,"_42":8552,"_67":8553,"_69":8554,"_71":70},"6Ps5RA_N",{},[],"The literature on Hypertext is generally effusive and non-critical. Even Conklin’s survey article in Computer (IEEE Computer, September 1987, pg 17 ff) ends up admitting that the author hopes that “the reader come away from this article excited, eager to try using hypertext for himself, and aware that he is at the beginning of something big, something like the invention of the wheel, but something that still has enough rough edges that no one is really sure that it w-ill fulfill its promise.” This article looks at what some have seen as rough edges but which may be cracks that extend deep into the heart of hypertext.",{"_32":8556,"_34":8557},[],{"_36":160,"_38":8558,"_40":619,"_42":8559,"_67":8560,"_69":8561,"_71":70},"lBb_qwuZ",{},[],"Conklin’s advocacy is tame stuff compared with Hypertext’s prime mover, Ted Nelson, who writes with the messianic verve characteristic of visionaries. Many followers and supporters of the Hypertext concept take much the same tone; in fact, there have not been many who have gainsaid the concept,for on the surface it seems a good one that is well within our technical reach. On the other hand, it has not been implemented except for a few more or less experimental projects: the grand vision languishes unfinished, though often started. If the details are kept fuzzy enough, Hypertext seems like a wonderful, universally applicable, powerful, natural, human-oriented model for organizing and accessingknowledge. Having felt that draw, and also havingimplemented some real-world projects that were considered visionary when I started but became well-accepted (and commercially successful) when I was finished, I took a closer look at Hypertext and found some deep and fundamental difficulties that have not been much discussed.",{"_32":8563,"_34":8564},[],{"_36":160,"_38":8565,"_40":619,"_42":8566,"_67":8567,"_69":8568,"_71":70},"du1Hpm4i",{},[],"A good place to begin is with some other ideas that, like Hypertext, sound very good but are simpler, and have failed to deliver on their promise.",{"_32":8570,"_34":8571},[],{"_36":160,"_38":8572,"_40":619,"_42":8573,"_67":8574,"_69":8575,"_71":70},"ISbpLacr",{},[],"There is a certain frustration in playing adventure games. The games ostensibly avoid requiring that you learn special computer commands by allowing you to frame your commands in English. This sounds very inviting, but whenever your response varies from the stylized vocabulary and grammar that the game recognizes you run into a wall of incomprehension. The game spins off a subgame of guessing which words the developer thought useful or significant. Synonyms in English may or may not be synonyms to the game; you often find that though what you said is correct, it is not accepted. All in all these games tend to be a frustrating experience unless you come to accept that figuring just how to emasculate your vocabulary and grammar is part of the game. Not everybody thinks this is fun, but ifyou enjoy it, you are a prime example of a puzzle- lover or ‘hacker” in the old, non-pejorative sense of a person who likes to play with a system - for hours and days on end if necessary - in order to learn how it works.",{"_32":8577,"_34":8578},[],{"_36":160,"_38":8579,"_40":619,"_42":8580,"_67":8581,"_69":8582,"_71":70},"7LdIe5sx",{},[],"What is really happening in these games is that the players are learning a set of computer commands -by trial and error. In an adventure-style sword battle your knowledge of fencing is of no use, but your knowledge of the system developers’ frame of mind is. The notes that most players end up making for their own use form the manual that the game’s inventors (deliberately) didn’t provide. In other words, there is not much difference between an adventure game and a poorly documented computer program. Both present the same kind of challenge, and appeal to much the same set of users.",{"_32":8584,"_34":8585},[],{"_36":160,"_38":8586,"_40":619,"_42":8587,"_67":8588,"_69":8589,"_71":70},"Oe00S4Cw",{},[],"The problem with adventure games was that something that sounds like the right, natural, inevitable and easiest thing to do failed (in some sense) because it delivered only the aroma of what was promised. When you are hungry, this can be worse than nothing at all. The full mea1 may, in fact, be undeliverable. Natural language may be an inherently unsuitable medium for programming (in the present meaning of the word) or even controlling an imaginary universe.",{"_32":8591,"_34":8592},[],{"_36":160,"_38":8593,"_40":619,"_42":8594,"_67":8595,"_69":8596,"_71":70},"xMS9H8Z8",{},[],"This insight can be extended to Hypertext. Hypertext, in a nutshell, is text (in the sense of what one finds in books) where there are links between different texts and portions of texts for some very large universe of knowledge. You might be reading, on the display of your information appliance, about butterflies. Say that the text mentions a gathering of monarch butterflies that occurs in Monterey, California. Soyou point to (by some means) the word monarch, andyoupress the udelve deeper” button (or some such action) and a picture of the butterfly comes onto your screen. You touch one of the legs of the butterfly and up comes, say, details of the leg of the butterfly or perhaps an article on butterfly legs. You then press the ‘back to where I was”button, and continue reading. Upon pointingto the word“Califomia” the delve deeper button might give you a map of California with Monterey called out, and so forth.",{"_32":8598,"_34":8599},[],{"_36":160,"_38":8600,"_40":619,"_42":8601,"_67":8602,"_69":8603,"_71":70},"2n-jbOIu",{},[],"As technology permits, the concept of “text” in Hypertext expands to include color images, movingimages (movies), sounds, real-time links to the author or other experts on the subject you are “reading’ about, reference librarians who can point to further sources of information, and literally anything else that might conceivably be pumped through wires or the aether to your system.",{"_32":8605,"_34":8606},[],{"_36":160,"_38":8607,"_40":619,"_42":8608,"_67":8609,"_69":8610,"_71":70},"aozE_rb8",{},[],"Lastly, the Hypertext vision includes a growing body of on-line information, becoming richer as it is used because users provide an ever-increasing number of sources of data and links between items. It assumes wide acceptance by a large number of ordinary, non-technophilic people.",{"_32":8612,"_34":8613},[],{"_36":160,"_38":8614,"_40":619,"_42":8615,"_67":8616,"_69":8617,"_71":70},"NEBRLVSs",{},[],"It sounds wonderful.",{"_32":8619,"_34":8620},[],{"_36":160,"_38":8621,"_40":619,"_42":8622,"_67":8623,"_69":8624,"_71":70},"cxFHuJRl",{},[],"There are, of course, some technological questions that can be asked about Hypertext: for example, how will we get the very high bandwidths between sources of information and the individual’s machine required to make pictures and text available quickly enough to avoid frustration? Another technological problem lies in the massive storage capacity, network, switching, and software required. There are social, legal, and economic problems as well. Examples of these problems include questions such as: will the financially privileged have easier access, and thus widen the gap between haves and have nots? Nelson has addressed (though without sufficient depth) the questions of who owns the material, who owns the all-important linkages, how copyrights are preserved, who pays for the central system, how to insure compatibility between systems and how an author gets paid. But this essay is concerned with basic conceptual problems, assuming that the technological problems will be solved in the natural course of events, and leaving the other questions for another time. I will also ignore the very real but probably not as serious “chicken and eg&’ problem of how Hypertext gets started, since at first it is necessarily rather weak and thin. While this last problem will have to be faced, other services, such as telephones faced the same dilemma and overcame it. Whether it gets off the ground depends in part on the quality of the initial system: where will we get enough linked text to make it useful at first?",{"_32":8626,"_34":8627},[],{"_36":160,"_38":8628,"_40":619,"_42":8629,"_67":8630,"_69":8631,"_71":70},"wXUYYqAh",{},[],"The problem with “natural language” games, which also applies to many “natural language” interfaces for more serious (this does not imply more worthy) applications, has a parallel in the proposed Hypertext systems. As an example, take the passage where the text mentioned a gathering of monarch butterflies. First of all, not every word will have the same kind or depth of information behind it. Say that a previous user had looked up the meaning of the word Umonarch” and established a link to ‘king.” Then, when you point to umonarch” meaning a kind of butterfly, you might find yourself in the midst of a discussion of the divine rights of hereditary rulers. Yougo“up”and try“butterfly”andyoufindageneraldescription ofthelepidoptera, which does not mention “monarch” since it only gives the Latin name, which you do not recognize. You can grope around for a while, trying this and that sub-heading in what you find, and maybe what you want is there, and maybe it isn’t. One key question is: How Do You Know If It’sThere? This isn’t the advertised smooth, rapid access “feel” of hypertext, this is a fishing expedition.",{"_32":8633,"_34":8634},[],{"_36":160,"_38":8635,"_40":619,"_42":8636,"_67":8637,"_69":8638,"_71":70},"Hcvv6_TM",{},[],"Let’s say that, by some means, you can point for specificity to the whole phrase “monarch butterfly” and you get, rather than some particular linked item, a list or menu of such items and other menus. Aside from having to learn how to operate the menus and make selections from them, it is well known that menus are a slow way of getting from place to place, especially if they are many levels deep. Avoiding, also, the question ofhow (orby whom) the menus are generated (Nelson suggests that people will spontaneously create them and charge for their use), let’s say that one menu item leads you to a picture of the butterfly. As before, you point to a leg. Now, it is not clear if you are pointing to, say, the tarsus, the whole leg, to legs in general, to butterfly legs, or to the whole insect. Since butterflies are beautifully symmetrical, are you pointing to ask about symmetry in general?",{"_32":8640,"_34":8641},[],{"_36":160,"_38":8642,"_40":619,"_42":8643,"_67":8644,"_69":8645,"_71":70},"giJZc-me",{},[],"Not every item or detail in a picture will have a reference attached to it. How will you tell which do and which don’t? None of the references about Hypertext seem to carefully address this problem. I tried a medical “Hypertext” styled system a few months ago, based onvideo disks with immense storage capacity. You could point to a structure in a dissection and get a close up view, or views from other angles. It seemed fine when being demonstrated by someone who knew which body parts had further data behind them, but when I tried to use it and pointed to structures that I was curious about, most of the time the system, being finite, could give me no information.",{"_32":8647,"_34":8648},[],{"_36":160,"_38":8649,"_40":619,"_42":8650,"_67":8651,"_69":8652,"_71":70},"vOxfj08Y",{},[],"There is a vague assumption that as people use it, the system will monitor and gather up the links they generate, and thus grow in depth and value. Does a link happen whenever you move from one frame or screenful to another? It will not, according to Nelson. You will have to explicitly tell the system when you are making a link (just how you do this is not specified), and I think it is important to ask if you are likely to bother making links at all. Remember: people are inherently lazy, and when you are hot on the trail of some information how likely are you to stop and tell the system which links seem valuable to you? If as a result of this observation you make the system record all links, good and bad, will there be human editors who will prune them (and where would we get these editors, how would we pay them, and is it in principle even possible to tell a good link from a bad link?) If the links are not pruned, won’t most searches turn into wild goose chases? One man’s links are another man’s sausages.",{"_32":8654,"_34":8655},[],{"_36":160,"_38":8656,"_40":619,"_42":8657,"_67":8658,"_69":8659,"_71":70},"RrBGLYMM",{},[],"In other words, it is not clear that it can work as neatly as the hand-waving of its visionaries make it seem. I have been told that there areno bad links, and in a sense this is correct: any connection, even if it is a misreading of, say, “sheer” for “shear,” is meaningful and potentially useful (say to a person studying common reading mistakes, or to a poet). But the clutter a user faces will be enormous.",{"_32":8661,"_34":8662},[],{"_36":160,"_38":8663,"_40":619,"_42":8664,"_67":8665,"_69":8666,"_71":70},"r0h86nS-",{},[],"The central lacuna is the omission of any specification of a human interface. The Xanadu project, trying to implement a real-world version of Hypertext, is just building a central processing and storage facility. When I have asked the implementors what it will look like to the user-a central question if it is to be widely accepted, and it must be used by a large population to fulfill the plans of its inventors -they say that the “front end” is not their concern. I claim that the “front end,” namely what devices and how it will look to users is as important as the central nexus. It may be more important, since if the front end puts people off, they will never get any further. Yet there is no user interface specification for what Hypertext will look like to the individual user. It is important that the user interface be reasonably uniform from implementation to implementation. This point has been well demonstrated by the Apple Macintosh computer. One of my goals when designing the Mac was to make it easier for a software designer to use a provided interface model than to create a new one. This was a positive use of people’s laziness. Thus, unlike any previous system, you can move from application to application with relative ease, and buying a new programis not as traumatic an experience asitused tobe. With earlier computers, each new application program gave you a nearly totally new experience.",{"_32":8668,"_34":8669},[],{"_36":160,"_38":8670,"_40":619,"_42":8671,"_67":8672,"_69":8673,"_71":70},"jV0qNpZK",{},[],"A Hypertext system will have good “feel” only if it is fast enough. This is another area solved primarily by looking the other way. In ten years the word“work” may easily generate 200 pages of menus of referents (since the word “work,” like so many other words, has everything from negative imphcations (dirty work) to positive ones (work ethic), to technical ones (force times distance), to political ones (ownership of one’s labor)). How long will it take the central system to find the menus, how long will it take to transmit them, how long will it take you to go through them, how long will it take you to get to the next submenu. 3 Most people don’t use dictionaries and encyclopedias because it takes from half a minute to a few minutes to look something up. If a computer system is as slow or slower, it will be avoided as thoroughly as people avoid other reference systems.",{"_32":8675,"_34":8676},[],{"_36":160,"_38":8677,"_40":619,"_42":8678,"_67":8679,"_69":8680,"_71":70},"wHOxmRd4",{},[],"The lack of a carefully thought out “front end” is thus a major flaw in the design of Hypertext. A person should be able to use it from any available port, whether at home, at school, in the office, at the library, or when walking in the park using Alan Kay’s mythical Dynabook. (There’s another fine-sounding idea that has never been specified to the point where you can evaluate if it’s workable. It, too, lacks an interface specification and apparently does what the user intends by a combination of wishful thinking and magic.)",{"_32":8682,"_34":8683},[],{"_36":160,"_38":8684,"_40":619,"_42":8685,"_67":8686,"_69":8687,"_71":70},"_eBVbOxc",{},[],"In short, Hypertext only sounds like a good idea. It tends to evaporate when looked at closely. There are three basic human interface problems: (i) the linkages are often either cumbersome, wrong for your needs, or trivial, (ii) the problem of what aspect of a word, phrase, or picture you intend has not been addressed, (iii) a uniform and excellent human interface specification is both necessary and absent.",{"_32":8689,"_34":8690},[],{"_36":160,"_38":8691,"_40":619,"_42":8692,"_67":8693,"_69":8694,"_71":70},"_ks5UroC",{},[],"I am sure enough of human ability to believe that the problems being addressed by Hypertext- like systems are not impossible to solve. What I am questioning is whether this particular proposed part of a solution, namely linked text (with a very broad definition of “text”) is the right one, or even a feasible one. As with playing“adventure” games, you will be trying to second guess the link builder’s frame of mind rather than staying within the subject you are working with. Knowledge of the system will often be more valuable than understanding your field. As the students of a poor teacher learn to give not the right answers but those the teacher wants, Hypertext users will spend much of their time pleasing the system instead of themselves.",{"_32":8696,"_34":8697},[],{"_36":160,"_38":8698,"_40":619,"_42":8699,"_67":8700,"_69":8701,"_71":70},"nFS_NnyR",{},[],"It is perhaps worthwhile asking why Nelson and the Xanadu people have looked at the aspects they have and ignored the ones mentioned here. I hope I may be excused for making an ad hominem observation: these people consider themselves hackers (in the best sense). They feel at home at the annual Hackers’ Conference. They love technology, and like Joyce’s Leopold Bloom, thrive on innards. They can discuss the minutiae of a particular system to all hours and, I fear, sometimes confuse their satisfaction in technical ingenuity and accomplishment with usability. The power of a linked data structure is formidable and amazing. My own thesis in computer science exploited such a structure. From speaking with Xanadu’s implementors, and some people who hope to tap into its data, I have seen how they have been seduced. The potential is enormous, the attention given to implementation of searches into vast quantities of human knowledge brilliant, and a host of fascinating problems in computer science have been attacked, and some seem solved. One gets an honest feeling of accomplishment. But they have not addressed the question: when a person sits down at her system what will have to be done first? What will she see? What is the next step the user takes, and the next...? How will it look? How many keystrokes or mouse pushes or dnger jabs will it take to find what is wanted? How long will it take? No, they speak to me of megabytes and optical disks instead of Susan and Jim and Marjorie and Bill. They speak of the great benefits that will accrue to individuals - that’s one end; and the vast linked data base - that’s the other end. But when asked how the ends are made to meet, just how the natural impedence between them is overcome, the designers become inspecific and waflle. How humans interact with systems is not their field and is not really close to their hearts. It is not the computer science they studied. It is a soft subject and making good interfaces (which they fervently believe should be done) will not win them the sincerest plaudits of their peers.",{"_32":8703,"_34":8704},[],{"_36":160,"_38":8705,"_40":619,"_42":8706,"_67":8707,"_69":8708,"_71":70},"FWOV7fMg",{},[],"None of this denies their interest in doing good things for the world and for individual people. The “how” just hasn’t been thought through. This may stem from Nelson’s belief that “rhe starting point in designing a computer system must be the creation of the conceptual and psychological environment -the seeming of the system [a nice phrase, but not very informative] -what I and my associates call the ‘virtuality.“’",{"_32":8710,"_34":8711},[],{"_36":160,"_38":8712,"_40":619,"_42":8713,"_67":8714,"_69":8715,"_71":70},"xGy0fVhy",{},[],"And what everybody else calls the “concept.” I agree that one must begin by deciding, as Nelson says, “bow it ought to be.” Unfortunately, Nelson’s “how it ought to be” does not include specifics of how it works in detail. Whether the hypertext concept is useful or not is most decidedly a function of the user interface, just as computers are more or less useful depending on how they facilitate access to their power. Consider the relative di&ulty of using a double-edged razor blade without a handle. It is just as sharp, but much harder to use. Nelson’s avoidance of what he calls “front end” issues is a major failing in the quality of his vision, his priorities, and his understanding of what makes things work well for people.",{"_32":8717,"_34":8718},[],{"_36":160,"_38":8719,"_40":619,"_42":8720,"_67":8721,"_69":8722,"_71":70},"CBXbnSIC",{},[],"Since creating the Macintosh project at Apple I’ve led the design of a number of products including the Canon Cat and SwyftWare. In the process, my associates and I obtained an excellent interface between people and text by using exactly what Nelson decried: a straightfor- ward linear structure. It was acted upon not by links and list processing but by an extremely fast search (which can be considered a real-time volatile link). One major difference is that we were driven to this internal structure by starting with a particular and finely tuned human interface, and only then searching for technology to implement it. I do not agree with Nelson’s statement that people naturally think in hierarchical structures of many layers. If that assumption falls, so does most of the Hypertext concept. Studies show that people prefer flat structures over deep ones, and if we do not accede to the way humans work then we are not likely to design workable products.",{"_32":8724,"_34":8725},[],{"_36":160,"_38":8726,"_40":619,"_42":8727,"_67":8728,"_69":8729,"_71":70},"xwuvOE_7",{},[],"The Hypertext vision is worth a try. The demonstrations so far have been tantalizing. It is my guess that the reality will remain tantalizing, and will never fulfill the dreams of Hypertext’s advocates - nor the dreams that they instilled in me, for that matter.",{"_32":8731,"_34":8732},[],{"_36":160,"_38":8733,"_40":619,"_42":8734,"_67":8735,"_69":8736,"_71":70},"5GA6nFW1",{},[],"While Hypertext itself may or may not be a good idea, the vision of giving everybody access to vast reaches of human knowledge is a praiseworthy one. There are probably better and more realizable ways. Hypertext is certainly incomplete at present, both in terms of implementation (as its designers would agree) and in terms of concept (they might not agree). My intent has been to present a countervailing opinion to the vast majority of what has been written and to balance the present uncritical discussion (that is, adulation) of Hypertext.",{"_32":8738,"_34":8739},[],{"_36":160,"_38":8740,"_40":619,"_42":8741,"_67":8742,"_69":8743,"_71":70},"bbJxeQVK",{},[],"Thanks to David Alzofon, Sam Bernstein, and Scott Kim for their constructive comments.",{"_36":870,"_38":8745,"_40":619,"_42":8746,"_67":8747,"_69":8748,"_71":70},"gJdEF3e3",{},[],"A CRITIQUE",{"_32":8750,"_34":8777},[8751,8758,8770],{"_32":8752,"_34":8753},[],{"_36":160,"_38":8754,"_40":619,"_42":8755,"_67":8756,"_69":8757,"_71":70},"4GwbvGmn",{},[],"Conklin, Jeff,“Hypertext: An Introduction and Survey-, IEEE Computer, September 1987,17ff.",{"_32":8759,"_34":8760},[],{"_36":160,"_38":8761,"_40":619,"_42":8762,"_67":8763,"_69":8769,"_71":70},"M04wkaKc",{},[8764],{"_36":919,"_167":8765,"_169":8766,"_42":8768,"_71":70},[137],[8767],408,{},"Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission.",{"_32":8771,"_34":8772},[],{"_36":160,"_38":8773,"_40":619,"_42":8774,"_67":8775,"_69":8776,"_71":70},"32eHgLoA",{},[],"c 1989 ACM 089791-340-X/89/001 l/0330$1.50 330",{"_36":870,"_38":8778,"_40":619,"_42":8779,"_67":8780,"_69":7367,"_71":70},"2jkLBy9Y",{},[],[54],"/records/the-hype-in-hypertext",{"_83":635},{},{"_38":616,"_95":54,"_55":8786,"_72":619,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,618],1773151562568,[149,616,619,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/the-hype-in-hypertext\",\"bafy2bzacecxctduy6skwjksign4curadmp63aojdgrkhaiso2gvseh4usks6a\",true]",{"_110":8791,"_147":9676,"_150":9677},{"_112":8792,"_131":132,"_133":9675,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":8793,"_38":9673},{"_29":8794,"_72":641,"_73":54,"_74":9669,"_55":9670,"_77":648,"_79":648,"_81":9671,"_85":9672,"_87":641,"_89":90},[8795,8806,8817,8839,8868,8919,8955,9012,9091,9128,9182,9219,9256,9293,9450,9473],{"_32":8796,"_34":8797},[],{"_36":160,"_38":8798,"_40":641,"_42":8799,"_67":8800,"_69":8805,"_71":70},"HNVkV_Rj",{},[8801],{"_36":166,"_167":8802,"_169":8803,"_42":8804,"_71":70},[137],[1488],{},"Satoshi Nakamoto",{"_32":8807,"_34":8808},[],{"_36":160,"_38":8809,"_40":641,"_42":8810,"_67":8811,"_69":8816,"_71":70},"iaE0Nhmv",{},[8812],{"_36":166,"_167":8813,"_169":8814,"_42":8815,"_71":70},[137],[1488],{},"October 31, 2008",{"_32":8818,"_34":8826},[8819],{"_32":8820,"_34":8821},[],{"_36":160,"_38":8822,"_40":641,"_42":8823,"_67":8824,"_69":8825,"_71":70},"kCo8J7Pg",{},[],"A purely peer-to-peer version of electronic cash would allow online payments to be sent directly from one party to another without going through a financial institution. Digital signatures provide part of the solution, but the main benefits are lost if a trusted third party is still required to prevent double-spending. We propose a solution to the double-spending problem using a peer-to-peer network. The network timestamps transactions by hashing them into an ongoing chain of hash-based proof-of-work, forming a record that cannot be changed without redoing the proof-of-work. The longest chain not only serves as proof of the sequence of events witnessed, but proof that it came from the largest pool of CPU power. As long as a majority of CPU power is controlled by nodes that are not cooperating to attack the network, they'll generate the longest chain and outpace attackers. The network itself requires minimal structure. Messages are broadcast on a best effort basis, and nodes can leave and rejoin the network at will, accepting the longest proof-of-work chain as proof of what happened while they were gone.",{"_36":870,"_38":8827,"_40":641,"_42":8828,"_67":8829,"_69":1827,"_71":70},"pQ0OBPyz",{},[8830,8834],{"_36":166,"_167":8831,"_169":8832,"_42":8833,"_71":70},[137],[240],{},{"_36":204,"_167":8835,"_169":8836,"_42":8837,"_71":8838},[137],[240],{},"https://nakamotoinstitute.org/bitcoin/#abstract",{"_32":8840,"_34":8855},[8841,8848],{"_32":8842,"_34":8843},[],{"_36":160,"_38":8844,"_40":641,"_42":8845,"_67":8846,"_69":8847,"_71":70},"jWY-Y6D6",{},[],"Commerce on the Internet has come to rely almost exclusively on financial institutions serving as trusted third parties to process electronic payments. While the system works well enough for most transactions, it still suffers from the inherent weaknesses of the trust based model. Completely non-reversible transactions are not really possible, since financial institutions cannot avoid mediating disputes. The cost of mediation increases transaction costs, limiting the minimum practical transaction size and cutting off the possibility for small casual transactions, and there is a broader cost in the loss of ability to make non-reversible payments for non-reversible services. With the possibility of reversal, the need for trust spreads. Merchants must be wary of their customers, hassling them for more information than they would otherwise need. A certain percentage of fraud is accepted as unavoidable. These costs and payment uncertainties can be avoided in person by using physical currency, but no mechanism exists to make payments over a communications channel without a trusted party.",{"_32":8849,"_34":8850},[],{"_36":160,"_38":8851,"_40":641,"_42":8852,"_67":8853,"_69":8854,"_71":70},"PHk1QkGN",{},[],"What is needed is an electronic payment system based on cryptographic proof instead of trust, allowing any two willing parties to transact directly with each other without the need for a trusted third party. Transactions that are computationally impractical to reverse would protect sellers from fraud, and routine escrow mechanisms could easily be implemented to protect buyers. In this paper, we propose a solution to the double-spending problem using a peer-to-peer distributed timestamp server to generate computational proof of the chronological order of transactions. The system is secure as long as honest nodes collectively control more CPU power than any cooperating group of attacker nodes.",{"_36":870,"_38":8856,"_40":641,"_42":8857,"_67":8858,"_69":3644,"_71":70},"9sGRIlRH",{},[8859,8863],{"_36":166,"_167":8860,"_169":8861,"_42":8862,"_71":70},[137],[2828],{},{"_36":204,"_167":8864,"_169":8865,"_42":8866,"_71":8867},[137],[2828],{},"https://nakamotoinstitute.org/bitcoin/#introduction",{"_32":8869,"_34":8905},[8870,8877,8884,8891],{"_32":8871,"_34":8872},[],{"_36":160,"_38":8873,"_40":641,"_42":8874,"_67":8875,"_69":8876,"_71":70},"R5WfY63y",{},[],"We define an electronic coin as a chain of digital signatures. Each owner transfers the coin to the next by digitally signing a hash of the previous transaction and the public key of the next owner and adding these to the end of the coin. A payee can verify the signatures to verify the chain of ownership.",{"_32":8878,"_34":8879},[],{"_36":1875,"_38":8880,"_40":641,"_42":8881,"_67":8882,"_69":70,"_71":8883},"MeBqGm1Q",{"_273":323},[],"ipfs://bafkreib4meyv5hau4dwqs7by22dezuv6bwkuostrcny67q6e2vgfxyyex4",{"_32":8885,"_34":8886},[],{"_36":160,"_38":8887,"_40":641,"_42":8888,"_67":8889,"_69":8890,"_71":70},"qsJVvV7s",{},[],"The problem of course is the payee can't verify that one of the owners did not double-spend the coin. A common solution is to introduce a trusted central authority, or mint, that checks every transaction for double spending. After each transaction, the coin must be returned to the mint to issue a new coin, and only coins issued directly from the mint are trusted not to be double-spent. The problem with this solution is that the fate of the entire money system depends on the company running the mint, with every transaction having to go through them, just like a bank.",{"_32":8892,"_34":8893},[],{"_36":160,"_38":8894,"_40":641,"_42":8895,"_67":8896,"_69":8904,"_71":70},"iOhTN5L1",{},[8897],{"_36":204,"_167":8898,"_169":8900,"_42":8902,"_71":8903},[8899],491,[8901],494,{},"https://nakamotoinstitute.org/bitcoin/#fn1","We need a way for the payee to know that the previous owners did not sign any earlier transactions. For our purposes, the earliest transaction is the one that counts, so we don't care about later attempts to double-spend. The only way to confirm the absence of a transaction is to be aware of all transactions. In the mint based model, the mint was aware of all transactions and decided which arrived first. To accomplish this without a trusted party, transactions must be publicly announced[1], and we need a system for participants to agree on a single history of the order in which they were received. The payee needs proof that at the time of each transaction, the majority of nodes agreed it was the first received.",{"_36":870,"_38":8906,"_40":641,"_42":8907,"_67":8908,"_69":8918,"_71":70},"J7Dg1bVM",{},[8909,8913],{"_36":166,"_167":8910,"_169":8911,"_42":8912,"_71":70},[137],[2828],{},{"_36":204,"_167":8914,"_169":8915,"_42":8916,"_71":8917},[137],[2828],{},"https://nakamotoinstitute.org/bitcoin/#transactions","2. Transactions",{"_32":8920,"_34":8941},[8921,8934],{"_32":8922,"_34":8923},[],{"_36":160,"_38":8924,"_40":641,"_42":8925,"_67":8926,"_69":8933,"_71":70},"WQO8i5l7",{},[8927],{"_36":204,"_167":8928,"_169":8930,"_42":8931,"_71":8932},[8929],205,[7213],{},"https://nakamotoinstitute.org/bitcoin/#fn2","The solution we propose begins with a timestamp server. A timestamp server works by taking a hash of a block of items to be timestamped and widely publishing the hash, such as in a newspaper or Usenet post[2-5]. The timestamp proves that the data must have existed at the time, obviously, in order to get into the hash. Each timestamp includes the previous timestamp in its hash, forming a chain, with each additional timestamp reinforcing the ones before it.",{"_32":8935,"_34":8936},[],{"_36":1875,"_38":8937,"_40":641,"_42":8938,"_67":8939,"_69":70,"_71":8940},"UnYaJtxx",{"_273":323},[],"ipfs://bafkreic6cq4efid3zaurju5arjgt5lztptsf27x53aqsoipcg6irhuvom4",{"_36":870,"_38":8942,"_40":641,"_42":8943,"_67":8944,"_69":8954,"_71":70},"yMrTBh1k",{},[8945,8949],{"_36":166,"_167":8946,"_169":8947,"_42":8948,"_71":70},[137],[985],{},{"_36":204,"_167":8950,"_169":8951,"_42":8952,"_71":8953},[137],[985],{},"https://nakamotoinstitute.org/bitcoin/#timestamp-server","3. Timestamp Server",{"_32":8956,"_34":8998},[8957,8970,8977,8984,8991],{"_32":8958,"_34":8959},[],{"_36":160,"_38":8960,"_40":641,"_42":8961,"_67":8962,"_69":8969,"_71":70},"ayevYwmO",{},[8963],{"_36":204,"_167":8964,"_169":8965,"_42":8967,"_71":8968},[6411],[8966],146,{},"https://nakamotoinstitute.org/bitcoin/#fn6","To implement a distributed timestamp server on a peer-to-peer basis, we will need to use a proof-of-work system similar to Adam Back's Hashcash[6], rather than newspaper or Usenet posts. The proof-of-work involves scanning for a value that when hashed, such as with SHA-256, the hash begins with a number of zero bits. The average work required is exponential in the number of zero bits required and can be verified by executing a single hash.",{"_32":8971,"_34":8972},[],{"_36":160,"_38":8973,"_40":641,"_42":8974,"_67":8975,"_69":8976,"_71":70},"sRwP_Uc5",{},[],"For our timestamp network, we implement the proof-of-work by incrementing a nonce in the block until a value is found that gives the block's hash the required zero bits. Once the CPU effort has been expended to make it satisfy the proof-of-work, the block cannot be changed without redoing the work. As later blocks are chained after it, the work to change the block would include redoing all the blocks after it.",{"_32":8978,"_34":8979},[],{"_36":1875,"_38":8980,"_40":641,"_42":8981,"_67":8982,"_69":70,"_71":8983},"OtvgfOVN",{"_273":323},[],"ipfs://bafkreiahzzkrdps5wi74hqffkz2fvebt4mvvgyavdhnogbudub4hfgxtpm",{"_32":8985,"_34":8986},[],{"_36":160,"_38":8987,"_40":641,"_42":8988,"_67":8989,"_69":8990,"_71":70},"GW_zkZNu",{},[],"The proof-of-work also solves the problem of determining representation in majority decision making. If the majority were based on one-IP-address-one-vote, it could be subverted by anyone able to allocate many IPs. Proof-of-work is essentially one-CPU-one-vote. The majority decision is represented by the longest chain, which has the greatest proof-of-work effort invested in it. If a majority of CPU power is controlled by honest nodes, the honest chain will grow the fastest and outpace any competing chains. To modify a past block, an attacker would have to redo the proof-of-work of the block and all blocks after it and then catch up with and surpass the work of the honest nodes. We will show later that the probability of a slower attacker catching up diminishes exponentially as subsequent blocks are added.",{"_32":8992,"_34":8993},[],{"_36":160,"_38":8994,"_40":641,"_42":8995,"_67":8996,"_69":8997,"_71":70},"YUtnyzrd",{},[],"To compensate for increasing hardware speed and varying interest in running nodes over time, the proof-of-work difficulty is determined by a moving average targeting an average number of blocks per hour. If they're generated too fast, the difficulty increases.",{"_36":870,"_38":8999,"_40":641,"_42":9000,"_67":9001,"_69":9011,"_71":70},"nf2b7GGB",{},[9002,9006],{"_36":166,"_167":9003,"_169":9004,"_42":9005,"_71":70},[137],[1488],{},{"_36":204,"_167":9007,"_169":9008,"_42":9009,"_71":9010},[137],[1488],{},"https://nakamotoinstitute.org/bitcoin/#proof-of-work","4. Proof-of-Work",{"_32":9013,"_34":9077},[9014,9063,9070],{"_32":9015,"_34":9058},[9016,9023,9030,9037,9044,9051],{"_32":9017,"_34":9018},[],{"_36":160,"_38":9019,"_40":641,"_42":9020,"_67":9021,"_69":9022,"_71":70},"xnZyeCk2",{},[],"New transactions are broadcast to all nodes.",{"_32":9024,"_34":9025},[],{"_36":160,"_38":9026,"_40":641,"_42":9027,"_67":9028,"_69":9029,"_71":70},"AlsfKdCK",{},[],"Each node collects new transactions into a block.",{"_32":9031,"_34":9032},[],{"_36":160,"_38":9033,"_40":641,"_42":9034,"_67":9035,"_69":9036,"_71":70},"y7SelTcb",{},[],"Each node works on finding a difficult proof-of-work for its block.",{"_32":9038,"_34":9039},[],{"_36":160,"_38":9040,"_40":641,"_42":9041,"_67":9042,"_69":9043,"_71":70},"NwjkTm5j",{},[],"When a node finds a proof-of-work, it broadcasts the block to all nodes.",{"_32":9045,"_34":9046},[],{"_36":160,"_38":9047,"_40":641,"_42":9048,"_67":9049,"_69":9050,"_71":70},"POHtdPnm",{},[],"Nodes accept the block only if all transactions in it are valid and not already spent.",{"_32":9052,"_34":9053},[],{"_36":160,"_38":9054,"_40":641,"_42":9055,"_67":9056,"_69":9057,"_71":70},"QX5Js2Lg",{},[],"Nodes express their acceptance of the block by working on creating the next block in the chain, using the hash of the accepted block as the previous hash.",{"_36":160,"_38":9059,"_40":641,"_42":9060,"_67":9061,"_69":9062,"_71":70},"stjxMQ1o",{"_273":2113},[],"The steps to run the network are as follows:",{"_32":9064,"_34":9065},[],{"_36":160,"_38":9066,"_40":641,"_42":9067,"_67":9068,"_69":9069,"_71":70},"9XCQHXzN",{},[],"Nodes always consider the longest chain to be the correct one and will keep working on extending it. If two nodes broadcast different versions of the next block simultaneously, some nodes may receive one or the other first. In that case, they work on the first one they received, but save the other branch in case it becomes longer. The tie will be broken when the next proof-of-work is found and one branch becomes longer; the nodes that were working on the other branch will then switch to the longer one.",{"_32":9071,"_34":9072},[],{"_36":160,"_38":9073,"_40":641,"_42":9074,"_67":9075,"_69":9076,"_71":70},"9BXGFX94",{},[],"New transaction broadcasts do not necessarily need to reach all nodes. As long as they reach many nodes, they will get into a block before long. Block broadcasts are also tolerant of dropped messages. If a node does not receive a block, it will request it when it receives the next block and realizes it missed one.",{"_36":870,"_38":9078,"_40":641,"_42":9079,"_67":9080,"_69":9090,"_71":70},"4X-jcZsW",{},[9081,9085],{"_36":166,"_167":9082,"_169":9083,"_42":9084,"_71":70},[137],[6982],{},{"_36":204,"_167":9086,"_169":9087,"_42":9088,"_71":9089},[137],[6982],{},"https://nakamotoinstitute.org/bitcoin/#network","5. Network",{"_32":9092,"_34":9114},[9093,9100,9107],{"_32":9094,"_34":9095},[],{"_36":160,"_38":9096,"_40":641,"_42":9097,"_67":9098,"_69":9099,"_71":70},"DcJNmWb1",{},[],"By convention, the first transaction in a block is a special transaction that starts a new coin owned by the creator of the block. This adds an incentive for nodes to support the network, and provides a way to initially distribute coins into circulation, since there is no central authority to issue them. The steady addition of a constant of amount of new coins is analogous to gold miners expending resources to add gold to circulation. In our case, it is CPU time and electricity that is expended.",{"_32":9101,"_34":9102},[],{"_36":160,"_38":9103,"_40":641,"_42":9104,"_67":9105,"_69":9106,"_71":70},"Ii3Gc6bh",{},[],"The incentive can also be funded with transaction fees. If the output value of a transaction is less than its input value, the difference is a transaction fee that is added to the incentive value of the block containing the transaction. Once a predetermined number of coins have entered circulation, the incentive can transition entirely to transaction fees and be completely inflation free.",{"_32":9108,"_34":9109},[],{"_36":160,"_38":9110,"_40":641,"_42":9111,"_67":9112,"_69":9113,"_71":70},"_aY-zK4q",{},[],"The incentive may help encourage nodes to stay honest. If a greedy attacker is able to assemble more CPU power than all the honest nodes, he would have to choose between using it to defraud people by stealing back his payments, or using it to generate new coins. He ought to find it more profitable to play by the rules, such rules that favour him with more new coins than everyone else combined, than to undermine the system and the validity of his own wealth.",{"_36":870,"_38":9115,"_40":641,"_42":9116,"_67":9117,"_69":9127,"_71":70},"jDpfMGhC",{},[9118,9122],{"_36":166,"_167":9119,"_169":9120,"_42":9121,"_71":70},[137],[1542],{},{"_36":204,"_167":9123,"_169":9124,"_42":9125,"_71":9126},[137],[1542],{},"https://nakamotoinstitute.org/bitcoin/#incentive","6. Incentive",{"_32":9129,"_34":9168},[9130,9154,9161],{"_32":9131,"_34":9132},[],{"_36":160,"_38":9133,"_40":641,"_42":9134,"_67":9135,"_69":9153,"_71":70},"lRg_J6DG",{},[9136,9142,9147],{"_36":204,"_167":9137,"_169":9138,"_42":9140,"_71":9141},[6375],[9139],237,{},"https://nakamotoinstitute.org/bitcoin/#fn7",{"_36":204,"_167":9143,"_169":9144,"_42":9146,"_71":8932},[9139],[9145],240,{},{"_36":204,"_167":9148,"_169":9149,"_42":9151,"_71":9152},[9145],[9150],243,{},"https://nakamotoinstitute.org/bitcoin/#fn5","Once the latest transaction in a coin is buried under enough blocks, the spent transactions before it can be discarded to save disk space. To facilitate this without breaking the block's hash, transactions are hashed in a Merkle Tree [7][2][5], with only the root included in the block's hash. Old blocks can then be compacted by stubbing off branches of the tree. The interior hashes do not need to be stored.",{"_32":9155,"_34":9156},[],{"_36":1875,"_38":9157,"_40":641,"_42":9158,"_67":9159,"_69":70,"_71":9160},"jaLqvM2d",{"_273":323},[],"ipfs://bafkreifwfibgbkxosbamhxh2yb7lzlolgjmtuqivxmbcseuuucxuydbmem",{"_32":9162,"_34":9163},[],{"_36":160,"_38":9164,"_40":641,"_42":9165,"_67":9166,"_69":9167,"_71":70},"TqnqJuzW",{},[],"A block header with no transactions would be about 80 bytes. If we suppose blocks are generated every 10 minutes, 80 bytes *6 *24 * 365 = 4.2MB per year. With computer systems typically selling with 2GB of RAM as of 2008, and Moore's Law predicting current growth of 1.2GB per year, storage should not be a problem even if the block headers must be kept in memory.",{"_36":870,"_38":9169,"_40":641,"_42":9170,"_67":9171,"_69":9181,"_71":70},"vGE1pRQD",{},[9172,9176],{"_36":166,"_167":9173,"_169":9174,"_42":9175,"_71":70},[137],[2531],{},{"_36":204,"_167":9177,"_169":9178,"_42":9179,"_71":9180},[137],[2531],{},"https://nakamotoinstitute.org/bitcoin/#reclaiming-disk-space","7. Reclaiming Disk Space",{"_32":9183,"_34":9205},[9184,9191,9198],{"_32":9185,"_34":9186},[],{"_36":160,"_38":9187,"_40":641,"_42":9188,"_67":9189,"_69":9190,"_71":70},"4yn7hfYh",{},[],"It is possible to verify payments without running a full network node. A user only needs to keep a copy of the block headers of the longest proof-of-work chain, which he can get by querying network nodes until he's convinced he has the longest chain, and obtain the Merkle branch linking the transaction to the block it's timestamped in. He can't check the transaction for himself, but by linking it to a place in the chain, he can see that a network node has accepted it, and blocks added after it further confirm the network has accepted it.",{"_32":9192,"_34":9193},[],{"_36":1875,"_38":9194,"_40":641,"_42":9195,"_67":9196,"_69":70,"_71":9197},"V8FGyatp",{"_273":323},[],"ipfs://bafkreihe3ah73hf2oc2ma3x6acjfxqbk3ot2tuqxoy4siriiql52g33b74",{"_32":9199,"_34":9200},[],{"_36":160,"_38":9201,"_40":641,"_42":9202,"_67":9203,"_69":9204,"_71":70},"wkNlj9f3",{},[],"As such, the verification is reliable as long as honest nodes control the network, but is more vulnerable if the network is overpowered by an attacker. While network nodes can verify transactions for themselves, the simplified method can be fooled by an attacker's fabricated transactions for as long as the attacker can continue to overpower the network. One strategy to protect against this would be to accept alerts from network nodes when they detect an invalid block, prompting the user's software to download the full block and alerted transactions to confirm the inconsistency. Businesses that receive frequent payments will probably still want to run their own nodes for more independent security and quicker verification.",{"_36":870,"_38":9206,"_40":641,"_42":9207,"_67":9208,"_69":9218,"_71":70},"eG3kSsAV",{},[9209,9213],{"_36":166,"_167":9210,"_169":9211,"_42":9212,"_71":70},[137],[2477],{},{"_36":204,"_167":9214,"_169":9215,"_42":9216,"_71":9217},[137],[2477],{},"https://nakamotoinstitute.org/bitcoin/#simplified-payment-verification","8. Simplified Payment Verification",{"_32":9220,"_34":9242},[9221,9228,9235],{"_32":9222,"_34":9223},[],{"_36":160,"_38":9224,"_40":641,"_42":9225,"_67":9226,"_69":9227,"_71":70},"2TUseBgq",{},[],"Although it would be possible to handle coins individually, it would be unwieldy to make a separate transaction for every cent in a transfer. To allow value to be split and combined, transactions contain multiple inputs and outputs. Normally there will be either a single input from a larger previous transaction or multiple inputs combining smaller amounts, and at most two outputs: one for the payment, and one returning the change, if any, back to the sender.",{"_32":9229,"_34":9230},[],{"_36":1875,"_38":9231,"_40":641,"_42":9232,"_67":9233,"_69":70,"_71":9234},"cTfiGxY8",{"_273":323},[],"ipfs://bafkreiexkeqida4d2ozl4ctpdlhbfnwqbashq6zobmxmoiijqgubdj5pra",{"_32":9236,"_34":9237},[],{"_36":160,"_38":9238,"_40":641,"_42":9239,"_67":9240,"_69":9241,"_71":70},"2WER_WHe",{},[],"It should be noted that fan-out, where a transaction depends on several transactions, and those transactions depend on many more, is not a problem here. There is never the need to extract a complete standalone copy of a transaction's history.",{"_36":870,"_38":9243,"_40":641,"_42":9244,"_67":9245,"_69":9255,"_71":70},"d8T_XpXO",{},[9246,9250],{"_36":166,"_167":9247,"_169":9248,"_42":9249,"_71":70},[137],[987],{},{"_36":204,"_167":9251,"_169":9252,"_42":9253,"_71":9254},[137],[987],{},"https://nakamotoinstitute.org/bitcoin/#combining-and-splitting-value","9. Combining and Splitting Value",{"_32":9257,"_34":9279},[9258,9265,9272],{"_32":9259,"_34":9260},[],{"_36":160,"_38":9261,"_40":641,"_42":9262,"_67":9263,"_69":9264,"_71":70},"UQGJzaIy",{},[],"The traditional banking model achieves a level of privacy by limiting access to information to the parties involved and the trusted third party. The necessity to announce all transactions publicly precludes this method, but privacy can still be maintained by breaking the flow of information in another place: by keeping public keys anonymous. The public can see that someone is sending an amount to someone else, but without information linking the transaction to anyone. This is similar to the level of information released by stock exchanges, where the time and size of individual trades, the \"tape\", is made public, but without telling who the parties were.",{"_32":9266,"_34":9267},[],{"_36":1875,"_38":9268,"_40":641,"_42":9269,"_67":9270,"_69":70,"_71":9271},"p3YG9N3n",{"_273":323},[],"ipfs://bafkreidcqqcx3tp4uzjuxrvytcxgrurtu4k27xvxqy65skctg2kbmd65xm",{"_32":9273,"_34":9274},[],{"_36":160,"_38":9275,"_40":641,"_42":9276,"_67":9277,"_69":9278,"_71":70},"dnvQ2Xvy",{},[],"As an additional firewall, a new key pair should be used for each transaction to keep them from being linked to a common owner. Some linking is still unavoidable with multi-input transactions, which necessarily reveal that their inputs were owned by the same owner. The risk is that if the owner of a key is revealed, linking could reveal other transactions that belonged to the same owner.",{"_36":870,"_38":9280,"_40":641,"_42":9281,"_67":9282,"_69":9292,"_71":70},"L2MOTmjX",{},[9283,9287],{"_36":166,"_167":9284,"_169":9285,"_42":9286,"_71":70},[137],[1464],{},{"_36":204,"_167":9288,"_169":9289,"_42":9290,"_71":9291},[137],[1464],{},"https://nakamotoinstitute.org/bitcoin/#privacy","10. Privacy",{"_32":9294,"_34":9436},[9295,9302,9309,9323,9331,9338,9345,9352,9359,9366,9373,9380,9387,9394,9401,9408,9415,9422,9429],{"_32":9296,"_34":9297},[],{"_36":160,"_38":9298,"_40":641,"_42":9299,"_67":9300,"_69":9301,"_71":70},"K0NAnVo6",{},[],"We consider the scenario of an attacker trying to generate an alternate chain faster than the honest chain. Even if this is accomplished, it does not throw the system open to arbitrary changes, such as creating value out of thin air or taking money that never belonged to the attacker. Nodes are not going to accept an invalid transaction as payment, and honest nodes will never accept a block containing them. An attacker can only try to change one of his own transactions to take back money he recently spent.",{"_32":9303,"_34":9304},[],{"_36":160,"_38":9305,"_40":641,"_42":9306,"_67":9307,"_69":9308,"_71":70},"dYSnFZKV",{},[],"The race between the honest chain and an attacker chain can be characterized as a Binomial Random Walk. The success event is the honest chain being extended by one block, increasing its lead by +1, and the failure event is the attacker's chain being extended by one block, reducing the gap by -1.",{"_32":9310,"_34":9311},[],{"_36":160,"_38":9312,"_40":641,"_42":9313,"_67":9314,"_69":9322,"_71":70},"6fyEYWrz",{},[9315],{"_36":204,"_167":9316,"_169":9318,"_42":9320,"_71":9321},[9317],373,[9319],376,{},"https://nakamotoinstitute.org/bitcoin/#fn8","The probability of an attacker catching up from a given deficit is analogous to a Gambler's Ruin problem. Suppose a gambler with unlimited credit starts at a deficit and plays potentially an infinite number of trials to try to reach breakeven. We can calculate the probability he ever reaches breakeven, or that an attacker ever catches up with the honest chain, as follows[8]:",{"_32":9324,"_34":9325},[],{"_36":2026,"_38":9326,"_40":641,"_42":9327,"_67":9329,"_69":9330,"_71":70},"W-K9bDsX",{"_2029":9328},"plaintext",[],"p = probability an honest node finds the next block\nq = probability the attacker finds the next block\nqz = probability the attacker will ever catch up from z blocks behind\n qz = {1 if p ≤ q\n (q/p)^z if if p fp>q}\n",{"_32":9332,"_34":9333},[],{"_36":160,"_38":9334,"_40":641,"_42":9335,"_67":9336,"_69":9337,"_71":70},"MgleBFro",{},[],"Given our assumption that p > q, the probability drops exponentially as the number of blocks the attacker has to catch up with increases. With the odds against him, if he doesn't make a lucky lunge forward early on, his chances become vanishingly small as he falls further behind.",{"_32":9339,"_34":9340},[],{"_36":160,"_38":9341,"_40":641,"_42":9342,"_67":9343,"_69":9344,"_71":70},"GOUDhFlD",{},[],"We now consider how long the recipient of a new transaction needs to wait before being sufficiently certain the sender can't change the transaction. We assume the sender is an attacker who wants to make the recipient believe he paid him for a while, then switch it to pay back to himself after some time has passed. The receiver will be alerted when that happens, but the sender hopes it will be too late.",{"_32":9346,"_34":9347},[],{"_36":160,"_38":9348,"_40":641,"_42":9349,"_67":9350,"_69":9351,"_71":70},"5lNdn4yV",{},[],"The receiver generates a new key pair and gives the public key to the sender shortly before signing. This prevents the sender from preparing a chain of blocks ahead of time by working on it continuously until he is lucky enough to get far enough ahead, then executing the transaction at that moment. Once the transaction is sent, the dishonest sender starts working in secret on a parallel chain containing an alternate version of his transaction.",{"_32":9353,"_34":9354},[],{"_36":160,"_38":9355,"_40":641,"_42":9356,"_67":9357,"_69":9358,"_71":70},"HjBIx8m3",{},[],"The recipient waits until the transaction has been added to a block and z� blocks have been linked after it. He doesn't know the exact amount of progress the attacker has made, but assuming the honest blocks took the average expected time per block, the attacker's potential progress will be a Poisson distribution with expected value:",{"_32":9360,"_34":9361},[],{"_36":1875,"_38":9362,"_40":641,"_42":9363,"_67":9364,"_69":70,"_71":9365},"6Y9YYQ3j",{"_273":323},[],"ipfs://bafkreidc2z5tfsj6b3z4ie5hljgbv2fhodifacbwayyi6qrfwq46aq6y5u",{"_32":9367,"_34":9368},[],{"_36":160,"_38":9369,"_40":641,"_42":9370,"_67":9371,"_69":9372,"_71":70},"sKyhgCA-",{},[],"To get the probability the attacker could still catch up now, we multiply the Poisson density for each amount of progress he could have made by the probability he could catch up from that point:",{"_32":9374,"_34":9375},[],{"_36":1875,"_38":9376,"_40":641,"_42":9377,"_67":9378,"_69":70,"_71":9379},"gw3a02Zs",{"_273":323},[],"ipfs://bafkreifmzf6lfegbwoe7dtdy2b52ges3octux543ggbu6qyrpkjyl5sqj4",{"_32":9381,"_34":9382},[],{"_36":160,"_38":9383,"_40":641,"_42":9384,"_67":9385,"_69":9386,"_71":70},"yabAdWnP",{},[],"Rearranging to avoid summing the infinite tail of the distribution...",{"_32":9388,"_34":9389},[],{"_36":1875,"_38":9390,"_40":641,"_42":9391,"_67":9392,"_69":70,"_71":9393},"r6mx3FhB",{"_273":323},[],"ipfs://bafkreifakkpyxatczdelxg7h3qb64ztcjambwtpecld74f6p6wvuwuyrnm",{"_32":9395,"_34":9396},[],{"_36":160,"_38":9397,"_40":641,"_42":9398,"_67":9399,"_69":9400,"_71":70},"tezfF5Bj",{},[],"Converting to C code...",{"_32":9402,"_34":9403},[],{"_36":2026,"_38":9404,"_40":641,"_42":9405,"_67":9406,"_69":9407,"_71":70},"q9JZj430",{"_2029":9328},[],"#include \ndouble AttackerSuccessProbability(double q, int z)\n{\n double p = 1.0 - q;\n double lambda = z * (q / p);\n double sum = 1.0;\n int i, k;\n for (k = 0; k <= z; k++)\n {\n double poisson = exp(-lambda);\n for (i = 1; i <= k; i++)\n poisson *= lambda / i;\n sum -= poisson * (1 - pow(q / p, z - k));\n }\n return sum;\n}\n",{"_32":9409,"_34":9410},[],{"_36":160,"_38":9411,"_40":641,"_42":9412,"_67":9413,"_69":9414,"_71":70},"kVweAf7z",{},[],"Running some results, we can see the probability drop off exponentially with z.",{"_32":9416,"_34":9417},[],{"_36":2026,"_38":9418,"_40":641,"_42":9419,"_67":9420,"_69":9421,"_71":70},"QlZ4SI99",{"_2029":9328},[],"q=0.1\nz=0 P=1.0000000\nz=1 P=0.2045873\nz=2 P=0.0509779\nz=3 P=0.0131722\nz=4 P=0.0034552\nz=5 P=0.0009137\nz=6 P=0.0002428\nz=7 P=0.0000647\nz=8 P=0.0000173\nz=9 P=0.0000046\nz=10 P=0.0000012\n\nq=0.3\nz=0 P=1.0000000\nz=5 P=0.1773523\nz=10 P=0.0416605\nz=15 P=0.0101008\nz=20 P=0.0024804\nz=25 P=0.0006132\nz=30 P=0.0001522\nz=35 P=0.0000379\nz=40 P=0.0000095\nz=45 P=0.0000024\nz=50 P=0.0000006\n",{"_32":9423,"_34":9424},[],{"_36":160,"_38":9425,"_40":641,"_42":9426,"_67":9427,"_69":9428,"_71":70},"BLv67_h8",{},[],"Solving for P less than 0.1%...",{"_32":9430,"_34":9431},[],{"_36":2026,"_38":9432,"_40":641,"_42":9433,"_67":9434,"_69":9435,"_71":70},"84XKlfIk",{"_2029":9328},[],"P < 0.001\nq=0.10 z=5\nq=0.15 z=8\nq=0.20 z=11\nq=0.25 z=15\nq=0.30 z=24\nq=0.35 z=41\nq=0.40 z=89\nq=0.45 z=340\n",{"_36":870,"_38":9437,"_40":641,"_42":9438,"_67":9439,"_69":9449,"_71":70},"nor-rS0A",{},[9440,9444],{"_36":166,"_167":9441,"_169":9442,"_42":9443,"_71":70},[137],[1488],{},{"_36":204,"_167":9445,"_169":9446,"_42":9447,"_71":9448},[137],[1488],{},"https://nakamotoinstitute.org/bitcoin/#calculations","11. Calculations",{"_32":9451,"_34":9459},[9452],{"_32":9453,"_34":9454},[],{"_36":160,"_38":9455,"_40":641,"_42":9456,"_67":9457,"_69":9458,"_71":70},"oge-XSqA",{},[],"We have proposed a system for electronic transactions without relying on trust. We started with the usual framework of coins made from digital signatures, which provides strong control of ownership, but is incomplete without a way to prevent double-spending. To solve this, we proposed a peer-to-peer network using proof-of-work to record a public history of transactions that quickly becomes computationally impractical for an attacker to change if honest nodes control a majority of CPU power. The network is robust in its unstructured simplicity. Nodes work all at once with little coordination. They do not need to be identified, since messages are not routed to any particular place and only need to be delivered on a best effort basis. Nodes can leave and rejoin the network at will, accepting the proof-of-work chain as proof of what happened while they were gone. They vote with their CPU power, expressing their acceptance of valid blocks by working on extending them and rejecting invalid blocks by refusing to work on them. Any needed rules and incentives can be enforced with this consensus mechanism.",{"_36":870,"_38":9460,"_40":641,"_42":9461,"_67":9462,"_69":9472,"_71":70},"_J_ObKpN",{},[9463,9467],{"_36":166,"_167":9464,"_169":9465,"_42":9466,"_71":70},[137],[171],{},{"_36":204,"_167":9468,"_169":9469,"_42":9470,"_71":9471},[137],[171],{},"https://nakamotoinstitute.org/bitcoin/#conclusion","12. Conclusion",{"_32":9474,"_34":9656},[9475,9498,9527,9549,9570,9596,9618,9639],{"_32":9476,"_34":9477},[],{"_36":160,"_38":9478,"_40":641,"_42":9479,"_67":9480,"_69":9497,"_71":70},"lBZatHCY",{},[9481,9486,9492],{"_36":204,"_167":9482,"_169":9483,"_42":9484,"_71":9485},[240],[6448],{},"https://nakamotoinstitute.org/b-money/",{"_36":204,"_167":9487,"_169":9488,"_42":9490,"_71":9491},[985],[9489],51,{},"http://www.weidai.com/bmoney.txt",{"_36":204,"_167":9493,"_169":9494,"_42":9495,"_71":9496},[1539],[6475],{},"https://nakamotoinstitute.org/bitcoin/#ref1","W. Dai, \"b-money,\" http://www.weidai.com/bmoney.txt, 1998. ↩",{"_32":9499,"_34":9500},[],{"_36":160,"_38":9501,"_40":641,"_42":9502,"_67":9503,"_69":9526,"_71":70},"ehJOLaPt",{},[9504,9509,9514,9519],{"_36":204,"_167":9505,"_169":9506,"_42":9507,"_71":9508},[6192],[1094],{},"https://nakamotoinstitute.org/static/docs/secure-timestamping-service.pdf",{"_36":919,"_167":9510,"_169":9512,"_42":9513,"_71":70},[9511],124,[244],{},{"_36":204,"_167":9515,"_169":9516,"_42":9517,"_71":9518},[1700],[5827],{},"https://nakamotoinstitute.org/bitcoin/#ref2",{"_36":204,"_167":9520,"_169":9522,"_42":9524,"_71":9525},[9521],189,[9523],190,{},"https://nakamotoinstitute.org/bitcoin/#ref2-2","H. Massias, X.S. Avila, and J.-J. Quisquater, \"Design of a secure timestamping service with minimal trust requirements,\" In 20th Symposium on Information Theory in the Benelux, May 1999. ↩ ↩",{"_32":9528,"_34":9529},[],{"_36":160,"_38":9530,"_40":641,"_42":9531,"_67":9532,"_69":9548,"_71":70},"4g73qCpe",{},[9533,9538,9543],{"_36":204,"_167":9534,"_169":9535,"_42":9536,"_71":9537},[3363],[6532],{},"https://nakamotoinstitute.org/literature/time-stamp-digital-document/",{"_36":919,"_167":9539,"_169":9540,"_42":9542,"_71":70},[5576],[9541],90,{},{"_36":204,"_167":9544,"_169":9545,"_42":9547,"_71":9518},[3376],[9546],126,{},"S. Haber, W.S. Stornetta, \"How to time-stamp a digital document,\" In Journal of Cryptology, vol 3, no 2, pages 99-111, 1991. ↩",{"_32":9550,"_34":9551},[],{"_36":160,"_38":9552,"_40":641,"_42":9553,"_67":9554,"_69":9569,"_71":70},"rxmMMfrP",{},[9555,9560,9564],{"_36":204,"_167":9556,"_169":9557,"_42":9558,"_71":9559},[1013],[6463],{},"https://nakamotoinstitute.org/literature/improving-time-stamping/",{"_36":919,"_167":9561,"_169":9562,"_42":9563,"_71":70},[6404],[6517],{},{"_36":204,"_167":9565,"_169":9567,"_42":9568,"_71":9518},[9566],200,[7134],{},"D. Bayer, S. Haber, W.S. Stornetta, \"Improving the efficiency and reliability of digital time-stamping,\" In Sequences II: Methods in Communication, Security and Computer Science, pages 329-334, 1993. ↩",{"_32":9571,"_34":9572},[],{"_36":160,"_38":9573,"_40":641,"_42":9574,"_67":9575,"_69":9595,"_71":70},"Lk4cXFCp",{},[9576,9581,9585,9590],{"_36":204,"_167":9577,"_169":9578,"_42":9579,"_71":9580},[3363],[263],{},"https://nakamotoinstitute.org/static/docs/secure-names-bit-strings.pdf",{"_36":919,"_167":9582,"_169":9583,"_42":9584,"_71":70},[265],[1248],{},{"_36":204,"_167":9586,"_169":9587,"_42":9589,"_71":9518},[973],[9588],166,{},{"_36":204,"_167":9591,"_169":9592,"_42":9593,"_71":9594},[2068],[3527],{},"https://nakamotoinstitute.org/bitcoin/#ref5","S. Haber, W.S. Stornetta, \"Secure names for bit-strings,\" In Proceedings of the 4th ACM Conference on Computer and Communications Security, pages 28-35, April 1997. ↩ ↩",{"_32":9597,"_34":9598},[],{"_36":160,"_38":9599,"_40":641,"_42":9600,"_67":9601,"_69":9617,"_71":70},"lvrgnju9",{},[9602,9607,9612],{"_36":204,"_167":9603,"_169":9604,"_42":9605,"_71":9606},[1476],[3453],{},"https://nakamotoinstitute.org/static/docs/hashcash.pdf",{"_36":204,"_167":9608,"_169":9609,"_42":9610,"_71":9611},[1539],[7328],{},"http://www.hashcash.org/papers/hashcash.pdf",{"_36":204,"_167":9613,"_169":9614,"_42":9615,"_71":9616},[6278],[5845],{},"https://nakamotoinstitute.org/bitcoin/#ref6","A. Back, \"Hashcash - a denial of service counter-measure,\" http://www.hashcash.org/papers/hashcash.pdf, 2002. ↩",{"_32":9619,"_34":9620},[],{"_36":160,"_38":9621,"_40":641,"_42":9622,"_67":9623,"_69":9638,"_71":70},"CpqEvRWV",{},[9624,9629,9633],{"_36":204,"_167":9625,"_169":9626,"_42":9627,"_71":9628},[1520],[6334],{},"https://nakamotoinstitute.org/literature/public-key-cryptosystems/",{"_36":919,"_167":9630,"_169":9631,"_42":9632,"_71":70},[3453],[7328],{},{"_36":204,"_167":9634,"_169":9635,"_42":9636,"_71":9637},[6476],[5974],{},"https://nakamotoinstitute.org/bitcoin/#ref7","R.C. Merkle, \"Protocols for public key cryptosystems,\" In Proc. 1980 Symposium on Security and Privacy, IEEE Computer Society, pages 122-133, April 1980. ↩",{"_32":9640,"_34":9641},[],{"_36":160,"_38":9642,"_40":641,"_42":9643,"_67":9644,"_69":9655,"_71":70},"sH7mLQBm",{},[9645,9650],{"_36":204,"_167":9646,"_169":9647,"_42":9648,"_71":9649},[1464],[1707],{},"https://nakamotoinstitute.org/literature/introduction-probability-theory-vol-i/",{"_36":204,"_167":9651,"_169":9652,"_42":9653,"_71":9654},[6450],[1117],{},"https://nakamotoinstitute.org/bitcoin/#ref8","W. Feller, \"An introduction to probability theory and its applications,\" 1957. ↩",{"_36":870,"_38":9657,"_40":641,"_42":9658,"_67":9659,"_69":3495,"_71":70},"NUco6M45",{"_273":2113},[9660,9664],{"_36":166,"_167":9661,"_169":9662,"_42":9663,"_71":70},[137],[6982],{},{"_36":204,"_167":9665,"_169":9666,"_42":9667,"_71":9668},[137],[6982],{},"https://nakamotoinstitute.org/bitcoin/#references",[644],"/records/bitcoin-a-peer-to-peer-electronic-cash-system",{"_83":657},{},{"_38":638,"_95":54,"_55":9674,"_72":641,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,640],1773151562645,[149,638,641,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/bitcoin-a-peer-to-peer-electronic-cash-system\",\"bafy2bzacec5sacme4htf7rr2af4s73pq32kq6s6gdq335d3dqumpt5rentpjc\",true]",{"_110":9679,"_147":10454,"_150":10455},{"_112":9680,"_131":132,"_133":10453,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":9681,"_38":10451},{"_29":9682,"_72":663,"_73":54,"_74":10447,"_55":10448,"_77":670,"_79":670,"_81":10449,"_85":10450,"_87":663,"_89":90},[9683,9690,9696,9703,9710,9717,9724,9731,9738,9745,9752,9759,9766,9776,9783,9790,9797,9811,9825,9839,9846,9853,9860,9866,9873,9880,9887,9894,9943,10048,10195,10223,10230,10237,10244,10251,10258,10293,10300,10307,10314,10321,10328,10384,10391],{"_32":9684,"_34":9685},[],{"_36":160,"_38":9686,"_40":663,"_42":9687,"_67":9688,"_69":9689,"_71":70},"QQnpcIHS",{},[],"Theodor H. Nelson\nThis paper was presented at the International Conference on online interactive computing held at Brunei University, Uxbridge, England, September 4-7,1972.",{"_32":9691,"_34":9692},[],{"_36":870,"_38":9693,"_40":663,"_42":9694,"_67":9695,"_69":1827,"_71":70},"XQLzQI6D",{},[],{"_32":9697,"_34":9698},[],{"_36":160,"_38":9699,"_40":663,"_42":9700,"_67":9701,"_69":9702,"_71":70},"gNCUISFe",{},[],"Bush was right. His famous article is, however, generally misinterpreted, for it has little to do with \"information retrieval\" as prosecuted today. Bush rejected indexing and discussed instead new forms of interwoven documents.",{"_32":9704,"_34":9705},[],{"_36":160,"_38":9706,"_40":663,"_42":9707,"_67":9708,"_69":9709,"_71":70},"N2CzMsHM",{},[],"It is possible that Bush's vision will be fulfilled substantially as he saw it, and that information retrieval systems of the kinds now popular will see less use than anticipated.",{"_32":9711,"_34":9712},[],{"_36":160,"_38":9713,"_40":663,"_42":9714,"_67":9715,"_69":9716,"_71":70},"G2mKHD0A",{},[],"As the technological base has changed, we must recast his thesis slightly, and regard Bush's \"memex\" as three things: the personal presentation, editing and file console; a digital feeder network for the delivery of documents in full-text digital form; and new types of documents, or hypertexts, which are especially worth receiving and sending in this manner.",{"_32":9718,"_34":9719},[],{"_36":160,"_38":9720,"_40":663,"_42":9721,"_67":9722,"_69":9723,"_71":70},"ZV011Qi9",{},[],"In addition, we also consider a likely design for specialist hypertexts, and discuss problems of their publication.",{"_32":9725,"_34":9726},[],{"_36":870,"_38":9727,"_40":663,"_42":9728,"_67":9729,"_69":9730,"_71":70},"txHq26eE",{},[],"Beating Around the Bush",{"_32":9732,"_34":9733},[],{"_36":160,"_38":9734,"_40":663,"_42":9735,"_67":9736,"_69":9737,"_71":70},"KRDSg6M6",{},[],"Twenty-seven years ago, in a widely acclaimed article, Vannevar Bush made certain predictions about the way we of the future would handle written information (1). We are not yet doing so. Yet the Bush article is often cited as the historical beginning, or as a technological watershed, of the field of information retrieval. It is frequently cited without interpretation (2,3). Although some commentators have said its predictions were improbable (4), in general its precepts have been ignored by acclamation.",{"_32":9739,"_34":9740},[],{"_36":160,"_38":9741,"_40":663,"_42":9742,"_67":9743,"_69":9744,"_71":70},"HXVjZdSV",{},[],"In this paper, an effort in counter-discipleship, I hope to remind readers of what Bush did and did not say, and point out what is not yet recognized: that much of what he predicted is possible now; the memex is here; the \"trails\" he spoke of—suitably generalized, and now called hypertexts—may, and should, become the principal publishing form of the future.",{"_32":9746,"_34":9747},[],{"_36":160,"_38":9748,"_40":663,"_42":9749,"_67":9750,"_69":9751,"_71":70},"eVkhIxCG",{},[],"In July of 1945 an article entitled \"As We May Think,\" by Vannevar Bush, was published in the Atlantic Monthly. It bristled with technical references but was actually fairly candid and simple.",{"_32":9753,"_34":9754},[],{"_36":160,"_38":9755,"_40":663,"_42":9756,"_67":9757,"_69":9758,"_71":70},"LBWp1Zqo",{},[],"It predicted many things. Bush, as director of Roosevelt's wartime Office of Scientific Research and Development, had seen the new ways in which technologies could be combined. In the urbane paragraphs of this article, Bush predicted a variety of useful future machines, including improvements in photography, facsimile systems, computers and miscellany. Depending on how you read it, he predicted, as well as you could hope, devices closely related to the Polaroid camera, the Xerox machine, computer transformation of mathematical expressions, and the telephone company's ESS switching system.",{"_32":9760,"_34":9761},[],{"_36":160,"_38":9762,"_40":663,"_42":9763,"_67":9764,"_69":9765,"_71":70},"dbHrGh9m",{},[],"But the article is best remembered for its description of the new ways that scientists and scholars could handle and share their ideas, writing, reading and filing in a magical system at their desks. The system is the famous \"memex.\"",{"_32":9767,"_34":9768},[],{"_36":9769,"_38":9770,"_40":663,"_42":9771,"_67":9774,"_69":70,"_71":9775},"Embed","Osvz_xGC",{"_9772":9773},"view","Content",[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#AqGRgRAh",{"_32":9777,"_34":9778},[],{"_36":9769,"_38":9779,"_40":663,"_42":9780,"_67":9781,"_69":70,"_71":9782},"iTALYgzT",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#TfWCAxXp",{"_32":9784,"_34":9785},[],{"_36":160,"_38":9786,"_40":663,"_42":9787,"_67":9788,"_69":9789,"_71":70},"Y5L1E35K",{},[],"The memex will hold all the writings its master wants to read, and he can read them easily.",{"_32":9791,"_34":9792},[],{"_36":9769,"_38":9793,"_40":663,"_42":9794,"_67":9795,"_69":70,"_71":9796},"EfyNN9um",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#3lraYLjj",{"_32":9798,"_34":9806},[9799],{"_32":9800,"_34":9801},[],{"_36":9769,"_38":9802,"_40":663,"_42":9803,"_67":9804,"_69":70,"_71":9805},"Zy29M0BN",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#EN57UWfJ",{"_36":160,"_38":9807,"_40":663,"_42":9808,"_67":9809,"_69":9810,"_71":70},"hn9y-2-Y",{"_273":323},[],"Moreover, he can compare and annotate them.",{"_32":9812,"_34":9820},[9813],{"_32":9814,"_34":9815},[],{"_36":9769,"_38":9816,"_40":663,"_42":9817,"_67":9818,"_69":70,"_71":9819},"SJDERbDF",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#TlXiaXp1",{"_36":160,"_38":9821,"_40":663,"_42":9822,"_67":9823,"_69":9824,"_71":70},"u-YHRstV",{"_273":323},[],"Not only ordinary documents need be held in the memex. The user may make connections between different parts of the things stored. He does this by ",{"_32":9826,"_34":9834},[9827],{"_32":9828,"_34":9829},[],{"_36":9769,"_38":9830,"_40":663,"_42":9831,"_67":9832,"_69":70,"_71":9833},"V0bfhFCG",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#aJ5f5jF5",{"_36":160,"_38":9835,"_40":663,"_42":9836,"_67":9837,"_69":9838,"_71":70},"UN8-5owL",{"_273":323},[],"By this associative technique he may create \"trails,\" new documentary objects that are useful in new ways.",{"_32":9840,"_34":9841},[],{"_36":160,"_38":9842,"_40":663,"_42":9843,"_67":9844,"_69":9845,"_71":70},"0qS5JIc9",{},[],"These new structures, or trails, may be taken and given to other people.",{"_32":9847,"_34":9848},[],{"_36":9769,"_38":9849,"_40":663,"_42":9850,"_67":9851,"_69":70,"_71":9852},"Qh5Esiow",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#DAwmGiOq",{"_32":9854,"_34":9855},[],{"_36":160,"_38":9856,"_40":663,"_42":9857,"_67":9858,"_69":9859,"_71":70},"IySC15lW",{},[],"And they may be published.",{"_32":9861,"_34":9862},[],{"_36":9769,"_38":9863,"_40":663,"_42":9864,"_67":9865,"_69":70,"_71":9833},"AYnznU_y",{"_9772":9773},[],{"_32":9867,"_34":9868},[],{"_36":160,"_38":9869,"_40":663,"_42":9870,"_67":9871,"_69":9872,"_71":70},"frKQTh2a",{},[],"It is strange that \"As We May Think\" has been taken so to heart in the field of information retrieval, since it runs counter to virtually all work being pursued under the name of information retrieval today. Such systems are principally concerned either with indexing conventional documents by content, or with somehow representing that content in a way that can be mechanically searched and deciphered.",{"_32":9874,"_34":9875},[],{"_36":160,"_38":9876,"_40":663,"_42":9877,"_67":9878,"_69":9879,"_71":70},"2q1LvZDy",{},[],"This is indeed paradoxical. On the one hand, Bush did not think well of indexing.",{"_32":9881,"_34":9882},[],{"_36":9769,"_38":9883,"_40":663,"_42":9884,"_67":9885,"_69":70,"_71":9886},"aYi-2PDe",{"_9772":9773},[],"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/as-we-may-think?v=bafy2bzaceaqvup7xqozrjgf5aadd7ud7bey44u5zmekpj3w76qscejbnnc4gy#-UV4qKcD",{"_32":9888,"_34":9889},[],{"_36":160,"_38":9890,"_40":663,"_42":9891,"_67":9892,"_69":9893,"_71":70},"xv7hjJiW",{},[],"On the other hand, with regard to content retrieval. Bush merely hinted about the use of structured-data representations and calculi in storing ideas (105, col. 2, para. 3), and did not plainly relate them to his mail exposition. The reason is plain: his real emphasis was on linkage, an£ new structures and activities that the automatic link-jump would mak( possible. While we might argue scripture about such matters, the fact L that Bush's most extensive concern has had few successors in the fielf called \"information retrieval.\"",{"_32":9895,"_34":9938},[9896,9903,9910,9917,9924,9931],{"_32":9897,"_34":9898},[],{"_36":160,"_38":9899,"_40":663,"_42":9900,"_67":9901,"_69":9902,"_71":70},"QtWm_YHF",{},[],"The memex was to be a single screen console for handling the user's notes, writing and correspondence, for reading books and other writ¬ ings created by others, and for creating new associative text structures, which may in their turn be read and distributed. All this I take to be the heart of Bush's prediction. This will happen. Such systems exist; they are approaching cost feasibility; and the world is readier than it thinks.",{"_32":9904,"_34":9905},[],{"_36":160,"_38":9906,"_40":663,"_42":9907,"_67":9908,"_69":9909,"_71":70},"YDPO9Awd",{},[],"Bush's machine will not, of course, be built exactly as he foresaw. The complete description, which I omitted, involves microfilm cas¬ settes, a photographic copying plate for adding new images to the microfilm file, and a telautograph stylus. Other machines he describes, such as the forehead camera and the direct-dictation typing machine, might or might not have been coupled to it as well. In the revised version of the article (5) his emphasis shifted to videotape. These impedimenta we ignore. There exist microfilm cassettes, copiers and so on, but the hardware ready to support a memex-class system will be something else.",{"_32":9911,"_34":9912},[],{"_36":160,"_38":9913,"_40":663,"_42":9914,"_67":9915,"_69":9916,"_71":70},"uhwoRLHW",{},[],"The system will be built from existing computer equipment and peripherals. Physically it will be a computer display, with a keyboard, at the user's desk; a support computer system (at the desk or elsewhere) for handling various technical chores; and a library network of digital feeder machines. The written materials, when not shown on the screen, will be stored and sent digitally, as telegraphic symbolg.’They will be sent back and forth among these systems automatically, as programmed in the various devices. The trails, or associative text structures—more generally called \"hypertexts\"—will be stored in coded form, along with, the more conventional documents in the various devices. The user will be billed automatically for the services and the delivery of copyrighted materials. The publisher, who maintains these copyrighted materials in the feeder machines, will be duly paid for their use.",{"_32":9918,"_34":9919},[],{"_36":160,"_38":9920,"_40":663,"_42":9921,"_67":9922,"_69":9923,"_71":70},"rjFINwnJ",{},[],"Prototype units exist now. Appropriate console hardware can be purchased now for about $15,000.",{"_32":9925,"_34":9926},[],{"_36":160,"_38":9927,"_40":663,"_42":9928,"_67":9929,"_69":9930,"_71":70},"MpSmGT1C",{},[],"Supply systems, however, are not quite ready. The best supply system may be a special-purpose computer or a general-purpose time¬ sharing pyitem; which is better is not clear. While costs of either are presently in thi tSAB or hundreds of thousands, they are coming down fast, and the use of a well-tailored system by many people at once should bring down the cost of such service down considerably. To name a figure arbitrarily, let us say that a service cost of $100 a month per user (exclusive of telephone lines and copyright) would be suffi¬ ciently low to draw many users. Such service at such a cost will surely be generally available between one and five years from now.",{"_32":9932,"_34":9933},[],{"_36":160,"_38":9934,"_40":663,"_42":9935,"_67":9936,"_69":9937,"_71":70},"kZrOy0ql",{},[],"Various preoccupations have delayed us psychologically. We do not need direct dictation, optical scanning or the availability (sic) of vast libraries for such systems to be immediately practical and important to us.",{"_36":870,"_38":9939,"_40":663,"_42":9940,"_67":9941,"_69":9942,"_71":70},"M0VjGRF0",{"_273":323},[],"Transposition",{"_32":9944,"_34":10043},[9945,9952,9959,9966,9973,9980,9987,9994,10001,10015,10022,10029,10036],{"_32":9946,"_34":9947},[],{"_36":160,"_38":9948,"_40":663,"_42":9949,"_67":9950,"_69":9951,"_71":70},"yRCt0hCQ",{},[],"We are speaking of a single console to handle notes, writing, much correspondence, much reading, and the creation of new kinds of texts. On it the user must be able to view, edit, file, and otherwise manipulate.",{"_32":9953,"_34":9954},[],{"_36":160,"_38":9955,"_40":663,"_42":9956,"_67":9957,"_69":9958,"_71":70},"uD8XLQ64",{},[],"Let me now describe a system for various kinds of text handling, the Xanadu Parallel Textface™. XANADU™ is a system presently under development as a turnkey computer graphics console for non-technical users. A stand-alone system, it is built on a minicomputer with disk and / or cassette tape, vectoring display screen, and keyboard. A variety of unusual programming techniques permit various types of screen animation, as well as automatic retrieval and data-base editing in the undersystem; these automatically service different user front ends, faces or theaters. Foremost among these theaters is the Parallel Textface, a text system of some power and delicacy.",{"_32":9960,"_34":9961},[],{"_36":160,"_38":9962,"_40":663,"_42":9963,"_67":9964,"_69":9965,"_71":70},"30jJW2pE",{},[],"Many of its features exist in other text handling systems, notably that of Douglas C. Engelbart at Stanford Research Institute (6). The purpose of this description is to show parallelisms between memex and this general type of system, not to distinguish this system from its relatives.",{"_32":9967,"_34":9968},[],{"_36":160,"_38":9969,"_40":663,"_42":9970,"_67":9971,"_69":9972,"_71":70},"60pYAt72",{},[],"I will speak of the Xanadu hypertext system, or Parallel Textface, simply as \"the system,\" \"the current system\" or the like, to distinguish it from the memex. As its implementation is not yet complete, this description applies to the present specifications and not only the parts that are working. We will note some resemblances to the memex.",{"_32":9974,"_34":9975},[],{"_36":160,"_38":9976,"_40":663,"_42":9977,"_67":9978,"_69":9979,"_71":70},"nALZJw6b",{},[],"The user sits at a display screen with a typewriter keyboard, a light pen or other pointing tool, and various optional controls. With these he may read, explore, annotate, write and revise. Storage is of course digital rather than pictorial; the system may manipulate the words letter by letter, rather than as a single image.",{"_32":9981,"_34":9982},[],{"_36":160,"_38":9983,"_40":663,"_42":9984,"_67":9985,"_69":9986,"_71":70},"wnSELNQB",{},[],"In basic editorial operations, the system presents text materials on the screen; the user may command basic writing and editing actions by simple manipulations. Indeed, he may make these editorial changes tentatively, on copies or alternative versions of the material; and he may, at his option, have his actions recorded automatically in a cumu¬ lative editorial log, in case it is later necessary to retract any of them.",{"_32":9988,"_34":9989},[],{"_36":160,"_38":9990,"_40":663,"_42":9991,"_67":9992,"_69":9993,"_71":70},"Yf16Esb5",{},[],"Bush did not really go into memex editorial operations, but of course there was that keyboard. It is interesting to note that the memex described in the revised version of Bush's article (5) kept a log of manipulations by the user. (95-6)",{"_32":9995,"_34":9996},[],{"_36":160,"_38":9997,"_40":663,"_42":9998,"_67":9999,"_69":10000,"_71":70},"GTnHIVqA",{},[],"The system is generally geared to tentative and thoughtful opera¬ tion. The alternative versions and editorial log are the strongest ex¬ amples, but there are others. An editing command may be retracted if its results do not please. Another example: a section of text being tried in a new place is shown glowing more brightly, so you know its limits within the new setting.",{"_32":10002,"_34":10010},[10003],{"_32":10004,"_34":10005},[],{"_36":160,"_38":10006,"_40":663,"_42":10007,"_67":10008,"_69":10009,"_71":70},"DUCET99r",{},[],"In the memex, the user could skip through a document at adjustable rates (107, col. 1, para. 5). In the current system he may zip forward through the text at whatever speed he chooses, watching it slide on the screen. (The necessity of smooth, incremental text motion for the CRT is not yet generally recognized.)",{"_36":160,"_38":10011,"_40":663,"_42":10012,"_67":10013,"_69":10014,"_71":70},"Jg93zaTs",{"_273":323},[],"The user of Bush's memex called its contents by means of a \"code book\" (107 passim )—but this too was actually stored in the system. From the code book the user was to choose contents for yiewing^with a single tap of the key,\" as mentioned earlier. In the current system it is possible lor the user to call something to the screen by picking the name from a screen menu or relational diagram with the light pen. Fie may do this not just with whole units, but also with subparts and different ver- v sions—separate copies—of documents being tentatively edited.",{"_32":10016,"_34":10017},[],{"_36":160,"_38":10018,"_40":663,"_42":10019,"_67":10020,"_69":10021,"_71":70},"lmCgmnpX",{},[],"The memex user looked at several documents simultaneously through several screens or panels of the same screen (107, col. 1, para, 6). This simultaneous viewing will be possible for several documents on the Parallel Textface; indeed, explicit linkages between associated texts may be viewed on request. This is the notion of \"parallel text,\" useful for commentaries, translations, intercomparisons of documents and much else. These facilities correspond rather well, I think, to Bush's \"marginal notes and comments\" between the \"several projection posi¬ tions.\"",{"_32":10023,"_34":10024},[],{"_36":160,"_38":10025,"_40":663,"_42":10026,"_67":10027,"_69":10028,"_71":70},"twmc1uQQ",{},[],"The memex user created annotations by hand, or links between the things that were being viewed simultaneously. This is possible on the current system, which allows the user to create links between text sections regardless of whether or not they are parts of the same unit or otherwise related. These may be between parallel texts, or among free- floating paragraphs (discrete or \"free\" hypertexts), or in virtually any other useful arrangement.",{"_32":10030,"_34":10031},[],{"_36":160,"_38":10032,"_40":663,"_42":10033,"_67":10034,"_69":10035,"_71":70},"PC4fPpfg",{},[],"For any system of this kind, design problems arise in the richer operations, such as creating and modifying connective structures. It is taken for granted that the console must be easy to use. That is no design problem for a small set of operations, such as text editing. But the design of the overall file handling elements and actions is more complicated. There are two problems. The first is how to achieve the desired perfor¬ mance values on available equipment and accepted software setting. This becomes a tradeoff. The grander problem, though, is conceptual unification for the system's filing structure and conventions.",{"_32":10037,"_34":10038},[],{"_36":160,"_38":10039,"_40":663,"_42":10040,"_67":10041,"_69":10042,"_71":70},"_pEfIwrZ",{},[],"In the current system there is presently only one type of connector. This restriction nevertheless permits a system sufficient to support real hypertext experimentation. Complex or annotated couplings are pres¬ ently not defined. However, simple links are adequate for various possible forms of discrete-jump hypertexts, including Bush trails, and may in principle be extended to computer responsibility for link behav¬ iors and complex coupling maintenance.",{"_36":870,"_38":10044,"_40":663,"_42":10045,"_67":10046,"_69":10047,"_71":70},"LXMJugTL",{"_273":323},[],"The Console",{"_32":10049,"_34":10190},[10050,10057,10071,10085,10099,10113,10120,10127,10134,10141,10148,10155,10162,10169,10176,10183],{"_32":10051,"_34":10052},[],{"_36":160,"_38":10053,"_40":663,"_42":10054,"_67":10055,"_69":10056,"_71":70},"0WEyivCC",{},[],"While Bush's term, \"trail,\" represents a very useful concept, we must generalize it. Bush's interest in microfilm led to his idea of the trail having a sequence.",{"_32":10058,"_34":10066},[10059],{"_32":10060,"_34":10061},[],{"_36":160,"_38":10062,"_40":663,"_42":10063,"_67":10064,"_69":10065,"_71":70},"qf_cC4Y7",{},[],"For [the user] runs through an encyclopedia, finds an interesting but sketchy article, leaves it projected. Next, in a history, he finds another pertinent item, and ties the two together. Thus he goes, building a trail of many items. (107, col. 2, para. 4)",{"_36":160,"_38":10067,"_40":663,"_42":10068,"_67":10069,"_69":10070,"_71":70},"10j2-4ds",{"_273":323},[],"By \"trail,\" Bush appears to have meant a sequence of document*^ document excerpts, and comment! upon them.",{"_32":10072,"_34":10080},[10073],{"_32":10074,"_34":10075},[],{"_36":160,"_38":10076,"_40":663,"_42":10077,"_67":10078,"_69":10079,"_71":70},"5sDzzO17",{},[],"When the user is building a trail, he names it, inserts the name in his code book, and taps it out on his keyboard. Before him are the two items to be joined projected onto adjacent viewing positions.... The user taps a single key, and the items are permanently joined. (107, col. 2, para. 2)",{"_36":160,"_38":10081,"_40":663,"_42":10082,"_67":10083,"_69":10084,"_71":70},"9C9AlJI6",{"_273":323},[],"This sequence would be established by making paired couplings.",{"_32":10086,"_34":10094},[10087],{"_32":10088,"_34":10089},[],{"_36":160,"_38":10090,"_40":663,"_42":10091,"_67":10092,"_69":10093,"_71":70},"dV1QbUyB",{},[],"Occasionally he inserts a comment of his own, either linking it into the main trail or joining it by a side trail to a particular item.",{"_36":160,"_38":10095,"_40":663,"_42":10096,"_67":10097,"_69":10098,"_71":70},"soA09eVb",{"_273":323},[],"Bush mentions two other types of trail. One is the \"side trail,\" branching out from a main trail sequence.",{"_32":10100,"_34":10108},[10101],{"_32":10102,"_34":10103},[],{"_36":160,"_38":10104,"_40":663,"_42":10105,"_67":10106,"_69":10107,"_71":70},"eOeFvpiI",{},[],"The historian, with a vast chronological account of a people, parallels it with a skip trail which stops only on the salient items, and can follow at any time contemporary trails which lead him all over civilization at a particular epoch. (108, col. 1, para. 1)",{"_36":160,"_38":10109,"_40":663,"_42":10110,"_67":10111,"_69":10112,"_71":70},"T_Dc-elN",{"_273":323},[],"The other type of trail is the \"skip trail,\" a subset of a main trail sequence that contains the highlights.",{"_32":10114,"_34":10115},[],{"_36":160,"_38":10116,"_40":663,"_42":10117,"_67":10118,"_69":10119,"_71":70},"YHIk647s",{},[],"In Bush's trails, the user had no choices to make as he moved through the sequence of items, except at an intersection of trails. With computer storage, however, no sequence need be imposed on the material; and, instead of simply storing materials in their order of arrival or of being noticed, it will be possible to create overall structures of greater useful? complexity. These may have, for instance, patterns of branches in various directions. Such non-sequential or complex text structures we may call \"hypertexts.\" (7)",{"_32":10121,"_34":10122},[],{"_36":160,"_38":10123,"_40":663,"_42":10124,"_67":10125,"_69":10126,"_71":70},"UfB8V-Sg",{},[],"\"Hypertext\" is the generic term; there are reasons, for which there Is no room here, to rule out such other candidate terms as \"branching text,\" \"graph-structured text,\" \"complex text\" and \"tree text.\"",{"_32":10128,"_34":10129},[],{"_36":160,"_38":10130,"_40":663,"_42":10131,"_67":10132,"_69":10133,"_71":70},"QOoVSIEq",{},[],"The best current definition of hypertext, over quite a broad range of types, is \"text Structure that cannot be conveniently printed.\" This is not very specific profound, but it fits best.",{"_32":10135,"_34":10136},[],{"_36":160,"_38":10137,"_40":663,"_42":10138,"_67":10139,"_69":10140,"_71":70},"-AGQ1NP9",{},[],"As Bush pointed out in his own terms, we think in hypertext (106, col. 2). We have been speaking hypertext all our lives and never known it. It is usually only in writing that we must pick thoughts up and irrelevantly put them down in the sequence demanded by the printed word. Writing is a process of making the tree of thought into a picket fence.",{"_32":10142,"_34":10143},[],{"_36":160,"_38":10144,"_40":663,"_42":10145,"_67":10146,"_69":10147,"_71":70},"hP34F12B",{},[],"Hypertext structures are varied. For instance, they may be free- branching with only one type of link and backing up; they may have modal links with different meanings in a free structure; or have modal links and repetitive structure.",{"_32":10149,"_34":10150},[],{"_36":160,"_38":10151,"_40":663,"_42":10152,"_67":10153,"_69":10154,"_71":70},"hhxI_GYs",{},[],"Discrete-jump hypertexts are not the only kinds. There is, for example. Stretchtext™. This is continuously variable text which never leaves the screen, but changes by small increments on user demand, growing longer and more detailed by a few words at a time, as required. Other continuous types are possible.",{"_32":10156,"_34":10157},[],{"_36":160,"_38":10158,"_40":663,"_42":10159,"_67":10160,"_69":10161,"_71":70},"3nvTs9mC",{},[],"Just as items may be coupled, whole hypertexts may be coupled into books, or one another. An example of the first would be a hypertext with annotations coupling into the Bible. Such multi-couplings involve bundles of pointers between the texts, possibly with type codes or annotations. (In the current system the non-annotated multicoupler is the canonical case between files.) They may also involve alternative versions, which there is no room to discuss here. The structuring of these coupler types is a continuing design task for hypertext systems.",{"_32":10163,"_34":10164},[],{"_36":160,"_38":10165,"_40":663,"_42":10166,"_67":10167,"_69":10168,"_71":70},"uLC2cmbX",{},[],"The creator of hypertexts may allow the user various options of jumping or branching. These options can lead the user to further reading in any pattern the author wants to make available to him. The only constraints on the author are usefulness, clarity, and artfulness.",{"_32":10170,"_34":10171},[],{"_36":160,"_38":10172,"_40":663,"_42":10173,"_67":10174,"_69":10175,"_71":70},"VZneRGrL",{},[],"There must, of course, be ways the reader may see, and choose among, possible branches from an item in the text. This problem was | implicit in Bush's treatment. Since \"any item can be joined into numer¬ ous trails\" (107, col. 2, para. 3) there would have had to be some way of j showing the user these options and their meaning. This is the case in] general, and a standing aspect of hypertext system design.",{"_32":10177,"_34":10178},[],{"_36":160,"_38":10179,"_40":663,"_42":10180,"_67":10181,"_69":10182,"_71":70},"iYPj_x-O",{},[],"Hypertexts may be casual rough notes, as described in Bush'l extended example of the Turkish bow and arrow; or they may at th@| other extreme be finished units, editorially completed and organized* Such finished units would have many of the same properties as binary writing: intentional assembly, attempted clarity and expository structure of enumerable \"points,\" and an overall comprehensible pat¬ tern whose interrelated parts may be in some way remembered or visualized. Finally, the concept of authorship applies to hypertexts as much as it does to an ordinary book or article.",{"_32":10184,"_34":10185},[],{"_36":160,"_38":10186,"_40":663,"_42":10187,"_67":10188,"_69":10189,"_71":70},"MXn38uto",{},[],"As with ordinary texts, too, the editorial properties and \"feel\" of hypertexts may be quite distinct and varied. For hypertexts these are of course largely unexplored. It is also very hard to anticipate their possible administrative and social settings, and this will greatly affect their character and the modes of their use.",{"_36":870,"_38":10191,"_40":663,"_42":10192,"_67":10193,"_69":10194,"_71":70},"EsLzTZeo",{"_273":323},[],"Hypertexts",{"_32":10196,"_34":10218},[10197,10211],{"_32":10198,"_34":10206},[10199],{"_32":10200,"_34":10201},[],{"_36":160,"_38":10202,"_40":663,"_42":10203,"_67":10204,"_69":10205,"_71":70},"4MeAzRck",{},[],"The network will consist of several computers or computer-like objects. In the user's own unit is digital logic, and possibly (as in our Xanadu) a small computer; if not, this unit is serviced or managed by a computer which stores the user's files and communicates with the library network. The user's requests for documents that are not avail¬ able locally go out to a library network. These requests are sorted out to the appropriate repository machine; the repository machine returns the document and a bill or fee schedule.",{"_36":160,"_38":10207,"_40":663,"_42":10208,"_67":10209,"_69":10210,"_71":70},"2q33hgDx",{"_273":323},[],"A general transmission network will carry requested documents from libraries to users, new documents from users to libraries, and commu¬ nications and documents between users.",{"_32":10212,"_34":10213},[],{"_36":160,"_38":10214,"_40":663,"_42":10215,"_67":10216,"_69":10217,"_71":70},"RzHgKXEU",{},[],"Various fees are logged up to the user. These will include various basic costs, such as membership in the system, rental of the terminal and hookup. Additional fees may include logged-in time, per-usage costs of s ' various facilities (such as average memory area occupied and quanti¬ ties of text moved), storage charges for materials kept locally, and royalties to copyright holders. It should be noted that various grades of service may also exist, in which the user gets faster service by claiming larger buffers and higher priorities, and pays for the privilege.",{"_36":870,"_38":10219,"_40":663,"_42":10220,"_67":10221,"_69":10222,"_71":70},"2uctG9Ee",{"_273":323},[],"The Transmission Network",{"_32":10224,"_34":10225},[],{"_36":160,"_38":10226,"_40":663,"_42":10227,"_67":10228,"_69":10229,"_71":70},"Z34QbOfh",{},[],"A1 though this may sound like a formidable prospect, in general and with polishing there is reason to hope that the real costs of such a system will compete favorably with the real costs of the forms of publication and libraries we now employ. (Of course, in such \"real cost\" we must include the library services supplied \"free\" by various levels of govern¬ ment, including municipal libraries, grants to universities and the indirect subsidy of publishers by low postal rates. It is not unthinkable that similar encouragement will come about for this form of publishing and libraryship.)",{"_32":10231,"_34":10232},[],{"_36":160,"_38":10233,"_40":663,"_42":10234,"_67":10235,"_69":10236,"_71":70},"goBmMxuA",{},[],"Various technical design issues exist. These involve the feeder computers and their forms of memory. These hierarchies of memory are fairly clear. They will generally include disk (for working areas and directories), magnetic card or data cell (for the corpus), and magnetic tape (for rarely-needed materials and safety copies). Immense solid- state memories will never take over completely unless they are cheaper.",{"_32":10238,"_34":10239},[],{"_36":160,"_38":10240,"_40":663,"_42":10241,"_67":10242,"_69":10243,"_71":70},"GsGw4htV",{},[],"A more difficult question is, what should the feeder computers be? Their job in this system is the lookup and shovelling of text, plus book¬ keeping. One school of thought holds that a true general-purpose time¬ sharing system is necessary; another, that the correct machine is a dedicated computer with rich interrupts and comparatively little arith¬ metic capacity. The third school would point out the special character of the work and lean toward special designs and special tradeoffs, which could be anything from associative memory to the use of delay¬ line machines.",{"_32":10245,"_34":10246},[],{"_36":160,"_38":10247,"_40":663,"_42":10248,"_67":10249,"_69":10250,"_71":70},"zbAVqPyW",{},[],"Similar issues exist for memory software and directory systems. There are complex technical problems of index and search techniques, and methods of their cross-tabulation. But they can be handled in some way or other.",{"_32":10252,"_34":10253},[],{"_36":160,"_38":10254,"_40":663,"_42":10255,"_67":10256,"_69":10257,"_71":70},"krHVUmbv",{},[],"A warning is necessary here, however. This area of console support is the area where things are not yet ready. The prediction of economic feasibility in five years, an eon in the computer world, is not the same as feasibility now. By devoting a whole computer, disk and tape to each user, the problem of console support can now be solved, in a manner of speaking; but the general problem of interleaved I/O and file manage¬ ment, with the efficient sharing of facilities, is another problem entirely, and the one that must be solved to make this whole thing go.",{"_32":10259,"_34":10288},[10260,10267,10274,10281],{"_32":10261,"_34":10262},[],{"_36":160,"_38":10263,"_40":663,"_42":10264,"_67":10265,"_69":10266,"_71":70},"HvU5_0F7",{},[],"Bush regarded his new text structures as transmissible between indi¬ viduals, and publishable. The same is true of hypertext units, the generalized form of trails. I think it likely that once such systems are available, the creation of branching and complex text will become recognized as far more natural than the structures in which we now must write.",{"_32":10268,"_34":10269},[],{"_36":160,"_38":10270,"_40":663,"_42":10271,"_67":10272,"_69":10273,"_71":70},"NpJlNMMo",{},[],"This will all follow naturally from the existence of consoles which permit multiple couplings between texts. Having created for personal use a hyper-document on one's console, it will seem only reasonable to press a button passing this on to a colleague in its hyper-form, without chopping and aligning it into conventional writing.",{"_32":10275,"_34":10276},[],{"_36":160,"_38":10277,"_40":663,"_42":10278,"_67":10279,"_69":10280,"_71":70},"GqUvfyXk",{},[],"Various interesting possibilities follow. Private \"journals\" in a field may be started among co-workers merely by the pooling of their hyper¬ documents. The rental of memory space on magnetic cards is inconse¬ quential next to what have been the costs of printing and mailing.",{"_32":10282,"_34":10283},[],{"_36":160,"_38":10284,"_40":663,"_42":10285,"_67":10286,"_69":10287,"_71":70},"Xfwi21W4",{},[],"When professional and technical societies become interested in sponsoring hyper-publication, one of the most straightforward ways to begin would be with the creation of society-sponsored review articles. These could be like the ordinary review articles sponsored by such societies, save that the review article would open directly into the various materials it was reviewing, and footnotes could be more extensive and slanted to different categories of reader. (Eigure 1.)",{"_36":870,"_38":10289,"_40":663,"_42":10290,"_67":10291,"_69":10292,"_71":70},"6C-tIuHJ",{"_273":323},[],"Publication: Redesign of the Technical Literature",{"_32":10294,"_34":10295},[],{"_36":1875,"_38":10296,"_40":663,"_42":10297,"_67":10298,"_69":70,"_71":10299},"AHdU7Sic",{"_273":323},[],"ipfs://bafkreih45rwplfyhtcvhvhoartio23fr3nw6m6j376tdi4zwetqeytmcde",{"_32":10301,"_34":10302},[],{"_36":160,"_38":10303,"_40":663,"_42":10304,"_67":10305,"_69":10306,"_71":70},"4N2-B8DE",{},[],"The next step is, of course, the creation of hyper-magazines or journals under the sponsorship and supervision of professional societ¬ ies. Here the problem of organization would seem to become thorny. But this collection could be much like the journals of today, except for the direct availability of previous literature, working papers and vari¬ ous odds and ends. It should be observed that any of the \"documents\" noted in the illustration can themselves be hypertexts. (Figure 2.)",{"_32":10308,"_34":10309},[],{"_36":1875,"_38":10310,"_40":663,"_42":10311,"_67":10312,"_69":70,"_71":10313},"xZqgbKwl",{"_273":323},[],"ipfs://bafkreidg4wc4cvzvp7m3e4gvxyultgcikkm5staxbf6ziywff5s6mxmuzm",{"_32":10315,"_34":10316},[],{"_36":160,"_38":10317,"_40":663,"_42":10318,"_67":10319,"_69":10320,"_71":70},"RCYxK8Fa",{},[],"In this magazine, an arbitrary conjecture, all material of the past year is considered \"recent\" and embraced in a common lookup struc¬ ture. New material enters the collection surreptitiously, at whatever time of day or night the editors release it; material one year old is formally expelled to a different file on the first of each month. (It may be just as accessible, but its nominal status changes, rather like that of a book taken off the \"recent acquisitions\" list of a library.) This maga¬ zine would hold most of what people were talking about in a field, and it would all be right there.",{"_32":10322,"_34":10323},[],{"_36":160,"_38":10324,"_40":663,"_42":10325,"_67":10326,"_69":10327,"_71":70},"PTfKOL8e",{},[],"There are numerous technical complications to hypertext publish¬ ing. There is no room here to discuss the more esoteric technical ones, such as facilities, billing and copyright conventions, or possible techniques of encryption and validation to prevent pirating of works and to authenticate expeditionary versions.",{"_32":10329,"_34":10379},[10330,10337,10344,10351,10358,10365,10372],{"_32":10331,"_34":10332},[],{"_36":160,"_38":10333,"_40":663,"_42":10334,"_67":10335,"_69":10336,"_71":70},"JTmcgPSS",{},[],"How shall it begin?",{"_32":10338,"_34":10339},[],{"_36":160,"_38":10340,"_40":663,"_42":10341,"_67":10342,"_69":10343,"_71":70},"AeoACfTd",{},[],"Those contemplating massive retrieval systems commonly pre¬ sume that they must begin with some massive corpus all accessible. The Library of Congress is often mentioned. Even Bush supposes regret¬ fully (in the revised article, p. 100) that the personal system waits on large public establishments being automated first.",{"_32":10345,"_34":10346},[],{"_36":160,"_38":10347,"_40":663,"_42":10348,"_67":10349,"_69":10350,"_71":70},"odGms8KE",{},[],"I do not believe this is so. It will be practicable and of considerable interest to begin on a small scale, having no grand corpus available. The grand corpus will come soon enough, as requests emerge. (We have a precedent: the prowess of University Microfilms, Inc. in rendering texts available to scholars in microfilm.)",{"_32":10352,"_34":10353},[],{"_36":160,"_38":10354,"_40":663,"_42":10355,"_67":10356,"_69":10357,"_71":70},"EDQvrf0V",{},[],"The way to begin is to furnish supported consoles to small commu¬ nities of users: key members of a \"small\" discipline, or specialists among whose work there is close connection. Suitable groups might be \"early Egyptologists,\" or just plain \"everybody at Woods Hole.\"",{"_32":10359,"_34":10360},[],{"_36":160,"_38":10361,"_40":663,"_42":10362,"_67":10363,"_69":10364,"_71":70},"2ov65eVP",{},[],"Such communicants, having been assured as well as possible of privacy and fail-safe design, will be encouraged to use the consoles fully. From the outset they may keep all their notes, manuscripts, articles, and copies of outgoing correspondence, on the system.",{"_32":10366,"_34":10367},[],{"_36":160,"_38":10368,"_40":663,"_42":10369,"_67":10370,"_69":10371,"_71":70},"gJRQI_G-",{},[],"The rest will follow. I am fairly sure of the predictions so far, at least in broad outline, but I am just as sure that the first generation of hypertext users will invent twice as much as has been descried and described so far.",{"_32":10373,"_34":10374},[],{"_36":160,"_38":10375,"_40":663,"_42":10376,"_67":10377,"_69":10378,"_71":70},"JGwiEpx3",{},[],"Who will support these beginnings? We have a choice, at the outset, of universities, publishing companies, computer companies (including service bureaux), research organizations or the government. Any of these might take such an initiative. Though such an initiative would seem severally unthinkable, it somehow seems collectively plausible and, of course, historically inevitable. If you believe in manifest destiny.",{"_36":870,"_38":10380,"_40":663,"_42":10381,"_67":10382,"_69":10383,"_71":70},"NmPbmZbl",{"_273":323},[],"How to Begin",{"_32":10385,"_34":10386},[],{"_36":160,"_38":10387,"_40":663,"_42":10388,"_67":10389,"_69":10390,"_71":70},"FqdZj537",{},[],"Theodor H. Nelson",{"_32":10392,"_34":10442},[10393,10400,10407,10414,10421,10428,10435],{"_32":10394,"_34":10395},[],{"_36":160,"_38":10396,"_40":663,"_42":10397,"_67":10398,"_69":10399,"_71":70},"q7BCIKoH",{},[],"Vannevar Bush, “As We May Think.\" The Atlantic Monthly 176:1 (July, 1945), 101-108. References to \"Bush\" cite this article unless further specified, and all unexplained numbers and paginations in the text refer to it. Because the article is so tightly written and our interest in it so close, paginations are given to the column and paragraph.",{"_32":10401,"_34":10402},[],{"_36":160,"_38":10403,"_40":663,"_42":10404,"_67":10405,"_69":10406,"_71":70},"BAYej_AG",{},[],"Allen Kent, Textbook on Mechanized Information Retrieval , second edition. Wiley, 1966; pp. 7-9.",{"_32":10408,"_34":10409},[],{"_36":160,"_38":10410,"_40":663,"_42":10411,"_67":10412,"_69":10413,"_71":70},"Knny6v2L",{},[],"Joseph Becker and Robert M. Hayes, Information Storage and Retrieval: Tools, Elements, Theories. Wiley, 1963; p. 40.",{"_32":10415,"_34":10416},[],{"_36":160,"_38":10417,"_40":663,"_42":10418,"_67":10419,"_69":10420,"_71":70},"FCyi95T7",{},[],"John H. Wilson, \"As We May Have Thought.\" In Progress in Information Science and Technology: Proceedings of the American Documentation Institute 1966 Annual Meeting. Adrianne Press, 1966, pp. 117-122.",{"_32":10422,"_34":10423},[],{"_36":160,"_38":10424,"_40":663,"_42":10425,"_67":10426,"_69":10427,"_71":70},"OiWtgN5T",{},[],"Vannevar Bush, \"Memex Revisited.\" In Vannevar Bush, Science Is Not Enough. William Morrow and Company, Inc., 1967, 75-101.",{"_32":10429,"_34":10430},[],{"_36":160,"_38":10431,"_40":663,"_42":10432,"_67":10433,"_69":10434,"_71":70},"-cs1mRKO",{},[],"Douglas C. Engelbart, \"Augmenting Human Intellect: A Conceptual Framework.\" AFOSR-3223 Summary Report, Stanford Research Institute, Menlo Park, California, October 1962. This expresses the philosophy, rather than the results, of the continuing project.",{"_32":10436,"_34":10437},[],{"_36":160,"_38":10438,"_40":663,"_42":10439,"_67":10440,"_69":10441,"_71":70},"mzUjEM1v",{},[],"Theodor H. Nelson, \"Getting It Out of Our System.\" In George Schechter (ed.). Information Retrieval: A Critical View. Thompson Book Company, 1967; pp. 191-210.",{"_36":870,"_38":10443,"_40":663,"_42":10444,"_67":10445,"_69":10446,"_71":70},"ojtCZdE_",{"_273":2113},[],"Endnotes",[279],"/records/as-we-will-think",{"_83":683},{},{"_38":660,"_95":54,"_55":10452,"_72":663,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,662],1773151562563,[149,660,663,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/as-we-will-think\",\"bafy2bzacecch5uwnt26x7dklj2wsiozscxmqoyev5may4dvqmc6nb5kqhly7k\",true]",{"_110":10457,"_147":10954,"_150":10955},{"_112":10458,"_131":132,"_133":10953,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":10459,"_38":10951},{"_29":10460,"_72":689,"_73":54,"_74":10946,"_55":10947,"_77":698,"_79":10948,"_81":10949,"_85":10950,"_87":699,"_89":90},[10461,10473,10485,10506,10554,10596,10645,10673,10687,10736,10750,10764,10869,10897,10911,10925],{"_32":10462,"_34":10463},[],{"_36":160,"_38":10464,"_40":699,"_42":10465,"_67":10466,"_69":10472,"_71":70},"wUSPjXYl",{},[10467],{"_36":204,"_167":10468,"_169":10469,"_42":10470,"_71":10471},[5843],[5591],{},"mailto:ted@xanadu.net","Theodor Holm Nelson Project Xanadu, Keio University and University of Southampton e-mail ted@xanadu.net",{"_32":10474,"_34":10475},[],{"_36":160,"_38":10476,"_40":699,"_42":10477,"_67":10478,"_69":10484,"_71":70},"Bp4Qfhbi",{},[10479],{"_36":204,"_167":10480,"_169":10481,"_42":10482,"_71":10483},[2828],[6479],{},"https://xanadu.com.au/ted/transcopyright/transcopy.html","Origin Server: https://xanadu.com.au/ted/transcopyright/transcopy.html",{"_32":10486,"_34":10501},[10487,10494],{"_32":10488,"_34":10489},[],{"_36":160,"_38":10490,"_40":699,"_42":10491,"_67":10492,"_69":10493,"_71":70},"dsozFF9o",{},[],"The on-line copyright problem may be resolvable by a simple, sweeping permission method. This proposed system, which anyone may use, allows broad re-use of materials in exchange for automatic tracking of ownership. Payment goes to the original publisher and credit to the original author. Nothing is misquoted, nothing is out of context (since the original context is immediately available), and users are not spied upon.",{"_32":10495,"_34":10496},[],{"_36":160,"_38":10497,"_40":699,"_42":10498,"_67":10499,"_69":10500,"_71":70},"3OXCe6Vl",{},[],"A wording and an abbreviation for this permission system are proposed here.",{"_36":870,"_38":10502,"_40":699,"_42":10503,"_67":10504,"_69":10505,"_71":70},"jNijcoDR",{"_273":323},[],"SUMMARY",{"_32":10507,"_34":10550},[10508,10515,10522,10529,10536,10543],{"_32":10509,"_34":10510},[],{"_36":160,"_38":10511,"_40":699,"_42":10512,"_67":10513,"_69":10514,"_71":70},"brZRn_iR",{},[],"Someone who asks, \"How do we keep people from stealing food?\" is asking you to consider only his side of the issue, without addressing underlying problems. But it might be sensible to ask another question in reply. If we ask, \"How can the people obtain food?\", perhaps both problems can be solved together.",{"_32":10516,"_34":10517},[],{"_36":160,"_38":10518,"_40":699,"_42":10519,"_67":10520,"_69":10521,"_71":70},"8EZ1ioFl",{},[],"That is how I see the issue of copyright in digital media. Those who merely ask, \"How do we prevent copyright infringement?\" are only asking the first question without addressing the second. There is a hunger for the re-use of media. If we can find a legitimate way to feed this hunger, then perhaps the stealing will not be necessary.",{"_32":10523,"_34":10524},[],{"_36":160,"_38":10525,"_40":699,"_42":10526,"_67":10527,"_69":10528,"_71":70},"Xpb7W3Jw",{},[],"Today's central controversy seems to be the question of how to manage copyright and royalty on the sale of digital content.",{"_32":10530,"_34":10531},[],{"_36":160,"_38":10532,"_40":699,"_42":10533,"_67":10534,"_69":10535,"_71":70},"H9Qs7d23",{},[],"The standard question has been, \"How do we prevent infringement?\" If we re-frame the question as \"How can we allow re-use?\", the solution may be simpler and more powerful than everyone thinks, with benefits for everyone.",{"_32":10537,"_34":10538},[],{"_36":160,"_38":10539,"_40":699,"_42":10540,"_67":10541,"_69":10542,"_71":70},"PbgLCTXr",{},[],"This reformulates an idea which occurred to the author in the fall of 1960, and which since then has been an implicit part of the Xanadu Project (1), an ambitious system of hypermedia publishing servers with deep version management. Because the project has been controversial and beset with difficulties, our fundamental copyright proposal was not understood. And because this method was embedded in the software that had been designed for the Xanadu project, it was not recognized or expounded as a separate legal permission doctrine.",{"_32":10544,"_34":10545},[],{"_36":160,"_38":10546,"_40":699,"_42":10547,"_67":10548,"_69":10549,"_71":70},"1hIDT9H4",{},[],"In this paper, we now separate that copyright method from its software history, and present it as a method anyone can use. It is a legal permission doctrine with far-reaching consequences, whose benefits may be considerable.",{"_36":870,"_38":10551,"_40":699,"_42":10552,"_67":10553,"_69":5929,"_71":70},"k25R4mHO",{"_273":323},[],{"_32":10555,"_34":10591},[10556,10563,10570,10577,10584],{"_32":10557,"_34":10558},[],{"_36":160,"_38":10559,"_40":699,"_42":10560,"_67":10561,"_69":10562,"_71":70},"cacNULNT",{},[],"From the beginning, the objective of Project Xanadu was to facilitate a new kind of literature: a new populist medium, a many-to-many publishing system, not centralized in editorial and publishing companies, but open to anyone. It was intended to create a new kind of freedom of the press, and make possible a deeper understanding of published materials (2).",{"_32":10564,"_34":10565},[],{"_36":160,"_38":10566,"_40":699,"_42":10567,"_67":10568,"_69":10569,"_71":70},"0HgU8n3a",{},[],"But this would not mean simply electronic availability of closed documents; we would also need to re-use existing materials, and the computer could help keep this re-use orderly (and do so without spying on users).",{"_32":10571,"_34":10572},[],{"_36":160,"_38":10573,"_40":699,"_42":10574,"_67":10575,"_69":10576,"_71":70},"qUVkCHlD",{},[],"The idea was to preserve integrity, copyright and royalty for digital materials, yet allow everyone freely to re-use these materials, which would retain their identity at all times. By allowing everyone to republish all materials, this would effectively define a new system of fluid, digital transmedia, with universal freedom of re-use and visualization. All different republications could in principle be viewed side-by-side by the user, thus leading to greater understanding of the material and of the points of view of the different documents, their authors and republishers.",{"_32":10578,"_34":10579},[],{"_36":160,"_38":10580,"_40":699,"_42":10581,"_67":10582,"_69":10583,"_71":70},"zElpS3C7",{},[],"The scheme is simple: under this arrangement, everyone is free to republish digital materials virtually, as quotations, anthologies and collages, provided that the republication is virtual: that is, provided that the republisher only provides instructions for acquisiton and assembly of the parts, and each copy of previously-published bytes is separately purchased from the original publisher(s) at the time of delivery. A republisher only distributes pointers showing how to obtain the material, and in what new context(s) to place the material; each recipient buys these materials independently.",{"_32":10585,"_34":10586},[],{"_36":160,"_38":10587,"_40":699,"_42":10588,"_67":10589,"_69":10590,"_71":70},"PI0YivhU",{},[],"This method provides each receiving party with a properly-owned, independent copy of the materials, all purchased anew from the original publisher. What may be just as important, it provides incentives for participation and a method for honest re-use in a system from which all benefit.",{"_36":870,"_38":10592,"_40":699,"_42":10593,"_67":10594,"_69":10595,"_71":70},"4Ub9rpVm",{"_273":323},[],"THE OBJECTIVE",{"_32":10597,"_34":10640},[10598,10605,10612],{"_32":10599,"_34":10600},[],{"_36":160,"_38":10601,"_40":699,"_42":10602,"_67":10603,"_69":10604,"_71":70},"-yWOcfjN",{},[],"What is proposed here turns out actually to be, at its center, a permission doctrine. A new permission doctrine may be easily added to our culture; a variety of permission doctrines are already popular, such as \"shareware\" and \"all rights reserved, except that churches may reprint freely.\"",{"_32":10606,"_34":10607},[],{"_36":160,"_38":10608,"_40":699,"_42":10609,"_67":10610,"_69":10611,"_71":70},"uEIMiZkC",{},[],"In this proposed permission doctrine, the copyright holder gives permission for republication, PROVIDED THAT the material is sent to users only as an address for the material being republished, indicating what material is to be included in what new context, and inviting the recipient to purchase the content bytes anew from their present publisher. When a recipient purchases material, the material is sent with identifiers as to its origin; and the user has software enabling these identifiers to be kept. This has a number of benefits: (1) the user knows the origin; (2) this identification can be part of a proof of purchase; (3) in principle, any recipient may republish in the same fashion, ad infinitum.",{"_32":10613,"_34":10635},[10614,10621,10628],{"_32":10615,"_34":10616},[],{"_36":160,"_38":10617,"_40":699,"_42":10618,"_67":10619,"_69":10620,"_71":70},"ZxDNZyym",{},[],"To allow this, the copyright holder must therefore make a statement like the following. (Note that I am still tinkering with the provisions and wording.)",{"_32":10622,"_34":10623},[],{"_36":160,"_38":10624,"_40":699,"_42":10625,"_67":10626,"_69":10627,"_71":70},"rjEqzKKo",{},[],"\"Permission is granted to all parties in the universe to re-publish the bytes of these materials virtually in new on-line contexts, provided (1) that such virtual republication consists of transmitting only a purchase address for bytes to be included in a particular new context; and provided (2) that the present publisher is notified of any such virtual republication.\"",{"_32":10629,"_34":10630},[],{"_36":160,"_38":10631,"_40":699,"_42":10632,"_67":10633,"_69":10634,"_71":70},"c572Na4t",{},[],"This may be adequate to achieve the desired result, as we will consider below. It also leaves room for a number of possible variations.",{"_36":870,"_38":10636,"_40":699,"_42":10637,"_67":10638,"_69":10639,"_71":70},"S4F01bwb",{"_273":323},[],"LONG FORM PERMISSION",{"_36":870,"_38":10641,"_40":699,"_42":10642,"_67":10643,"_69":10644,"_71":70},"7zCGLn1a",{"_273":323},[],"A PERMISSION DOCTRINE",{"_32":10646,"_34":10668},[10647,10654,10661],{"_32":10648,"_34":10649},[],{"_36":160,"_38":10650,"_40":699,"_42":10651,"_67":10652,"_69":10653,"_71":70},"JgpmeBjp",{},[],"This may seem over-simple, when mighty technical and legislative solutions are being sought by so many parties. But it shifts the ground of the issue.",{"_32":10655,"_34":10656},[],{"_36":160,"_38":10657,"_40":699,"_42":10658,"_67":10659,"_69":10660,"_71":70},"_T72pSmK",{},[],"The new ground becomes the issue of CONTEXT RELINQUISHMENT-- the publisher's willingness to allow the material to be used in unpredictable contexts, in return for royalty, credit, and the immediate availability of the original contexts for further purchase, inspection and comparison.",{"_32":10662,"_34":10663},[],{"_36":160,"_38":10664,"_40":699,"_42":10665,"_67":10666,"_69":10667,"_71":70},"Y7mOKd7e",{},[],"This is a tradeoff. We expect publishers-- especially small, non-traditional publishers and self-publishing individuals-- to be invigorated by the notion of their materials being available for universal sale and re-use, to their benefit. More traditional publishers and authors may hesitate, not recognizing that all the traditional objectives may be satisfied by this system.",{"_36":870,"_38":10669,"_40":689,"_42":10670,"_67":10671,"_69":10672,"_71":70},"3lBM7vjq",{"_273":323},[],"IRONICALLY SIMPLE",{"_32":10674,"_34":10682},[10675],{"_32":10676,"_34":10677},[],{"_36":160,"_38":10678,"_40":699,"_42":10679,"_67":10680,"_69":10681,"_71":70},"kB1Aa5RP",{},[],"Implied in this method are certain other aspects of implementation. For instance, the user must be given a receipt for each portion purchased, so that the received materials may be proved a legitimate copy. A survivable memorandum of origin (the address from which purchased) must also accompany the repurchased materials, making virtual republication possible once again (by the new recipient). And the republisher must notify the original publisher of the republication, so that these re-uses may be seen.",{"_36":870,"_38":10683,"_40":689,"_42":10684,"_67":10685,"_69":10686,"_71":70},"6OGEE3Ci",{"_273":323},[],"IMPLIED ASPECTS",{"_32":10688,"_34":10731},[10689,10696,10703],{"_32":10690,"_34":10691},[],{"_36":160,"_38":10692,"_40":699,"_42":10693,"_67":10694,"_69":10695,"_71":70},"MNPJQJFL",{},[],"This permission doctrine has certain minimal requirements for supporting software. Certain unusual software features are required:",{"_32":10697,"_34":10698},[],{"_36":160,"_38":10699,"_40":699,"_42":10700,"_67":10701,"_69":10702,"_71":70},"BadN2E0x",{},[],"Server-side software: The server program should have the ability to sell materials in small amounts, ideally at a fixed price per byte, delivering the materials with a receipt and identity notification.",{"_32":10704,"_34":10726},[10705,10712,10719],{"_32":10706,"_34":10707},[],{"_36":160,"_38":10708,"_40":699,"_42":10709,"_67":10710,"_69":10711,"_71":70},"AUjNyGTG",{},[],"Viewer program with purchase methods. Any recipient must have a viewer program (\"client software\") which has methods for purchasing the required bytes, and which retains the identity of bytes purchased.",{"_32":10713,"_34":10714},[],{"_36":160,"_38":10715,"_40":699,"_42":10716,"_67":10717,"_69":10718,"_71":70},"zycMiC4Z",{},[],"Editing program which retains identities of portions. Any republisher must have an editing program which retains the original identity and addresses of the edited materials, even as they become cut down (or re-expanded by additional purchases from the original).",{"_32":10720,"_34":10721},[],{"_36":160,"_38":10722,"_40":699,"_42":10723,"_67":10724,"_69":10725,"_71":70},"ZQjsNs0y",{},[],"Stripping program. After an author has finished creating a document which is to include republished material, a special stripping program (or feature) must then prepare the document for skeleton transmission, stripping out the actual bytes and substituting the original addresses in the necessary format for their repurchase.",{"_36":160,"_38":10727,"_40":699,"_42":10728,"_67":10729,"_69":10730,"_71":70},"t2lJAIkY",{"_273":2113},[],"Client-side software: Certain detailed features of an unusual nature are required in the user's programs.",{"_36":870,"_38":10732,"_40":689,"_42":10733,"_67":10734,"_69":10735,"_71":70},"J9i9eU_d",{"_273":323},[],"SUPPORTING SOFTWARE ASPECTS",{"_32":10737,"_34":10745},[10738],{"_32":10739,"_34":10740},[],{"_36":160,"_38":10741,"_40":699,"_42":10742,"_67":10743,"_69":10744,"_71":70},"ME9QYzcC",{},[],"The recipient who purchases the suggested materials owns a final copy, like any book, each portion legally purchased. Even if the materials are later withdrawn from sale, each copy already acquired in this way retains itsownership status as the possession of the recipient.",{"_36":870,"_38":10746,"_40":699,"_42":10747,"_67":10748,"_69":10749,"_71":70},"e7yTOty9",{"_273":323},[],"OWNERSHIP OF EACH FINAL COPY",{"_32":10751,"_34":10759},[10752],{"_32":10753,"_34":10754},[],{"_36":160,"_38":10755,"_40":699,"_42":10756,"_67":10757,"_69":10758,"_71":70},"2pX_wpkQ",{},[],"Note that any party may offer transcopyright; and note that different variations of this arrangement, with different details of availability, may be mixed and matched in a given document (see below). Regardless of such variations, a legitimate mixed copy is still owned by the final recipient.",{"_36":870,"_38":10760,"_40":699,"_42":10761,"_67":10762,"_69":10763,"_71":70},"rUXNmxua",{"_273":323},[],"COMPATIBILITY, INTEROPERABILITY",{"_32":10765,"_34":10864},[10766,10780,10794,10801,10822,10829,10843,10850,10857],{"_32":10767,"_34":10775},[10768],{"_32":10769,"_34":10770},[],{"_36":160,"_38":10771,"_40":699,"_42":10772,"_67":10773,"_69":10774,"_71":70},"sg7lckfk",{},[],"Trans(c)(year)(name)",{"_36":160,"_38":10776,"_40":699,"_42":10777,"_67":10778,"_69":10779,"_71":70},"ZMkNa8Vv",{"_273":323},[],"I propound for this permission system an extremely simple presentational format. A publisher signifies participation by the following notice, in the place of the usual copyright notice:",{"_32":10781,"_34":10789},[10782],{"_32":10783,"_34":10784},[],{"_36":160,"_38":10785,"_40":699,"_42":10786,"_67":10787,"_69":10788,"_71":70},"Kk5z_3XQ",{},[],"Trans(c)1995 Irving Snerd",{"_36":160,"_38":10790,"_40":699,"_42":10791,"_67":10792,"_69":10793,"_71":70},"-bPhCN80",{"_273":323},[],"For example,",{"_32":10795,"_34":10796},[],{"_36":160,"_38":10797,"_40":699,"_42":10798,"_67":10799,"_69":10800,"_71":70},"7LetWbRi",{},[],"This is a shorthand form of the long-form permission stated earlier, so that the publisher is spared having to include it.",{"_32":10802,"_34":10817},[10803,10810],{"_32":10804,"_34":10805},[],{"_36":160,"_38":10806,"_40":699,"_42":10807,"_67":10808,"_69":10809,"_71":70},"NCVZnjvY",{},[],"Trans(c)1995 Irving Snerd; administered Dun & Bradstreet. or",{"_32":10811,"_34":10812},[],{"_36":160,"_38":10813,"_40":699,"_42":10814,"_67":10815,"_69":10816,"_71":70},"POtByzif",{},[],"Ziff-Davis Trans(c)1995 Irving Snerd.",{"_36":160,"_38":10818,"_40":699,"_42":10819,"_67":10820,"_69":10821,"_71":70},"NknvdOv4",{"_273":323},[],"Some distribution agency or availability scheme should also be specified by the transcopyright grantor, as, for example:",{"_32":10823,"_34":10824},[],{"_36":160,"_38":10825,"_40":699,"_42":10826,"_67":10827,"_69":10828,"_71":70},"AyuJBVD2",{},[],"Either of these notifications tells all parties, in condensed form, (1) that copyright is claimed; (2) that transcopyright permission is granted, and (3) where the materials may be bought.",{"_32":10830,"_34":10838},[10831],{"_32":10832,"_34":10833},[],{"_36":160,"_38":10834,"_40":699,"_42":10835,"_67":10836,"_69":10837,"_71":70},"7q56R-FM",{},[],"(c)1995 Irving Snerd ",{"_36":160,"_38":10839,"_40":699,"_42":10840,"_67":10841,"_69":10842,"_71":70},"zijiMGdS",{"_273":323},[],"It will be noted that the traditional copyright notice",{"_32":10844,"_34":10845},[],{"_36":160,"_38":10846,"_40":699,"_42":10847,"_67":10848,"_69":10849,"_71":70},"YqM6RY5K",{},[],"is FULLY CONTAINED within the transcopyright notice, and so is still present.",{"_32":10851,"_34":10852},[],{"_36":160,"_38":10853,"_40":699,"_42":10854,"_67":10855,"_69":10856,"_71":70},"ELhVQqkv",{},[],"However, note also that this traditional copyright notice no longer has its former force in law, since by today's law an author now establishes copyright automatically by creating a work; so the copyright notice is now regarded as being a courtesy and a convenience. Thus we are offering the transcopyright permission as a further courtesy, so that all parties will know how they may republish.",{"_32":10858,"_34":10859},[],{"_36":160,"_38":10860,"_40":699,"_42":10861,"_67":10862,"_69":10863,"_71":70},"vzY1PYHG",{},[],"By what authority is this a shorthand of the longer version? I hereby DECLARE it to be such a shorthand form, just as the terms \"shareware\" and \"copyleft,\" declared by Bob Wallace and Richard Stallman respectively, have come to represent their respective permission doctrines, both now widely accepted and used. If others use the transcopyright notification with the intent given here, it will be recognized in law (like shareware and copyleft) as being synonymous with the longer permission notice.",{"_36":870,"_38":10865,"_40":699,"_42":10866,"_67":10867,"_69":10868,"_71":70},"r6q50lI0",{"_273":323},[],"THE PROPOSED FORMAT AND ITS LEGAL STATUS",{"_32":10870,"_34":10892},[10871,10878,10885],{"_32":10872,"_34":10873},[],{"_36":160,"_38":10874,"_40":699,"_42":10875,"_67":10876,"_69":10877,"_71":70},"jV9vaJYf",{},[],"This arrangement is for on-line screen viewing and keepage of digital data, not for paper or other solid media.",{"_32":10879,"_34":10880},[],{"_36":160,"_38":10881,"_40":699,"_42":10882,"_67":10883,"_69":10884,"_71":70},"epwXZiCC",{},[],"A number of issues are not handled by this arrangement. These include byte modification (such as morphing, bytewise graphical operations, and merged re-use of audio samples into a fused, mixed, inseparable recording). It does not involve printout. It does not cover site licensing for multiple users. It does not include model releases, talent releases, or other forms of permission not strictly part of copyright. It does not state how long materials will be offered for sale.",{"_32":10886,"_34":10887},[],{"_36":160,"_38":10888,"_40":699,"_42":10889,"_67":10890,"_69":10891,"_71":70},"JBbARtK1",{},[],"Who settles these details? This is within the scope of variation of the idea: different forms of transcopyright may be offered by different parties-- individuals, companies, or other administrations. Any party offering transcopyright may bundle different kinds of permission into their own systems. (For instance, the contracts of Project Xanadu will have specific clauses with respect to length of availability, paper printout and site licensing.)",{"_36":870,"_38":10893,"_40":699,"_42":10894,"_67":10895,"_69":10896,"_71":70},"nxKFA0cQ",{"_273":323},[],"VARIATIONS NOT COVERED; DIFFERENT JURISDICTIONS",{"_32":10898,"_34":10906},[10899],{"_32":10900,"_34":10901},[],{"_36":160,"_38":10902,"_40":699,"_42":10903,"_67":10904,"_69":10905,"_71":70},"bP2HSJYk",{},[],"This system is not automatically enforced, but neither is any other feasible electronic copyright system. It is no more or less enforceable than any other. The fact that it defines a convenient method for honest behavior, satisfying principal objectives of both publisher and republisher-- no longer \"infringer,\" but honest participant-- is a strong argument in its favor.",{"_36":870,"_38":10907,"_40":699,"_42":10908,"_67":10909,"_69":10910,"_71":70},"gifi-l5O",{"_273":323},[],"ENFORCEMENT AND BENEFITS",{"_32":10912,"_34":10920},[10913],{"_32":10914,"_34":10915},[],{"_36":160,"_38":10916,"_40":699,"_42":10917,"_67":10918,"_69":10919,"_71":70},"FZl1ZfTd",{},[],"My special thanks to Robert W. Fiddler, Esq., of Great Neck, N.Y., for over twenty-five years of friendship, generous legal tutoring, and delightful banter that have helped shape these ideas; but any errors, misunderstandings, or improprieties are my own.",{"_36":870,"_38":10921,"_40":699,"_42":10922,"_67":10923,"_69":10924,"_71":70},"1LGgTbce",{"_273":323},[],"ACKNOWLEDGMENT",{"_32":10926,"_34":10941},[10927,10934],{"_32":10928,"_34":10929},[],{"_36":160,"_38":10930,"_40":699,"_42":10931,"_67":10932,"_69":10933,"_71":70},"H0MET-YY",{},[],"Nelson, Theodor Holm, Literary Machines. Available from Mindful Press, 3020 Bridgeway #295, Sausalito, CA 94965, USA.",{"_32":10935,"_34":10936},[],{"_36":160,"_38":10937,"_40":699,"_42":10938,"_67":10939,"_69":10940,"_71":70},"M116WUdG",{},[],"Nelson, Theodor Holm, \"Literature Unified by Transclusion.\" Communications of the ACM, 1995.\n",{"_36":870,"_38":10942,"_40":699,"_42":10943,"_67":10944,"_69":10945,"_71":70},"LaCO6csZ",{"_273":2113},[],"BIBLIOGRAPHY",[279],"/records/transcopyright-pre-permission-for-virtual-republishing","2025-04-22T13:16:59.245Z",{"_83":712},{},{"_38":686,"_95":54,"_55":10952,"_72":689,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,688],1773151562567,[149,686,689,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/transcopyright-pre-permission-for-virtual-republishing\",\"bafy2bzaceclc5nlpgulmjwhnqelgtmzn4ulwy64vercqapqvs7f7m6tshknfm\",true]",{"_110":10957,"_147":11619,"_150":11620},{"_112":10958,"_131":132,"_133":11618,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":10959,"_38":11616},{"_29":10960,"_72":718,"_73":54,"_74":11611,"_55":11612,"_77":726,"_79":11613,"_81":11614,"_85":11615,"_87":727,"_89":90},[10961,10973,10985,10997,11003,11010,11017,11024,11116,11219,11303,11345,11422,11492,11534],{"_32":10962,"_34":10963},[],{"_36":160,"_38":10964,"_40":10965,"_42":10966,"_67":10967,"_69":10972,"_71":70},"LT8SR8VG","bafy2bzacectcr6tbm6lphxz6qevqdzbf5b6l2tri4gq4huw5drbp3vtxk2326",{},[10968],{"_36":166,"_167":10969,"_169":10970,"_42":10971,"_71":70},[5591],[7296],{},"“Consider a future device … in which an individual stores all his books, records, and communications, and which is mechanized so that it may be consulted with exceeding speed and flexibility. It is an enlarged intimate supplement to his memory.”",{"_32":10974,"_34":10975},[],{"_36":160,"_38":10976,"_40":10965,"_42":10977,"_67":10978,"_69":10984,"_71":70},"PUjhoPGO",{},[10979],{"_36":204,"_167":10980,"_169":10981,"_42":10982,"_71":10983},[47],[1488],{},"undefined","By Vannevar Bush",{"_32":10986,"_34":10987},[],{"_36":160,"_38":10988,"_40":10965,"_42":10989,"_67":10990,"_69":10996,"_71":70},"jHU9XtzX",{},[10991],{"_36":204,"_167":10992,"_169":10993,"_42":10994,"_71":10995},[6982],[6448],{},"hm://z6MkrbYsRzKb1VABdvhsDSAk6JK8fAszKsyHhcaZigYeWCou/keywords?v=bafy2bzacebmjuozpxuj7gz5xopm7bcqql3wrsuvtxwex3myzvynb4vrsa7r3q#hEOcMm4d","Keywords: Keywords",{"_32":10998,"_34":10999},[],{"_36":1875,"_38":11000,"_40":10965,"_42":11001,"_67":11002,"_69":70,"_71":737},"_moUTRZu",{},[],{"_32":11004,"_34":11005},[],{"_36":160,"_38":11006,"_40":10965,"_42":11007,"_67":11008,"_69":11009,"_71":70},"h5EzPleN",{},[],"This has not been a scientist's war; it has been a war in which all have had a part. The scientists, burying their old professional competition in the demand of a common cause, have shared greatly and learned much. It has been exhilarating to work in effective partnership. Now, for many, this appears to be approaching an end. What are the scientists to do next?",{"_32":11011,"_34":11012},[],{"_36":160,"_38":11013,"_40":10965,"_42":11014,"_67":11015,"_69":11016,"_71":70},"7bq1agtk",{},[],"For the biologists, and particularly for the medical scientists, there can be little indecision, for their war has hardly required them to leave the old paths. Many indeed have been able to carry on their war research in their familiar peacetime laboratories. Their objectives remain much the same. WOW",{"_32":11018,"_34":11019},[],{"_36":160,"_38":11020,"_40":10965,"_42":11021,"_67":11022,"_69":11023,"_71":70},"vaq59NuB",{},[],"It is the physicists who have been thrown most violently off stride, who have left academic pursuits for the making of strange destructive gadgets, who have had to devise new methods for their unanticipated assignments. They have done their part on the devices that made it possible to turn back the enemy, have worked in combined effort with the physicists of our allies. They have felt within themselves the stir of achievement. They have been part of a great team. Now, as peace approaches, one asks where they will find objectives worthy of their best.",{"_32":11025,"_34":11111},[11026,11034,11041,11048,11067,11074,11081,11088,11095],{"_32":11027,"_34":11028},[],{"_36":160,"_38":11029,"_40":11030,"_42":11031,"_67":11032,"_69":11033,"_71":70},"fsvLRbpM","bafy2bzaceb7xb4ixpk4kzd73mql3ogwmak26fcc3plf35sbrxmr7lzh3drfyw",{},[],"Of what lasting benefit has been man’s use of science and of the new instruments which his research brought into existence? First, they have increased his control of his material environment. They have improved his food, his clothing, his shelter; they have increased his security and released him partly from the bondage of bare existence. They have given him increased knowledge of his own biological processes so that he has had a progressive freedom from disease and an increased span of life. They are illuminating the interactions of his physiological and psychological functions, giving the promise of an improved mental health.",{"_32":11035,"_34":11036},[],{"_36":160,"_38":11037,"_40":11030,"_42":11038,"_67":11039,"_69":11040,"_71":70},"FtyqstGP",{},[],"Science has provided the swiftest communication between individuals; it has provided a record of ideas and has enabled man to manipulate and to make extracts from that record so that knowledge evolves and endures throughout the life of a race rather than that of an individual.",{"_32":11042,"_34":11043},[],{"_36":160,"_38":11044,"_40":11030,"_42":11045,"_67":11046,"_69":11047,"_71":70},"EtPB8OOn",{},[],"There is a growing mountain of research. But there is increased evidence that we are being bogged down today as specialization extends. The investigator is staggered by the findings and conclusions of thousands of other workers—conclusions which he cannot find time to grasp, much less to remember, as they appear. Yet specialization becomes increasingly necessary for progress, and the effort to bridge between disciplines is correspondingly superficial.",{"_32":11049,"_34":11050},[],{"_36":160,"_38":11051,"_40":11030,"_42":11052,"_67":11053,"_69":11066,"_71":70},"ElkdsWEh",{},[11054,11061],{"_36":204,"_167":11055,"_169":11057,"_42":11059,"_71":11060},[11056],594,[11058],610,{},"https://www.theatlantic.com/magazine/archive/2016/06/genes-are-overrated/480729/",{"_36":11062,"_167":11063,"_169":11064,"_42":11065,"_71":70},"Underline",[11056],[11058],{},"Professionally our methods of transmitting and reviewing the results of research are generations old and by now are totally inadequate for their purpose. If the aggregate time spent in writing scholarly works and in reading them could be evaluated, the ratio between these amounts of time might well be startling. Those who conscientiously attempt to keep abreast of current thought, even in restricted fields, by close and continuous reading might well shy away from an examination calculated to show how much of the previous month’s efforts could be produced on call. Mendel’s concept of the laws of genetics was lost to the world for a generation because his publication did not reach the few who were capable of grasping and extending it; and this sort of catastrophe is undoubtedly being repeated all about us, as truly significant attainments become lost in the mass of the inconsequential.",{"_32":11068,"_34":11069},[],{"_36":160,"_38":11070,"_40":11030,"_42":11071,"_67":11072,"_69":11073,"_71":70},"_X828seC",{},[],"The difficulty seems to be, not so much that we publish unduly in view of the extent and variety of present day interests, but rather that publication has been extended far beyond our present ability to make real use of the record. The summation of human experience is being expanded at a prodigious rate, and the means we use for threading through the consequent maze to the momentarily important item is the same as was used in the days of square-rigged ships.",{"_32":11075,"_34":11076},[],{"_36":160,"_38":11077,"_40":11030,"_42":11078,"_67":11079,"_69":11080,"_71":70},"UulAaPMh",{},[],"But there are signs of a change as new and powerful instrumentalities come into use. Photocells capable of seeing things in a physical sense, advanced photography which can record what is seen or even what is not, thermionic tubes capable of controlling potent forces under the guidance of less power than a mosquito uses to vibrate his wings, cathode ray tubes rendering visible an occurrence so brief that by comparison a microsecond is a long time, relay combinations which will carry out involved sequences of movements more reliably than any human operator and thousands of times as fast—there are plenty of mechanical aids with which to effect a transformation in scientific records.",{"_32":11082,"_34":11083},[],{"_36":160,"_38":11084,"_40":11030,"_42":11085,"_67":11086,"_69":11087,"_71":70},"CQCC_MuI",{},[],"Two centuries ago Leibnitz invented a calculating machine which embodied most of the essential features of recent keyboard devices, but it could not then come into use. The economics of the situation were against it: the labor involved in constructing it, before the days of mass production, exceeded the labor to be saved by its use, since all it could accomplish could be duplicated by sufficient use of pencil and paper. Moreover, it would have been subject to frequent breakdown, so that it could not have been depended upon; for at that time and long after, complexity and unreliability were synonymous.",{"_32":11089,"_34":11090},[],{"_36":160,"_38":11091,"_40":11030,"_42":11092,"_67":11093,"_69":11094,"_71":70},"kvppvgUU",{},[],"Babbage, even with remarkably generous support for his time, could not produce his great arithmetical machine. His idea was sound enough, but construction and maintenance costs were then too heavy. Had a Pharaoh been given detailed and explicit designs of an automobile, and had he understood them completely, it would have taxed the resources of his kingdom to have fashioned the thousands of parts for a single car, and that car would have broken down on the first trip to Giza.",{"_32":11096,"_34":11097},[],{"_36":160,"_38":11098,"_40":11030,"_42":11099,"_67":11100,"_69":11110,"_71":70},"rW1JcTwl",{},[11101,11106],{"_36":204,"_167":11102,"_169":11103,"_42":11104,"_71":11105},[7150],[6317],{},"https://www.theatlantic.com/technology/archive/2013/09/the-hidden-world-of-the-typewriter/279523/",{"_36":11062,"_167":11107,"_169":11108,"_42":11109,"_71":70},[7150],[6317],{},"Machines with interchangeable parts can now be constructed with great economy of effort. In spite of much complexity, they perform reliably. Witness the humble typewriter, or the movie camera, or the automobile. Electrical contacts have ceased to stick when thoroughly understood. Note the automatic telephone exchange, which has hundreds of thousands of such contacts, and yet is reliable. A spider web of metal, sealed in a thin glass container, a wire heated to brilliant glow, in short, the thermionic tube of radio sets, is made by the hundred million, tossed about in packages, plugged into sockets—and it works! Its gossamer parts, the precise location and alignment involved in its construction, would have occupied a master craftsman of the guild for months; now it is built for thirty cents. The world has arrived at an age of cheap complex devices of great reliability; and something is bound to come of it.",{"_36":870,"_38":11112,"_40":11030,"_42":11113,"_67":11114,"_69":11115,"_71":70},"-6w4sC-U",{"_273":323},[],"1",{"_32":11117,"_34":11214},[11118,11125,11132,11139,11146,11153,11160,11167,11174,11181,11188,11201],{"_32":11119,"_34":11120},[],{"_36":160,"_38":11121,"_40":11030,"_42":11122,"_67":11123,"_69":11124,"_71":70},"SRZ0vATy",{},[],"A record if it is to be useful to science, must be continuously extended, it must be stored, and above all it must be consulted. Today we make the record conventionally by writing and photography, followed by printing; but we also record on film, on wax disks, and on magnetic wires. Even if utterly new recording procedures do not appear, these present ones are certainly in the process of modification and extension.",{"_32":11126,"_34":11127},[],{"_36":160,"_38":11128,"_40":11030,"_42":11129,"_67":11130,"_69":11131,"_71":70},"2c3C7fi7",{},[],"Certainly progress in photography is not going to stop. Faster material and lenses, more automatic cameras, finer-grained sensitive compounds to allow an extension of the minicamera idea, are all imminent. Let us project this trend ahead to a logical, if not inevitable, outcome. The camera hound of the future wears on his forehead a lump a little larger than a walnut. It takes pictures 3 millimeters square, later to be projected or enlarged, which after all involves only a factor of 10 beyond present practice. The lens is of universal focus, down to any distance accommodated by the unaided eye, simply because it is of short focal length. There is a built-in photocell on the walnut such as we now have on at least one camera, which automatically adjusts exposure for a wide range of illumination. There is film in the walnut for a hundred exposures, and the spring for operating its shutter and shifting its film is wound once for all when the film clip is inserted. It produces its result in full color. It may well be stereoscopic, and record with two spaced glass eyes, for striking improvements in stereoscopic technique are just around the corner.",{"_32":11133,"_34":11134},[],{"_36":160,"_38":11135,"_40":11030,"_42":11136,"_67":11137,"_69":11138,"_71":70},"pdVl6vYY",{},[],"The cord which trips its shutter may reach down a man’s sleeve within easy reach of his fingers. A quick squeeze, and the picture is taken. On a pair of ordinary glasses is a square of fine lines near the top of one lens, where it is out of the way of ordinary vision. When an object appears in that square, it is lined up for its picture. As the scientist of the future moves about the laboratory or the field, every time he looks at something worthy of the record, he trips the shutter and in it goes, without even an audible click. Is this all fantastic? The only fantastic thing about it is the idea of making as many pictures as would result from its use.",{"_32":11140,"_34":11141},[],{"_36":160,"_38":11142,"_40":11030,"_42":11143,"_67":11144,"_69":11145,"_71":70},"Om8w7cZv",{},[],"Will there be dry photography? It is already here in two forms. When Brady made his Civil War pictures, the plate had to be wet at the time of exposure. Now it has to be wet during development instead. In the future perhaps it need not be wetted at all. There have long been films impregnated with diazo dyes which form a picture without development, so that it is already there as soon as the camera has been operated. An exposure to ammonia gas destroys the unexposed dye, and the picture can then be taken out into the light and examined. The process is now slow, but someone may speed it up, and it has no grain difficulties such as now keep photographic researchers busy. Often it would be advantageous to be able to snap the camera and to look at the picture immediately.",{"_32":11147,"_34":11148},[],{"_36":160,"_38":11149,"_40":11030,"_42":11150,"_67":11151,"_69":11152,"_71":70},"GYpDNHoP",{},[],"Another process now in use is also slow, and more or less clumsy. For fifty years impregnated papers have been used which turn dark at every point where an electrical contact touches them, by reason of the chemical change thus produced in an iodine compound included in the paper. They have been used to make records, for a pointer moving across them can leave a trail behind. If the electrical potential on the pointer is varied as it moves, the line becomes light or dark in accordance with the potential.",{"_32":11154,"_34":11155},[],{"_36":160,"_38":11156,"_40":11030,"_42":11157,"_67":11158,"_69":11159,"_71":70},"uhEJCqrR",{},[],"This scheme is now used in facsimile transmission. The pointer draws a set of closely spaced lines across the paper one after another. As it moves, its potential is varied in accordance with a varying current received over wires from a distant station, where these variations are produced by a photocell which is similarly scanning a picture. At every instant the darkness of the line being drawn is made equal to the darkness of the point on the picture being observed by the photocell. Thus, when the whole picture has been covered, a replica appears at the receiving end.",{"_32":11161,"_34":11162},[],{"_36":160,"_38":11163,"_40":11030,"_42":11164,"_67":11165,"_69":11166,"_71":70},"KtGcS1nr",{},[],"A scene itself can be just as well looked over line by line by the photocell in this way as can a photograph of the scene. This whole apparatus constitutes a camera, with the added feature, which can be dispensed with if desired, of making its picture at a distance. It is slow, and the picture is poor in detail. Still, it does give another process of dry photography, in which the picture is finished as soon as it is taken.",{"_32":11168,"_34":11169},[],{"_36":160,"_38":11170,"_40":11030,"_42":11171,"_67":11172,"_69":11173,"_71":70},"VomN4nAf",{},[],"It would be a brave man who would predict that such a process will always remain clumsy, slow, and faulty in detail. Television equipment today transmits sixteen reasonably good pictures a second, and it involves only two essential differences from the process described above. For one, the record is made by a moving beam of electrons rather than a moving pointer, for the reason that an electron beam can sweep across the picture very rapidly indeed. The other difference involves merely the use of a screen which glows momentarily when the electrons hit, rather than a chemically treated paper or film which is permanently altered. This speed is necessary in television, for motion pictures rather than stills are the object.",{"_32":11175,"_34":11176},[],{"_36":160,"_38":11177,"_40":11030,"_42":11178,"_67":11179,"_69":11180,"_71":70},"t1EgGQs2",{},[],"Use chemically treated film in place of the glowing screen, allow the apparatus to transmit one picture only rather than a succession, and a rapid camera for dry photography results. The treated film needs to be far faster in action than present examples, but it probably could be. More serious is the objection that this scheme would involve putting the film inside a vacuum chamber, for electron beams behave normally only in such a rarefied environment. This difficulty could be avoided by allowing the electron beam to play on one side of a partition, and by pressing the film against the other side, if this partition were such as to allow the electrons to go through perpendicular to its surface, and to prevent them from spreading out sideways. Such partitions, in crude form, could certainly be constructed, and they will hardly hold up the general development.",{"_32":11182,"_34":11183},[],{"_36":160,"_38":11184,"_40":11030,"_42":11185,"_67":11186,"_69":11187,"_71":70},"K1L6Vnfe",{},[],"Like dry photography, microphotography still has a long way to go. The basic scheme of reducing the size of the record, and examining it by projection rather than directly, has possibilities too great to be ignored. The combination of optical projection and photographic reduction is already producing some results in microfilm for scholarly purposes, and the potentialities are highly suggestive. Today, with microfilm, reductions by a linear factor of 20 can be employed and still produce full clarity when the material is re-enlarged for examination. The limits are set by the graininess of the film, the excellence of the optical system, and the efficiency of the light sources employed. All of these are rapidly improving.",{"_32":11189,"_34":11190},[],{"_36":160,"_38":11191,"_40":11030,"_42":11192,"_67":11193,"_69":11200,"_71":70},"tAiERhgM",{},[11194],{"_36":919,"_167":11195,"_169":11197,"_42":11199,"_71":70},[11196],288,[11198],311,{},"Assume a linear ratio of 100 for future use. Consider film of the same thickness as paper, although thinner film will certainly be usable. Even under these conditions there would be a total factor of 10,000 between the bulk of the ordinary record on books, and its microfilm replica. The Encyclopædia Britannica could be reduced to the volume of a matchbox. A library of a million volumes could be compressed into one end of a desk. If the human race has produced since the invention of movable type a total record, in the form of magazines, newspapers, books, tracts, advertising blurbs, correspondence, having a volume corresponding to a billion books, the whole affair, assembled and compressed, could be lugged off in a moving van. Mere compression, of course, is not enough; one needs not only to make and store a record but also be able to consult it, and this aspect of the matter comes later. Even the modern great library is not generally consulted; it is nibbled at by a few.",{"_32":11202,"_34":11203},[],{"_36":160,"_38":11204,"_40":11030,"_42":11205,"_67":11206,"_69":11213,"_71":70},"hhWzhvhy",{},[11207],{"_36":919,"_167":11208,"_169":11210,"_42":11212,"_71":70},[9541,11209],324,[6533,11211],334,{},"Compression is important, however, when it comes to costs. The material for the microfilm Britannica would cost a nickel, and it could be mailed anywhere for a cent. What would it cost to print a million copies? To print a sheet of newspaper, in a large edition, costs a small fraction of a cent. The entire material of the Britannica in reduced microfilm form would go on a sheet eight and one-half by eleven inches. Once it is available, with the photographic reproduction methods of the future, duplicates in large quantities could probably be turned out for a cent apiece beyond the cost of materials. The preparation of the original copy? That introduces the next aspect of the subject.",{"_36":870,"_38":11215,"_40":11030,"_42":11216,"_67":11217,"_69":11218,"_71":70},"_TGEPVNw",{"_273":323},[],"2",{"_32":11220,"_34":11298},[11221,11228,11235,11242,11249,11256,11263,11270,11277,11284,11291],{"_32":11222,"_34":11223},[],{"_36":160,"_38":11224,"_40":11030,"_42":11225,"_67":11226,"_69":11227,"_71":70},"mcSU_1Z4",{},[],"To make the record, we now push a pencil or tap a typewriter. Then comes the process of digestion and correction, followed by an intricate process of typesetting, printing, and distribution. To consider the first stage of the procedure, will the author of the future cease writing by hand or typewriter and talk directly to the record? He does so indirectly, by talking to a stenographer or a wax cylinder; but the elements are all present if he wishes to have his talk directly produce a typed record. All he needs to do is to take advantage of existing mechanisms and to alter his language.",{"_32":11229,"_34":11230},[],{"_36":160,"_38":11231,"_40":11030,"_42":11232,"_67":11233,"_69":11234,"_71":70},"e1OnZ5ys",{},[],"At a recent World Fair a machine called a Voder was shown. A girl stroked its keys and it emitted recognizable speech. No human vocal chords entered into the procedure at any point; the keys simply combined some electrically produced vibrations and passed these on to a loud-speaker. In the Bell Laboratories there is the converse of this machine, called a Vocoder. The loudspeaker is replaced by a microphone, which picks up sound. Speak to it, and the corresponding keys move. This may be one element of the postulated system.",{"_32":11236,"_34":11237},[],{"_36":160,"_38":11238,"_40":11030,"_42":11239,"_67":11240,"_69":11241,"_71":70},"3_IW5nwv",{},[],"The other element is found in the stenotype, that somewhat disconcerting device encountered usually at public meetings. A girl strokes its keys languidly and looks about the room and sometimes at the speaker with a disquieting gaze. From it emerges a typed strip which records in a phonetically simplified language a record of what the speaker is supposed to have said. Later this strip is retyped into ordinary language, for in its nascent form it is intelligible only to the initiated. Combine these two elements, let the Vocoder run the stenotype, and the result is a machine which types when talked to.",{"_32":11243,"_34":11244},[],{"_36":160,"_38":11245,"_40":11030,"_42":11246,"_67":11247,"_69":11248,"_71":70},"3APnJbW5",{},[],"Our present languages are not especially adapted to this sort of mechanization, it is true. It is strange that the inventors of universal languages have not seized upon the idea of producing one which better fitted the technique for transmitting and recording speech. Mechanization may yet force the issue, especially in the scientific field; whereupon scientific jargon would become still less intelligible to the layman.",{"_32":11250,"_34":11251},[],{"_36":160,"_38":11252,"_40":11030,"_42":11253,"_67":11254,"_69":11255,"_71":70},"vyT4Qh7J",{},[],"One can now picture a future investigator in his laboratory. His hands are free, and he is not anchored. As he moves about and observes, he photographs and comments. Time is automatically recorded to tie the two records together. If he goes into the field, he may be connected by radio to his recorder. As he ponders over his notes in the evening, he again talks his comments into the record. His typed record, as well as his photographs, may both be in miniature, so that he projects them for examination.",{"_32":11257,"_34":11258},[],{"_36":160,"_38":11259,"_40":11030,"_42":11260,"_67":11261,"_69":11262,"_71":70},"DjqvcW_2",{},[],"Much needs to occur, however, between the collection of data and observations, the extraction of parallel material from the existing record, and the final insertion of new material into the general body of the common record. For mature thought there is no mechanical substitute. But creative thought and essentially repetitive thought are very different things. For the latter there are, and may be, powerful mechanical aids.",{"_32":11264,"_34":11265},[],{"_36":160,"_38":11266,"_40":11030,"_42":11267,"_67":11268,"_69":11269,"_71":70},"BQYHdvom",{},[],"Adding a column of figures is a repetitive thought process, and it was long ago properly relegated to the machine. True, the machine is sometimes controlled by a keyboard, and thought of a sort enters in reading the figures and poking the corresponding keys, but even this is avoidable. Machines have been made which will read typed figures by photocells and then depress the corresponding keys; these are combinations of photocells for scanning the type, electric circuits for sorting the consequent variations, and relay circuits for interpreting the result into the action of solenoids to pull the keys down.",{"_32":11271,"_34":11272},[],{"_36":160,"_38":11273,"_40":11030,"_42":11274,"_67":11275,"_69":11276,"_71":70},"wfxQINaa",{},[],"All this complication is needed because of the clumsy way in which we have learned to write figures. If we recorded them positionally, simply by the configuration of a set of dots on a card, the automatic reading mechanism would become comparatively simple. In fact if the dots are holes, we have the punched-card machine long ago produced by Hollorith for the purposes of the census, and now used throughout business. Some types of complex businesses could hardly operate without these machines.",{"_32":11278,"_34":11279},[],{"_36":160,"_38":11280,"_40":11030,"_42":11281,"_67":11282,"_69":11283,"_71":70},"3rsmlV1G",{},[],"Adding is only one operation. To perform arithmetical computation involves also subtraction, multiplication, and division, and in addition some method for temporary storage of results, removal from storage for further manipulation, and recording of final results by printing. Machines for these purposes are now of two types: keyboard machines for accounting and the like, manually controlled for the insertion of data, and usually automatically controlled as far as the sequence of operations is concerned; and punched-card machines in which separate operations are usually delegated to a series of machines, and the cards then transferred bodily from one to another. Both forms are very useful; but as far as complex computations are concerned, both are still in embryo.",{"_32":11285,"_34":11286},[],{"_36":160,"_38":11287,"_40":11030,"_42":11288,"_67":11289,"_69":11290,"_71":70},"HAKoL0UH",{},[],"Rapid electrical counting appeared soon after the physicists found it desirable to count cosmic rays. For their own purposes the physicists promptly constructed thermionic-tube equipment capable of counting electrical impulses at the rate of 100,000 a second. The advanced arithmetical machines of the future will be electrical in nature, and they will perform at 100 times present speeds, or more.",{"_32":11292,"_34":11293},[],{"_36":160,"_38":11294,"_40":11030,"_42":11295,"_67":11296,"_69":11297,"_71":70},"UxBKYabq",{},[],"Moreover, they will be far more versatile than present commercial machines, so that they may readily be adapted for a wide variety of operations. They will be controlled by a control card or film, they will select their own data and manipulate it in accordance with the instructions thus inserted, they will perform complex arithmetical computations at exceedingly high speeds, and they will record results in such form as to be readily available for distribution or for later further manipulation. Such machines will have enormous appetites. One of them will take instructions and data from a whole roomful of girls armed with simple key board punches, and will deliver sheets of computed results every few minutes. There will always be plenty of things to compute in the detailed affairs of millions of people doing complicated things.",{"_36":870,"_38":11299,"_40":11030,"_42":11300,"_67":11301,"_69":11302,"_71":70},"Caz1YMi1",{"_273":323},[],"3",{"_32":11304,"_34":11340},[11305,11312,11319,11326,11333],{"_32":11306,"_34":11307},[],{"_36":160,"_38":11308,"_40":11030,"_42":11309,"_67":11310,"_69":11311,"_71":70},"X0LPMZba",{},[],"The repetitive processes of thought are not confined however, to matters of arithmetic and statistics. In fact, every time one combines and records facts in accordance with established logical processes, the creative aspect of thinking is concerned only with the selection of the data and the process to be employed and the manipulation thereafter is repetitive in nature and hence a fit matter to be relegated to the machine. Not so much has been done along these lines, beyond the bounds of arithmetic, as might be done, primarily because of the economics of the situation. The needs of business and the extensive market obviously waiting, assured the advent of mass-produced arithmetical machines just as soon as production methods were sufficiently advanced.",{"_32":11313,"_34":11314},[],{"_36":160,"_38":11315,"_40":11030,"_42":11316,"_67":11317,"_69":11318,"_71":70},"2eSzLikN",{},[],"With machines for advanced analysis no such situation existed; for there was and is no extensive market; the users of advanced methods of manipulating data are a very small part of the population. There are, however, machines for solving differential equations—and functional and integral equations, for that matter. There are many special machines, such as the harmonic synthesizer which predicts the tides. There will be many more, appearing certainly first in the hands of the scientist and in small numbers.",{"_32":11320,"_34":11321},[],{"_36":160,"_38":11322,"_40":11030,"_42":11323,"_67":11324,"_69":11325,"_71":70},"YpDlMGqW",{},[],"If scientific reasoning were limited to the logical processes of arithmetic, we should not get far in our understanding of the physical world. One might as well attempt to grasp the game of poker entirely by the use of the mathematics of probability. The abacus, with its beads strung on parallel wires, led the Arabs to positional numeration and the concept of zero many centuries before the rest of the world; and it was a useful tool—so useful that it still exists.",{"_32":11327,"_34":11328},[],{"_36":160,"_38":11329,"_40":11030,"_42":11330,"_67":11331,"_69":11332,"_71":70},"BmIiNLll",{},[],"It is a far cry from the abacus to the modern keyboard accounting machine. It will be an equal step to the arithmetical machine of the future. But even this new machine will not take the scientist where he needs to go. Relief must be secured from laborious detailed manipulation of higher mathematics as well, if the users of it are to free their brains for something more than repetitive detailed transformations in accordance with established rules. A mathematician is not a man who can readily manipulate figures; often he cannot. He is not even a man who can readily perform the transformations of equations by the use of calculus. He is primarily an individual who is skilled in the use of symbolic logic on a high plane, and especially he is a man of intuitive judgment in the choice of the manipulative processes he employs.",{"_32":11334,"_34":11335},[],{"_36":160,"_38":11336,"_40":11030,"_42":11337,"_67":11338,"_69":11339,"_71":70},"Fo67osVh",{},[],"All else he should be able to turn over to his mechanism, just as confidently as he turns over the propelling of his car to the intricate mechanism under the hood. Only then will mathematics be practically effective in bringing the growing knowledge of atomistics to the useful solution of the advanced problems of chemistry, metallurgy, and biology. For this reason there still come more machines to handle advanced mathematics for the scientist. Some of them will be sufficiently bizarre to suit the most fastidious connoisseur of the present artifacts of civilization.",{"_36":870,"_38":11341,"_40":11030,"_42":11342,"_67":11343,"_69":11344,"_71":70},"WoW7Eg8x",{"_273":323},[],"4",{"_32":11346,"_34":11417},[11347,11354,11361,11368,11375,11382,11389,11396,11403,11410],{"_32":11348,"_34":11349},[],{"_36":160,"_38":11350,"_40":11030,"_42":11351,"_67":11352,"_69":11353,"_71":70},"dbVFL4fA",{},[],"The scientist, however, is not the only person who manipulates data and examines the world about him by the use of logical processes, although he sometimes preserves this appearance by adopting into the fold anyone who becomes logical, much in the manner in which a British labor leader is elevated to knighthood. Whenever logical processes of thought are employed—that is, whenever thought for a time runs along an accepted groove—there is an opportunity for the machine. Formal logic used to be a keen instrument in the hands of the teacher in his trying of students' souls. It is readily possible to construct a machine which will manipulate premises in accordance with formal logic, simply by the clever use of relay circuits. Put a set of premises into such a device and turn the crank, and it will readily pass out conclusion after conclusion, all in accordance with logical law, and with no more slips than would be expected of a keyboard adding machine.",{"_32":11355,"_34":11356},[],{"_36":160,"_38":11357,"_40":11030,"_42":11358,"_67":11359,"_69":11360,"_71":70},"qI7bXze9",{},[],"Logic can become enormously difficult, and it would undoubtedly be well to produce more assurance in its use. The machines for higher analysis have usually been equation solvers. Ideas are beginning to appear for equation transformers, which will rearrange the relationship expressed by an equation in accordance with strict and rather advanced logic. Progress is inhibited by the exceedingly crude way in which mathematicians express their relationships. They employ a symbolism which grew like Topsy and has little consistency; a strange fact in that most logical field.",{"_32":11362,"_34":11363},[],{"_36":160,"_38":11364,"_40":11030,"_42":11365,"_67":11366,"_69":11367,"_71":70},"2DeyUdzh",{},[],"A new symbolism, probably positional, must apparently precede the reduction of mathematical transformations to machine processes. Then, on beyond the strict logic of the mathematician, lies the application of logic in everyday affairs. We may some day click off arguments on a machine with the same assurance that we now enter sales on a cash register. But the machine of logic will not look like a cash register, even of the streamlined model.",{"_32":11369,"_34":11370},[],{"_36":160,"_38":11371,"_40":11030,"_42":11372,"_67":11373,"_69":11374,"_71":70},"KBnJ0-B0",{},[],"So much for the manipulation of ideas and their insertion into the record. Thus far we seem to be worse off than before—for we can enormously extend the record; yet even in its present bulk we can hardly consult it. This is a much larger matter than merely the extraction of data for the purposes of scientific research; it involves the entire process by which man profits by his inheritance of acquired knowledge. The prime action of use is selection, and here we are halting indeed. There may be millions of fine thoughts, and the account of the experience on which they are based, all encased within stone walls of acceptable architectural form; but if the scholar can get at only one a week by diligent search, his syntheses are not likely to keep up with the current scene.",{"_32":11376,"_34":11377},[],{"_36":160,"_38":11378,"_40":11030,"_42":11379,"_67":11380,"_69":11381,"_71":70},"MYDxRxw5",{},[],"Selection, in this broad sense, is a stone adze in the hands of a cabinetmaker. Yet, in a narrow sense and in other areas, something has already been done mechanically on selection. The personnel officer of a factory drops a stack of a few thousand employee cards into a selecting machine, sets a code in accordance with an established convention, and produces in a short time a list of all employees who live in Trenton and know Spanish. Even such devices are much too slow when it comes, for example, to matching a set of fingerprints with one of five million on file. Selection devices of this sort will soon be speeded up from their present rate of reviewing data at a few hundred a minute. By the use of photocells and microfilm they will survey items at the rate of a thousand a second, and will print out duplicates of those selected.",{"_32":11383,"_34":11384},[],{"_36":160,"_38":11385,"_40":11030,"_42":11386,"_67":11387,"_69":11388,"_71":70},"7JIxh6TR",{},[],"This process, however, is simple selection: it proceeds by examining in turn every one of a large set of items, and by picking out those which have certain specified characteristics. There is another form of selection best illustrated by the automatic telephone exchange. You dial a number and the machine selects and connects just one of a million possible stations. It does not run over them all. It pays attention only to a class given by a first digit, then only to a subclass of this given by the second digit, and so on; and thus proceeds rapidly and almost unerringly to the selected station. It requires a few seconds to make the selection, although the process could be speeded up if increased speed were economically warranted. If necessary, it could be made extremely fast by substituting thermionic-tube switching for mechanical switching, so that the full selection could be made in one one-hundredth of a second. No one would wish to spend the money necessary to make this change in the telephone system, but the general idea is applicable elsewhere.",{"_32":11390,"_34":11391},[],{"_36":160,"_38":11392,"_40":11030,"_42":11393,"_67":11394,"_69":11395,"_71":70},"HSwtph6E",{},[],"Take the prosaic problem of the great department store. Every time a charge sale is made, there are a number of things to be done. The inventory needs to be revised, the salesman needs to be given credit for the sale, the general accounts need an entry, and, most important, the customer needs to be charged. A central records device has been developed in which much of this work is done conveniently. The salesman places on a stand the customer's identification card, his own card, and the card taken from the article sold—all punched cards. When he pulls a lever, contacts are made through the holes, machinery at a central point makes the necessary computations and entries, and the proper receipt is printed for the salesman to pass to the customer.",{"_32":11397,"_34":11398},[],{"_36":160,"_38":11399,"_40":11030,"_42":11400,"_67":11401,"_69":11402,"_71":70},"rDkc-rpW",{},[],"But there may be ten thousand charge customers doing business with the store, and before the full operation can be completed someone has to select the right card and insert it at the central office. Now rapid selection can slide just the proper card into position in an instant or two, and return it afterward. Another difficulty occurs, however. Someone must read a total on the card, so that the machine can add its computed item to it. Conceivably the cards might be of the dry photography type I have described. Existing totals could then be read by photocell, and the new total entered by an electron beam.",{"_32":11404,"_34":11405},[],{"_36":160,"_38":11406,"_40":11030,"_42":11407,"_67":11408,"_69":11409,"_71":70},"VnHx8GEY",{},[],"The cards may be in miniature, so that they occupy little space. They must move quickly. They need not be transferred far, but merely into position so that the photocell and recorder can operate on them. Positional dots can enter the data. At the end of the month a machine can readily be made to read these and to print an ordinary bill. With tube selection, in which no mechanical parts are involved in the switches, little time need be occupied in bringing the correct card into use—a second should suffice for the entire operation. The whole record on the card may be made by magnetic dots on a steel sheet if desired, instead of dots to be observed optically, following the scheme by which Poulsen long ago put speech on a magnetic wire. This method has the advantage of simplicity and ease of erasure. By using photography, however one can arrange to project the record in enlarged form and at a distance by using the process common in television equipment.",{"_32":11411,"_34":11412},[],{"_36":160,"_38":11413,"_40":11030,"_42":11414,"_67":11415,"_69":11416,"_71":70},"Bl9S1vY0",{},[],"One can consider rapid selection of this form, and distant projection for other purposes. To be able to key one sheet of a million before an operator in a second or two, with the possibility of then adding notes thereto, is suggestive in many ways. It might even be of use in libraries, but that is another story. At any rate, there are now some interesting combinations possible. One might, for example, speak to a microphone, in the manner described in connection with the speech controlled typewriter, and thus make his selections. It would certainly beat the usual file clerk.",{"_36":870,"_38":11418,"_40":11030,"_42":11419,"_67":11420,"_69":11421,"_71":70},"823Fb4_N",{"_273":323},[],"5",{"_32":11423,"_34":11487},[11424,11431,11438,11445,11452,11459,11466,11473,11480],{"_32":11425,"_34":11426},[],{"_36":160,"_38":11427,"_40":11030,"_42":11428,"_67":11429,"_69":11430,"_71":70},"-UV4qKcD",{},[],"The real heart of the matter of selection, however, goes deeper than a lag in the adoption of mechanisms by libraries, or a lack of development of devices for their use. Our ineptitude in getting at the record is largely caused by the artificiality of systems of indexing. When data of any sort are placed in storage, they are filed alphabetically or numerically, and information is found (when it is) by tracing it down from subclass to subclass. It can be in only one place, unless duplicates are used; one has to have rules as to which path will locate it, and the rules are cumbersome. Having found one item, moreover, one has to emerge from the system and re-enter on a new path.",{"_32":11432,"_34":11433},[],{"_36":160,"_38":11434,"_40":11030,"_42":11435,"_67":11436,"_69":11437,"_71":70},"BYXDVRVK",{},[],"The human mind does not work that way. It operates by association. With one item in its grasp, it snaps instantly to the next that is suggested by the association of thoughts, in accordance with some intricate web of trails carried by the cells of the brain. It has other characteristics, of course; trails that are not frequently followed are prone to fade, items are not fully permanent, memory is transitory. Yet the speed of action, the intricacy of trails, the detail of mental pictures, is awe-inspiring beyond all else in nature.",{"_32":11439,"_34":11440},[],{"_36":160,"_38":11441,"_40":11030,"_42":11442,"_67":11443,"_69":11444,"_71":70},"cwjOO8BP",{},[],"Man cannot hope fully to duplicate this mental process artificially, but he certainly ought to be able to learn from it. In minor ways he may even improve, for his records have relative permanency. The first idea, however, to be drawn from the analogy concerns selection. Selection by association, rather than indexing, may yet be mechanized. One cannot hope thus to equal the speed and flexibility with which the mind follows an associative trail, but it should be possible to beat the mind decisively in regard to the permanence and clarity of the items resurrected from storage.",{"_32":11446,"_34":11447},[],{"_36":160,"_38":11448,"_40":11030,"_42":11449,"_67":11450,"_69":11451,"_71":70},"AqGRgRAh",{},[],"Consider a future device for individual use, which is a sort of mechanized private file and library. It needs a name, and, to coin one at random, “memex” will do. A memex is a device in which an individual stores all his books, records, and communications, and which is mechanized so that it may be consulted with exceeding speed and flexibility. It is an enlarged intimate supplement to his memory.",{"_32":11453,"_34":11454},[],{"_36":160,"_38":11455,"_40":11030,"_42":11456,"_67":11457,"_69":11458,"_71":70},"TfWCAxXp",{},[],"It consists of a desk, and while it can presumably be operated from a distance, it is primarily the piece of furniture at which he works. On the top are slanting translucent screens, on which material can be projected for convenient reading. There is a keyboard, and sets of buttons and levers. Otherwise it looks like an ordinary desk.",{"_32":11460,"_34":11461},[],{"_36":160,"_38":11462,"_40":11030,"_42":11463,"_67":11464,"_69":11465,"_71":70},"Ji-nrzmR",{},[],"In one end is the stored material. The matter of bulk is well taken care of by improved microfilm. Only a small part of the interior of the memex is devoted to storage, the rest to mechanism. Yet if the user inserted 5000 pages of material a day it would take him hundreds of years to fill the repository, so he can be profligate and enter material freely.",{"_32":11467,"_34":11468},[],{"_36":160,"_38":11469,"_40":11030,"_42":11470,"_67":11471,"_69":11472,"_71":70},"jYxXQch-",{},[],"Most of the memex contents are purchased on microfilm ready for insertion. Books of all sorts, pictures, current periodicals, newspapers, are thus obtained and dropped into place. Business correspondence takes the same path. And there is provision for direct entry. On the top of the memex is a transparent platen. On this are placed longhand notes, photographs, memoranda, all sorts of things. When one is in place, the depression of a lever causes it to be photographed onto the next blank space in a section of the memex film, dry photography being employed.",{"_32":11474,"_34":11475},[],{"_36":160,"_38":11476,"_40":11030,"_42":11477,"_67":11478,"_69":11479,"_71":70},"3lraYLjj",{},[],"There is, of course, provision for consultation of the record by the usual scheme of indexing. If the user wishes to consult a certain book, he taps its code on the keyboard, and the title page of the book promptly appears before him, projected onto one of his viewing positions. Frequently-used codes are mnemonic, so that he seldom consults his code book; but when he does, a single tap of a key projects it for his use. Moreover, he has supplemental levers. On deflecting one of these levers to the right he runs through the book before him, each page in turn being projected at a speed which just allows a recognizing glance at each. If he deflects it further to the right, he steps through the book 10 pages at a time; still further at 100 pages at a time. Deflection to the left gives him the same control backwards.",{"_32":11481,"_34":11482},[],{"_36":160,"_38":11483,"_40":11030,"_42":11484,"_67":11485,"_69":11486,"_71":70},"EN57UWfJ",{},[],"A special button transfers him immediately to the first page of the index. Any given book of his library can thus be called up and consulted with far greater facility than if it were taken from a shelf. As he has several projection positions, he can leave one item in position while he calls up another. He can add marginal notes and comments, taking advantage of one possible type of dry photography, and it could even be arranged so that he can do this by a stylus scheme, such as is now employed in the telautograph seen in railroad waiting rooms, just as though he had the physical page before him.",{"_36":870,"_38":11488,"_40":11030,"_42":11489,"_67":11490,"_69":11491,"_71":70},"hE72EiW7",{"_273":323},[],"6",{"_32":11493,"_34":11529},[11494,11501,11508,11515,11522],{"_32":11495,"_34":11496},[],{"_36":160,"_38":11497,"_40":11030,"_42":11498,"_67":11499,"_69":11500,"_71":70},"TlXiaXp1",{},[],"All this is conventional, except for the projection forward of present-day mechanisms and gadgetry. It affords an immediate step, however, to associative indexing, the basic idea of which is a provision whereby any item may be caused at will to select immediately and automatically another. This is the essential feature of the memex. The process of tying two items together is the important thing.",{"_32":11502,"_34":11503},[],{"_36":160,"_38":11504,"_40":11030,"_42":11505,"_67":11506,"_69":11507,"_71":70},"h2eYi2q9",{},[],"When the user is building a trail, he names it, inserts the name in his code book, and taps it out on his keyboard. Before him are the two items to be joined, projected onto adjacent viewing positions. At the bottom of each there are a number of blank code spaces, and a pointer is set to indicate one of these on each item. The user taps a single key, and the items are permanently joined. In each code space appears the code word. Out of view, but also in the code space, is inserted a set of dots for photocell viewing; and on each item these dots by their positions designate the index number of the other item.",{"_32":11509,"_34":11510},[],{"_36":160,"_38":11511,"_40":11030,"_42":11512,"_67":11513,"_69":11514,"_71":70},"rkpILk1-",{},[],"Thereafter, at any time, when one of these items is in view, the other can be instantly recalled merely by tapping a button below the corresponding code space. Moreover, when numerous items have been thus joined together to form a trail, they can be reviewed in turn, rapidly or slowly, by deflecting a lever like that used for turning the pages of a book. It is exactly as though the physical items had been gathered together from widely separated sources and bound together to form a new book. It is more than this, for any item can be joined into numerous trails.",{"_32":11516,"_34":11517},[],{"_36":160,"_38":11518,"_40":11030,"_42":11519,"_67":11520,"_69":11521,"_71":70},"K-wqZnlN",{},[],"The owner of the memex, let us say, is interested in the origin and properties of the bow and arrow. Specifically he is studying why the short Turkish bow was apparently superior to the English long bow in the skirmishes of the Crusades. He has dozens of possibly pertinent books and articles in his memex. First he runs through an encyclopedia, finds an interesting but sketchy article, leaves it projected. Next, in a history, he finds another pertinent item, and ties the two together. Thus he goes, building a trail of many items. Occasionally he inserts a comment of his own, either linking it into the main trail or joining it by a side trail to a particular item. When it becomes evident that the elastic properties of available materials had a great deal to do with the bow, he branches off on a side trail which takes him through textbooks on elasticity and tables of physical constants. He inserts a page of longhand analysis of his own. Thus he builds a trail of his interest through the maze of materials available to him.",{"_32":11523,"_34":11524},[],{"_36":160,"_38":11525,"_40":11030,"_42":11526,"_67":11527,"_69":11528,"_71":70},"DAwmGiOq",{},[],"And his trails do not fade. Several years later, his talk with a friend turns to the queer ways in which a people resist innovations, even of vital interest. He has an example, in the fact that the outraged Europeans still failed to adopt the Turkish bow. In fact he has a trail on it. A touch brings up the code book. Tapping a few keys projects the head of the trail. A lever runs through it at will, stopping at interesting items, going off on side excursions. It is an interesting trail, pertinent to the discussion. So he sets a reproducer in action, photographs the whole trail out, and passes it to his friend for insertion in his own memex, there to be linked into the more general trail.",{"_36":870,"_38":11530,"_40":11030,"_42":11531,"_67":11532,"_69":11533,"_71":70},"p1OJYYyQ",{"_273":323},[],"7",{"_32":11535,"_34":11606},[11536,11543,11550,11557,11564,11571,11578,11585,11592,11599],{"_32":11537,"_34":11538},[],{"_36":160,"_38":11539,"_40":11030,"_42":11540,"_67":11541,"_69":11542,"_71":70},"aJ5f5jF5",{},[],"Wholly new forms of encyclopedias will appear, ready made with a mesh of associative trails running through them, ready to be dropped into the memex and there amplified. The lawyer has at his touch the associated opinions and decisions of his whole experience, and of the experience of friends and authorities. The patent attorney has on call the millions of issued patents, with familiar trails to every point of his client’s interest. The physician, puzzled by a patient’s reactions, strikes the trail established in studying an earlier similar case, and runs rapidly through analogous case histories, with side references to the classics for the pertinent anatomy and histology. The chemist, struggling with the synthesis of an organic compound, has all the chemical literature before him in his laboratory, with trails following the analogies of compounds, and side trails to their physical and chemical behavior.",{"_32":11544,"_34":11545},[],{"_36":160,"_38":11546,"_40":11030,"_42":11547,"_67":11548,"_69":11549,"_71":70},"CrI3YWur",{},[],"The historian, with a vast chronological account of a people, parallels it with a skip trail which stops only on the salient items, and can follow at any time contemporary trails which lead him all over civilization at a particular epoch. There is a new profession of trail blazers, those who find delight in the task of establishing useful trails through the enormous mass of the common record. The inheritance from the master becomes, not only his additions to the world's record, but for his disciples the entire scaffolding by which they were erected.",{"_32":11551,"_34":11552},[],{"_36":160,"_38":11553,"_40":11030,"_42":11554,"_67":11555,"_69":11556,"_71":70},"U_9LaT7O",{},[],"Thus science may implement the ways in which man produces, stores, and consults the record of the race. It might be striking to outline the instrumentalities of the future more spectacularly, rather than to stick closely to methods and elements now known and undergoing rapid development, as has been done here. Technical difficulties of all sorts have been ignored, certainly, but also ignored are means as yet unknown which may come any day to accelerate technical progress as violently as did the advent of the thermionic tube. In order that the picture may not be too commonplace, by reason of sticking to present-day patterns, it may be well to mention one such possibility, not to prophesy but merely to suggest, for prophecy based on extension of the known has substance, while prophecy founded on the unknown is only a doubly involved guess.",{"_32":11558,"_34":11559},[],{"_36":160,"_38":11560,"_40":11030,"_42":11561,"_67":11562,"_69":11563,"_71":70},"rbCVLzDH",{},[],"All our steps in creating or absorbing material of the record proceed through one of the senses—the tactile when we touch keys, the oral when we speak or listen, the visual when we read. Is it not possible that some day the path may be established more directly?",{"_32":11565,"_34":11566},[],{"_36":160,"_38":11567,"_40":11030,"_42":11568,"_67":11569,"_69":11570,"_71":70},"tUjyp4qQ",{},[],"We know that when the eye sees, all the consequent information is transmitted to the brain by means of electrical vibrations in the channel of the optic nerve. This is an exact analogy with the electrical vibrations which occur in the cable of a television set: they convey the picture from the photocells which see it to the radio transmitter from which it is broadcast. We know further that if we can approach that cable with the proper instruments, we do not need to touch it; we can pick up those vibrations by electrical induction and thus discover and reproduce the scene which is being transmitted, just as a telephone wire may be tapped for its message.",{"_32":11572,"_34":11573},[],{"_36":160,"_38":11574,"_40":11030,"_42":11575,"_67":11576,"_69":11577,"_71":70},"tRsbCa9_",{},[],"The impulses which flow in the arm nerves of a typist convey to her fingers the translated information which reaches her eye or ear, in order that the fingers may be caused to strike the proper keys. Might not these currents be intercepted, either in the original form in which information is conveyed to the brain, or in the marvelously metamorphosed form in which they then proceed to the hand?",{"_32":11579,"_34":11580},[],{"_36":160,"_38":11581,"_40":11030,"_42":11582,"_67":11583,"_69":11584,"_71":70},"-RUSQJGe",{},[],"By bone conduction we already introduce sounds: into the nerve channels of the deaf in order that they may hear. Is it not possible that we may learn to introduce them without the present cumbersomeness of first transforming electrical vibrations to mechanical ones, which the human mechanism promptly transforms back to the electrical form? With a couple of electrodes on the skull the encephalograph now produces pen-and-ink traces which bear some relation to the electrical phenomena going on in the brain itself. True, the record is unintelligible, except as it points out certain gross misfunctioning of the cerebral mechanism; but who would now place bounds on where such a thing may lead?",{"_32":11586,"_34":11587},[],{"_36":160,"_38":11588,"_40":11030,"_42":11589,"_67":11590,"_69":11591,"_71":70},"DOt3yVEX",{},[],"In the outside world, all forms of intelligence whether of sound or sight, have been reduced to the form of varying currents in an electric circuit in order that they may be transmitted. Inside the human frame exactly the same sort of process occurs. Must we always transform to mechanical movements in order to proceed from one electrical phenomenon to another? It is a suggestive thought, but it hardly warrants prediction without losing touch with reality and immediateness.",{"_32":11593,"_34":11594},[],{"_36":160,"_38":11595,"_40":11030,"_42":11596,"_67":11597,"_69":11598,"_71":70},"O9yaYqlH",{},[],"Presumably man’s spirit should be elevated if he can better review his shady past and analyze more completely and objectively his present problems. He has built a civilization so complex that he needs to mechanize his records more fully if he is to push his experiment to its logical conclusion and not merely become bogged down part way there by overtaxing his limited memory. His excursions may be more enjoyable if he can reacquire the privilege of forgetting the manifold things he does not need to have immediately at hand, with some assurance that he can find them again if they prove important.",{"_32":11600,"_34":11601},[],{"_36":160,"_38":11602,"_40":11030,"_42":11603,"_67":11604,"_69":11605,"_71":70},"xlkEDzl2",{},[],"The applications of science have built man a well-supplied house, and are teaching him to live healthily therein. They have enabled him to throw masses of people against one another with cruel weapons. They may yet allow him truly to encompass the great record and to grow in the wisdom of race experience. He may perish in conflict before he learns to wield that record for his true good. Yet, in the application of science to the needs and desires of man, it would seem to be a singularly unfortunate stage at which to terminate the process, or to lose hope as to the outcome.",{"_36":870,"_38":11607,"_40":11030,"_42":11608,"_67":11609,"_69":11610,"_71":70},"08ZdhY57",{"_273":323},[],"8",[279],"/records/as-we-may-think","2025-04-02T15:47:27.962Z",{"_83":736,"_285":737,"_738":63},{},{"_38":715,"_95":54,"_55":11617,"_72":718,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,717],1773151562813,[149,715,718,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/as-we-may-think\",\"bafy2bzacec3kkhk7fwcoj2r3igjlqws2osakiwpnxyimlpsnklxrxwtyn6bpu\",true]",{"_110":11622,"_147":12379,"_150":12380},{"_112":11623,"_131":132,"_133":12378,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":11624,"_38":12376},{"_29":11625,"_72":744,"_73":54,"_74":12372,"_55":12373,"_77":751,"_79":751,"_81":12374,"_85":12375,"_87":744,"_89":90},[11626,11637,11648,11657,11668,11694,11732,11764,11825,11916,12061,12129,12157,12185,12206,12226],{"_32":11627,"_34":11628},[],{"_36":160,"_38":11629,"_40":744,"_42":11630,"_67":11631,"_69":11636,"_71":70},"XhasNcRw",{},[11632],{"_36":166,"_167":11633,"_169":11634,"_42":11635,"_71":70},[137,7309,987,1000],[6448,1573,2416,6475],{},"Andrew M. Fountain, Wendy Hall, Ian Heath, and Hugh C. Davis",{"_32":11638,"_34":11639},[],{"_36":160,"_38":11640,"_40":744,"_42":11641,"_67":11642,"_69":11647,"_71":70},"uhPy138g",{},[11643],{"_36":919,"_167":11644,"_169":11645,"_42":11646,"_71":70},[137],[3409],{},"Department of Electronics and Computer Science University of Southampton Southampton SO95NH",{"_32":11649,"_34":11650},[],{"_36":8525,"_38":11651,"_40":744,"_42":11652,"_67":11655,"_69":70,"_71":11656},"_lUdRhiX",{"_8528":11653,"_83":11654},582465,"298-311_Fountain.pdf",[],"ipfs://bafybeiaajxfk7wgbxs7ax2wikm32bz7h4filzpiun5wbxueydhioosfdkm",{"_32":11658,"_34":11659},[],{"_36":160,"_38":11660,"_40":744,"_42":11661,"_67":11662,"_69":11667,"_71":70},"kisyDkpB",{},[11663],{"_36":166,"_167":11664,"_169":11665,"_42":11666,"_71":70},[137],[240],{},"ABSTRACT: There are currently a number of commercially available hypertext and hypermedia systems, of varying levels of sophistication and usability, but there are still many problems to be resolved in the design of such systems. In this paper, we itemise some of the major problems that we have identified as possibly causing a barrier to the growth and development of hypermedia applications outside the research community. A model of an open hypermedia architecture with dynamic linking features is proposed that moves some way to resolving these problems, and the first implementation of the system, Microcosm, is presented and discussed.",{"_32":11669,"_34":11670},[],{"_36":160,"_38":11671,"_40":744,"_42":11672,"_67":11673,"_69":11693,"_71":70},"o_PfuGMM",{},[11674,11678,11683,11688],{"_36":166,"_167":11675,"_169":11676,"_42":11677,"_71":70},[137],[240],{},{"_36":204,"_167":11679,"_169":11680,"_42":11681,"_71":11682},[6982],[7309],{},"hm://d/P8AJ4RvURPbDMQKyTsgWCo?v=bafy2bzacebjgt6zf7xm4uxy6e7aq6jnqme44zrcm57ukhapcz2f5dw3szgydy",{"_36":204,"_167":11684,"_169":11685,"_42":11686,"_71":11687},[1011],[3476],{},"hm://d/5yKBJKR5baKz6ZL5LumwPX?v=bafy2bzacebjhoib5lu33ljxcqj3f222j6jj5ujzx24btgkhoxioditxljaclc",{"_36":204,"_167":11689,"_169":11690,"_42":11691,"_71":11692},[2261],[9489],{},"hm://d/EgtvG7xCvqmdaKMDCsCSy8?v=bafy2bzaceakrdbigvs2qbh32w7hwi3c6hbgv6el3umq5jek7aub4c2g6ynoao","KEYWORDS: #hypertext, #multimedia, #dynamic linking",{"_32":11695,"_34":11727},[11696,11703,11720],{"_32":11697,"_34":11698},[],{"_36":160,"_38":11699,"_40":744,"_42":11700,"_67":11701,"_69":11702,"_71":70},"NnRF5d0l",{},[],"The terms hypertext and hypermedia are now so well known that definitions are unnecessary. Advances in computer power and performance have permitted the visionary concepts put forward by Bush [1945], Engelbart [1963] and Nelson [1967] to become a practical reality and we are now in a position to explore the implications, both positive and negative, of using hypertext systems for the management of information. The need for us to be able to control and utilise the phenomenal amounts of information that will be available to us through advances in technology, is the driving force behind the rapid pace of developments in hypertext and hypermedia systems. Much of the textual information that is available in the world today is stored or originally created in electronic format can be revised, edited and distributed easily as text files in a computer system. When we add to this the potential afforded by developments in optical disc technology for the storage of vast amounts of information from different media, we see the dawning of a new age of information processing.",{"_32":11704,"_34":11705},[],{"_36":160,"_38":11706,"_40":744,"_42":11707,"_67":11708,"_69":11719,"_71":70},"9rQ7cSUm",{},[11709],{"_36":919,"_167":11710,"_169":11714,"_42":11718,"_71":70},[956,11711,11712,11713],672,699,726,[6051,11715,11716,11717],678,705,732,{},"Traditional ways of presenting and distributing information in a linear fashion are no longer sufficient, and conventional database technology does not permit the wide range of functions required to fully exploit the potential of the new multimedia information systems. Neither of these strategies will become redundant but new systems must be developed that combine support for structured text, the handling of large volumes of data, the ability to mix media, and the freedom for the reader to switch seamlessly between the mixed media documents in the system [Rahtz et al. 1989a]. Hypertext and hypermedia techniques seem to offer much potential in this context ([Rahtz et al. 1989], [Yankelovich et al. 1988], [Shneiderman et al. 1989), but whilst providing solutions to many information processing problems, they naturally give rise to further sets of usability problems that have yet to be resolved ([Halasz 1988], [Nielsen 1990a]).",{"_32":11721,"_34":11722},[],{"_36":160,"_38":11723,"_40":744,"_42":11724,"_67":11725,"_69":11726,"_71":70},"pF2EWBai",{},[],"The use of hypertext and hypermedia systems is still largely confined to the research community. This is partly because of the limitations of commercially available systems and partly because of the tremendous effort required to create and maintain a hypertext system. These issues are compounded by the fact that currently available hypertext packages are basically closed systems, so that if material is created in one system it is very difficult to integrate it with material created in another system. We believe that this is a major barrier to the growth and development of hypertext and hypermedia applications outside the research community. This paper describes the design and implementation of a dynamic model of hypermedia that moves some way towards resolving these problems.",{"_36":870,"_38":11728,"_40":744,"_42":11729,"_67":11730,"_69":11731,"_71":70},"Jow66E4S",{"_273":323},[],"1 Introduction",{"_32":11733,"_34":11759},[11734,11741,11748],{"_32":11735,"_34":11736},[],{"_36":160,"_38":11737,"_40":744,"_42":11738,"_67":11739,"_69":11740,"_71":70},"Vu5aXi7E",{},[],"Nielsen's new book [Nielsen 1990b] gives a very full account of the nature of hypertext and hypermedia and describes the major systems that are currendy available. The two most widely used, certainly in the U.K., are Apple's HyperCard and OWL's Guide. It is a debatable point whether HyperCard can actually be described as a hypertext system. Its strength is in its rapid prototyping capabilities and it can certainly be used to simulate a hypertext environment through the means of its scripting language, HyperTalk. On the other hand, Guide developed from a research base at the University of Kent [Brown 1986], and was designed as a tool for reading documents on a computer. Guide has many well-defined and well-designed hypertext features which make it very easy to use. Version 2 of Guide had only limited extensibility but version 3, which has recently been released, incorporates a full scripting language.",{"_32":11742,"_34":11743},[],{"_36":160,"_38":11744,"_40":744,"_42":11745,"_67":11746,"_69":11747,"_71":70},"D7YX0WcL",{},[],"Both Guide and HyperCard have become successful commercially because they are easy to use and are readily available on the most widely used personal computer workstations, namely the IBM pc (or compatibles) and the Apple Macintosh. HyperCard is of course only available for the Macintosh range of computers but Apple's marketing ploy of giving a copy of HyperCard away free with every Macintosh has served to make HyperCard phenomenally successful as an application development environment. It is also possible to extend both Guide and HyperCard to incorporate multimedia information (such as image, sound and video) so that they can be classified as hypermedia systems. However, neither system provides a means for cataloguing or manipulating information about links independently from the documents in which they are activated. This means it is very difficult to provide summary information about links for maintaining, updating and enhancing the system, or to provide graphical browsing facilities and other sophisticated navigation tools. Guide overcomes navigation problems by controlling the types of buttons that the author can use and by emphasising the use of 'replacement' buttons in a scrolling text. However, HyperCard encourages a 'goto' approach to the creation of button and links and its very flexibility can be its downfall as far as controlling the development of the application is concerned.",{"_32":11749,"_34":11750},[],{"_36":160,"_38":11751,"_40":744,"_42":11752,"_67":11753,"_69":11758,"_71":70},"iSJK1YVZ",{},[11754],{"_36":919,"_167":11755,"_169":11756,"_42":11757,"_71":70},[1508],[185],{},"Other well-known hypertext systems, such as Intermedia [Yankelovich et al. 1988], Notecards [Halasz 1988] and Hyperties [Shneiderman 1987], have also developed out of large research projects and contain many highly sophisticated and well-researched hypertext features and navigation tools. They all embody the concept of a database of nodes and links but with very different models of design. The Intermedia project at Brown University is probably the most well- known and most often referenced hypertext research project. It was designed for educational use at the university level and has been used to teach several courses in subjects such as biology and English literature. Hyperties is well-known as the system in which the hypertext version of the July'88 issue of the CACM was issued, and for the computer-based version of the book Hypertext Hands On [Shneiderman & Kearsley 1989]. It is available for the IBM pc and has been used extensively for museum applications [Shneiderman *et al. *1989]. Intermedia and Notecards both require high-powered Unix workstations and this may limit their use outside of the research environment in the immediate future.",{"_36":870,"_38":11760,"_40":744,"_42":11761,"_67":11762,"_69":11763,"_71":70},"uzofeeFl",{"_273":323},[],"2 Current Hypermedia Systems",{"_32":11765,"_34":11820},[11766,11773,11784,11795,11806,11813],{"_32":11767,"_34":11768},[],{"_36":160,"_38":11769,"_40":744,"_42":11770,"_67":11771,"_69":11772,"_71":70},"MduvnlBF",{},[],"We consider that there are four problems common to many current hypertext systems, which act as possible barriers to the creation, extension and integration of hypertext document systems.",{"_32":11774,"_34":11775},[],{"_36":160,"_38":11776,"_40":744,"_42":11777,"_67":11778,"_69":11783,"_71":70},"8M9w4xkw",{},[11779],{"_36":919,"_167":11780,"_169":11781,"_42":11782,"_71":70},[137],[3363],{},"Authoring effort required. The large effort required to insert links into documents is seen as one of the main limitations of hypertext systems. Documents are becoming available in computer readable form far faster than they can be converted to hypertext. The user of a hypertext system may often feel frustration that they are limited to the documents that have been painstakingly converted to run under their system.",{"_32":11785,"_34":11786},[],{"_36":160,"_38":11787,"_40":744,"_42":11788,"_67":11789,"_69":11794,"_71":70},"PVZuuQS9",{},[11790],{"_36":919,"_167":11791,"_169":11792,"_42":11793,"_71":70},[137],[3407],{},"Hypertext systems are closed. Hypertext systems are usually run as stand alone programs and will not communicate bi-directionally with other software packages. Often it is possible to add drivers to extend the system, but these connections are not usually bi-directional in the sense that external programs can access the hypertext linking mechanisms. It is seen as important to be able to integrate a hypertext system into the user's whole environment and this requires an open system. When multimedia documents are used, it is often necessary to add support for extra video/graphics formats. A system that has been designed to be open can provide for this sort of extensibility.",{"_32":11796,"_34":11797},[],{"_36":160,"_38":11798,"_40":744,"_42":11799,"_67":11800,"_69":11805,"_71":70},"scWgQgWd",{},[11801],{"_36":919,"_167":11802,"_169":11803,"_42":11804,"_71":70},[137],[3407],{},"Proprietary document formats. In general it is not possible to take documents produced in one system (e.g. Guide) and use them in another (e.g. Hypercard). Document formats are sometimes closely guarded secrets. This exacerbates the authoring problem above, and makes it difficult to write conversion programs from one format into another.",{"_32":11807,"_34":11808},[],{"_36":160,"_38":11809,"_40":744,"_42":11810,"_67":11811,"_69":11812,"_71":70},"mqBgd_hm",{},[],"*Problems with read-only media. *Many hypertext systems implement links by means of tags and pointers embedded in documents. With CD-ROMs and networked files it is not possible to freely add links into documents. Although hypertext CD-ROMs are available, the links are hard-coded into the documents and cannot be added to or changed on the medium itself. We believe that it is vital for the users of hypertext systems to be able to add their own links and annotations.",{"_32":11814,"_34":11815},[],{"_36":160,"_38":11816,"_40":744,"_42":11817,"_67":11818,"_69":11819,"_71":70},"FlPgRU7L",{},[],"Clearly, some hypertext systems partly solve these problems, for example Intermedia keeps link information separate from the documents themselves, but we have attempted to design a new system that solves them all by providing an open model for hypertext/hypermedia with dynamic linking capabilities. The first instantiation of this new system is called Microcosm.",{"_36":870,"_38":11821,"_40":744,"_42":11822,"_67":11823,"_69":11824,"_71":70},"3dMQtrbn",{"_273":323},[],"3 Problems with Current Systems",{"_32":11826,"_34":11911},[11827,11834,11841,11852,11863,11875,11882,11889,11896,11903],{"_32":11828,"_34":11829},[],{"_36":160,"_38":11830,"_40":744,"_42":11831,"_67":11832,"_69":11833,"_71":70},"Alh3AHFG",{},[],"Microcosm has been designed with a set of guiding principles. Each design decision was made by evaluating the alternatives against this set of principles:",{"_32":11835,"_34":11836},[],{"_36":160,"_38":11837,"_40":744,"_42":11838,"_67":11839,"_69":11840,"_71":70},"X8FnIu02",{},[],"*No ultimate distinction between author and user: *All users should be in a position to add linking information to the system. The task of having to structure knowledge by adding links can be an effective learning experience and does not belong only to the teacher domain.",{"_32":11842,"_34":11843},[],{"_36":160,"_38":11844,"_40":744,"_42":11845,"_67":11846,"_69":11851,"_71":70},"t6qtkOue",{},[11847],{"_36":919,"_167":11848,"_169":11849,"_42":11850,"_71":70},[137],[1539],{},"Loosely coupled system with a low level of interdependency: Microcosm is not just one program, it is a set of communicating tasks, open in structure. It should be possible to couple any other program into the system.",{"_32":11853,"_34":11854},[],{"_36":160,"_38":11855,"_40":744,"_42":11856,"_67":11857,"_69":11862,"_71":70},"2tJwvp4F",{},[11858],{"_36":919,"_167":11859,"_169":11860,"_42":11861,"_71":70},[137],[1783],{},"Modular to allow for slot-in experimental replacements. Microcosm is intended to be the workbench for a research environment. Every element, such as the linker, the document viewers, etc. must be replaceable. The system must be configurable and flexible so it may be used for investigating different ideas.",{"_32":11864,"_34":11865},[],{"_36":160,"_38":11866,"_40":744,"_42":11867,"_67":11868,"_69":11874,"_71":70},"CYcLBOs4",{},[11869],{"_36":919,"_167":11870,"_169":11871,"_42":11873,"_71":70},[137],[11872],38,{},"Separation of links from data objects: Information about relationships between documents is separated from the documents themselves, and is abstracted to a higher level. There are two worlds of information: the world of raw information: resource bases of text, graphics, video and sound; and the world of relationships and links between ideas, words, phrases, images and documents. Microcosm aims to keep these separate.",{"_32":11876,"_34":11877},[],{"_36":160,"_38":11878,"_40":744,"_42":11879,"_67":11880,"_69":11881,"_71":70},"PAni92Q3",{},[],"Document, Viewers",{"_32":11883,"_34":11884},[],{"_36":160,"_38":11885,"_40":744,"_42":11886,"_67":11887,"_69":11888,"_71":70},"G9JBMT0M",{},[],"External Windows Application",{"_32":11890,"_34":11891},[],{"_36":160,"_38":11892,"_40":744,"_42":11893,"_67":11894,"_69":11895,"_71":70},"e6oSI4sj",{},[],"External DOS - Application",{"_32":11897,"_34":11898},[],{"_36":160,"_38":11899,"_40":744,"_42":11900,"_67":11901,"_69":11902,"_71":70},"S2YqR81f",{},[],"Document Control System",{"_32":11904,"_34":11905},[],{"_36":1875,"_38":11906,"_40":744,"_42":11907,"_67":11908,"_69":11909,"_71":11910},"2Fl1gbfU",{},[],"Figure 1: Microcosm Tasks","ipfs://bafkreieuf6gimgzpw3p3txjofux4e6uf7uhjuj5a2o7hxsa4mgvyjufkha",{"_36":870,"_38":11912,"_40":744,"_42":11913,"_67":11914,"_69":11915,"_71":70},"nHRfE2hD",{"_273":323},[],"4 Principles",{"_32":11917,"_34":12056},[11918,11944,11984],{"_32":11919,"_34":11935},[11920],{"_32":11921,"_34":11922},[],{"_36":160,"_38":11923,"_40":744,"_42":11924,"_67":11925,"_69":11934,"_71":70},"zTvUzCuZ",{},[11926],{"_36":919,"_167":11927,"_169":11930,"_42":11933,"_71":70},[6475,11928,11929],242,876,[7128,11931,11932],258,897,{},"In a Microcosm session, at least two tasks are running. The Document Control System opens documents routes messages and supports links. Most of the time it is not visible to the user except as an icon at the bottom of the screen. One or more Document Viewers are used to display document on the screen. One viewer is running for each document visible. Different viewers are used for different types of document or medium. Currently there are viewers for text (plain ASCII), monochrome and colour bit-mapped graphics, vector graphics, animated graphics, CD sound, and still or moving video from a video disk. There may be a mix of viewers on the screen at the same time and the software imposes no limit in practice to the number running. Document viewers communicate by means of messages, and all messages are routed through the Document Control System. A third type of task, External Applications may also be running. These are applications which are not part of the Microcosm system but can be linked in by the Document Control System. For example, a spreadsheet can be used for graphing figures, or information can be extracted from a database, or from another hypertext system.",{"_36":870,"_38":11936,"_40":744,"_42":11937,"_67":11938,"_69":11943,"_71":70},"46jxSdky",{"_273":323},[11939],{"_36":919,"_167":11940,"_169":11941,"_42":11942,"_71":70},[137],[985],{},"5.1 Microcosm Tasks",{"_32":11945,"_34":11975},[11946,11960,11968],{"_32":11947,"_34":11948},[],{"_36":160,"_38":11949,"_40":744,"_42":11950,"_67":11951,"_69":11959,"_71":70},"Y8GjrY7D",{},[11952],{"_36":919,"_167":11953,"_169":11956,"_42":11958,"_71":70},[11954,11955],186,427,[6212,11957],446,{},"The basic mechanism of Microcosm is the message. It is used for following links, creating links, opening new documents and invoking programs. The message contains three essential parts: a selection which will typically be one or more words of text or an area of an image or graphic object selected by the user, an action which is to be performed on the selection, such as \"follow link\" or \"look this up in the dictionary\"; and context information which includes the name of the document containing the selection, its position in that document, the date, and the user's name.",{"_32":11961,"_34":11962},[],{"_36":1875,"_38":11963,"_40":744,"_42":11964,"_67":11965,"_69":11966,"_71":11967},"gKTGpRfz",{},[],"Figure 2: Message Format","ipfs://bafkreid44jpqak6czdm3wjmmrsgr3hrbauwmghcoeg44byvvas7wozrble",{"_32":11969,"_34":11970},[],{"_36":160,"_38":11971,"_40":744,"_42":11972,"_67":11973,"_69":11974,"_71":70},"lJ-rEo2a",{},[],"A message can be created in two ways. The simplest way is by the user highlighting a selection on the screen using a mouse, and then pulling down a menu of actions from a menu bar. Chosing an action will cause the message to be dispatched. The context information is provided by the document viewer. Messages are also created when buttons are pressed. Each document that has had buttons created for it has a button file associated with it. This button file contains a list of the locations of buttons within the document. A selection and an action are also stored for each button. A button then is merely a pre-defined selection bound to an action. It is a special case of the much more general message mechanism.",{"_36":870,"_38":11976,"_40":744,"_42":11977,"_67":11978,"_69":11983,"_71":70},"lZI8HeO-",{"_273":323},[11979],{"_36":919,"_167":11980,"_169":11981,"_42":11982,"_71":70},[137],[1011],{},"5.2 Microcosm Messages",{"_32":11985,"_34":12047},[11986,12001,12008,12015,12023,12031,12039],{"_32":11987,"_34":11988},[],{"_36":160,"_38":11989,"_40":744,"_42":11990,"_67":11991,"_69":12000,"_71":70},"Lyxt82fM",{},[11992],{"_36":919,"_167":11993,"_169":11996,"_42":11999,"_71":70},[1854,11994,11995],303,458,[11997,830,11998],241,469,{},"When the Document Control System receives a message it processes it according to the action. Each action has a task associated with it, and the task will be started up and send the required message. For example, if the action was create link then the message will be sent to the link creator. If it was search dictionary then the DOS dictionary application will be invoked with the message placed on the command line or in a data file as desired. The action follow link is the most common and so will be described in more detail.",{"_32":12002,"_34":12003},[],{"_36":160,"_38":12004,"_40":744,"_42":12005,"_67":12006,"_69":12007,"_71":70},"nZe1eheW",{},[],"Links are stored in a link database. This is a simple flat file system with one record per link. Each record associates a link message with a dispatch message. When the linker receives a follow link action, it attempts to match the rest of the message with a link message in the database. The way this match is performed is dependant on information entered at the time the links were created about how specific or general the link is. If a match is found, then the dispatch message is sent back to the Document Control System. It contains the name of the target document and offset into it where the link was directed. This information is used to start up a Document Viewer of the appropriate type, load the target document, and move to the specified location. In this instance, the user is not aware of the operation of the Document Control System at all. As far as they are concerned they have asked to follow a link and the new document has appeared in another window.",{"_32":12009,"_34":12010},[],{"_36":160,"_38":12011,"_40":744,"_42":12012,"_67":12013,"_69":12014,"_71":70},"prbInvgr",{},[],"Things are slightly more complicated if more than one link is available from a given selection. The user is then presented with a menu of links from which one or more may be chosen. Figures 3—6 illustrate the process of creating and following links",{"_32":12016,"_34":12017},[],{"_36":1875,"_38":12018,"_40":744,"_42":12019,"_67":12020,"_69":12021,"_71":12022},"mILPCyxW",{},[],"Figure 3: Screen shot of Microcosm showing a file relating to the Mountbatten archive from which the user has chosen to make a link on the phrase ","ipfs://bafkreidrqhxg775kmvh76nzrbuaiqdhhn5ju3ytnfxxe52z3lcvkgjiq4q",{"_32":12024,"_34":12025},[],{"_36":1875,"_38":12026,"_40":744,"_42":12027,"_67":12028,"_69":12029,"_71":12030},"ND8F-lHc",{},[],"Figure 4: The link database has three links for the word ","ipfs://bafybeifp562aogtgfq25rhm7dlsfkqj3y5yekxksdinpjkcoq53755quuy",{"_32":12032,"_34":12033},[],{"_36":1875,"_38":12034,"_40":744,"_42":12035,"_67":12036,"_69":12037,"_71":12038},"zuhH0vdX",{},[],"Figure 5: The biography text file appears in another window and the user chooses to complete the link made on the phrase ","ipfs://bafybeihc7k4xgcrecakcgypxqrbuussmsic3lsvlf35mpbgberoi3tdipq",{"_32":12040,"_34":12041},[],{"_36":1875,"_38":12042,"_40":744,"_42":12043,"_67":12044,"_69":12045,"_71":12046},"V7yFg_xS",{},[],"Figure 6: The link is made to apply from anywhere in any document. Thus a generic link has been created on the phrase ","ipfs://bafybeih5uylsxrfyges7ssdjmryvaiw3jldqin7mqjp2vgq5sqjgzojh4u",{"_36":870,"_38":12048,"_40":744,"_42":12049,"_67":12050,"_69":12055,"_71":70},"193SB84G",{"_273":323},[12051],{"_36":919,"_167":12052,"_169":12053,"_42":12054,"_71":70},[137],[1011],{},"5.3 Message Processing",{"_36":870,"_38":12057,"_40":744,"_42":12058,"_67":12059,"_69":12060,"_71":70},"Xtc9lzuN",{"_273":323},[],"5 Design",{"_32":12062,"_34":12124},[12063,12088,12106],{"_32":12064,"_34":12079},[12065],{"_32":12066,"_34":12067},[],{"_36":160,"_38":12068,"_40":744,"_42":12069,"_67":12070,"_69":12078,"_71":70},"6qxZHgpv",{},[12071],{"_36":919,"_167":12072,"_169":12075,"_42":12077,"_71":70},[12073,12074],140,1060,[6675,12076],1066,{},"Instead of storing the link information in with the documents, it is separated out into a knowledge base. This separation allows link to be generic, that is they are not applicable to only one document, but may be used with a whole class of documents. This greatly reduces the authoring effort required, since a new document can be brought into the system and immediately contain links. The Microcosm philosophy is that hypermedia links in themselves are a valuable store of knowledge. If this knowledge is bound too tightly to the documents, then it cannot be applied to new data. Instead it should be pushed away from the documents, into a world of generic knowledge. Microcosm aims to abstract the annotations, cross-references, and other knowledge and tools, so that when new documents are introduced, they immediately have links and cross references available. It should be possible to read a new paper on for example, microbiology, and merely to have to classify the subject of the paper to have a whole wealth of knowledge linked to the it. If the word amoeba had been linked to a videodisc clip of a moving amoeba, and the link had been specified as generic, then new document containing the word would automatically have the link. With the addition of simple filters, the information contained in the links can be applied to different areas of knowledge, being as generic or specific as wished.",{"_36":870,"_38":12080,"_40":744,"_42":12081,"_67":12082,"_69":12087,"_71":70},"6rRfAyOS",{"_273":323},[12083],{"_36":919,"_167":12084,"_169":12085,"_42":12086,"_71":70},[137],[7260],{},"6.1 Authoring effort required—generic links.",{"_32":12089,"_34":12097},[12090],{"_32":12091,"_34":12092},[],{"_36":160,"_38":12093,"_40":744,"_42":12094,"_67":12095,"_69":12096,"_71":70},"tOJKrVQC",{},[],"The separation of link information from documents has the benefit of allowing links to be made from read-only media such as CD-ROMs and remote file servers. This also simplifies links to and from media such as video and sound.",{"_36":870,"_38":12098,"_40":744,"_42":12099,"_67":12100,"_69":12105,"_71":70},"nvYKuqf6",{"_273":323},[12101],{"_36":919,"_167":12102,"_169":12103,"_42":12104,"_71":70},[137],[7309],{},"6.2 Read-only media.",{"_32":12107,"_34":12115},[12108],{"_32":12109,"_34":12110},[],{"_36":160,"_38":12111,"_40":744,"_42":12112,"_67":12113,"_69":12114,"_71":70},"xztLBOJI",{},[],"This is particularly important in a distributed hypertext, where it may be necessary to send out messages to remote machines (and slow to respond peripherals such as videodisc players) and then return control to the user while waiting for the remote responses, presumably while displaying some visual clue that they are still waiting for some response.",{"_36":870,"_38":12116,"_40":744,"_42":12117,"_67":12118,"_69":12123,"_71":70},"3XX1BZDj",{"_273":323},[12119],{"_36":919,"_167":12120,"_169":12121,"_42":12122,"_71":70},[137],[11872],{},"6.3 The possibilities for parallelism.",{"_36":870,"_38":12125,"_40":744,"_42":12126,"_67":12127,"_69":12128,"_71":70},"XEkQ2-d-",{"_273":323},[],"6 Implications",{"_32":12130,"_34":12152},[12131,12138,12145],{"_32":12132,"_34":12133},[],{"_36":160,"_38":12134,"_40":744,"_42":12135,"_67":12136,"_69":12137,"_71":70},"5TrbxzsG",{},[],"The first implementation of Microcosm was prototyped in Actor and then fully implemented in C and MS Windows version 3.0. It runs on IBM PCs (or compatibles) with a 286 processor or above. MS Windows provided us with the basic building blocks for Microcosm, namely the windows and icon interface, tools for creating pull-down menus and dialogue boxes as required, and multi tasking capability. It also provided a convenient message passing system, the Dynamic Data Exchange (DDE), which was used to handle interprocess communication in the Microcosm Document Control System.",{"_32":12139,"_34":12140},[],{"_36":160,"_38":12141,"_40":744,"_42":12142,"_67":12143,"_69":12144,"_71":70},"m7MgBeJ0",{},[],"The task of developing programs for MS Windows using the Software Developers Kit (SDK) can be very time consuming, especially to start with when there is a steep learning curve to be scaled. For this reason we conducted various experiments with the programming language ACTOR [Davis & Heath 1989] which is a single inheritance object oriented programming language similar to Smalltalk, but using MS Windows for its development environment, and producing MS Windows executable programs. While we found development in the ACTOR environment to be much faster, we found that the memory required was too great to allow it to run with other programs, and this prevented us developing the full loosely coupled communication process model in ACTOR. However, we were able to construct a restricted version of the Microcosm system using ACTOR in a relatively short period of time (about 3 weeks of part-time work by one person), and this turned out to be an ideal way of prototyping the user interface of the full system.",{"_32":12146,"_34":12147},[],{"_36":160,"_38":12148,"_40":744,"_42":12149,"_67":12150,"_69":12151,"_71":70},"rrGIx63U",{},[],"The first full implementation of Microcosm in MS Windows was ready for application development in January 1990. Our first application has been in the area of history and in particular in the development of an electronic version of the Mountbatten Archive. This archive is kept and maintained by the Hartley Library at the University of Southampton, and contains approximately 250,000 text documents, 50,000 photographs, 35 reels of cine film, and various audio and video tapes from the collection of the late Lord Mountbatten of Burma. The challenge is to make this archive available to historians in a way that permits explicit and implicit relationships between the different elements of the archive (text, photographs, film etc.) to be stored and analysed. Together with other colleagues at the University we have created a prototype of the electronic archive, taking documents and photographs from the period 1947-8, when Mountbatten was Viceroy of India. Currently, the text documents are stored as ASCII files on the hard-disc and the photographs are stored on a laser videodisc. Images from the latter are displayed in windows on the VGA screen of the computer workstation via a VideoLogic DVA-4000 board. This application provided the content of Figures i, and has allowed us to explore the potential of the various features that are built into Microcosm. A fuller report of this application and our work with the Department of History at Southampton is given in [Colson & Hall 1990].",{"_36":870,"_38":12153,"_40":744,"_42":12154,"_67":12155,"_69":12156,"_71":70},"WrY1b_Vv",{"_273":323},[],"7 Current State of Development",{"_32":12158,"_34":12180},[12159,12166,12173],{"_32":12160,"_34":12161},[],{"_36":160,"_38":12162,"_40":744,"_42":12163,"_67":12164,"_69":12165,"_71":70},"wIT2PWhV",{},[],"Navigation facilities within Microcosm are currently very limited. Users move around the system by following links, initiating database searches and manipulating the windows and icons in which the information appears. This is clearly unsatisfactory for the majority of users especially when the information space is very large (as in the Mountbatten application). An immediate priority is to explore how some of the 'standard' hypertext navigation features, such as contents and index lists, overview maps,and guided tours, can be applied and possibly extended in Microcosm, and if any new navigation tools are suggested by the Microcosm model. One of the main problems inherent in a loosely coupled system such as Microcosm is to let the user know what areas of the screen are active. In most hypertext systems the link anchor is specific, and so some visual clue is displayed to indicate where the anchor is, but in Microcosm, the generality of the linking mechanism makes such clues more difficult to create.",{"_32":12167,"_34":12168},[],{"_36":160,"_38":12169,"_40":744,"_42":12170,"_67":12171,"_69":12172,"_71":70},"n5dndQRb",{},[],"We conducted various experiments using the ACTOR version of Microcosm, and found that so long as a reasonably fast database is used to store the links, it is not unreasonable to search the entire database for links that are specific to the document at load time, and then to search the document file for the positions at which the visual clue should be inserted. However, inserting clues for links with a greater degree of generality is a problem. Clearly it is not reasonable to attempt to match every generic link in the database into the file, if the number of links is very large. Neither is it reasonable, if the file is very large, to attempt to match every possible text string in the file against the database. We found that the most acceptable solution to this problem was to allow the user to select an area of interest, and to select a menu option to match all possible strings in the selection against the database, and to display any matches found.",{"_32":12174,"_34":12175},[],{"_36":160,"_38":12176,"_40":744,"_42":12177,"_67":12178,"_69":12179,"_71":70},"iiHQO5wZ",{},[],"Another problem area in current hypertext systems that we plan to explore in Microcosm is version control and cooperative work. A number of solutions to this problem have been suggested in the hypertext literature [Akscyn 1988, Yankelovich et al 1985, Delise 1987], The next version of Microcosm will have a system of installable filters. It is intended to include a system for version control similar to Intermedia's webs, but which would allow for separate users by allowing a hierarchy of installed filters, so that for example, the main filter might add the links for a particular user.",{"_36":870,"_38":12181,"_40":744,"_42":12182,"_67":12183,"_69":12184,"_71":70},"SducKQrC",{"_273":323},[],"8 Research Directions",{"_32":12186,"_34":12201},[12187,12194],{"_32":12188,"_34":12189},[],{"_36":160,"_38":12190,"_40":744,"_42":12191,"_67":12192,"_69":12193,"_71":70},"_1hpi_4K",{},[],"One of the main barriers to progress in the field of hypertext is the effort required to convert linear text to hypertext. Although vast numbers of pages are available on line, few of them have been converted to hypertext, and even fewer were intentionally authored as such. Users may rapidly come to expect to find very large amounts of information available as hypertexts, so methods of converting linear texts are an area of current research. Most attempts to convert linear documents [Furuta et al. 1989, Rahtz et al. 1989] so far have concentrated on the use of the structure of the document to break the document into appropriately sized nodes, then on using adapted indexing and cross referencing tools to automate link production, in order to produce a framework hypertext, which will usually require further manual cross referencing and linking. Nielsen [1990b] states that links in hypertext systems are \"almost always anchored\" at their departure point. In Microcosm we have move away from this principle: the selection and action mechanism, which provides the generic linking capability within the system, gives us a different, and we believe very powerful, method for assisting the authoring effort. This has already been proven extremely effective in providing hypertext/hypermedia access to a large multimedia archive. A word or phrase has only to be designated a generic link once for this to apply across the whole set of documents in the system and any new documents that are brought into the system. This facility then applies directly to documents stored on read-only media without any extra processing of the documents.",{"_32":12195,"_34":12196},[],{"_36":160,"_38":12197,"_40":744,"_42":12198,"_67":12199,"_69":12200,"_71":70},"5kHIzSG8",{},[],"The main principles of Microcosm's design - its open nature, multi-tasking capabilities, bi-directional process communication and the separation of links into a separate database - have allowed us to create a very powerful and flexible hypermedia system. In Microcosm it is possible to run Guide, say, as a Windows application and thus read Guide documents exactly as they were authored, but at the same time to apply links created within the Microcosm environment to the Guide document using the selection/action mechanism of Microcosm. Links can launch database searches or activate videodisc access, so that if we bring a new document into the system, in whatever format, words or phrases in that document can be linked, for example, to a videodisc database that has been previously created within Microcosm, with no extra authoring effort. These facilities enable the user to fully integrate documents authored in other hypertext/hypermedia systems into their own hypermedia knowledge-base.",{"_36":870,"_38":12202,"_40":744,"_42":12203,"_67":12204,"_69":12205,"_71":70},"7tW-GVfj",{"_273":323},[],"9 Conclusions",{"_32":12207,"_34":12222},[12208,12215],{"_32":12209,"_34":12210},[],{"_36":160,"_38":12211,"_40":744,"_42":12212,"_67":12213,"_69":12214,"_71":70},"u4sJpcjH",{},[],"Representations of photographs from the Mountbatten archive appear by kind permission of Trustees of the Broadlands Archives Trust.",{"_32":12216,"_34":12217},[],{"_36":160,"_38":12218,"_40":744,"_42":12219,"_67":12220,"_69":12221,"_71":70},"XIjtP9JH",{},[],"We are extremely grateful to colleagues in the Department of History HiDES project, the Archives and Manuscripts Department of the Hartley Library, and the Department of Teaching Media for their invaluable support and assistance in the application of Microcosm to the Mountbatten Archive.Thanks are also due to colleagues in the Department of Electronics and Computer Science who contributed so much to the early discussions on the design of Microcosm.",{"_36":870,"_38":12223,"_40":744,"_42":12224,"_67":12225,"_69":3315,"_71":70},"ppbbmkQj",{"_273":323},[],{"_32":12227,"_34":12368},[12228,12235,12242,12249,12256,12263,12270,12277,12284,12291,12298,12305,12312,12319,12326,12333,12340,12347,12354,12361],{"_32":12229,"_34":12230},[],{"_36":160,"_38":12231,"_40":744,"_42":12232,"_67":12233,"_69":12234,"_71":70},"LS6JgZDR",{},[],"[Akscyn 1988] R. Akscyn, D.L. McCracken & E. Yoder, \"KMS: A Distributed Hypertext System for Managing Knowledge in Organizations\", Communcations of the ACM, Vol. 31, No. 7, 1988, pp 820-835.",{"_32":12236,"_34":12237},[],{"_36":160,"_38":12238,"_40":744,"_42":12239,"_67":12240,"_69":12241,"_71":70},"lZvbrDtL",{},[],"[Brown 1986] P.J. Brown, \"Interactive Documentation\", Software Practice and Experience, March 1986, pp 291-299.",{"_32":12243,"_34":12244},[],{"_36":160,"_38":12245,"_40":744,"_42":12246,"_67":12247,"_69":12248,"_71":70},"HgeIuk96",{},[],"[Bush 1945] V. BUSH, \"As We May Think\", Atlantic Monthly, July 1945, pp 101-108.",{"_32":12250,"_34":12251},[],{"_36":160,"_38":12252,"_40":744,"_42":12253,"_67":12254,"_69":12255,"_71":70},"Fh_lGnxZ",{},[],"[Colson & Hall 1990] F. Colson & W. Hall, \"Prologue to Partition: Viceroy Mountabatten and the Handling of the INA Crisis\", to be published in the J. of theAssociationofHistoryandComputing, Autumn1990.",{"_32":12257,"_34":12258},[],{"_36":160,"_38":12259,"_40":744,"_42":12260,"_67":12261,"_69":12262,"_71":70},"6pZh82Vf",{},[],"[Davis & Heath 1989] H. Davis & I. Heath, \"An Evaluation of Actor for Developing Large Windows Applications\", Department of Electronics and Computer Science CSTR 89-5, University of Southampton, 1989.",{"_32":12264,"_34":12265},[],{"_36":160,"_38":12266,"_40":744,"_42":12267,"_67":12268,"_69":12269,"_71":70},"4AWBFAj1",{},[],"[Delisle 1987] N. Delisle & M. Schwartz, \"Contexts - A Partitioning Concept for Hypertext\", J.of the ACM Transactions on Office Information Systems, Vol. 5, No. 2, April 1987, pp 168-186.",{"_32":12271,"_34":12272},[],{"_36":160,"_38":12273,"_40":744,"_42":12274,"_67":12275,"_69":12276,"_71":70},"4t1Zoa_P",{},[],"[Englebart 1963] D.C. ENGELBART, \"A Conceptual Framework for the Augmentation of Man's Intellect\", in Vistas in Information Handling, Vol.l, Spartan Books, London, 1963.",{"_32":12278,"_34":12279},[],{"_36":160,"_38":12280,"_40":744,"_42":12281,"_67":12282,"_69":12283,"_71":70},"5yiI4lG1",{},[],"[Furuta et al. 1989] R. Furuta, C. Plaisant, & B. Shneiderman, \"A Spectrum of Automatic Hypertext Constructs\", J. ofHypermedia, Vol. 1, No. 2, 1989, pp 179- 195.",{"_32":12285,"_34":12286},[],{"_36":160,"_38":12287,"_40":744,"_42":12288,"_67":12289,"_69":12290,"_71":70},"MdszdabQ",{},[],"[Halasz 1988] F.G. Halasz, \"Reflections on Notecards: Seven Issues for the Next Generation of Hypermedia Systems\", Communications of the ACM, 31(7), July 1988, pp 836-852.",{"_32":12292,"_34":12293},[],{"_36":160,"_38":12294,"_40":744,"_42":12295,"_67":12296,"_69":12297,"_71":70},"XCgeHLuP",{},[],"[Nelson 1967] T.H. Nelson, \"Getting It Out of Our System\", in Schechter G. (ed.) Information Retrieval: A Critical Review, Thompson Books, Wash. D.C., 1967.",{"_32":12299,"_34":12300},[],{"_36":160,"_38":12301,"_40":744,"_42":12302,"_67":12303,"_69":12304,"_71":70},"pZPB2gw4",{},[],"[Nielsen 1990a] J. NIELSEN, \"The Art of Navigating Through Hypertext\", Communications ofthe ACM, 33(3), March 1990, pp 297-310.",{"_32":12306,"_34":12307},[],{"_36":160,"_38":12308,"_40":744,"_42":12309,"_67":12310,"_69":12311,"_71":70},"evR1RJrJ",{},[],"[Nielsen 1990b] J. NIELSEN, Hypertext and Hypermedia, Academic Press, 1990. [Rahtz 1989a] S. Rahtz, L. Carr & W. Hall, \"New designs for Archaeological",{"_32":12313,"_34":12314},[],{"_36":160,"_38":12315,"_40":744,"_42":12316,"_67":12317,"_69":12318,"_71":70},"gq-ugXJH",{},[],"Reports\", Science and Archaeology, no. 31, 1989, pp 20-34.",{"_32":12320,"_34":12321},[],{"_36":160,"_38":12322,"_40":744,"_42":12323,"_67":12324,"_69":12325,"_71":70},"O5sGpHkx",{},[],"[Rahtz 1989b] S. Rahtz, L. Carr, & W. Hall, \"Creating Multimedia Documents\",",{"_32":12327,"_34":12328},[],{"_36":160,"_38":12329,"_40":744,"_42":12330,"_67":12331,"_69":12332,"_71":70},"v47uPZ-b",{},[],"in Hypertext: the State of the Art (ed. McAleese) Intellect Ltd, 1990.",{"_32":12334,"_34":12335},[],{"_36":160,"_38":12336,"_40":744,"_42":12337,"_67":12338,"_69":12339,"_71":70},"Xmu-awUK",{},[],"[Shneiderman 1987] B. Shneiderman, \"User Interface Design for the Hyperties Electronic Encyclopedia\", Proceedings of the ACM Hypertext'87 Conference, Chapel Hill, NC, November 1987, pp!89-194.",{"_32":12341,"_34":12342},[],{"_36":160,"_38":12343,"_40":744,"_42":12344,"_67":12345,"_69":12346,"_71":70},"bfx5yR_X",{},[],"[Shneiderman et al. 1989] B. SHNEIDERMAN, D. BRETHAUER, C. PLAISANT & R. Potter, \"The Hyperties Electronic Encyclopedia: An Evaluation Based on Three Museum Installations”, J. American Societyfor Information Science, 40 (3), May 1989, ppi72-182.",{"_32":12348,"_34":12349},[],{"_36":160,"_38":12350,"_40":744,"_42":12351,"_67":12352,"_69":12353,"_71":70},"tLo5UMhK",{},[],"[Shneiderman & Kearsley 1989] B. Shneiderman & G. Kearsley, Hypertext Hands On, Addison-Wesley, 1989.",{"_32":12355,"_34":12356},[],{"_36":160,"_38":12357,"_40":744,"_42":12358,"_67":12359,"_69":12360,"_71":70},"k4egv8uy",{},[],"[Yankelovich et al 1985] N. Yankelovich, N. Meyrowitz & A. VAN Dam, \"Reading and Writing the Electronic Book”, IEEE Computer, October 1985.",{"_32":12362,"_34":12363},[],{"_36":160,"_38":12364,"_40":744,"_42":12365,"_67":12366,"_69":12367,"_71":70},"A4WRp0sA",{},[],"[Yankelovich et al 1988] N. Yankelovich, B. Haan, N. Meyrowitz & S. Drucker, \"Intermedia: The Concept and Construction of a Seamless Information Environment\", IEEE Computer, January 1988, pp 81-96.",{"_36":870,"_38":12369,"_40":744,"_42":12370,"_67":12371,"_69":3495,"_71":70},"iFOjUDyH",{"_273":323},[],[54],"/records/microcosm-an-open-model-for-hypermedia-with-dynamic-linking",{"_83":764},{},{"_38":741,"_95":54,"_55":12377,"_72":744,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,743],1773151562780,[149,741,744,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/microcosm-an-open-model-for-hypermedia-with-dynamic-linking\",\"bafy2bzacedslgk3murmoxfmfgbz43t6hgjml4f4ngzhztmufodoglys4tus46\",true]",{"_110":12382,"_147":12440,"_150":12441},{"_112":12383,"_131":132,"_133":12439,"_135":-5,"_136":137,"_138":137,"_139":137,"_140":-5,"_141":-5,"_142":63,"_143":144,"_145":146},{"_36":27,"_27":12384,"_38":12437},{"_29":12385,"_72":770,"_73":54,"_74":12433,"_55":12434,"_77":777,"_79":777,"_81":12435,"_85":12436,"_87":770,"_89":90},[12386,12393,12404,12415],{"_32":12387,"_34":12388},[],{"_36":160,"_38":12389,"_40":770,"_42":12390,"_67":12391,"_69":12392,"_71":70},"5LlAEp9Z",{},[],"Mark S. Miller1, Tom Van Cutsem2, and Bill Tulloh",{"_32":12394,"_34":12395},[],{"_36":160,"_38":12396,"_40":770,"_42":12397,"_67":12398,"_69":12403,"_71":70},"tujwccLO",{},[12399],{"_36":166,"_167":12400,"_169":12401,"_42":12402,"_71":70},[137],[240],{},"Abstract. Contracts enable mutually suspicious parties to cooperate safely through the exchange of rights. Smart contracts are programs whose behavior enforces the terms of the contract. This paper shows how such contracts can be specified elegantly and executed safely, given an appropriate distributed, secure, persistent, and ubiquitous computational fabric. JavaScript provides the ubiquity but must be significantly extended to deal with the other aspects. The first part of this paper is a progress report on our efforts to turn JavaScript into this fabric. To demonstrate the suitability of this design, we describe an escrow exchange contract implemented in 42 lines of JavaScript code.",{"_32":12405,"_34":12406},[],{"_36":160,"_38":12407,"_40":770,"_42":12408,"_67":12409,"_69":12414,"_71":70},"6KUzV1Qy",{},[12410],{"_36":166,"_167":12411,"_169":12412,"_42":12413,"_71":70},[137],[240],{},"Keywords: security, distributed objects, object-capabilities, smart contracts.",{"_32":12416,"_34":12424},[12417],{"_32":12418,"_34":12419},[],{"_36":160,"_38":12420,"_40":770,"_42":12421,"_67":12422,"_69":12423,"_71":70},"NBw2Rxx_",{},[],"The fabric of the global economy is held together by contracts. A contract is an agreed framework for the rearrangement of rights between mutually suspicious parties. But existing contracts are ambiguous, jurisdictions-specific, and written, interpreted, and adjudicated only by expensive experts. Smart contracts are contract-like arrangements expressed in program code, where the behavior of the program enforces the terms of the “contract”[1]. Though not a substitute for legal contracts, they can provide some of the benefits of contracts for fine-grain, jurisdiction-free, and automated arrangements for which legal contracts are impractical. To realize this potential, smart contracts need a distributed, secure, persistent, and ubiquitous computational fabric. To avoid merely substituting one set of expensive experts for another, non-experts should be able to write smart contracts understandable by other non-experts. We1 are working towards turning JavaScript into such a fabric. JavaScript is already understood and used by many non-expert programmers. We call our target JavaScript platform Dr. SES for Distributed Resilient Secure EcmaScript. 2 Dr. SES is not specifically tied to electronic rights (erights) or smart contracts per se. Its focus is to make distributed secure programming in JavaScript as effortless as possible. But much of the design of Dr. SES and its predecessors [2,3,4] was shaped by examining what we need to express smart contracts simply. Taking a rights-based approach to local and distributed computing, we believe, has led us to building a better general purpose platform as well as one naturally suited for expressing new kinds of erights and contracts.",{"_36":160,"_38":12425,"_40":770,"_42":12426,"_67":12427,"_69":12432,"_71":70},"V4liDAZK",{"_273":323},[12428],{"_36":166,"_167":12429,"_169":12430,"_42":12431,"_71":70},[137],[2477],{},"Smart Contracts for the Rest of Us",[54],"/records/distributed-electronic-rights-in-javascript",{"_83":786},{},{"_38":767,"_95":54,"_55":12438,"_72":770,"_97":-5,"_98":-5,"_99":-5,"_100":-5,"_94":6},[56,769],1773151562782,[149,767,770,6],"[\"ENTITY\",\"hm://z6MkrvYZzMYaCxyjbFWsZicdPCrcVmiXvgeY3i65GERQjjoH/records/distributed-electronic-rights-in-javascript\",\"bafy2bzacedcmcgdvm6gazawxh2s3rd2bx6c3whsllxzrydpttnp5zkzmcsbvk\",true]","enableWebSigning","https://bitcointuesdaymadrid.com","origin","homeMetadata",{"_83":12447,"_284":12448,"_285":70,"_287":12443,"_289":70,"_12449":12450,"_12451":6,"_393":394},"Bitcoin Tuesday Madrid","ipfs://bafybeiejzcbcowtpfkvcjnbjyunpuzch5eetntscwvblfiy2d27tjtoqay","seedExperimentalHomeOrder","CreatedFirst","showActivity","originHomeId",{"_95":12454,"_38":12455,"_55":12456,"_72":-5,"_97":-5,"_98":-5,"_99":-5,"_100":-5},"z6Mkusu8KBMXe52JC9fnEFzwdsAF2SXGvnxoAyVTXBhGfRDR","hm://z6Mkusu8KBMXe52JC9fnEFzwdsAF2SXGvnxoAyVTXBhGfRDR",[],"meta",{"_12459":12460,"_12719":12720},"values",{"_12461":12462,"_12463":12464,"_12466":12467,"_12468":12469,"_12471":12472,"_12473":12474,"_12475":12476,"_12477":12478,"_12479":12480,"_12481":12482,"_12483":12484,"_12485":12486,"_12487":12488,"_12489":12490,"_12491":12492,"_12493":12494,"_12495":12496,"_12497":12498,"_12499":12500,"_12501":12502,"_12503":12504,"_12505":12506,"_12507":12508,"_12509":12510,"_12511":12512,"_12513":12514,"_12515":12516,"_12517":12518,"_12519":12520,"_12521":12522,"_12523":12524,"_12525":12526,"_12527":12528,"_12529":12530,"_12531":12532,"_12533":12534,"_12535":12536,"_12537":12538,"_12539":12540,"_12541":12542,"_12543":12544,"_12545":12546,"_12547":12548,"_12549":12550,"_12551":12552,"_12553":12554,"_12555":12556,"_12557":12558,"_12559":12560,"_12561":12562,"_12563":12564,"_12565":12566,"_12567":12568,"_12569":12570,"_12571":12572,"_12573":12574,"_12575":12576,"_12577":12578,"_12579":12580,"_12581":12582,"_12583":12584,"_12585":12586,"_12587":12588,"_12589":12590,"_12591":12592,"_12593":12594,"_12595":12596,"_12597":12598,"_12599":12600,"_12601":12602,"_12603":12604,"_12605":12606,"_12607":12608,"_12609":12610,"_12611":12612,"_12613":12614,"_12615":12616,"_12617":12618,"_12619":12620,"_12621":12622,"_12623":12624,"_12625":12626,"_12627":12628,"_12629":12630,"_12631":12632,"_12633":12634,"_12635":12636,"_12637":12638,"_12639":12640,"_12641":12642,"_12643":12644,"_12645":12646,"_12647":12648,"_12649":12650,"_12651":12652,"_12653":12654,"_12655":12656,"_12657":12658,"_12659":12660,"_12661":12662,"_12663":12664,"_12665":12666,"_12667":12668,"_12669":12670,"_12671":12672,"_12673":12674,"_12675":12676,"_12677":12678,"_12679":12680,"_12681":12682,"_12683":12684,"_12685":12686,"_12687":12688,"_12689":12690,"_12691":12692,"_12693":12694,"_12695":12696,"_12697":12698,"_12699":12700,"_12701":12702,"_12703":12704,"_12705":12706,"_12707":12708,"_12709":12710,"_12711":12712,"_12713":12714,"_12715":12716,"_12717":12718},"dehydratedState.queries.1.queryKey.2",[10983],"dehydratedState.queries.2.state.data.0.createTime.seconds",[12465],"bigint","dehydratedState.queries.2.state.data.0.updateTime.seconds",[12465],"dehydratedState.queries.2.state.data.0.sortTime",[12470],"Date","dehydratedState.queries.2.state.data.0.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.2.state.data.0.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.2.state.data.0.generationInfo.generation",[12465],"dehydratedState.queries.2.state.data.0.redirectInfo",[10983],"dehydratedState.queries.2.state.data.1.createTime.seconds",[12465],"dehydratedState.queries.2.state.data.1.updateTime.seconds",[12465],"dehydratedState.queries.2.state.data.1.sortTime",[12470],"dehydratedState.queries.2.state.data.1.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.2.state.data.1.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.2.state.data.1.generationInfo.generation",[12465],"dehydratedState.queries.2.state.data.1.redirectInfo",[10983],"dehydratedState.queries.2.state.data.2.createTime.seconds",[12465],"dehydratedState.queries.2.state.data.2.updateTime.seconds",[12465],"dehydratedState.queries.2.state.data.2.sortTime",[12470],"dehydratedState.queries.2.state.data.2.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.2.state.data.2.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.2.state.data.2.generationInfo.generation",[12465],"dehydratedState.queries.2.state.data.2.redirectInfo",[10983],"dehydratedState.queries.2.state.data.3.createTime.seconds",[12465],"dehydratedState.queries.2.state.data.3.updateTime.seconds",[12465],"dehydratedState.queries.2.state.data.3.sortTime",[12470],"dehydratedState.queries.2.state.data.3.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.2.state.data.3.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.2.state.data.3.generationInfo.generation",[12465],"dehydratedState.queries.2.state.data.3.redirectInfo",[10983],"dehydratedState.queries.3.state.data.0.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.0.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.0.sortTime",[12470],"dehydratedState.queries.3.state.data.0.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.0.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.0.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.0.redirectInfo",[10983],"dehydratedState.queries.3.state.data.1.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.1.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.1.sortTime",[12470],"dehydratedState.queries.3.state.data.1.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.1.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.1.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.1.redirectInfo",[10983],"dehydratedState.queries.3.state.data.2.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.2.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.2.sortTime",[12470],"dehydratedState.queries.3.state.data.2.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.2.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.2.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.2.redirectInfo",[10983],"dehydratedState.queries.3.state.data.3.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.3.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.3.sortTime",[12470],"dehydratedState.queries.3.state.data.3.activitySummary.latestCommentTime.seconds",[12465],"dehydratedState.queries.3.state.data.3.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.3.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.3.redirectInfo",[10983],"dehydratedState.queries.3.state.data.4.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.4.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.4.sortTime",[12470],"dehydratedState.queries.3.state.data.4.activitySummary.latestCommentTime.seconds",[12465],"dehydratedState.queries.3.state.data.4.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.4.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.4.redirectInfo",[10983],"dehydratedState.queries.3.state.data.5.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.5.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.5.sortTime",[12470],"dehydratedState.queries.3.state.data.5.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.5.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.5.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.5.redirectInfo",[10983],"dehydratedState.queries.3.state.data.6.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.6.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.6.sortTime",[12470],"dehydratedState.queries.3.state.data.6.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.6.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.6.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.6.redirectInfo",[10983],"dehydratedState.queries.3.state.data.7.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.7.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.7.sortTime",[12470],"dehydratedState.queries.3.state.data.7.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.7.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.7.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.7.redirectInfo",[10983],"dehydratedState.queries.3.state.data.8.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.8.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.8.sortTime",[12470],"dehydratedState.queries.3.state.data.8.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.8.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.8.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.8.redirectInfo",[10983],"dehydratedState.queries.3.state.data.9.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.9.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.9.sortTime",[12470],"dehydratedState.queries.3.state.data.9.activitySummary.latestCommentTime.seconds",[12465],"dehydratedState.queries.3.state.data.9.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.9.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.9.redirectInfo",[10983],"dehydratedState.queries.3.state.data.10.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.10.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.10.sortTime",[12470],"dehydratedState.queries.3.state.data.10.activitySummary.latestCommentTime.seconds",[12465],"dehydratedState.queries.3.state.data.10.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.10.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.10.redirectInfo",[10983],"dehydratedState.queries.3.state.data.11.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.11.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.11.sortTime",[12470],"dehydratedState.queries.3.state.data.11.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.11.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.11.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.11.redirectInfo",[10983],"dehydratedState.queries.3.state.data.12.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.12.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.12.sortTime",[12470],"dehydratedState.queries.3.state.data.12.activitySummary.latestCommentTime.seconds",[12465],"dehydratedState.queries.3.state.data.12.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.12.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.12.redirectInfo",[10983],"dehydratedState.queries.3.state.data.13.createTime.seconds",[12465],"dehydratedState.queries.3.state.data.13.updateTime.seconds",[12465],"dehydratedState.queries.3.state.data.13.sortTime",[12470],"dehydratedState.queries.3.state.data.13.activitySummary.latestCommentTime",[10983],"dehydratedState.queries.3.state.data.13.activitySummary.latestChangeTime.seconds",[12465],"dehydratedState.queries.3.state.data.13.generationInfo.generation",[12465],"dehydratedState.queries.3.state.data.13.redirectInfo",[10983],"dehydratedState.queries.5.state.data.metadata.summary",[10983],"referentialEqualities",{"_12466":12721,"_12481":12722,"_12495":12723,"_12509":12724,"_12521":12725,"_12537":12726,"_12551":12727,"_12563":12728,"_12579":12729,"_12591":12730,"_12605":12731,"_12619":12732,"_12633":12733,"_12647":12734,"_12663":12735,"_12677":12736,"_12689":12737,"_12703":12738},[12473],[12487],[12501],[12515],[12523,12529],[12543],[12557],[12565,12571],[12585],[12593,12599],[12607,12613],[12621,12627],[12635,12641],[12649,12655],[12669],[12683],[12691,12697],[12705,12711],"actionData","errors"]