{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OV7KOBYLDIQVFPGHYGDETZDESM","short_pith_number":"pith:OV7KOBYL","schema_version":"1.0","canonical_sha256":"757ea7070b1a2152bcc7c18649e464932f32b1f0a5ec6566448ceb3b3099e116","source":{"kind":"arxiv","id":"1810.05602","version":4},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1810.05602","created_at":"2026-07-05T05:33:57.054760+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.05602v4","created_at":"2026-07-05T05:33:57.054760+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.05602","created_at":"2026-07-05T05:33:57.054760+00:00"},{"alias_kind":"pith_short_12","alias_value":"OV7KOBYLDIQV","created_at":"2026-07-05T05:33:57.054760+00:00"},{"alias_kind":"pith_short_16","alias_value":"OV7KOBYLDIQVFPGH","created_at":"2026-07-05T05:33:57.054760+00:00"},{"alias_kind":"pith_short_8","alias_value":"OV7KOBYL","created_at":"2026-07-05T05:33:57.054760+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM","json":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM.json","graph_json":"https://pith.science/api/pith-number/OV7KOBYLDIQVFPGHYGDETZDESM/graph.json","events_json":"https://pith.science/api/pith-number/OV7KOBYLDIQVFPGHYGDETZDESM/events.json","paper":"https://pith.science/paper/OV7KOBYL"},"agent_actions":{"view_html":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM","download_json":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM.json","view_paper":"https://pith.science/paper/OV7KOBYL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.05602&json=true","fetch_graph":"https://pith.science/api/pith-number/OV7KOBYLDIQVFPGHYGDETZDESM/graph.json","fetch_events":"https://pith.science/api/pith-number/OV7KOBYLDIQVFPGHYGDETZDESM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/action/storage_attestation","attest_author":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/action/author_attestation","sign_citation":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/action/citation_signature","submit_replication":"https://pith.science/pith/OV7KOBYLDIQVFPGHYGDETZDESM/action/replication_record"}},"created_at":"2026-07-05T05:33:57.054760+00:00","updated_at":"2026-07-05T05:33:57.054760+00:00"}