{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WPU4QUQQ3DALYCTG2HUIHGTTMS","short_pith_number":"pith:WPU4QUQQ","schema_version":"1.0","canonical_sha256":"b3e9c85210d8c0bc0a66d1e8839a736492130792f06ea90ba67900ed39b78e73","source":{"kind":"arxiv","id":"1305.1415","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.1415","created_at":"2026-05-18T03:26:21.839203+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.1415v1","created_at":"2026-05-18T03:26:21.839203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1415","created_at":"2026-05-18T03:26:21.839203+00:00"},{"alias_kind":"pith_short_12","alias_value":"WPU4QUQQ3DAL","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WPU4QUQQ3DALYCTG","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WPU4QUQQ","created_at":"2026-05-18T12:28:04.890932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS","json":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS.json","graph_json":"https://pith.science/api/pith-number/WPU4QUQQ3DALYCTG2HUIHGTTMS/graph.json","events_json":"https://pith.science/api/pith-number/WPU4QUQQ3DALYCTG2HUIHGTTMS/events.json","paper":"https://pith.science/paper/WPU4QUQQ"},"agent_actions":{"view_html":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS","download_json":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS.json","view_paper":"https://pith.science/paper/WPU4QUQQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.1415&json=true","fetch_graph":"https://pith.science/api/pith-number/WPU4QUQQ3DALYCTG2HUIHGTTMS/graph.json","fetch_events":"https://pith.science/api/pith-number/WPU4QUQQ3DALYCTG2HUIHGTTMS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/action/storage_attestation","attest_author":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/action/author_attestation","sign_citation":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/action/citation_signature","submit_replication":"https://pith.science/pith/WPU4QUQQ3DALYCTG2HUIHGTTMS/action/replication_record"}},"created_at":"2026-05-18T03:26:21.839203+00:00","updated_at":"2026-05-18T03:26:21.839203+00:00"}