{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4TNBZGBXZM5YIUKNLTNL4KXSQQ","short_pith_number":"pith:4TNBZGBX","schema_version":"1.0","canonical_sha256":"e4da1c9837cb3b84514d5cdabe2af2843de0038d3bbc6c8565b29b3217b8b25e","source":{"kind":"arxiv","id":"1811.02390","version":1},"attestation_state":"computed","paper":{"title":"Local-Encoding-Preserving Secure Network Coding---Part II: Flexible Rate and 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:45Z","abstract_excerpt":"In the two-part paper, we consider the problem of secure network coding when the information rate and the security level can change over time. To efficiently solve this problem, we put forward local-encoding-preserving secure network coding, where a family of secure linear network codes (SLNCs) is called local-encoding-preserving (LEP) if all the SLNCs in this family share a common local encoding kernel at each intermediate node in the network. In this paper (Part II), we first consider the design of a family of LEP SLNCs for a fixed rate and a flexible security level. We present a novel and e"},"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.02390","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:45Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"42499814b10423f054551aa0841b0447c46269923ba57cad642804edf22695e7","abstract_canon_sha256":"22b2f4bb42b042dffd01bec09ccf453b41eac8b473cf1926f30dc3d9738099c5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:24.392301Z","signature_b64":"uZZIOOJIX3fqHWqAPHpDIyt1ZfN8Azol9JTiyJMhXKGJWN0etlIMpMYDg9eJDZu8iDX9FkfHaNMN1ew8mtikBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4da1c9837cb3b84514d5cdabe2af2843de0038d3bbc6c8565b29b3217b8b25e","last_reissued_at":"2026-05-18T00:01:24.391882Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:24.391882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local-Encoding-Preserving Secure Network Coding---Part II: Flexible Rate and 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:45Z","abstract_excerpt":"In the two-part paper, we consider the problem of secure network coding when the information rate and the security level can change over time. To efficiently solve this problem, we put forward local-encoding-preserving secure network coding, where a family of secure linear network codes (SLNCs) is called local-encoding-preserving (LEP) if all the SLNCs in this family share a common local encoding kernel at each intermediate node in the network. In this paper (Part II), we first consider the design of a family of LEP SLNCs for a fixed rate and a flexible security level. We present a novel and e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02390","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.02390","created_at":"2026-05-18T00:01:24.391945+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.02390v1","created_at":"2026-05-18T00:01:24.391945+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02390","created_at":"2026-05-18T00:01:24.391945+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TNBZGBXZM5Y","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TNBZGBXZM5YIUKN","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TNBZGBX","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/4TNBZGBXZM5YIUKNLTNL4KXSQQ","json":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ.json","graph_json":"https://pith.science/api/pith-number/4TNBZGBXZM5YIUKNLTNL4KXSQQ/graph.json","events_json":"https://pith.science/api/pith-number/4TNBZGBXZM5YIUKNLTNL4KXSQQ/events.json","paper":"https://pith.science/paper/4TNBZGBX"},"agent_actions":{"view_html":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ","download_json":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ.json","view_paper":"https://pith.science/paper/4TNBZGBX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.02390&json=true","fetch_graph":"https://pith.science/api/pith-number/4TNBZGBXZM5YIUKNLTNL4KXSQQ/graph.json","fetch_events":"https://pith.science/api/pith-number/4TNBZGBXZM5YIUKNLTNL4KXSQQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/action/storage_attestation","attest_author":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/action/author_attestation","sign_citation":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/action/citation_signature","submit_replication":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/action/replication_record"}},"created_at":"2026-05-18T00:01:24.391945+00:00","updated_at":"2026-05-18T00:01:24.391945+00:00"}