{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:OZXSAFZR234WXLTGHXGBDFT4F4","short_pith_number":"pith:OZXSAFZR","schema_version":"1.0","canonical_sha256":"766f201731d6f96bae663dcc11967c2f2e06e8e6461c49595841e9f250f88f48","source":{"kind":"arxiv","id":"2602.11788","version":2},"attestation_state":"computed","paper":{"title":"The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongfeng Wu, Li Zhu","submitted_at":"2026-02-12T10:09:56Z","abstract_excerpt":"In this work, We introduce a new upper bound on the Hamming distance of simple-root constacyclic codes over finite fields, which we call the arithmetic Singleton bound. The main technical tool is the notion of a multiple equal-difference (MED) representation. Via the MED representations of the defining set of the generator polynomial of a simple-root constacyclic code, we obtain a family of upper bounds on its Hamming distance, among which the weakest one coincides with the Singleton bound, while the strongest one is defined to be the arithmetic Singleton bound for this code. Consequently, the"},"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":"2602.11788","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-12T10:09:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"74dbfc2de243852c4796f57fa15a0ba26cfe3f814552074a4a0c1e3a25161b12","abstract_canon_sha256":"304bf50d342af7897fe7b6963ae249703c953c906374136c69440005c8df6bee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:41.409989Z","signature_b64":"37dK7LxV/bOlm2jBbDtqe1FtNwaWd4pl3HfN646ytEZN5xRzMqJ1CIhH248vq+ICsB+7HP7TxyKMeD9xXdP4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"766f201731d6f96bae663dcc11967c2f2e06e8e6461c49595841e9f250f88f48","last_reissued_at":"2026-06-09T01:04:41.409380Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:41.409380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hongfeng Wu, Li Zhu","submitted_at":"2026-02-12T10:09:56Z","abstract_excerpt":"In this work, We introduce a new upper bound on the Hamming distance of simple-root constacyclic codes over finite fields, which we call the arithmetic Singleton bound. The main technical tool is the notion of a multiple equal-difference (MED) representation. Via the MED representations of the defining set of the generator polynomial of a simple-root constacyclic code, we obtain a family of upper bounds on its Hamming distance, among which the weakest one coincides with the Singleton bound, while the strongest one is defined to be the arithmetic Singleton bound for this code. Consequently, the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.11788","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/2602.11788/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":"2602.11788","created_at":"2026-06-09T01:04:41.409451+00:00"},{"alias_kind":"arxiv_version","alias_value":"2602.11788v2","created_at":"2026-06-09T01:04:41.409451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.11788","created_at":"2026-06-09T01:04:41.409451+00:00"},{"alias_kind":"pith_short_12","alias_value":"OZXSAFZR234W","created_at":"2026-06-09T01:04:41.409451+00:00"},{"alias_kind":"pith_short_16","alias_value":"OZXSAFZR234WXLTG","created_at":"2026-06-09T01:04:41.409451+00:00"},{"alias_kind":"pith_short_8","alias_value":"OZXSAFZR","created_at":"2026-06-09T01:04:41.409451+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/OZXSAFZR234WXLTGHXGBDFT4F4","json":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4.json","graph_json":"https://pith.science/api/pith-number/OZXSAFZR234WXLTGHXGBDFT4F4/graph.json","events_json":"https://pith.science/api/pith-number/OZXSAFZR234WXLTGHXGBDFT4F4/events.json","paper":"https://pith.science/paper/OZXSAFZR"},"agent_actions":{"view_html":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4","download_json":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4.json","view_paper":"https://pith.science/paper/OZXSAFZR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2602.11788&json=true","fetch_graph":"https://pith.science/api/pith-number/OZXSAFZR234WXLTGHXGBDFT4F4/graph.json","fetch_events":"https://pith.science/api/pith-number/OZXSAFZR234WXLTGHXGBDFT4F4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/action/storage_attestation","attest_author":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/action/author_attestation","sign_citation":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/action/citation_signature","submit_replication":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/action/replication_record"}},"created_at":"2026-06-09T01:04:41.409451+00:00","updated_at":"2026-06-09T01:04:41.409451+00:00"}