{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SO3WHPLSMG5G2QBBHBHLISRJS7","short_pith_number":"pith:SO3WHPLS","canonical_record":{"source":{"id":"1305.1082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T04:16:26Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"2f5774d6556c1a79a71d8173c40d1d3015d553fd3d7e0274e486f8af2e20293f","abstract_canon_sha256":"1276c0a52243062d8f490efac68b7e12a3a1482463c67558e081cfecfa4e053c"},"schema_version":"1.0"},"canonical_sha256":"93b763bd7261ba6d4021384eb44a2997f5289f26430e8bddca0c97f893616082","source":{"kind":"arxiv","id":"1305.1082","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1082","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1082v1","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1082","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"SO3WHPLSMG5G","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SO3WHPLSMG5G2QBB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SO3WHPLS","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SO3WHPLSMG5G2QBBHBHLISRJS7","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1082","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T04:16:26Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"2f5774d6556c1a79a71d8173c40d1d3015d553fd3d7e0274e486f8af2e20293f","abstract_canon_sha256":"1276c0a52243062d8f490efac68b7e12a3a1482463c67558e081cfecfa4e053c"},"schema_version":"1.0"},"canonical_sha256":"93b763bd7261ba6d4021384eb44a2997f5289f26430e8bddca0c97f893616082","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:24.180532Z","signature_b64":"/7oIvtO8GlNvyu3IGtuHA5/+7IZgHT9TcHecYdjjyrkLgeI+XPhd0hdqcHowKZXuA9ZKHBhEjL2BVg/KP9zKCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93b763bd7261ba6d4021384eb44a2997f5289f26430e8bddca0c97f893616082","last_reissued_at":"2026-05-18T03:26:24.180000Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:24.180000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1082","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:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dq9z0w8wnHjqRp80QdzMo+heQjNfRIsd0PV2ss0Imd+kFgSRBa3dHw55/ysdCN+8wMKnbrLBereh+9FVoXz7Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:34.685120Z"},"content_sha256":"2a4d40ad60fbe7353257aea2aa6e169463751a15f1b255bc891107f41cf77b82","schema_version":"1.0","event_id":"sha256:2a4d40ad60fbe7353257aea2aa6e169463751a15f1b255bc891107f41cf77b82"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SO3WHPLSMG5G2QBBHBHLISRJS7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Random Linear Network Codes for Secrecy over Wireless Broadcast Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Parastoo Sadeghi, Shahriar Etemadi Tajbakhsh","submitted_at":"2013-05-06T04:16:26Z","abstract_excerpt":"We consider a set of $n$ messages and a group of $k$ clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method for secretly delivering each message to its privileged recipients in a way that each receiver can decode its own messages but not the others'. Our method is based on combining the messages using linear network coding and hiding the decoding coefficients from the unprivileged clients. We provide an information theoretic proof for the secrecy of the proposed me"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1082","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:26:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8gfRzMWw4jewz/zkoko0Xfxq99B77N9FS6QVcdEH1oMzaBmFkSw6Pb0On8AU569EIJh8QEpQ4DGRXVsmmr0NBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:39:34.685570Z"},"content_sha256":"e8579021aeeb3945501405897d3d19400dbc94dc4b38a2aeceae55bc40475636","schema_version":"1.0","event_id":"sha256:e8579021aeeb3945501405897d3d19400dbc94dc4b38a2aeceae55bc40475636"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SO3WHPLSMG5G2QBBHBHLISRJS7/bundle.json","state_url":"https://pith.science/pith/SO3WHPLSMG5G2QBBHBHLISRJS7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SO3WHPLSMG5G2QBBHBHLISRJS7/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-06-05T16:39:34Z","links":{"resolver":"https://pith.science/pith/SO3WHPLSMG5G2QBBHBHLISRJS7","bundle":"https://pith.science/pith/SO3WHPLSMG5G2QBBHBHLISRJS7/bundle.json","state":"https://pith.science/pith/SO3WHPLSMG5G2QBBHBHLISRJS7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SO3WHPLSMG5G2QBBHBHLISRJS7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SO3WHPLSMG5G2QBBHBHLISRJS7","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":"1276c0a52243062d8f490efac68b7e12a3a1482463c67558e081cfecfa4e053c","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T04:16:26Z","title_canon_sha256":"2f5774d6556c1a79a71d8173c40d1d3015d553fd3d7e0274e486f8af2e20293f"},"schema_version":"1.0","source":{"id":"1305.1082","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1082","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1082v1","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1082","created_at":"2026-05-18T03:26:24Z"},{"alias_kind":"pith_short_12","alias_value":"SO3WHPLSMG5G","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SO3WHPLSMG5G2QBB","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SO3WHPLS","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:e8579021aeeb3945501405897d3d19400dbc94dc4b38a2aeceae55bc40475636","target":"graph","created_at":"2026-05-18T03:26:24Z","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 set of $n$ messages and a group of $k$ clients. Each client is privileged for receiving an arbitrary subset of the messages over a broadcast erasure channel, which generalizes scenario of a previous work. We propose a method for secretly delivering each message to its privileged recipients in a way that each receiver can decode its own messages but not the others'. Our method is based on combining the messages using linear network coding and hiding the decoding coefficients from the unprivileged clients. We provide an information theoretic proof for the secrecy of the proposed me","authors_text":"Parastoo Sadeghi, Shahriar Etemadi Tajbakhsh","cross_cats":["cs.CR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T04:16:26Z","title":"Random Linear Network Codes for Secrecy over Wireless Broadcast Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1082","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:2a4d40ad60fbe7353257aea2aa6e169463751a15f1b255bc891107f41cf77b82","target":"record","created_at":"2026-05-18T03:26:24Z","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":"1276c0a52243062d8f490efac68b7e12a3a1482463c67558e081cfecfa4e053c","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-06T04:16:26Z","title_canon_sha256":"2f5774d6556c1a79a71d8173c40d1d3015d553fd3d7e0274e486f8af2e20293f"},"schema_version":"1.0","source":{"id":"1305.1082","kind":"arxiv","version":1}},"canonical_sha256":"93b763bd7261ba6d4021384eb44a2997f5289f26430e8bddca0c97f893616082","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93b763bd7261ba6d4021384eb44a2997f5289f26430e8bddca0c97f893616082","first_computed_at":"2026-05-18T03:26:24.180000Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:24.180000Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/7oIvtO8GlNvyu3IGtuHA5/+7IZgHT9TcHecYdjjyrkLgeI+XPhd0hdqcHowKZXuA9ZKHBhEjL2BVg/KP9zKCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:24.180532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1082","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a4d40ad60fbe7353257aea2aa6e169463751a15f1b255bc891107f41cf77b82","sha256:e8579021aeeb3945501405897d3d19400dbc94dc4b38a2aeceae55bc40475636"],"state_sha256":"f689295f58b39b3ab9804683e2b702f13d155bca0b66399c6517594cad3c4c94"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"31EwU0OjbYZqS82XK8QfPALrKMMMpvtrKc9/ftdeiAiJ5nW0za4YEwMFYwxPks4oYMXXIcGZ8w1eo/21RkohCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:39:34.687596Z","bundle_sha256":"d733a1731cfc57c569d1a3f90d516e6ee5ce57747372f8b9263eff97d382da53"}}