{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:CJ25HW4C5CNDOT63G2QS5R2BNH","short_pith_number":"pith:CJ25HW4C","canonical_record":{"source":{"id":"1305.4444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-20T06:03:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e43f24afc09942d4b582d309d9bc7981b52956305030be770906d5c74c94596e","abstract_canon_sha256":"da936c39739d4ba1b80e0cdb64986083bbb24961d4d2fb800917e8b0c68453b5"},"schema_version":"1.0"},"canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","source":{"kind":"arxiv","id":"1305.4444","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4444","created_at":"2026-05-18T03:25:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4444v1","created_at":"2026-05-18T03:25:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4444","created_at":"2026-05-18T03:25:23Z"},{"alias_kind":"pith_short_12","alias_value":"CJ25HW4C5CND","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CJ25HW4C5CNDOT63","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CJ25HW4C","created_at":"2026-05-18T12:27:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:CJ25HW4C5CNDOT63G2QS5R2BNH","target":"record","payload":{"canonical_record":{"source":{"id":"1305.4444","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-20T06:03:23Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"e43f24afc09942d4b582d309d9bc7981b52956305030be770906d5c74c94596e","abstract_canon_sha256":"da936c39739d4ba1b80e0cdb64986083bbb24961d4d2fb800917e8b0c68453b5"},"schema_version":"1.0"},"canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:23.690027Z","signature_b64":"bFXpdZfY9D0vuY61vRrHTA5FvsSAFMY+ki4ZJ8J26PVzLxsRV6ujIsuzTqbiBXa/r5WSwWy3XXybvgmHprQoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","last_reissued_at":"2026-05-18T03:25:23.689389Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:23.689389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1305.4444","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:25:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p3QM6rZ4dNE/wrvwW9dTsy+h3LOmb0SpBuAIMnlvjBMOR+yqR1Oz0L2BXKwFFaLC3+kTywCw3KA6CCxjXeuBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:53:44.799158Z"},"content_sha256":"cce8965fd49e8d1aaf6e1d8da180de6e9a972da86510195c8c06f079e981945e","schema_version":"1.0","event_id":"sha256:cce8965fd49e8d1aaf6e1d8da180de6e9a972da86510195c8c06f079e981945e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:CJ25HW4C5CNDOT63G2QS5R2BNH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-receiver Authentication Scheme for Multiple Messages 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-05-20T06:03:23Z","abstract_excerpt":"In this paper, we construct an authentication scheme for multi-receivers and multiple messages based on a linear code $C$. This construction can be regarded as a generalization of the authentication scheme given by Safavi-Naini and Wang. Actually, we notice that the scheme of Safavi-Naini and Wang is constructed with Reed-Solomon codes. The generalization to linear codes has the similar advantages as generalizing Shamir's secret sharing scheme to linear secret sharing sceme based on linear codes. For a fixed message base field $\\f$, our scheme allows arbitrarily many receivers to check the int"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4444","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:25:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Aa178oa7r69kqv43QgVoqB6gggFGWAFWxhjSz1eum1IwVbnSx8T6Ks/PTjxfsR57teF2S87I1pmGeME4pji4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T14:53:44.799510Z"},"content_sha256":"e0457c521efeb09f4f74171ecc5f83a5c46c5783a3112c36d8a1c543995d9871","schema_version":"1.0","event_id":"sha256:e0457c521efeb09f4f74171ecc5f83a5c46c5783a3112c36d8a1c543995d9871"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/bundle.json","state_url":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/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-01T14:53:44Z","links":{"resolver":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH","bundle":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/bundle.json","state":"https://pith.science/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CJ25HW4C5CNDOT63G2QS5R2BNH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CJ25HW4C5CNDOT63G2QS5R2BNH","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":"da936c39739d4ba1b80e0cdb64986083bbb24961d4d2fb800917e8b0c68453b5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-20T06:03:23Z","title_canon_sha256":"e43f24afc09942d4b582d309d9bc7981b52956305030be770906d5c74c94596e"},"schema_version":"1.0","source":{"id":"1305.4444","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.4444","created_at":"2026-05-18T03:25:23Z"},{"alias_kind":"arxiv_version","alias_value":"1305.4444v1","created_at":"2026-05-18T03:25:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.4444","created_at":"2026-05-18T03:25:23Z"},{"alias_kind":"pith_short_12","alias_value":"CJ25HW4C5CND","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CJ25HW4C5CNDOT63","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CJ25HW4C","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e0457c521efeb09f4f74171ecc5f83a5c46c5783a3112c36d8a1c543995d9871","target":"graph","created_at":"2026-05-18T03:25:23Z","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 this paper, we construct an authentication scheme for multi-receivers and multiple messages based on a linear code $C$. This construction can be regarded as a generalization of the authentication scheme given by Safavi-Naini and Wang. Actually, we notice that the scheme of Safavi-Naini and Wang is constructed with Reed-Solomon codes. The generalization to linear codes has the similar advantages as generalizing Shamir's secret sharing scheme to linear secret sharing sceme based on linear codes. For a fixed message base field $\\f$, our scheme allows arbitrarily many receivers to check the int","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-05-20T06:03:23Z","title":"Multi-receiver Authentication Scheme for Multiple Messages Based on Linear Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.4444","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:cce8965fd49e8d1aaf6e1d8da180de6e9a972da86510195c8c06f079e981945e","target":"record","created_at":"2026-05-18T03:25:23Z","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":"da936c39739d4ba1b80e0cdb64986083bbb24961d4d2fb800917e8b0c68453b5","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2013-05-20T06:03:23Z","title_canon_sha256":"e43f24afc09942d4b582d309d9bc7981b52956305030be770906d5c74c94596e"},"schema_version":"1.0","source":{"id":"1305.4444","kind":"arxiv","version":1}},"canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1275d3db82e89a374fdb36a12ec74169f16383cf27452521bb52424bc284e06b","first_computed_at":"2026-05-18T03:25:23.689389Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:23.689389Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bFXpdZfY9D0vuY61vRrHTA5FvsSAFMY+ki4ZJ8J26PVzLxsRV6ujIsuzTqbiBXa/r5WSwWy3XXybvgmHprQoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:23.690027Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.4444","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cce8965fd49e8d1aaf6e1d8da180de6e9a972da86510195c8c06f079e981945e","sha256:e0457c521efeb09f4f74171ecc5f83a5c46c5783a3112c36d8a1c543995d9871"],"state_sha256":"3338e882b6b25ddb9cbce15906b453a407636e3c01238bda84765680997ecdd6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OAnpgbMyCqRthDayTVn3H5jESfwUG36b4R++0V61FwumRE/P/D4cmYpPmVdmDnoEcP0GLfE4J1YL2ha7z4ofDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T14:53:44.801394Z","bundle_sha256":"aa22b17e5d6e00fe10770952e03960df4c41b316336e141c2c4ea172dbc7ff1c"}}