{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YT7TAEXA3GESMJVZQXNHU57AS5","short_pith_number":"pith:YT7TAEXA","schema_version":"1.0","canonical_sha256":"c4ff3012e0d9892626b985da7a77e0974f334479731cb9d06b75b6c7564a329e","source":{"kind":"arxiv","id":"1401.4451","version":2},"attestation_state":"computed","paper":{"title":"Reliable, Deniable, and Hidable Communication over Multipath Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Mayank Bakshi, Sidharth Jaggi, Swanand Kadhe","submitted_at":"2014-01-17T20:50:29Z","abstract_excerpt":"We consider the scenario wherein Alice wants to (potentially) communicate to the intended receiver Bob over a network consisting of multiple parallel links in the presence of a passive eavesdropper Willie, who observes an unknown subset of links. A primary goal of our communication protocol is to make the communication \"deniable\", {\\it i.e.}, Willie should not be able to {\\it reliably} estimate whether or not Alice is transmitting any {\\it covert} information to Bob. Moreover, if Alice is indeed actively communicating, her covert messages should be information-theoretically \"hidable\" in the se"},"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.4451","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T20:50:29Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"d3081741a6da24804134171a357b84a00293f7661045d5c4317cfd27b58d0342","abstract_canon_sha256":"0fa45ba7166cccffd11ddcfef261bac8bee7abe4363468423f7664a2f544583d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:48.848588Z","signature_b64":"XBbyRMmteXzhl6wm0UO2G1eZyDwBtD6SUxpM4YqRAG/7vXNqv3AfFUH0MFo14/wOUZ/NPlwTg25TSjsTm6WLBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4ff3012e0d9892626b985da7a77e0974f334479731cb9d06b75b6c7564a329e","last_reissued_at":"2026-05-18T03:00:48.847809Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:48.847809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliable, Deniable, and Hidable Communication over Multipath Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Sprintson, Mayank Bakshi, Sidharth Jaggi, Swanand Kadhe","submitted_at":"2014-01-17T20:50:29Z","abstract_excerpt":"We consider the scenario wherein Alice wants to (potentially) communicate to the intended receiver Bob over a network consisting of multiple parallel links in the presence of a passive eavesdropper Willie, who observes an unknown subset of links. A primary goal of our communication protocol is to make the communication \"deniable\", {\\it i.e.}, Willie should not be able to {\\it reliably} estimate whether or not Alice is transmitting any {\\it covert} information to Bob. Moreover, if Alice is indeed actively communicating, her covert messages should be information-theoretically \"hidable\" in the se"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4451","kind":"arxiv","version":2},"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.4451","created_at":"2026-05-18T03:00:48.847959+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.4451v2","created_at":"2026-05-18T03:00:48.847959+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4451","created_at":"2026-05-18T03:00:48.847959+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT7TAEXA3GES","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT7TAEXA3GESMJVZ","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT7TAEXA","created_at":"2026-05-18T12:28:57.508820+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/YT7TAEXA3GESMJVZQXNHU57AS5","json":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5.json","graph_json":"https://pith.science/api/pith-number/YT7TAEXA3GESMJVZQXNHU57AS5/graph.json","events_json":"https://pith.science/api/pith-number/YT7TAEXA3GESMJVZQXNHU57AS5/events.json","paper":"https://pith.science/paper/YT7TAEXA"},"agent_actions":{"view_html":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5","download_json":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5.json","view_paper":"https://pith.science/paper/YT7TAEXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.4451&json=true","fetch_graph":"https://pith.science/api/pith-number/YT7TAEXA3GESMJVZQXNHU57AS5/graph.json","fetch_events":"https://pith.science/api/pith-number/YT7TAEXA3GESMJVZQXNHU57AS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/action/storage_attestation","attest_author":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/action/author_attestation","sign_citation":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/action/citation_signature","submit_replication":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/action/replication_record"}},"created_at":"2026-05-18T03:00:48.847959+00:00","updated_at":"2026-05-18T03:00:48.847959+00:00"}