{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YT7TAEXA3GESMJVZQXNHU57AS5","short_pith_number":"pith:YT7TAEXA","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"},"canonical_sha256":"c4ff3012e0d9892626b985da7a77e0974f334479731cb9d06b75b6c7564a329e","source":{"kind":"arxiv","id":"1401.4451","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4451","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4451v2","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4451","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"YT7TAEXA3GES","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YT7TAEXA3GESMJVZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YT7TAEXA","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YT7TAEXA3GESMJVZQXNHU57AS5","target":"record","payload":{"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"},"canonical_sha256":"c4ff3012e0d9892626b985da7a77e0974f334479731cb9d06b75b6c7564a329e","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"},"source_kind":"arxiv","source_id":"1401.4451","source_version":2,"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-05-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BG4pfs5KrJxkQfbTAOhmxSM17G1Y/8vho6pcTb0jYVCmgRyjREWpQY5phDODgMKnbQZLFWFaSmEX78BFTx2cAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:29:38.724499Z"},"content_sha256":"f34cc5ed3fe7881cd3682c75dd3054b3094bc9b4e5a927217792e1727935eeb6","schema_version":"1.0","event_id":"sha256:f34cc5ed3fe7881cd3682c75dd3054b3094bc9b4e5a927217792e1727935eeb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YT7TAEXA3GESMJVZQXNHU57AS5","target":"graph","payload":{"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"},"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-05-18T03:00:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zw9DJgc6qI+VG8iaIqlS6nWm3hTUniMWkhlVjKQ+P1RCXDdFuSP9q5Pzwva34fTzKiWNAtd+xcY8dW/I0Z+HBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:29:38.725143Z"},"content_sha256":"3cc0cb2c11668acd868929533f8b1fb1220e9a869227ab3d0af69d5b47859349","schema_version":"1.0","event_id":"sha256:3cc0cb2c11668acd868929533f8b1fb1220e9a869227ab3d0af69d5b47859349"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/bundle.json","state_url":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YT7TAEXA3GESMJVZQXNHU57AS5/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-05-28T03:29:38Z","links":{"resolver":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5","bundle":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/bundle.json","state":"https://pith.science/pith/YT7TAEXA3GESMJVZQXNHU57AS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YT7TAEXA3GESMJVZQXNHU57AS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YT7TAEXA3GESMJVZQXNHU57AS5","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":"0fa45ba7166cccffd11ddcfef261bac8bee7abe4363468423f7664a2f544583d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T20:50:29Z","title_canon_sha256":"d3081741a6da24804134171a357b84a00293f7661045d5c4317cfd27b58d0342"},"schema_version":"1.0","source":{"id":"1401.4451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.4451","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"arxiv_version","alias_value":"1401.4451v2","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.4451","created_at":"2026-05-18T03:00:48Z"},{"alias_kind":"pith_short_12","alias_value":"YT7TAEXA3GES","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YT7TAEXA3GESMJVZ","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YT7TAEXA","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:3cc0cb2c11668acd868929533f8b1fb1220e9a869227ab3d0af69d5b47859349","target":"graph","created_at":"2026-05-18T03:00:48Z","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"},"paper":{"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","authors_text":"Alex Sprintson, Mayank Bakshi, Sidharth Jaggi, Swanand Kadhe","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T20:50:29Z","title":"Reliable, Deniable, and Hidable Communication over Multipath Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.4451","kind":"arxiv","version":2},"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:f34cc5ed3fe7881cd3682c75dd3054b3094bc9b4e5a927217792e1727935eeb6","target":"record","created_at":"2026-05-18T03:00:48Z","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":"0fa45ba7166cccffd11ddcfef261bac8bee7abe4363468423f7664a2f544583d","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-01-17T20:50:29Z","title_canon_sha256":"d3081741a6da24804134171a357b84a00293f7661045d5c4317cfd27b58d0342"},"schema_version":"1.0","source":{"id":"1401.4451","kind":"arxiv","version":2}},"canonical_sha256":"c4ff3012e0d9892626b985da7a77e0974f334479731cb9d06b75b6c7564a329e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4ff3012e0d9892626b985da7a77e0974f334479731cb9d06b75b6c7564a329e","first_computed_at":"2026-05-18T03:00:48.847809Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:00:48.847809Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XBbyRMmteXzhl6wm0UO2G1eZyDwBtD6SUxpM4YqRAG/7vXNqv3AfFUH0MFo14/wOUZ/NPlwTg25TSjsTm6WLBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:00:48.848588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.4451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f34cc5ed3fe7881cd3682c75dd3054b3094bc9b4e5a927217792e1727935eeb6","sha256:3cc0cb2c11668acd868929533f8b1fb1220e9a869227ab3d0af69d5b47859349"],"state_sha256":"7aaa79641d1f2d8c3bb36e5ce798deec1bced0b5090b1b2eaccc0c108b2ab973"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Hp7+Q1IDy1gqvzsIwpksO4KEatCR53jbml6so17noncBwsdMy0s4IMZ7tJTUP0ugEmfMxrnJxQSSiwVrSv9AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:29:38.728127Z","bundle_sha256":"275781ea40a1109bf35a50ac4bbc232df25f64efb99bb8ebe225fb43eb193abe"}}