{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AGGTQNMNZMUDIXCDQDACQNA2FP","short_pith_number":"pith:AGGTQNMN","canonical_record":{"source":{"id":"1505.01390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T15:10:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46f4bbf04a6fc3789d93ab9d74c3967f3f7b31439333caa5ef345ec4e0c569cb","abstract_canon_sha256":"0f958f77c55ed2ed2ae6e7d597da68618e2a37afb25844ca12ab64b2227e3dff"},"schema_version":"1.0"},"canonical_sha256":"018d38358dcb28345c4380c028341a2bce567df636fdae07fc9667173179fbc7","source":{"kind":"arxiv","id":"1505.01390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01390","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01390v1","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01390","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"AGGTQNMNZMUD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGGTQNMNZMUDIXCD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGGTQNMN","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AGGTQNMNZMUDIXCDQDACQNA2FP","target":"record","payload":{"canonical_record":{"source":{"id":"1505.01390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T15:10:58Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"46f4bbf04a6fc3789d93ab9d74c3967f3f7b31439333caa5ef345ec4e0c569cb","abstract_canon_sha256":"0f958f77c55ed2ed2ae6e7d597da68618e2a37afb25844ca12ab64b2227e3dff"},"schema_version":"1.0"},"canonical_sha256":"018d38358dcb28345c4380c028341a2bce567df636fdae07fc9667173179fbc7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:16:49.511118Z","signature_b64":"8g2a2t9G15HghshJUgqNNhqJ6FszVFZJ1nOtM/mcybMeO0ieQaVECbmYNsd9sJ3U2Y5UmQbbjCuXSUrpm+grCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"018d38358dcb28345c4380c028341a2bce567df636fdae07fc9667173179fbc7","last_reissued_at":"2026-05-18T02:16:49.510415Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:16:49.510415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.01390","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:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rmFCLHXVCxXrB0g9cI0XICc7BPD+zxqowtHRCfUgBXKTITSfY7H8zuLoQUwcLJ8SOM6O2MRp7RfjQlZtLIh4BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:17:08.528383Z"},"content_sha256":"180cc4ffb720a7254fa60dc4cd68974682952a48cbc4739a1825b7933d4c7386","schema_version":"1.0","event_id":"sha256:180cc4ffb720a7254fa60dc4cd68974682952a48cbc4739a1825b7933d4c7386"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AGGTQNMNZMUDIXCDQDACQNA2FP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Optimality of Secure Network Coding","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Jiyong Lu, Xuan Guang","submitted_at":"2015-05-06T15:10:58Z","abstract_excerpt":"In network communications, information transmission often encounters wiretapping attacks. Secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of source symbols and random symbols are two fundamental research problems. For an important case that each wiretap-set with cardinality not larger than $r$, Cai and Yeung proposed a coding scheme, which is optimal in the senses of maximizing the number of source symbols and at the same time minimizing the number of random symbols. In this letter, we further s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01390","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:16:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XIVaAYeG8zdyAlKOljB8QWbeoPjdsFtKcOr5n6W/2rc0OTP1PmCIrjqFlBAhQfLaTFcCJduGeEMhEOvEtesQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:17:08.529128Z"},"content_sha256":"fa16a1db82da7314c0629c28a4a4bff8eb8e17d1543d3d1094f7589d6ff35a3d","schema_version":"1.0","event_id":"sha256:fa16a1db82da7314c0629c28a4a4bff8eb8e17d1543d3d1094f7589d6ff35a3d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AGGTQNMNZMUDIXCDQDACQNA2FP/bundle.json","state_url":"https://pith.science/pith/AGGTQNMNZMUDIXCDQDACQNA2FP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AGGTQNMNZMUDIXCDQDACQNA2FP/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-11T06:17:08Z","links":{"resolver":"https://pith.science/pith/AGGTQNMNZMUDIXCDQDACQNA2FP","bundle":"https://pith.science/pith/AGGTQNMNZMUDIXCDQDACQNA2FP/bundle.json","state":"https://pith.science/pith/AGGTQNMNZMUDIXCDQDACQNA2FP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AGGTQNMNZMUDIXCDQDACQNA2FP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AGGTQNMNZMUDIXCDQDACQNA2FP","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":"0f958f77c55ed2ed2ae6e7d597da68618e2a37afb25844ca12ab64b2227e3dff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T15:10:58Z","title_canon_sha256":"46f4bbf04a6fc3789d93ab9d74c3967f3f7b31439333caa5ef345ec4e0c569cb"},"schema_version":"1.0","source":{"id":"1505.01390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.01390","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"arxiv_version","alias_value":"1505.01390v1","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.01390","created_at":"2026-05-18T02:16:49Z"},{"alias_kind":"pith_short_12","alias_value":"AGGTQNMNZMUD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AGGTQNMNZMUDIXCD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AGGTQNMN","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:fa16a1db82da7314c0629c28a4a4bff8eb8e17d1543d3d1094f7589d6ff35a3d","target":"graph","created_at":"2026-05-18T02:16:49Z","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":"In network communications, information transmission often encounters wiretapping attacks. Secure network coding is introduced to prevent information from being leaked to adversaries. The investigation of performance bounds on the numbers of source symbols and random symbols are two fundamental research problems. For an important case that each wiretap-set with cardinality not larger than $r$, Cai and Yeung proposed a coding scheme, which is optimal in the senses of maximizing the number of source symbols and at the same time minimizing the number of random symbols. In this letter, we further s","authors_text":"Fang-Wei Fu, Jiyong Lu, Xuan Guang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T15:10:58Z","title":"On the Optimality of Secure Network Coding"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.01390","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:180cc4ffb720a7254fa60dc4cd68974682952a48cbc4739a1825b7933d4c7386","target":"record","created_at":"2026-05-18T02:16:49Z","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":"0f958f77c55ed2ed2ae6e7d597da68618e2a37afb25844ca12ab64b2227e3dff","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-06T15:10:58Z","title_canon_sha256":"46f4bbf04a6fc3789d93ab9d74c3967f3f7b31439333caa5ef345ec4e0c569cb"},"schema_version":"1.0","source":{"id":"1505.01390","kind":"arxiv","version":1}},"canonical_sha256":"018d38358dcb28345c4380c028341a2bce567df636fdae07fc9667173179fbc7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"018d38358dcb28345c4380c028341a2bce567df636fdae07fc9667173179fbc7","first_computed_at":"2026-05-18T02:16:49.510415Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:16:49.510415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8g2a2t9G15HghshJUgqNNhqJ6FszVFZJ1nOtM/mcybMeO0ieQaVECbmYNsd9sJ3U2Y5UmQbbjCuXSUrpm+grCg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:16:49.511118Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.01390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:180cc4ffb720a7254fa60dc4cd68974682952a48cbc4739a1825b7933d4c7386","sha256:fa16a1db82da7314c0629c28a4a4bff8eb8e17d1543d3d1094f7589d6ff35a3d"],"state_sha256":"8b0fc6f3259a45fc98c7a8f1e329f12a288f9b204d127dfed7db903526be512c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kNoIsaZRTUEG1y9qA+CFBTj3JSfUuUXhrYFDJxpxFILFzWBOjFMl7cXq+tcW3HqngtCXB49cVSYH4BB4AeP5BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:17:08.533601Z","bundle_sha256":"b68893cfccecad329d04e6905bc196509fe5316ba6ba3b74f1e31945d1228206"}}