{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4VVQUXZ6KX5DF6NEL42D74XPOY","short_pith_number":"pith:4VVQUXZ6","schema_version":"1.0","canonical_sha256":"e56b0a5f3e55fa32f9a45f343ff2ef76192b48a2e68f76bd72e00e1eb94e15a5","source":{"kind":"arxiv","id":"1811.02388","version":1},"attestation_state":"computed","paper":{"title":"Local-Encoding-Preserving Secure Network Coding---Part I: Fixed Security Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Raymond W. Yeung, Xuan Guang","submitted_at":"2018-11-06T14:59:27Z","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"},"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":"1811.02388","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:27Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"6e84194527cde04f6217eff2c5897e9746a908d1034983449312dd6f27574a69","abstract_canon_sha256":"6024ee6bcda02b13355221258b8f351018d8b533649ada20a4ecce6f695aed0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.405621Z","signature_b64":"MNCOclDjRT18eg9c7Lc52dZ2Sou+tieYuRZZJfrEuOsO7irBySJkZZqNU4v+DdeYqJbHsJ2YF3GlB3T+lnB6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e56b0a5f3e55fa32f9a45f343ff2ef76192b48a2e68f76bd72e00e1eb94e15a5","last_reissued_at":"2026-05-18T00:01:24.405185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.405185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local-Encoding-Preserving Secure Network Coding---Part I: Fixed Security Level","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Fang-Wei Fu, Raymond W. Yeung, Xuan Guang","submitted_at":"2018-11-06T14:59:27Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02388","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":"1811.02388","created_at":"2026-05-18T00:01:24.405253+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02388v1","created_at":"2026-05-18T00:01:24.405253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02388","created_at":"2026-05-18T00:01:24.405253+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VVQUXZ6KX5D","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VVQUXZ6KX5DF6NE","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VVQUXZ6","created_at":"2026-05-18T12:32:05.422762+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/4VVQUXZ6KX5DF6NEL42D74XPOY","json":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY.json","graph_json":"https://pith.science/api/pith-number/4VVQUXZ6KX5DF6NEL42D74XPOY/graph.json","events_json":"https://pith.science/api/pith-number/4VVQUXZ6KX5DF6NEL42D74XPOY/events.json","paper":"https://pith.science/paper/4VVQUXZ6"},"agent_actions":{"view_html":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY","download_json":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY.json","view_paper":"https://pith.science/paper/4VVQUXZ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02388&json=true","fetch_graph":"https://pith.science/api/pith-number/4VVQUXZ6KX5DF6NEL42D74XPOY/graph.json","fetch_events":"https://pith.science/api/pith-number/4VVQUXZ6KX5DF6NEL42D74XPOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY/action/storage_attestation","attest_author":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY/action/author_attestation","sign_citation":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY/action/citation_signature","submit_replication":"https://pith.science/pith/4VVQUXZ6KX5DF6NEL42D74XPOY/action/replication_record"}},"created_at":"2026-05-18T00:01:24.405253+00:00","updated_at":"2026-05-18T00:01:24.405253+00:00"}