{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4TNBZGBXZM5YIUKNLTNL4KXSQQ","short_pith_number":"pith:4TNBZGBX","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"},"canonical_sha256":"e4da1c9837cb3b84514d5cdabe2af2843de0038d3bbc6c8565b29b3217b8b25e","source":{"kind":"arxiv","id":"1811.02390","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02390","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02390v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02390","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"4TNBZGBXZM5Y","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TNBZGBXZM5YIUKN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TNBZGBX","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4TNBZGBXZM5YIUKNLTNL4KXSQQ","target":"record","payload":{"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"},"canonical_sha256":"e4da1c9837cb3b84514d5cdabe2af2843de0038d3bbc6c8565b29b3217b8b25e","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"},"source_kind":"arxiv","source_id":"1811.02390","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-18T00:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LcC9X645OEh3FtKVB3ELOp6wg5vhDo7V1biea6vgEIqGdtJpSt8b/YMVb7s2Lk+k+hEa0xOn96v43mh0F8sfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:06:13.072609Z"},"content_sha256":"12d4470e6f0fd5db942eb07afe6cb95b6b320b0885809ec1909e707411e041b9","schema_version":"1.0","event_id":"sha256:12d4470e6f0fd5db942eb07afe6cb95b6b320b0885809ec1909e707411e041b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4TNBZGBXZM5YIUKNLTNL4KXSQQ","target":"graph","payload":{"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"},"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-18T00:01:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z0ritx4zOEwjOGi9Vx9uNpjb0fdOoucpHMf5YiP20Wl2nrduvJnoo9zye/y/Ojf00k4ism7v0WRV8FesczI9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T04:06:13.073356Z"},"content_sha256":"a4ad630b885a52d1098a48ce850a149a9a5a55889fc1b3d6da4414a59ff50d75","schema_version":"1.0","event_id":"sha256:a4ad630b885a52d1098a48ce850a149a9a5a55889fc1b3d6da4414a59ff50d75"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/bundle.json","state_url":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/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-11T04:06:13Z","links":{"resolver":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ","bundle":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/bundle.json","state":"https://pith.science/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TNBZGBXZM5YIUKNLTNL4KXSQQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4TNBZGBXZM5YIUKNLTNL4KXSQQ","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":"22b2f4bb42b042dffd01bec09ccf453b41eac8b473cf1926f30dc3d9738099c5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:45Z","title_canon_sha256":"42499814b10423f054551aa0841b0447c46269923ba57cad642804edf22695e7"},"schema_version":"1.0","source":{"id":"1811.02390","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.02390","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"arxiv_version","alias_value":"1811.02390v1","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.02390","created_at":"2026-05-18T00:01:24Z"},{"alias_kind":"pith_short_12","alias_value":"4TNBZGBXZM5Y","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TNBZGBXZM5YIUKN","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TNBZGBX","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:a4ad630b885a52d1098a48ce850a149a9a5a55889fc1b3d6da4414a59ff50d75","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":"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","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:45Z","title":"Local-Encoding-Preserving Secure Network Coding---Part II: Flexible Rate and Security Level"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.02390","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:12d4470e6f0fd5db942eb07afe6cb95b6b320b0885809ec1909e707411e041b9","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":"22b2f4bb42b042dffd01bec09ccf453b41eac8b473cf1926f30dc3d9738099c5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-11-06T14:59:45Z","title_canon_sha256":"42499814b10423f054551aa0841b0447c46269923ba57cad642804edf22695e7"},"schema_version":"1.0","source":{"id":"1811.02390","kind":"arxiv","version":1}},"canonical_sha256":"e4da1c9837cb3b84514d5cdabe2af2843de0038d3bbc6c8565b29b3217b8b25e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4da1c9837cb3b84514d5cdabe2af2843de0038d3bbc6c8565b29b3217b8b25e","first_computed_at":"2026-05-18T00:01:24.391882Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:24.391882Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uZZIOOJIX3fqHWqAPHpDIyt1ZfN8Azol9JTiyJMhXKGJWN0etlIMpMYDg9eJDZu8iDX9FkfHaNMN1ew8mtikBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:24.392301Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.02390","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12d4470e6f0fd5db942eb07afe6cb95b6b320b0885809ec1909e707411e041b9","sha256:a4ad630b885a52d1098a48ce850a149a9a5a55889fc1b3d6da4414a59ff50d75"],"state_sha256":"313d323841e4e99cab9fbfe90212239fa15ff6af3b8a5494480d9f9b7e481087"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XIaOHfjBQ7dIvAr9xLQ3g9W8UM+i+wVw8xTR5LUkOyiXziH4JURb3vAQs74P74Uh2m0dO3EOWANmXS/VLpBzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T04:06:13.077018Z","bundle_sha256":"f4d05913552ee0a0d8e0b9b399dcea012e85f15c2b1671dce8aa482652cfd724"}}