{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6BETR4KMNHWWYAJFSZQT76MQB2","short_pith_number":"pith:6BETR4KM","schema_version":"1.0","canonical_sha256":"f04938f14c69ed6c012596613ff9900eb9830f1113bedd0cc518ab50a38de37f","source":{"kind":"arxiv","id":"1401.3659","version":1},"attestation_state":"computed","paper":{"title":"Multipath Private Communication: An Information Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Hadi Ahmadi, Reihaneh Safavi-Naini","submitted_at":"2014-01-15T16:48:08Z","abstract_excerpt":"Sending private messages over communication environments under surveillance is an important challenge in communication security and has attracted attentions of cryptographers through time. We believe that resources other than cryptographic keys can be used for communication privacy. We consider private message transmission (PMT) in an abstract multipath communication model between two communicants, Alice and Bob, in the presence of an eavesdropper, Eve. Alice and Bob have pre-shared keys and Eve is computationally unbounded. There are a total of $n$ paths and the three parties can have simulta"},"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":"1401.3659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2014-01-15T16:48:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"988a5daedfd4b1874daa4dc6441289001fea065bb0f90a29aaf9220309a85129","abstract_canon_sha256":"6749e53796c79f77912ec8d15212d88ae341285e100ff10c80a0fbc268c3a8b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:02:08.028547Z","signature_b64":"bIf5hpC4n9ZUwbpig+rkNoFyzOOcxpvXFWIPTIoQE85+Qk6btdSBfkWOndsktRpDDltLGNOfFiQlFz+NnMlZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f04938f14c69ed6c012596613ff9900eb9830f1113bedd0cc518ab50a38de37f","last_reissued_at":"2026-05-18T03:02:08.027637Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:02:08.027637Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multipath Private Communication: An Information Theoretic Approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Hadi Ahmadi, Reihaneh Safavi-Naini","submitted_at":"2014-01-15T16:48:08Z","abstract_excerpt":"Sending private messages over communication environments under surveillance is an important challenge in communication security and has attracted attentions of cryptographers through time. We believe that resources other than cryptographic keys can be used for communication privacy. We consider private message transmission (PMT) in an abstract multipath communication model between two communicants, Alice and Bob, in the presence of an eavesdropper, Eve. Alice and Bob have pre-shared keys and Eve is computationally unbounded. There are a total of $n$ paths and the three parties can have simulta"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.3659","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1401.3659","created_at":"2026-05-18T03:02:08.027791+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.3659v1","created_at":"2026-05-18T03:02:08.027791+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.3659","created_at":"2026-05-18T03:02:08.027791+00:00"},{"alias_kind":"pith_short_12","alias_value":"6BETR4KMNHWW","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6BETR4KMNHWWYAJF","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6BETR4KM","created_at":"2026-05-18T12:28:16.859392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04129","citing_title":"Quantum-Resistant Networks: A Review of Primitives, Protocols and Best Practices","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2","json":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2.json","graph_json":"https://pith.science/api/pith-number/6BETR4KMNHWWYAJFSZQT76MQB2/graph.json","events_json":"https://pith.science/api/pith-number/6BETR4KMNHWWYAJFSZQT76MQB2/events.json","paper":"https://pith.science/paper/6BETR4KM"},"agent_actions":{"view_html":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2","download_json":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2.json","view_paper":"https://pith.science/paper/6BETR4KM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.3659&json=true","fetch_graph":"https://pith.science/api/pith-number/6BETR4KMNHWWYAJFSZQT76MQB2/graph.json","fetch_events":"https://pith.science/api/pith-number/6BETR4KMNHWWYAJFSZQT76MQB2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2/action/storage_attestation","attest_author":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2/action/author_attestation","sign_citation":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2/action/citation_signature","submit_replication":"https://pith.science/pith/6BETR4KMNHWWYAJFSZQT76MQB2/action/replication_record"}},"created_at":"2026-05-18T03:02:08.027791+00:00","updated_at":"2026-05-18T03:02:08.027791+00:00"}