{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4VVQUXZ6KX5DF6NEL42D74XPOY","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":"6024ee6bcda02b13355221258b8f351018d8b533649ada20a4ecce6f695aed0f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:27Z","title_canon_sha256":"6e84194527cde04f6217eff2c5897e9746a908d1034983449312dd6f27574a69"},"schema_version":"1.0","source":{"id":"1811.02388","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02388","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02388v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02388","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"4VVQUXZ6KX5D","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4VVQUXZ6KX5DF6NE","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4VVQUXZ6","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:6457ba66a6c9570b1bb12603bcb2081a35b1a7bf37d11e768ac54e0ed9768c2b","target":"graph","created_at":"2026-05-18T00:01:24Z","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":"Information-theoretic security is considered in the paradigm of network coding in the presence of wiretappers, who can access one arbitrary edge subset up to a certain size, also referred to as the security level. Secure network coding is applied to prevent the leakage of the source information to the wiretappers. In this two-part paper, we consider the problem of secure network coding when the information rate and the security level can change over time. In the current paper (i.e., Part I of the two-part paper), we focus on the problem for a fixed security level and a flexible rate. To effici","authors_text":"Fang-Wei Fu, Raymond W. Yeung, Xuan Guang","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:27Z","title":"Local-Encoding-Preserving Secure Network Coding---Part I: Fixed Security Level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02388","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:0970583fb4300a1c512396c2ce03e2d007e5f6c9fffd1652c762ea713b656087","target":"record","created_at":"2026-05-18T00:01:24Z","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":"6024ee6bcda02b13355221258b8f351018d8b533649ada20a4ecce6f695aed0f","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:27Z","title_canon_sha256":"6e84194527cde04f6217eff2c5897e9746a908d1034983449312dd6f27574a69"},"schema_version":"1.0","source":{"id":"1811.02388","kind":"arxiv","version":1}},"canonical_sha256":"e56b0a5f3e55fa32f9a45f343ff2ef76192b48a2e68f76bd72e00e1eb94e15a5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e56b0a5f3e55fa32f9a45f343ff2ef76192b48a2e68f76bd72e00e1eb94e15a5","first_computed_at":"2026-05-18T00:01:24.405185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:24.405185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MNCOclDjRT18eg9c7Lc52dZ2Sou+tieYuRZZJfrEuOsO7irBySJkZZqNU4v+DdeYqJbHsJ2YF3GlB3T+lnB6Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:24.405621Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02388","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0970583fb4300a1c512396c2ce03e2d007e5f6c9fffd1652c762ea713b656087","sha256:6457ba66a6c9570b1bb12603bcb2081a35b1a7bf37d11e768ac54e0ed9768c2b"],"state_sha256":"c9249113947ea60e145952f11e49e7008bcc54bdb5d108ff0ca8b93027c3a77b"}