{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WPU4QUQQ3DALYCTG2HUIHGTTMS","short_pith_number":"pith:WPU4QUQQ","canonical_record":{"source":{"id":"1305.1415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T05:55:30Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"9b48ce8cb5dba6db07b86aff286c1adce1f9fe567fccff5959f18f734177ee53","abstract_canon_sha256":"6836a73d77e770c955ffa7432d94f0811be05ef05cea2c7be1cb53135f8e9402"},"schema_version":"1.0"},"canonical_sha256":"b3e9c85210d8c0bc0a66d1e8839a736492130792f06ea90ba67900ed39b78e73","source":{"kind":"arxiv","id":"1305.1415","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1415","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1415v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1415","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"WPU4QUQQ3DAL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WPU4QUQQ3DALYCTG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WPU4QUQQ","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WPU4QUQQ3DALYCTG2HUIHGTTMS","target":"record","payload":{"canonical_record":{"source":{"id":"1305.1415","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T05:55:30Z","cross_cats_sorted":["cs.CR","math.IT"],"title_canon_sha256":"9b48ce8cb5dba6db07b86aff286c1adce1f9fe567fccff5959f18f734177ee53","abstract_canon_sha256":"6836a73d77e770c955ffa7432d94f0811be05ef05cea2c7be1cb53135f8e9402"},"schema_version":"1.0"},"canonical_sha256":"b3e9c85210d8c0bc0a66d1e8839a736492130792f06ea90ba67900ed39b78e73","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:26:21.839722Z","signature_b64":"GM8WsDCshGR63WBAS1zRg7tsqIgcZxlGQjKYt9lbP55quO03BAToDYJo2GOqiDuZhtWtWnYzMQmQn+AWx3zFDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b3e9c85210d8c0bc0a66d1e8839a736492130792f06ea90ba67900ed39b78e73","last_reissued_at":"2026-05-18T03:26:21.839104Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:26:21.839104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.1415","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9eII0ioBbQd+DZfuOkKUWkBozXlC18fk7HGXRtgAXARSGCoGGudjw9+37a3do6IFYQC1pPXYFvaQfVny3idcCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:03:21.380541Z"},"content_sha256":"79584f7aa73efd7acd4213854cde22973be75f5b8ef2ff65fc32375952513162","schema_version":"1.0","event_id":"sha256:79584f7aa73efd7acd4213854cde22973be75f5b8ef2ff65fc32375952513162"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WPU4QUQQ3DALYCTG2HUIHGTTMS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Centralized and Cooperative Transmission of Secure Multiple Unicasts using Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","math.IT"],"primary_cat":"cs.IT","authors_text":"Parastoo Sadeghi, Rodney Kennedy, Shahriar Etemadi Tajbakhsh","submitted_at":"2013-05-07T05:55:30Z","abstract_excerpt":"We introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'. In the proposed method the messages are combined together using a special variant of random linear network coding. Each client is provided with a private set of decoding coefficients to decode its own message. Our method provides security for the transmission sessions against computational brute-force attacks and also weakly security in information theoreti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1415","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:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fKt2YSPQ6A9HQvwDAt+eUZZle+tb+iUobhled3j8bAUC6a65tPY5Ly13jGXvYlNejiiXjJ+aKzyzT/AFq8zBCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T14:03:21.380891Z"},"content_sha256":"eb5a901fa3a4bb1f1c95902e917661482745b09bdbec9b014040ecc0690afe7d","schema_version":"1.0","event_id":"sha256:eb5a901fa3a4bb1f1c95902e917661482745b09bdbec9b014040ecc0690afe7d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/bundle.json","state_url":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/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-05T14:03:21Z","links":{"resolver":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS","bundle":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/bundle.json","state":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WPU4QUQQ3DALYCTG2HUIHGTTMS","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":"6836a73d77e770c955ffa7432d94f0811be05ef05cea2c7be1cb53135f8e9402","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T05:55:30Z","title_canon_sha256":"9b48ce8cb5dba6db07b86aff286c1adce1f9fe567fccff5959f18f734177ee53"},"schema_version":"1.0","source":{"id":"1305.1415","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1415","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1415v1","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1415","created_at":"2026-05-18T03:26:21Z"},{"alias_kind":"pith_short_12","alias_value":"WPU4QUQQ3DAL","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WPU4QUQQ3DALYCTG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WPU4QUQQ","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:eb5a901fa3a4bb1f1c95902e917661482745b09bdbec9b014040ecc0690afe7d","target":"graph","created_at":"2026-05-18T03:26:21Z","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 introduce a method for securely delivering a set of messages to a group of clients over a broadcast erasure channel where each client is interested in a distinct message. Each client is able to obtain its own message but not the others'. In the proposed method the messages are combined together using a special variant of random linear network coding. Each client is provided with a private set of decoding coefficients to decode its own message. Our method provides security for the transmission sessions against computational brute-force attacks and also weakly security in information theoreti","authors_text":"Parastoo Sadeghi, Rodney Kennedy, 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-07T05:55:30Z","title":"Centralized and Cooperative Transmission of Secure Multiple Unicasts using Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1415","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:79584f7aa73efd7acd4213854cde22973be75f5b8ef2ff65fc32375952513162","target":"record","created_at":"2026-05-18T03:26:21Z","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":"6836a73d77e770c955ffa7432d94f0811be05ef05cea2c7be1cb53135f8e9402","cross_cats_sorted":["cs.CR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-05-07T05:55:30Z","title_canon_sha256":"9b48ce8cb5dba6db07b86aff286c1adce1f9fe567fccff5959f18f734177ee53"},"schema_version":"1.0","source":{"id":"1305.1415","kind":"arxiv","version":1}},"canonical_sha256":"b3e9c85210d8c0bc0a66d1e8839a736492130792f06ea90ba67900ed39b78e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b3e9c85210d8c0bc0a66d1e8839a736492130792f06ea90ba67900ed39b78e73","first_computed_at":"2026-05-18T03:26:21.839104Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:21.839104Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GM8WsDCshGR63WBAS1zRg7tsqIgcZxlGQjKYt9lbP55quO03BAToDYJo2GOqiDuZhtWtWnYzMQmQn+AWx3zFDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:21.839722Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1415","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79584f7aa73efd7acd4213854cde22973be75f5b8ef2ff65fc32375952513162","sha256:eb5a901fa3a4bb1f1c95902e917661482745b09bdbec9b014040ecc0690afe7d"],"state_sha256":"6fa7294ddbfe4a639d069b3d00b4187864a5e11dd226f325205f40c5a1fb4070"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmXWKIgnEpGdk0dwQysnIiiZgSsn7yGOYcp253TR2qvQK93eCHscbLG1SosgjyZFVSEq0gMNuHaHJP3KCIvfBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T14:03:21.382880Z","bundle_sha256":"bae0e60e0e2cc69bc6d5760ce712b3098d3ed20dcfa5580cb5c2fe7bdf0d484f"}}