{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:EWI47D6HMQS54YJ3UGPDCJCJ2T","short_pith_number":"pith:EWI47D6H","schema_version":"1.0","canonical_sha256":"2591cf8fc76425de613ba19e312449d4ceab95ef8c671eda1b5e1936fed121fb","source":{"kind":"arxiv","id":"1811.06829","version":1},"attestation_state":"computed","paper":{"title":"Minimal linear codes in odd characteristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Matteo Bonini","submitted_at":"2018-11-16T14:58:22Z","abstract_excerpt":"In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $\\mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.06829","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-11-16T14:58:22Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"2b25bd489fe6d11d7c9800d053ebae7af436ea29100511e0c3b4fb98f031200d","abstract_canon_sha256":"da4b88670c4877df967e2d829efa706e8b0f4e98b69bccefe354f9b423c5edcc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:17.493839Z","signature_b64":"BHjEzZpHtkOOJEW09tOnVZqdJNFw0+lb1sOhCMik86tP7Q0NdJxkFT/LLIRW8eAIkJ+WpGzI2NK6ba/cx67jDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2591cf8fc76425de613ba19e312449d4ceab95ef8c671eda1b5e1936fed121fb","last_reissued_at":"2026-05-18T00:00:17.493278Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:17.493278Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal linear codes in odd characteristic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"math.CO","authors_text":"Daniele Bartoli, Matteo Bonini","submitted_at":"2018-11-16T14:58:22Z","abstract_excerpt":"In this paper we generalize constructions in two recent works of Ding, Heng, Zhou to any field $\\mathbb{F}_q$, $q$ odd, providing infinite families of minimal codes for which the Ashikhmin-Barg bound does not hold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.06829","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.06829","created_at":"2026-05-18T00:00:17.493385+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.06829v1","created_at":"2026-05-18T00:00:17.493385+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.06829","created_at":"2026-05-18T00:00:17.493385+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWI47D6HMQS5","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWI47D6HMQS54YJ3","created_at":"2026-05-18T12:32:22.470017+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWI47D6H","created_at":"2026-05-18T12:32:22.470017+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T","json":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T.json","graph_json":"https://pith.science/api/pith-number/EWI47D6HMQS54YJ3UGPDCJCJ2T/graph.json","events_json":"https://pith.science/api/pith-number/EWI47D6HMQS54YJ3UGPDCJCJ2T/events.json","paper":"https://pith.science/paper/EWI47D6H"},"agent_actions":{"view_html":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T","download_json":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T.json","view_paper":"https://pith.science/paper/EWI47D6H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.06829&json=true","fetch_graph":"https://pith.science/api/pith-number/EWI47D6HMQS54YJ3UGPDCJCJ2T/graph.json","fetch_events":"https://pith.science/api/pith-number/EWI47D6HMQS54YJ3UGPDCJCJ2T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T/action/storage_attestation","attest_author":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T/action/author_attestation","sign_citation":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T/action/citation_signature","submit_replication":"https://pith.science/pith/EWI47D6HMQS54YJ3UGPDCJCJ2T/action/replication_record"}},"created_at":"2026-05-18T00:00:17.493385+00:00","updated_at":"2026-05-18T00:00:17.493385+00:00"}