{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ODSAJMKWWBHVTZXAVJCC7TJQRK","short_pith_number":"pith:ODSAJMKW","schema_version":"1.0","canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","source":{"kind":"arxiv","id":"1912.12769","version":1},"attestation_state":"computed","paper":{"title":"Minimal Codes From Characteristic Functions Not Satisfying The Ashikhmin-Barg Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julien Sorci","submitted_at":"2019-12-30T01:01:53Z","abstract_excerpt":"A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of each other. Ashikhmin and Barg gave a sufficient condition for a code to be minimal, which led to much interest in constructing minimal codes that do not satisfy their condition. We consider a particular family of codes $\\mathcal C_f$ when $f$ is the indicator function of a set of points, and prove a sufficient condition for $\\mathcal C_f$ to be minimal and not satisfy Ashikhmin and Barg's condition based on certain g"},"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":"1912.12769","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-12-30T01:01:53Z","cross_cats_sorted":[],"title_canon_sha256":"d2246803519862626e411dfc72276f2ff556f02f3bd10943de37612a7aeda3c4","abstract_canon_sha256":"d1c2cfed1eeb308f5c2217dc14501986bc838579f932aaa413206f44276898c7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:29:03.256755Z","signature_b64":"bw6NFOHbCGTBUh+UbPiQQvWP4jSYifEtDYstFmoYYTjlIM9uApBzciEm0nbghnaIjlEBK/MZ5syAQAaPO+k4AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70e404b156b04f59e6e0aa442fcd308abed987ed4d462f8b6c4ab6bcceb56a7f","last_reissued_at":"2026-07-05T00:29:03.256424Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:29:03.256424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Codes From Characteristic Functions Not Satisfying The Ashikhmin-Barg Condition","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Julien Sorci","submitted_at":"2019-12-30T01:01:53Z","abstract_excerpt":"A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of each other. Ashikhmin and Barg gave a sufficient condition for a code to be minimal, which led to much interest in constructing minimal codes that do not satisfy their condition. We consider a particular family of codes $\\mathcal C_f$ when $f$ is the indicator function of a set of points, and prove a sufficient condition for $\\mathcal C_f$ to be minimal and not satisfy Ashikhmin and Barg's condition based on certain g"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.12769","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.12769/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.12769","created_at":"2026-07-05T00:29:03.256480+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.12769v1","created_at":"2026-07-05T00:29:03.256480+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.12769","created_at":"2026-07-05T00:29:03.256480+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODSAJMKWWBHV","created_at":"2026-07-05T00:29:03.256480+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODSAJMKWWBHVTZXA","created_at":"2026-07-05T00:29:03.256480+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODSAJMKW","created_at":"2026-07-05T00:29:03.256480+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/ODSAJMKWWBHVTZXAVJCC7TJQRK","json":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK.json","graph_json":"https://pith.science/api/pith-number/ODSAJMKWWBHVTZXAVJCC7TJQRK/graph.json","events_json":"https://pith.science/api/pith-number/ODSAJMKWWBHVTZXAVJCC7TJQRK/events.json","paper":"https://pith.science/paper/ODSAJMKW"},"agent_actions":{"view_html":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK","download_json":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK.json","view_paper":"https://pith.science/paper/ODSAJMKW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.12769&json=true","fetch_graph":"https://pith.science/api/pith-number/ODSAJMKWWBHVTZXAVJCC7TJQRK/graph.json","fetch_events":"https://pith.science/api/pith-number/ODSAJMKWWBHVTZXAVJCC7TJQRK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/action/storage_attestation","attest_author":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/action/author_attestation","sign_citation":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/action/citation_signature","submit_replication":"https://pith.science/pith/ODSAJMKWWBHVTZXAVJCC7TJQRK/action/replication_record"}},"created_at":"2026-07-05T00:29:03.256480+00:00","updated_at":"2026-07-05T00:29:03.256480+00:00"}