{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OZXSAFZR234WXLTGHXGBDFT4F4","short_pith_number":"pith:OZXSAFZR","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"},"canonical_sha256":"766f201731d6f96bae663dcc11967c2f2e06e8e6461c49595841e9f250f88f48","source":{"kind":"arxiv","id":"2602.11788","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.11788","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2602.11788v2","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.11788","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"OZXSAFZR234W","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"OZXSAFZR234WXLTG","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"OZXSAFZR","created_at":"2026-06-09T01:04:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OZXSAFZR234WXLTGHXGBDFT4F4","target":"record","payload":{"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"},"canonical_sha256":"766f201731d6f96bae663dcc11967c2f2e06e8e6461c49595841e9f250f88f48","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"},"source_kind":"arxiv","source_id":"2602.11788","source_version":2,"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-06-09T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X11CpnGckofL2UVK7BwvBoYe41eJ6M+oAwiQif6lmzD1ywZNQoHUgT10bjUF20N9TQop9i6/UzHTAdf791liDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:19:27.236615Z"},"content_sha256":"bb8a85bfcde2087b2ebca25a2baa5fc66a69768c55ae9a607d2fbc4596828f7b","schema_version":"1.0","event_id":"sha256:bb8a85bfcde2087b2ebca25a2baa5fc66a69768c55ae9a607d2fbc4596828f7b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OZXSAFZR234WXLTGHXGBDFT4F4","target":"graph","payload":{"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"},"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-06-09T01:04:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RTd0oCbnUUfNV9Q0IfueMtQOau+WPOtu+6YzA6jopoEf6vwAvhyiIeC44KBwkf7iayvQViKF6kV1abPF6AgwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T19:19:27.237437Z"},"content_sha256":"28e32188661b909381ffb041b3f6f74374a64551d0041c65b3c383afadb0a4e8","schema_version":"1.0","event_id":"sha256:28e32188661b909381ffb041b3f6f74374a64551d0041c65b3c383afadb0a4e8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/bundle.json","state_url":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OZXSAFZR234WXLTGHXGBDFT4F4/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-09T19:19:27Z","links":{"resolver":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4","bundle":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/bundle.json","state":"https://pith.science/pith/OZXSAFZR234WXLTGHXGBDFT4F4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OZXSAFZR234WXLTGHXGBDFT4F4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OZXSAFZR234WXLTGHXGBDFT4F4","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":"304bf50d342af7897fe7b6963ae249703c953c906374136c69440005c8df6bee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-12T10:09:56Z","title_canon_sha256":"74dbfc2de243852c4796f57fa15a0ba26cfe3f814552074a4a0c1e3a25161b12"},"schema_version":"1.0","source":{"id":"2602.11788","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.11788","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"arxiv_version","alias_value":"2602.11788v2","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.11788","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"pith_short_12","alias_value":"OZXSAFZR234W","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"pith_short_16","alias_value":"OZXSAFZR234WXLTG","created_at":"2026-06-09T01:04:41Z"},{"alias_kind":"pith_short_8","alias_value":"OZXSAFZR","created_at":"2026-06-09T01:04:41Z"}],"graph_snapshots":[{"event_id":"sha256:28e32188661b909381ffb041b3f6f74374a64551d0041c65b3c383afadb0a4e8","target":"graph","created_at":"2026-06-09T01:04:41Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2602.11788/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Hongfeng Wu, Li Zhu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-12T10:09:56Z","title":"The Arithmetic Singleton Bound on the Hamming Distances of Simple-rooted Constacyclic Codes over Finite Fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2602.11788","kind":"arxiv","version":2},"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:bb8a85bfcde2087b2ebca25a2baa5fc66a69768c55ae9a607d2fbc4596828f7b","target":"record","created_at":"2026-06-09T01:04:41Z","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":"304bf50d342af7897fe7b6963ae249703c953c906374136c69440005c8df6bee","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-02-12T10:09:56Z","title_canon_sha256":"74dbfc2de243852c4796f57fa15a0ba26cfe3f814552074a4a0c1e3a25161b12"},"schema_version":"1.0","source":{"id":"2602.11788","kind":"arxiv","version":2}},"canonical_sha256":"766f201731d6f96bae663dcc11967c2f2e06e8e6461c49595841e9f250f88f48","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"766f201731d6f96bae663dcc11967c2f2e06e8e6461c49595841e9f250f88f48","first_computed_at":"2026-06-09T01:04:41.409380Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-09T01:04:41.409380Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"37dK7LxV/bOlm2jBbDtqe1FtNwaWd4pl3HfN646ytEZN5xRzMqJ1CIhH248vq+ICsB+7HP7TxyKMeD9xXdP4DA==","signature_status":"signed_v1","signed_at":"2026-06-09T01:04:41.409989Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.11788","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb8a85bfcde2087b2ebca25a2baa5fc66a69768c55ae9a607d2fbc4596828f7b","sha256:28e32188661b909381ffb041b3f6f74374a64551d0041c65b3c383afadb0a4e8"],"state_sha256":"234f8adc45fded62ba2fb9b6444501b661c4f08dbf2acfc193b5d29bac29322f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AvjB2J7wlAu76EyqpmadEotTUqdaUVO9OBNZnLQY5OW4Npzopmxxls8N81QcR/azY8xyYqZQ6YC8gIp2wCHYDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T19:19:27.242052Z","bundle_sha256":"ea6d6626b66fd2aaa8ec83aa04d240c5c5f550183a1f33caef83ec3397354da2"}}