{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FGGXHV5GY74TJHRIHKNENGTM74","short_pith_number":"pith:FGGXHV5G","schema_version":"1.0","canonical_sha256":"298d73d7a6c7f9349e283a9a469a6cff35c5f66c35498c2276b1ebb99eeb0cc7","source":{"kind":"arxiv","id":"2505.07130","version":2},"attestation_state":"computed","paper":{"title":"Minimal Linear Codes Violating the Ashikhmin-Barg Condition from Arbitrary Projective Linear Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Hao Chen, Huimin Lao, Yaqi Chen","submitted_at":"2025-05-11T22:02:40Z","abstract_excerpt":"In recent years, there have been many constructions of minimal linear codes violating the Ashikhmin-Barg condition from Boolean functions, linear codes with few nonzero weights or partial difference sets. In this paper, we first give a general method to transform a minimal code satisfying the Ashikhmin-Barg condition to a minimal code violating the Ashikhmin-Barg condition. Then we give a construction of a minimal code satisfying the Ashikhmin-Barg condition from an arbitrary projective linear code. Hence an arbitrary projective linear code can be transformed to a minimal codes violating the A"},"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":"2505.07130","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/publicdomain/zero/1.0/","primary_cat":"cs.IT","submitted_at":"2025-05-11T22:02:40Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"5e477a067ee1befd8c992c4322191c201986d46a62e0b2a6df0644f859c15b02","abstract_canon_sha256":"33316292d1a4aeca84b7350bc2a050ba279a79a2d3299822b5db845a8cf8296c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:04:51.041109Z","signature_b64":"M4j46WWYi2PpVOjZzSGvFnA6j0J/BNXXgdixxg2hmT2gPwXRg/PN4gjqzuMDCyAXPf/ZmMuq34jmunW8PKlYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"298d73d7a6c7f9349e283a9a469a6cff35c5f66c35498c2276b1ebb99eeb0cc7","last_reissued_at":"2026-07-05T11:04:51.040580Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:04:51.040580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal Linear Codes Violating the Ashikhmin-Barg Condition from Arbitrary Projective Linear Codes","license":"http://creativecommons.org/publicdomain/zero/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Conghui Xie, Hao Chen, Huimin Lao, Yaqi Chen","submitted_at":"2025-05-11T22:02:40Z","abstract_excerpt":"In recent years, there have been many constructions of minimal linear codes violating the Ashikhmin-Barg condition from Boolean functions, linear codes with few nonzero weights or partial difference sets. In this paper, we first give a general method to transform a minimal code satisfying the Ashikhmin-Barg condition to a minimal code violating the Ashikhmin-Barg condition. Then we give a construction of a minimal code satisfying the Ashikhmin-Barg condition from an arbitrary projective linear code. Hence an arbitrary projective linear code can be transformed to a minimal codes violating the A"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.07130","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.07130/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":"2505.07130","created_at":"2026-07-05T11:04:51.040641+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.07130v2","created_at":"2026-07-05T11:04:51.040641+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.07130","created_at":"2026-07-05T11:04:51.040641+00:00"},{"alias_kind":"pith_short_12","alias_value":"FGGXHV5GY74T","created_at":"2026-07-05T11:04:51.040641+00:00"},{"alias_kind":"pith_short_16","alias_value":"FGGXHV5GY74TJHRI","created_at":"2026-07-05T11:04:51.040641+00:00"},{"alias_kind":"pith_short_8","alias_value":"FGGXHV5G","created_at":"2026-07-05T11:04:51.040641+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/FGGXHV5GY74TJHRIHKNENGTM74","json":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74.json","graph_json":"https://pith.science/api/pith-number/FGGXHV5GY74TJHRIHKNENGTM74/graph.json","events_json":"https://pith.science/api/pith-number/FGGXHV5GY74TJHRIHKNENGTM74/events.json","paper":"https://pith.science/paper/FGGXHV5G"},"agent_actions":{"view_html":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74","download_json":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74.json","view_paper":"https://pith.science/paper/FGGXHV5G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.07130&json=true","fetch_graph":"https://pith.science/api/pith-number/FGGXHV5GY74TJHRIHKNENGTM74/graph.json","fetch_events":"https://pith.science/api/pith-number/FGGXHV5GY74TJHRIHKNENGTM74/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74/action/storage_attestation","attest_author":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74/action/author_attestation","sign_citation":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74/action/citation_signature","submit_replication":"https://pith.science/pith/FGGXHV5GY74TJHRIHKNENGTM74/action/replication_record"}},"created_at":"2026-07-05T11:04:51.040641+00:00","updated_at":"2026-07-05T11:04:51.040641+00:00"}