{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SDHYHEC5NXH653TCPHDIKEPTNI","short_pith_number":"pith:SDHYHEC5","canonical_record":{"source":{"id":"1303.0930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-05T05:33:40Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ce9c2d69c43365fadea8b6e49bdf87ce86de75d039a34bf854f6bf834c54a6c3","abstract_canon_sha256":"f2af2668cff28c8574d98592f424a24a8d20b9ac953ddfac5821d864f08ad9b2"},"schema_version":"1.0"},"canonical_sha256":"90cf83905d6dcfeeee6279c68511f36a242eee4eecf00c091387916dfb6f4b87","source":{"kind":"arxiv","id":"1303.0930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0930","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0930v1","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0930","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"pith_short_12","alias_value":"SDHYHEC5NXH6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SDHYHEC5NXH653TC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SDHYHEC5","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SDHYHEC5NXH653TCPHDIKEPTNI","target":"record","payload":{"canonical_record":{"source":{"id":"1303.0930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-05T05:33:40Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"ce9c2d69c43365fadea8b6e49bdf87ce86de75d039a34bf854f6bf834c54a6c3","abstract_canon_sha256":"f2af2668cff28c8574d98592f424a24a8d20b9ac953ddfac5821d864f08ad9b2"},"schema_version":"1.0"},"canonical_sha256":"90cf83905d6dcfeeee6279c68511f36a242eee4eecf00c091387916dfb6f4b87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:53.432334Z","signature_b64":"domhYhX2l72Y1ErC+q4yIzwCIOoY9t++NqXVzIeH2DwNBbFn5WuWvFu43HHMHapzEAK7fR5kqk21EXaeccyZAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90cf83905d6dcfeeee6279c68511f36a242eee4eecf00c091387916dfb6f4b87","last_reissued_at":"2026-05-18T03:31:53.431744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:53.431744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.0930","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-18T03:31:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A20pVPYIh0JHprXrITmn5VN3cO8jJxYg7ByG6dGdWsRTUmMSK97VGkWrEJoq+twkkTm3+GBikJfpfooMJCeACg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:15:45.185722Z"},"content_sha256":"98835d5fd86054f33e03b99c03f9ed5d271065a5d55487f242ea5bf5ac9b73ea","schema_version":"1.0","event_id":"sha256:98835d5fd86054f33e03b99c03f9ed5d271065a5d55487f242ea5bf5ac9b73ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SDHYHEC5NXH653TCPHDIKEPTNI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An Authentication Scheme for Subspace Codes over Network Based on Linear Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Fang-Wei Fu, Jun Zhang, Xinran Li","submitted_at":"2013-03-05T05:33:40Z","abstract_excerpt":"Network coding provides the advantage of maximizing the usage of network resources, and has great application prospects in future network communications. However, the properties of network coding also make the pollution attack more serious. In this paper, we give an unconditional secure authentication scheme for network coding based on a linear code $C$. Safavi-Naini and Wang gave an authentication code for multi-receivers and multiple messages. We notice that the scheme of Safavi-Naini and Wang is essentially constructed with Reed-Solomon codes. And we modify their construction slightly to ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0930","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-18T03:31:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EipC8HX1YJ3KzwcfY/jphSatKf9gPJeldi+MjS7x2zJzjg2Vweed36p6wSV3v1oi7v893pHP7moyxnPJ3i7mCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:15:45.186065Z"},"content_sha256":"7f4662fdb2c9b510161d908799a8a1426deeee4ff96412710f2ea4853bb17e9e","schema_version":"1.0","event_id":"sha256:7f4662fdb2c9b510161d908799a8a1426deeee4ff96412710f2ea4853bb17e9e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDHYHEC5NXH653TCPHDIKEPTNI/bundle.json","state_url":"https://pith.science/pith/SDHYHEC5NXH653TCPHDIKEPTNI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDHYHEC5NXH653TCPHDIKEPTNI/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-01T15:15:45Z","links":{"resolver":"https://pith.science/pith/SDHYHEC5NXH653TCPHDIKEPTNI","bundle":"https://pith.science/pith/SDHYHEC5NXH653TCPHDIKEPTNI/bundle.json","state":"https://pith.science/pith/SDHYHEC5NXH653TCPHDIKEPTNI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDHYHEC5NXH653TCPHDIKEPTNI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SDHYHEC5NXH653TCPHDIKEPTNI","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":"f2af2668cff28c8574d98592f424a24a8d20b9ac953ddfac5821d864f08ad9b2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-05T05:33:40Z","title_canon_sha256":"ce9c2d69c43365fadea8b6e49bdf87ce86de75d039a34bf854f6bf834c54a6c3"},"schema_version":"1.0","source":{"id":"1303.0930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.0930","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"arxiv_version","alias_value":"1303.0930v1","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.0930","created_at":"2026-05-18T03:31:53Z"},{"alias_kind":"pith_short_12","alias_value":"SDHYHEC5NXH6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SDHYHEC5NXH653TC","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SDHYHEC5","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:7f4662fdb2c9b510161d908799a8a1426deeee4ff96412710f2ea4853bb17e9e","target":"graph","created_at":"2026-05-18T03:31:53Z","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":"Network coding provides the advantage of maximizing the usage of network resources, and has great application prospects in future network communications. However, the properties of network coding also make the pollution attack more serious. In this paper, we give an unconditional secure authentication scheme for network coding based on a linear code $C$. Safavi-Naini and Wang gave an authentication code for multi-receivers and multiple messages. We notice that the scheme of Safavi-Naini and Wang is essentially constructed with Reed-Solomon codes. And we modify their construction slightly to ma","authors_text":"Fang-Wei Fu, Jun Zhang, Xinran Li","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-05T05:33:40Z","title":"An Authentication Scheme for Subspace Codes over Network Based on Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.0930","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:98835d5fd86054f33e03b99c03f9ed5d271065a5d55487f242ea5bf5ac9b73ea","target":"record","created_at":"2026-05-18T03:31:53Z","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":"f2af2668cff28c8574d98592f424a24a8d20b9ac953ddfac5821d864f08ad9b2","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-03-05T05:33:40Z","title_canon_sha256":"ce9c2d69c43365fadea8b6e49bdf87ce86de75d039a34bf854f6bf834c54a6c3"},"schema_version":"1.0","source":{"id":"1303.0930","kind":"arxiv","version":1}},"canonical_sha256":"90cf83905d6dcfeeee6279c68511f36a242eee4eecf00c091387916dfb6f4b87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90cf83905d6dcfeeee6279c68511f36a242eee4eecf00c091387916dfb6f4b87","first_computed_at":"2026-05-18T03:31:53.431744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:53.431744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"domhYhX2l72Y1ErC+q4yIzwCIOoY9t++NqXVzIeH2DwNBbFn5WuWvFu43HHMHapzEAK7fR5kqk21EXaeccyZAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:53.432334Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.0930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98835d5fd86054f33e03b99c03f9ed5d271065a5d55487f242ea5bf5ac9b73ea","sha256:7f4662fdb2c9b510161d908799a8a1426deeee4ff96412710f2ea4853bb17e9e"],"state_sha256":"9def7eb5bfb7a374f7f9b2e935154d5fdb6de69180a27fc049e632c345062e98"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5TPikBYtTO5UEPl9HxOplUY45pHkLyCfUG3iiT/baYXuvKb5XTOt+eycaKxWrFJ5rJXm5bzd4nHyoN4997PwAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:15:45.187995Z","bundle_sha256":"37eacba253ba998794c47d5d56e3d066d1af94f13c9a0c972dc6a46bfd280b12"}}