{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4D6UVPMEHNDBAAUI3OPRQJIMFT","short_pith_number":"pith:4D6UVPME","canonical_record":{"source":{"id":"1803.09988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-27T09:42:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4e6510bccf7bc0269ab2ece251134a7a08fe148be741593348dbe9a0148e29f","abstract_canon_sha256":"7eec00a54d2a44ee84b66eee699eec18246ca90515fade131379ec29fe8e3839"},"schema_version":"1.0"},"canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","source":{"kind":"arxiv","id":"1803.09988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09988","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09988v1","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09988","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"4D6UVPMEHNDB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4D6UVPMEHNDBAAUI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4D6UVPME","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4D6UVPMEHNDBAAUI3OPRQJIMFT","target":"record","payload":{"canonical_record":{"source":{"id":"1803.09988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-27T09:42:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"b4e6510bccf7bc0269ab2ece251134a7a08fe148be741593348dbe9a0148e29f","abstract_canon_sha256":"7eec00a54d2a44ee84b66eee699eec18246ca90515fade131379ec29fe8e3839"},"schema_version":"1.0"},"canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:00.787597Z","signature_b64":"3G8Pg9F7QMWA7GdwsLeENk2lKzBeSNaJv9l6Gsa2cP/nZZVyE30vMWwzELvA90drMK2OuzzJrikupDuCM+LuBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","last_reissued_at":"2026-05-18T00:20:00.786957Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:00.786957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.09988","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:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iRrsOzhnFEVwwfK3rwjXVqiCo7/K+pRhj3qRe474b7GkNMU2J1Xj7hGPs9xpMz2SClxlocn/bnRCB2dkE1PLAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:26:02.545310Z"},"content_sha256":"f27a607761b4180d46a393b48fdfe9b7b4be2c0cea13ff3228b5a03ed776f303","schema_version":"1.0","event_id":"sha256:f27a607761b4180d46a393b48fdfe9b7b4be2c0cea13ff3228b5a03ed776f303"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4D6UVPMEHNDBAAUI3OPRQJIMFT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimal Linear Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Cunsheng Ding, Zhengchun Zhou, Ziling Heng","submitted_at":"2018-03-27T09:42:19Z","abstract_excerpt":"As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that $w_{\\min}/w_{\\max}> (q-1)/q$ is a sufficient condition for a linear code over the finite field $\\gf(q)$ to be minimal, where $q$ is a prime power, $w_{\\min}$ and $w_{\\max}$ denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to pre"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09988","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:20:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2qQLZbUeotrPeqXEk+LcqaK/JzXYJLGUEGK21CDZfNzXfgOK48UioSJkLpxikWWE+qU6/hxhI6VcXu1d7M8NDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:26:02.546065Z"},"content_sha256":"3e1b07dd3fcd48ae17375d2d55e0dc23060e631fb8b7f3e5218a362b7c674089","schema_version":"1.0","event_id":"sha256:3e1b07dd3fcd48ae17375d2d55e0dc23060e631fb8b7f3e5218a362b7c674089"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/bundle.json","state_url":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/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-08T20:26:02Z","links":{"resolver":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT","bundle":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/bundle.json","state":"https://pith.science/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4D6UVPMEHNDBAAUI3OPRQJIMFT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4D6UVPMEHNDBAAUI3OPRQJIMFT","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":"7eec00a54d2a44ee84b66eee699eec18246ca90515fade131379ec29fe8e3839","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-27T09:42:19Z","title_canon_sha256":"b4e6510bccf7bc0269ab2ece251134a7a08fe148be741593348dbe9a0148e29f"},"schema_version":"1.0","source":{"id":"1803.09988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.09988","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"arxiv_version","alias_value":"1803.09988v1","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.09988","created_at":"2026-05-18T00:20:00Z"},{"alias_kind":"pith_short_12","alias_value":"4D6UVPMEHNDB","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4D6UVPMEHNDBAAUI","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4D6UVPME","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:3e1b07dd3fcd48ae17375d2d55e0dc23060e631fb8b7f3e5218a362b7c674089","target":"graph","created_at":"2026-05-18T00:20:00Z","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":"As a special class of linear codes, minimal linear codes have important applications in secret sharing and secure two-party computation. Constructing minimal linear codes with new and desirable parameters has been an interesting research topic in coding theory and cryptography. Ashikhmin and Barg showed that $w_{\\min}/w_{\\max}> (q-1)/q$ is a sufficient condition for a linear code over the finite field $\\gf(q)$ to be minimal, where $q$ is a prime power, $w_{\\min}$ and $w_{\\max}$ denote the minimum and maximum nonzero weights in the code, respectively. The first objective of this paper is to pre","authors_text":"Cunsheng Ding, Zhengchun Zhou, Ziling Heng","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-27T09:42:19Z","title":"Minimal Linear Codes over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.09988","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:f27a607761b4180d46a393b48fdfe9b7b4be2c0cea13ff3228b5a03ed776f303","target":"record","created_at":"2026-05-18T00:20:00Z","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":"7eec00a54d2a44ee84b66eee699eec18246ca90515fade131379ec29fe8e3839","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-03-27T09:42:19Z","title_canon_sha256":"b4e6510bccf7bc0269ab2ece251134a7a08fe148be741593348dbe9a0148e29f"},"schema_version":"1.0","source":{"id":"1803.09988","kind":"arxiv","version":1}},"canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0fd4abd843b46100288db9f18250c2cd61269fd68efa15cad9204670fc5c844","first_computed_at":"2026-05-18T00:20:00.786957Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:00.786957Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3G8Pg9F7QMWA7GdwsLeENk2lKzBeSNaJv9l6Gsa2cP/nZZVyE30vMWwzELvA90drMK2OuzzJrikupDuCM+LuBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:00.787597Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.09988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f27a607761b4180d46a393b48fdfe9b7b4be2c0cea13ff3228b5a03ed776f303","sha256:3e1b07dd3fcd48ae17375d2d55e0dc23060e631fb8b7f3e5218a362b7c674089"],"state_sha256":"cd981aa450b5d085b89bf791a4c486ced5221ccb6b7b182eb183eba6763adf9b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"njhViq8sCoEjbw/yG9ABkqSfiXGDNC8e+xVWCMWMtQnF+Bo1Y4Y2A8v/EBrhyHp6h1Cd+Q7EQegJfXfLrkAEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:26:02.550290Z","bundle_sha256":"c52981f7d24c332561e1fff834d9f160dc284b60120bf18fd78d1347a2ecda3f"}}