{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:EM7PNR6RM7B6C3DC4II33DPSCE","short_pith_number":"pith:EM7PNR6R","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"},"canonical_sha256":"233ef6c7d167c3e16c62e211bd8df21115eb629820a3a6da11db697592bc99cc","source":{"kind":"arxiv","id":"1504.05662","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05662","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05662v1","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05662","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"EM7PNR6RM7B6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EM7PNR6RM7B6C3DC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EM7PNR6R","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:EM7PNR6RM7B6C3DC4II33DPSCE","target":"record","payload":{"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"},"canonical_sha256":"233ef6c7d167c3e16c62e211bd8df21115eb629820a3a6da11db697592bc99cc","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"},"source_kind":"arxiv","source_id":"1504.05662","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-18T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eRZEORJD47VOVCkxj6Ovyuotc/hod8pEhPtrnaJFHRQaQJiahNGb1hxR3lQZ98zIxhBbwsKtGb/EU2CAbeQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:52:33.574939Z"},"content_sha256":"c50cc0685d30de3f9b55a193a0a0a6b3ccb43ebd9d2d683619dc548e3b27c666","schema_version":"1.0","event_id":"sha256:c50cc0685d30de3f9b55a193a0a0a6b3ccb43ebd9d2d683619dc548e3b27c666"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:EM7PNR6RM7B6C3DC4II33DPSCE","target":"graph","payload":{"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"},"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-18T02:18:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+iWtMGZ+RWjQIHLyb9DCn5zl4iCu0uKUVHv0lL/tkAkur1yqgRUV/5q2BdnSKeO+QEAoqkG8+NL0Obm5J2q/Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T03:52:33.575292Z"},"content_sha256":"4912399cbf89a9131e5d621a7d8e28209f94313237c99f7161546ed519228c73","schema_version":"1.0","event_id":"sha256:4912399cbf89a9131e5d621a7d8e28209f94313237c99f7161546ed519228c73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/bundle.json","state_url":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EM7PNR6RM7B6C3DC4II33DPSCE/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-04T03:52:33Z","links":{"resolver":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE","bundle":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/bundle.json","state":"https://pith.science/pith/EM7PNR6RM7B6C3DC4II33DPSCE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EM7PNR6RM7B6C3DC4II33DPSCE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:EM7PNR6RM7B6C3DC4II33DPSCE","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":"40d9be73fb136b3044b6180147f5d3701d752230a0814e392d974aabdfd57861","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T05:57:30Z","title_canon_sha256":"a8d9f06a9ef26644ef7d7dbbc6a2f057a6b3fa57d45c66fd552781ca2c688f8d"},"schema_version":"1.0","source":{"id":"1504.05662","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05662","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05662v1","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05662","created_at":"2026-05-18T02:18:13Z"},{"alias_kind":"pith_short_12","alias_value":"EM7PNR6RM7B6","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"EM7PNR6RM7B6C3DC","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"EM7PNR6R","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:4912399cbf89a9131e5d621a7d8e28209f94313237c99f7161546ed519228c73","target":"graph","created_at":"2026-05-18T02:18:13Z","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 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$. ","authors_text":"Chau Yuen, Son Hoang Dau, Wentu Song","cross_cats":["math.CO","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T05:57:30Z","title":"Weakly Secure MDS Codes for Simple Multiple Access Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05662","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:c50cc0685d30de3f9b55a193a0a0a6b3ccb43ebd9d2d683619dc548e3b27c666","target":"record","created_at":"2026-05-18T02:18:13Z","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":"40d9be73fb136b3044b6180147f5d3701d752230a0814e392d974aabdfd57861","cross_cats_sorted":["math.CO","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-04-22T05:57:30Z","title_canon_sha256":"a8d9f06a9ef26644ef7d7dbbc6a2f057a6b3fa57d45c66fd552781ca2c688f8d"},"schema_version":"1.0","source":{"id":"1504.05662","kind":"arxiv","version":1}},"canonical_sha256":"233ef6c7d167c3e16c62e211bd8df21115eb629820a3a6da11db697592bc99cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"233ef6c7d167c3e16c62e211bd8df21115eb629820a3a6da11db697592bc99cc","first_computed_at":"2026-05-18T02:18:13.020987Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:18:13.020987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fU96jwb7mp5RWi3/QrAbVfR3M3IAceCAdUnHATC6KrZgxMqEpa3dW341TDpbrzAhbDZdKz3wXtU2bmsBJ0DKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:18:13.021717Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05662","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c50cc0685d30de3f9b55a193a0a0a6b3ccb43ebd9d2d683619dc548e3b27c666","sha256:4912399cbf89a9131e5d621a7d8e28209f94313237c99f7161546ed519228c73"],"state_sha256":"b67a4204bdae7ce9c15be574a8bf1f5aa1a110ca0af6cf1616abf12b6dab13ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O2ZLcX9pV3XFn5Os/ovQ3hBdyM9I+wLd1gCJftL4HV3/p5H+59ZcnceWqA8kW+Tso0Rm3jME/n0/yTzHVyyDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T03:52:33.577452Z","bundle_sha256":"90cc823407c1ded7628a842bb525d23313d6fa903f6e6194b8b04915e4f0c24e"}}