{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Z6KEDYAMGBDGUTFBF3XK63XITT","short_pith_number":"pith:Z6KEDYAM","canonical_record":{"source":{"id":"1202.4058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-18T04:43:42Z","cross_cats_sorted":[],"title_canon_sha256":"df3f71809fdc9f0ee8bff03714526dfa71c3ae85bae9ba8f7e6ce91edce1a864","abstract_canon_sha256":"35bd1a8abc993c3614780cd0f0c8aa3b0cdf9ef748b961254f798263e31f2173"},"schema_version":"1.0"},"canonical_sha256":"cf9441e00c30466a4ca12eeeaf6ee89cc891e77e4b5913751f91e9cc9a6232a3","source":{"kind":"arxiv","id":"1202.4058","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4058","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4058v2","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4058","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z6KEDYAMGBDG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z6KEDYAMGBDGUTFB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z6KEDYAM","created_at":"2026-05-18T12:27:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Z6KEDYAMGBDGUTFBF3XK63XITT","target":"record","payload":{"canonical_record":{"source":{"id":"1202.4058","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-18T04:43:42Z","cross_cats_sorted":[],"title_canon_sha256":"df3f71809fdc9f0ee8bff03714526dfa71c3ae85bae9ba8f7e6ce91edce1a864","abstract_canon_sha256":"35bd1a8abc993c3614780cd0f0c8aa3b0cdf9ef748b961254f798263e31f2173"},"schema_version":"1.0"},"canonical_sha256":"cf9441e00c30466a4ca12eeeaf6ee89cc891e77e4b5913751f91e9cc9a6232a3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:14:08.801486Z","signature_b64":"xErCGAs6YG8cekn/lhzQ8eAE6XyCsOdLXXLRo5X5qH1dy7tlA8PSGtEkCydlCs/LrKP+JxL0BbGyZr/2Wnm1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cf9441e00c30466a4ca12eeeaf6ee89cc891e77e4b5913751f91e9cc9a6232a3","last_reissued_at":"2026-05-18T03:14:08.800999Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:14:08.800999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1202.4058","source_version":2,"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:14:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WxXT2M1iDKurFyxjtyoqaECiazam518Tf1YkZGk0snSar2YIRczXq15G7s3Eos7FA5rXKoK2kJJLL2wQ5JXcAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:58:48.166198Z"},"content_sha256":"08141e0a89614f5cfc00899902db33aceb11eca1646fe471b876a9f652e2b788","schema_version":"1.0","event_id":"sha256:08141e0a89614f5cfc00899902db33aceb11eca1646fe471b876a9f652e2b788"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Z6KEDYAMGBDGUTFBF3XK63XITT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Secret sharing with a class of minimal linear codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Yun Song, Zhihui Li","submitted_at":"2012-02-18T04:43:42Z","abstract_excerpt":"There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access structures of the schemes based on linear codes is very hard. This paper proposed the concept of minimal linear code, which makes the determination of the access structures of the schemes based on the duals of minimal linear codes easier. It is proved that the shortening codes of minimal linear codes are also minimal ones. Then the conditions whether several types "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4058","kind":"arxiv","version":2},"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:14:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1/WbFo8h7BemFhRigEzFCfFLtnFA2yxQv8gHcS0T0fAikb24stFglmM/nUzpus3haSt/VgVeoj8BbRVdF2PDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T12:58:48.166579Z"},"content_sha256":"993c9990592999e310b45c55b4dd16f691d69ea8cadeb34470d346dc965dae39","schema_version":"1.0","event_id":"sha256:993c9990592999e310b45c55b4dd16f691d69ea8cadeb34470d346dc965dae39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Z6KEDYAMGBDGUTFBF3XK63XITT/bundle.json","state_url":"https://pith.science/pith/Z6KEDYAMGBDGUTFBF3XK63XITT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Z6KEDYAMGBDGUTFBF3XK63XITT/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-23T12:58:48Z","links":{"resolver":"https://pith.science/pith/Z6KEDYAMGBDGUTFBF3XK63XITT","bundle":"https://pith.science/pith/Z6KEDYAMGBDGUTFBF3XK63XITT/bundle.json","state":"https://pith.science/pith/Z6KEDYAMGBDGUTFBF3XK63XITT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Z6KEDYAMGBDGUTFBF3XK63XITT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Z6KEDYAMGBDGUTFBF3XK63XITT","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":"35bd1a8abc993c3614780cd0f0c8aa3b0cdf9ef748b961254f798263e31f2173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-18T04:43:42Z","title_canon_sha256":"df3f71809fdc9f0ee8bff03714526dfa71c3ae85bae9ba8f7e6ce91edce1a864"},"schema_version":"1.0","source":{"id":"1202.4058","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.4058","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"arxiv_version","alias_value":"1202.4058v2","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.4058","created_at":"2026-05-18T03:14:08Z"},{"alias_kind":"pith_short_12","alias_value":"Z6KEDYAMGBDG","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_16","alias_value":"Z6KEDYAMGBDGUTFB","created_at":"2026-05-18T12:27:30Z"},{"alias_kind":"pith_short_8","alias_value":"Z6KEDYAM","created_at":"2026-05-18T12:27:30Z"}],"graph_snapshots":[{"event_id":"sha256:993c9990592999e310b45c55b4dd16f691d69ea8cadeb34470d346dc965dae39","target":"graph","created_at":"2026-05-18T03:14:08Z","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":"There are several methods for constructing secret sharing schemes, one of which is based on coding theory. Theoretically, every linear code can be used to construct secret sharing schemes. However, in general, determining the access structures of the schemes based on linear codes is very hard. This paper proposed the concept of minimal linear code, which makes the determination of the access structures of the schemes based on the duals of minimal linear codes easier. It is proved that the shortening codes of minimal linear codes are also minimal ones. Then the conditions whether several types ","authors_text":"Yun Song, Zhihui Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-18T04:43:42Z","title":"Secret sharing with a class of minimal linear codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.4058","kind":"arxiv","version":2},"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:08141e0a89614f5cfc00899902db33aceb11eca1646fe471b876a9f652e2b788","target":"record","created_at":"2026-05-18T03:14:08Z","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":"35bd1a8abc993c3614780cd0f0c8aa3b0cdf9ef748b961254f798263e31f2173","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2012-02-18T04:43:42Z","title_canon_sha256":"df3f71809fdc9f0ee8bff03714526dfa71c3ae85bae9ba8f7e6ce91edce1a864"},"schema_version":"1.0","source":{"id":"1202.4058","kind":"arxiv","version":2}},"canonical_sha256":"cf9441e00c30466a4ca12eeeaf6ee89cc891e77e4b5913751f91e9cc9a6232a3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf9441e00c30466a4ca12eeeaf6ee89cc891e77e4b5913751f91e9cc9a6232a3","first_computed_at":"2026-05-18T03:14:08.800999Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:14:08.800999Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xErCGAs6YG8cekn/lhzQ8eAE6XyCsOdLXXLRo5X5qH1dy7tlA8PSGtEkCydlCs/LrKP+JxL0BbGyZr/2Wnm1Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:14:08.801486Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.4058","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08141e0a89614f5cfc00899902db33aceb11eca1646fe471b876a9f652e2b788","sha256:993c9990592999e310b45c55b4dd16f691d69ea8cadeb34470d346dc965dae39"],"state_sha256":"73f46c28ce01bac2feca7c13b3918b4271a5139d0dbf8882183d7fce744ceb47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CN9Qj2bJIXhlwo3FoSgcNYLWqBiTEiQF+5G34IlwrdbcxD4vS+7ok+tqgYHUGwcaDUQAL9MHaLzJXrqO0HVTCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T12:58:48.168423Z","bundle_sha256":"b3cde17b12d31fecf390063c254d9319698f5c76b65d20a54b512808b9b70938"}}