{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:EM7PNR6RM7B6C3DC4II33DPSCE","short_pith_number":"pith:EM7PNR6R","schema_version":"1.0","canonical_sha256":"233ef6c7d167c3e16c62e211bd8df21115eb629820a3a6da11db697592bc99cc","source":{"kind":"arxiv","id":"1504.05662","version":1},"attestation_state":"computed","paper":{"title":"Weakly Secure MDS Codes for Simple Multiple Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2015-04-22T05:57:30Z","abstract_excerpt":"We consider a simple multiple access network (SMAN), where $k$ sources of unit rates transmit their data to a common sink via $n$ relays. Each relay is connected to the sink and to certain sources. A coding scheme (for the relays) is weakly secure if a passive adversary who eavesdrops on less than $k$ relay-sink links cannot reconstruct the data from each source. We show that there exists a weakly secure maximum distance separable (MDS) coding scheme for the relays if and only if every subset of $\\ell$ relays must be collectively connected to at least $\\ell+1$ sources, for all $0 < \\ell < k$. "},"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":"1504.05662","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T05:57:30Z","cross_cats_sorted":["math.CO","math.IT"],"title_canon_sha256":"a8d9f06a9ef26644ef7d7dbbc6a2f057a6b3fa57d45c66fd552781ca2c688f8d","abstract_canon_sha256":"40d9be73fb136b3044b6180147f5d3701d752230a0814e392d974aabdfd57861"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:18:13.021717Z","signature_b64":"fU96jwb7mp5RWi3/QrAbVfR3M3IAceCAdUnHATC6KrZgxMqEpa3dW341TDpbrzAhbDZdKz3wXtU2bmsBJ0DKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"233ef6c7d167c3e16c62e211bd8df21115eb629820a3a6da11db697592bc99cc","last_reissued_at":"2026-05-18T02:18:13.020987Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:18:13.020987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Weakly Secure MDS Codes for Simple Multiple Access Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO","math.IT"],"primary_cat":"cs.IT","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","submitted_at":"2015-04-22T05:57:30Z","abstract_excerpt":"We consider a simple multiple access network (SMAN), where $k$ sources of unit rates transmit their data to a common sink via $n$ relays. Each relay is connected to the sink and to certain sources. A coding scheme (for the relays) is weakly secure if a passive adversary who eavesdrops on less than $k$ relay-sink links cannot reconstruct the data from each source. We show that there exists a weakly secure maximum distance separable (MDS) coding scheme for the relays if and only if every subset of $\\ell$ relays must be collectively connected to at least $\\ell+1$ sources, for all $0 < \\ell < k$. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05662","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":"1504.05662","created_at":"2026-05-18T02:18:13.021089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.05662v1","created_at":"2026-05-18T02:18:13.021089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05662","created_at":"2026-05-18T02:18:13.021089+00:00"},{"alias_kind":"pith_short_12","alias_value":"EM7PNR6RM7B6","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"EM7PNR6RM7B6C3DC","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"EM7PNR6R","created_at":"2026-05-18T12:29:19.899920+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/EM7PNR6RM7B6C3DC4II33DPSCE","json":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE.json","graph_json":"https://pith.science/api/pith-number/EM7PNR6RM7B6C3DC4II33DPSCE/graph.json","events_json":"https://pith.science/api/pith-number/EM7PNR6RM7B6C3DC4II33DPSCE/events.json","paper":"https://pith.science/paper/EM7PNR6R"},"agent_actions":{"view_html":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE","download_json":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE.json","view_paper":"https://pith.science/paper/EM7PNR6R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.05662&json=true","fetch_graph":"https://pith.science/api/pith-number/EM7PNR6RM7B6C3DC4II33DPSCE/graph.json","fetch_events":"https://pith.science/api/pith-number/EM7PNR6RM7B6C3DC4II33DPSCE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/action/storage_attestation","attest_author":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/action/author_attestation","sign_citation":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/action/citation_signature","submit_replication":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/action/replication_record"}},"created_at":"2026-05-18T02:18:13.021089+00:00","updated_at":"2026-05-18T02:18:13.021089+00:00"}