{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OV7KOBYLDIQVFPGHYGDETZDESM","short_pith_number":"pith:OV7KOBYL","canonical_record":{"source":{"id":"1810.05602","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-12T16:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"dd025fd1b2626f95644b8a2e6c6361bd3244ba5dceef8bfa0e662d74b75c95cf","abstract_canon_sha256":"79819fd3d2600865051c1f182559252955f19534b658fa50fa578e473de932d5"},"schema_version":"1.0"},"canonical_sha256":"757ea7070b1a2152bcc7c18649e464932f32b1f0a5ec6566448ceb3b3099e116","source":{"kind":"arxiv","id":"1810.05602","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05602","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05602v4","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05602","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"OV7KOBYLDIQV","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"pith_short_16","alias_value":"OV7KOBYLDIQVFPGH","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"pith_short_8","alias_value":"OV7KOBYL","created_at":"2026-07-05T05:33:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OV7KOBYLDIQVFPGHYGDETZDESM","target":"record","payload":{"canonical_record":{"source":{"id":"1810.05602","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-12T16:46:07Z","cross_cats_sorted":[],"title_canon_sha256":"dd025fd1b2626f95644b8a2e6c6361bd3244ba5dceef8bfa0e662d74b75c95cf","abstract_canon_sha256":"79819fd3d2600865051c1f182559252955f19534b658fa50fa578e473de932d5"},"schema_version":"1.0"},"canonical_sha256":"757ea7070b1a2152bcc7c18649e464932f32b1f0a5ec6566448ceb3b3099e116","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:33:57.055138Z","signature_b64":"r9PTC2Yy0K0BrMbjBGWRPkc0R6or5ulnnmcW4Eq8agXy2N0mwOwNqidj+tRega8xX3/Twd7ctDTP5+q+BlcwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"757ea7070b1a2152bcc7c18649e464932f32b1f0a5ec6566448ceb3b3099e116","last_reissued_at":"2026-07-05T05:33:57.054698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:33:57.054698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.05602","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y1yvnt52u9Ev2QiRSYn/apgWczmfWf0H4GZYve3Wurp9P40kvR7rvtI7BffkTKvhN7feVLNeXy4VA8Y2oPu3BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:59:14.581321Z"},"content_sha256":"2b53bfc424a3e73717a76ae2ae176c33bfd5f213eeccc9b0c36f081c52cc3bdb","schema_version":"1.0","event_id":"sha256:2b53bfc424a3e73717a76ae2ae176c33bfd5f213eeccc9b0c36f081c52cc3bdb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OV7KOBYLDIQVFPGHYGDETZDESM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Stefan Rass","submitted_at":"2018-10-12T16:46:07Z","abstract_excerpt":"We consider network graphs $G=(V,E)$ in which adjacent nodes share common secrets. In this setting, certain techniques for perfect end-to-end security (in the sense of confidentiality, authenticity (implying integrity) and availability, i.e., CIA+) can be made applicable without end-to-end shared secrets and without computational intractability assumptions. To this end, we introduce and study the concept of a unique-neighborhood network, in which nodes are uniquely identifiable upon their graph-topological neighborhood. While the concept is motivated by authentication, it may enjoy wider appli"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05602","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1810.05602/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T05:33:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCBmB82QNoM5LqveGfd8IbSKfdvcJCznMTRN+R0dJXejtT0obCDCzR+UOEKDHBCUvMSyWl3sUid9ugam0ShDBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T20:59:14.581872Z"},"content_sha256":"d5c5a113804371ef995aee9932f0e0b8d5eb3925e30aec2d6651d26f1d4275d8","schema_version":"1.0","event_id":"sha256:d5c5a113804371ef995aee9932f0e0b8d5eb3925e30aec2d6651d26f1d4275d8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/bundle.json","state_url":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OV7KOBYLDIQVFPGHYGDETZDESM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T20:59:14Z","links":{"resolver":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM","bundle":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/bundle.json","state":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OV7KOBYLDIQVFPGHYGDETZDESM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OV7KOBYLDIQVFPGHYGDETZDESM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"79819fd3d2600865051c1f182559252955f19534b658fa50fa578e473de932d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-12T16:46:07Z","title_canon_sha256":"dd025fd1b2626f95644b8a2e6c6361bd3244ba5dceef8bfa0e662d74b75c95cf"},"schema_version":"1.0","source":{"id":"1810.05602","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.05602","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"arxiv_version","alias_value":"1810.05602v4","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05602","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"pith_short_12","alias_value":"OV7KOBYLDIQV","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"pith_short_16","alias_value":"OV7KOBYLDIQVFPGH","created_at":"2026-07-05T05:33:57Z"},{"alias_kind":"pith_short_8","alias_value":"OV7KOBYL","created_at":"2026-07-05T05:33:57Z"}],"graph_snapshots":[{"event_id":"sha256:d5c5a113804371ef995aee9932f0e0b8d5eb3925e30aec2d6651d26f1d4275d8","target":"graph","created_at":"2026-07-05T05:33:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1810.05602/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider network graphs $G=(V,E)$ in which adjacent nodes share common secrets. In this setting, certain techniques for perfect end-to-end security (in the sense of confidentiality, authenticity (implying integrity) and availability, i.e., CIA+) can be made applicable without end-to-end shared secrets and without computational intractability assumptions. To this end, we introduce and study the concept of a unique-neighborhood network, in which nodes are uniquely identifiable upon their graph-topological neighborhood. While the concept is motivated by authentication, it may enjoy wider appli","authors_text":"Stefan Rass","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-12T16:46:07Z","title":"Perfectly Secure Communication, based on Graph-Topological Addressing in Unique-Neighborhood Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.05602","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2b53bfc424a3e73717a76ae2ae176c33bfd5f213eeccc9b0c36f081c52cc3bdb","target":"record","created_at":"2026-07-05T05:33:57Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"79819fd3d2600865051c1f182559252955f19534b658fa50fa578e473de932d5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2018-10-12T16:46:07Z","title_canon_sha256":"dd025fd1b2626f95644b8a2e6c6361bd3244ba5dceef8bfa0e662d74b75c95cf"},"schema_version":"1.0","source":{"id":"1810.05602","kind":"arxiv","version":4}},"canonical_sha256":"757ea7070b1a2152bcc7c18649e464932f32b1f0a5ec6566448ceb3b3099e116","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"757ea7070b1a2152bcc7c18649e464932f32b1f0a5ec6566448ceb3b3099e116","first_computed_at":"2026-07-05T05:33:57.054698Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T05:33:57.054698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r9PTC2Yy0K0BrMbjBGWRPkc0R6or5ulnnmcW4Eq8agXy2N0mwOwNqidj+tRega8xX3/Twd7ctDTP5+q+BlcwDA==","signature_status":"signed_v1","signed_at":"2026-07-05T05:33:57.055138Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.05602","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2b53bfc424a3e73717a76ae2ae176c33bfd5f213eeccc9b0c36f081c52cc3bdb","sha256:d5c5a113804371ef995aee9932f0e0b8d5eb3925e30aec2d6651d26f1d4275d8"],"state_sha256":"4f28881dd8744f61c207daf17b76390b9110ac647183da3c1492f2580c9e136c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UOm4iogoiqfLAo60Z50czse83h+78YWks1/ASh9OfA5sznCCxzy6gR2hsWR0rl31xDQ8/l6IZCLnohXD4rLYAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T20:59:14.587774Z","bundle_sha256":"c1a4ec5d61b0f65c7d7f77dff0a6572f5ba53016bc946c3b95bf014067d53888"}}