{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:2FI7LMIPU7PRQ3ANSVUR4IH6MV","short_pith_number":"pith:2FI7LMIP","canonical_record":{"source":{"id":"1206.3133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-14T15:15:32Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"79762ba96290f4dbbb1729bfa17738d2f7af12e7e1007369624ae494f58f1c56","abstract_canon_sha256":"5091482a70098d4e5f4f6182aefaa9278e58e650b0d1fe39d2224df47601d1d4"},"schema_version":"1.0"},"canonical_sha256":"d151f5b10fa7df186c0d95691e20fe65599b55f6b6777437170abe71c3036d5f","source":{"kind":"arxiv","id":"1206.3133","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3133","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3133v1","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3133","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"2FI7LMIPU7PR","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2FI7LMIPU7PRQ3AN","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2FI7LMIP","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:2FI7LMIPU7PRQ3ANSVUR4IH6MV","target":"record","payload":{"canonical_record":{"source":{"id":"1206.3133","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-14T15:15:32Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"79762ba96290f4dbbb1729bfa17738d2f7af12e7e1007369624ae494f58f1c56","abstract_canon_sha256":"5091482a70098d4e5f4f6182aefaa9278e58e650b0d1fe39d2224df47601d1d4"},"schema_version":"1.0"},"canonical_sha256":"d151f5b10fa7df186c0d95691e20fe65599b55f6b6777437170abe71c3036d5f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:32.603397Z","signature_b64":"tQ0qL0h6AbhhhdoB+q36LFfkfdB5CiAvj8JKcw8xZuNJg3W/I0WUIyEcRwZhl8eq8FsXgEXV9h4DlZG0nmwSBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d151f5b10fa7df186c0d95691e20fe65599b55f6b6777437170abe71c3036d5f","last_reissued_at":"2026-05-18T03:53:32.602677Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:32.602677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.3133","source_version":1,"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:53:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Bz1shybu/0wUvjYA270WFnXlGbZ/VFxL8hngbatlke036k94EPq1FxPIwpuL50q6ol4h31pwOopBL2/NbMgIDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:02:41.453673Z"},"content_sha256":"46c8b0476c5f71d021e9ff94523b7d6541db34663630e759bb5af0557caf87b1","schema_version":"1.0","event_id":"sha256:46c8b0476c5f71d021e9ff94523b7d6541db34663630e759bb5af0557caf87b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:2FI7LMIPU7PRQ3ANSVUR4IH6MV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Christina Fragouli, Mahdi Jafari Siavoshani","submitted_at":"2012-06-14T15:15:32Z","abstract_excerpt":"We consider a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q) from one of the honest nodes (i.e., Alice) to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is also overheard by Eve.\n  For this setup, we propose upper and lower bounds for the secret key generation capacity assuming that the field size q is very large. For the case of two trusted terminals (m = "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3133","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"},"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:53:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mfnb4xssYJhlBCLF75EoMJTnk2aNdqx/NUcHR8eqWew8DV8LN9rNq1wqhOtpnVB1TBa+W1QQ06YMDW/2Gm8bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:02:41.454389Z"},"content_sha256":"c2d6a6ba7d53f266135ee630d1f804a1354256bf3785ad5360701bb85262d33e","schema_version":"1.0","event_id":"sha256:c2d6a6ba7d53f266135ee630d1f804a1354256bf3785ad5360701bb85262d33e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV/bundle.json","state_url":"https://pith.science/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV/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-30T20:02:41Z","links":{"resolver":"https://pith.science/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV","bundle":"https://pith.science/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV/bundle.json","state":"https://pith.science/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2FI7LMIPU7PRQ3ANSVUR4IH6MV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2FI7LMIPU7PRQ3ANSVUR4IH6MV","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":"5091482a70098d4e5f4f6182aefaa9278e58e650b0d1fe39d2224df47601d1d4","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-14T15:15:32Z","title_canon_sha256":"79762ba96290f4dbbb1729bfa17738d2f7af12e7e1007369624ae494f58f1c56"},"schema_version":"1.0","source":{"id":"1206.3133","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3133","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3133v1","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3133","created_at":"2026-05-18T03:53:32Z"},{"alias_kind":"pith_short_12","alias_value":"2FI7LMIPU7PR","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2FI7LMIPU7PRQ3AN","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2FI7LMIP","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:c2d6a6ba7d53f266135ee630d1f804a1354256bf3785ad5360701bb85262d33e","target":"graph","created_at":"2026-05-18T03:53:32Z","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 a group of m+1 trusted nodes that aim to create a shared secret key K over a network in the presence of a passive eavesdropper, Eve. We assume a linear non-coherent network coding broadcast channel (over a finite field F_q) from one of the honest nodes (i.e., Alice) to the rest of them including Eve. All of the trusted nodes can also discuss over a cost-free public channel which is also overheard by Eve.\n  For this setup, we propose upper and lower bounds for the secret key generation capacity assuming that the field size q is very large. For the case of two trusted terminals (m = ","authors_text":"Christina Fragouli, Mahdi Jafari Siavoshani","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-14T15:15:32Z","title":"Multi-terminal Secrecy in a Linear Non-coherent Packetized Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3133","kind":"arxiv","version":1},"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:46c8b0476c5f71d021e9ff94523b7d6541db34663630e759bb5af0557caf87b1","target":"record","created_at":"2026-05-18T03:53:32Z","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":"5091482a70098d4e5f4f6182aefaa9278e58e650b0d1fe39d2224df47601d1d4","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-06-14T15:15:32Z","title_canon_sha256":"79762ba96290f4dbbb1729bfa17738d2f7af12e7e1007369624ae494f58f1c56"},"schema_version":"1.0","source":{"id":"1206.3133","kind":"arxiv","version":1}},"canonical_sha256":"d151f5b10fa7df186c0d95691e20fe65599b55f6b6777437170abe71c3036d5f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d151f5b10fa7df186c0d95691e20fe65599b55f6b6777437170abe71c3036d5f","first_computed_at":"2026-05-18T03:53:32.602677Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:32.602677Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQ0qL0h6AbhhhdoB+q36LFfkfdB5CiAvj8JKcw8xZuNJg3W/I0WUIyEcRwZhl8eq8FsXgEXV9h4DlZG0nmwSBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:32.603397Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3133","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46c8b0476c5f71d021e9ff94523b7d6541db34663630e759bb5af0557caf87b1","sha256:c2d6a6ba7d53f266135ee630d1f804a1354256bf3785ad5360701bb85262d33e"],"state_sha256":"d59fde443a567353244b68091861b0c66390b8df1d22db0926677f6412e21968"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hmO+oOkfHICYVzmjQOypL2/ZdERUKKIOulnmFfoRmlUq/l5XOh6AsMkN6BTiwy1jh/zLRmYqPWZGEmMRBc0BAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:02:41.458176Z","bundle_sha256":"3aada8dd447b22c3fd9da83808ee0aa3776b1e69ee4e2aa9f7cee418e78296b5"}}