{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:M7RAE3PSGZWDXDKUHOPCWQW3QO","short_pith_number":"pith:M7RAE3PS","canonical_record":{"source":{"id":"1907.03522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-08T11:29:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4530eb4d5b35549f2c5ff726ac807b162a5aae69275c0abaf6ffe15784c60820","abstract_canon_sha256":"a7969ad7449f9e0930a00564f985e7e0752ec73a43b291d0c17deaa3a4522266"},"schema_version":"1.0"},"canonical_sha256":"67e2026df2366c3b8d543b9e2b42db839d3fa308b79eb341588c2af433622806","source":{"kind":"arxiv","id":"1907.03522","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03522","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03522v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03522","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"M7RAE3PSGZWD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M7RAE3PSGZWDXDKU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M7RAE3PS","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:M7RAE3PSGZWDXDKUHOPCWQW3QO","target":"record","payload":{"canonical_record":{"source":{"id":"1907.03522","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-08T11:29:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"4530eb4d5b35549f2c5ff726ac807b162a5aae69275c0abaf6ffe15784c60820","abstract_canon_sha256":"a7969ad7449f9e0930a00564f985e7e0752ec73a43b291d0c17deaa3a4522266"},"schema_version":"1.0"},"canonical_sha256":"67e2026df2366c3b8d543b9e2b42db839d3fa308b79eb341588c2af433622806","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:41:14.401415Z","signature_b64":"9oztBWm/Z7ZtKz0RjKsouefj0e8DHjH5YhFTKL5Mjnh10kj2IQEr5eiXK2qWpBOzXNpjCRm0cFA/vlyM5opOBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67e2026df2366c3b8d543b9e2b42db839d3fa308b79eb341588c2af433622806","last_reissued_at":"2026-05-17T23:41:14.401065Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:41:14.401065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.03522","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-17T23:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rh4DZ3JEwH4rGESqZb8fOaaeOJHLRG5X7VdIshFEwnUd6RkRl9mlVYGJArnxV+uUeRcwk83RabjlIQ4MVnMxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:32:05.037326Z"},"content_sha256":"0dd0d659d64e5a50afa7f2c9bf4b20c99f3245d258c05410d33ad9c2c5c4f800","schema_version":"1.0","event_id":"sha256:0dd0d659d64e5a50afa7f2c9bf4b20c99f3245d258c05410d33ad9c2c5c4f800"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:M7RAE3PSGZWDXDKUHOPCWQW3QO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Debaditya Chaudhuri, Michael Langberg, Michelle Effros","submitted_at":"2019-07-08T11:29:27Z","abstract_excerpt":"It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to $z$ network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances --- a well known open problem. This work treats an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03522","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-17T23:41:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzGfsyYGUClfQKXVQNXBpBaNczZjlOW2UcAeqQCKEyybEAvit4dnYXTsoWrXAKJ4yAVBwbwp6VFGnUpMue2KAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T07:32:05.037703Z"},"content_sha256":"ef968586d48e527b5361ce4c97a3f5c64bcbb8d7d3dde4610f65d182cc300cbc","schema_version":"1.0","event_id":"sha256:ef968586d48e527b5361ce4c97a3f5c64bcbb8d7d3dde4610f65d182cc300cbc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO/bundle.json","state_url":"https://pith.science/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO/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-27T07:32:05Z","links":{"resolver":"https://pith.science/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO","bundle":"https://pith.science/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO/bundle.json","state":"https://pith.science/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M7RAE3PSGZWDXDKUHOPCWQW3QO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:M7RAE3PSGZWDXDKUHOPCWQW3QO","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":"a7969ad7449f9e0930a00564f985e7e0752ec73a43b291d0c17deaa3a4522266","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-08T11:29:27Z","title_canon_sha256":"4530eb4d5b35549f2c5ff726ac807b162a5aae69275c0abaf6ffe15784c60820"},"schema_version":"1.0","source":{"id":"1907.03522","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03522","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03522v1","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03522","created_at":"2026-05-17T23:41:14Z"},{"alias_kind":"pith_short_12","alias_value":"M7RAE3PSGZWD","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"M7RAE3PSGZWDXDKU","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"M7RAE3PS","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:ef968586d48e527b5361ce4c97a3f5c64bcbb8d7d3dde4610f65d182cc300cbc","target":"graph","created_at":"2026-05-17T23:41:14Z","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":"It is common in the study of secure multicast network coding in the presence of an eavesdropper that has access to $z$ network links, to assume that the source node is the only node that generates random keys. In this setting, the secure multicast rate is well understood. Computing the secure multicast rate, or even the secure unicast rate, in the more general setting in which all network nodes may generate (independent) random keys is known to be as difficult as computing the (non-secure) capacity of multiple-unicast network coding instances --- a well known open problem. This work treats an ","authors_text":"Debaditya Chaudhuri, Michael Langberg, Michelle Effros","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-08T11:29:27Z","title":"Secure Network Coding in the Setting in Which a Non-Source Node May Generate Random Keys"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03522","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:0dd0d659d64e5a50afa7f2c9bf4b20c99f3245d258c05410d33ad9c2c5c4f800","target":"record","created_at":"2026-05-17T23:41:14Z","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":"a7969ad7449f9e0930a00564f985e7e0752ec73a43b291d0c17deaa3a4522266","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2019-07-08T11:29:27Z","title_canon_sha256":"4530eb4d5b35549f2c5ff726ac807b162a5aae69275c0abaf6ffe15784c60820"},"schema_version":"1.0","source":{"id":"1907.03522","kind":"arxiv","version":1}},"canonical_sha256":"67e2026df2366c3b8d543b9e2b42db839d3fa308b79eb341588c2af433622806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"67e2026df2366c3b8d543b9e2b42db839d3fa308b79eb341588c2af433622806","first_computed_at":"2026-05-17T23:41:14.401065Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:41:14.401065Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9oztBWm/Z7ZtKz0RjKsouefj0e8DHjH5YhFTKL5Mjnh10kj2IQEr5eiXK2qWpBOzXNpjCRm0cFA/vlyM5opOBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:41:14.401415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03522","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0dd0d659d64e5a50afa7f2c9bf4b20c99f3245d258c05410d33ad9c2c5c4f800","sha256:ef968586d48e527b5361ce4c97a3f5c64bcbb8d7d3dde4610f65d182cc300cbc"],"state_sha256":"9f4627d48331532c319c63c9632327a27a03d65351c30e7cb3afc14c5bb59a80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yMDbZA8WMkNT5WMdSdJTybvhfp8cscNie6TznEkYAPiVRDFCB2127J+4ApFELT8LNYNGju0IL9ImFZttYnPmBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T07:32:05.039811Z","bundle_sha256":"41dead3bdfbc48e7c3b5a60b7a3777dec555a36353bda917a956dc3298e6b1bf"}}