{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:K2CP5XYO5P7L6KJZKNMGWPBJQU","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":"6667da8305c8f46642b98eb1eda9f831d3fed840adb3a08df6e1cd566b5cb57c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-11T07:42:56Z","title_canon_sha256":"dda61d532dfee778ce5d1c9373b269de863addba933c2de4fe8bca5cf465aa2a"},"schema_version":"1.0","source":{"id":"2606.13008","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.13008","created_at":"2026-06-12T01:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"2606.13008v1","created_at":"2026-06-12T01:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13008","created_at":"2026-06-12T01:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"K2CP5XYO5P7L","created_at":"2026-06-12T01:09:36Z"},{"alias_kind":"pith_short_16","alias_value":"K2CP5XYO5P7L6KJZ","created_at":"2026-06-12T01:09:36Z"},{"alias_kind":"pith_short_8","alias_value":"K2CP5XYO","created_at":"2026-06-12T01:09:36Z"}],"graph_snapshots":[{"event_id":"sha256:73b59b9dd9ea4793dd030825a57e7bca4cf120d5dee3cedfd7b99769cc03fa47","target":"graph","created_at":"2026-06-12T01:09:36Z","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/2606.13008/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In lattice-based cryptographic schemes, both encoded messages and accumulated decryption noise are represented in a modulo $q$ space. Therefore, it is natural to study toroidal distances and maximum toroidal distance (MTD) codes. In this paper, we derive some upper bounds for minimum toroidal distance of a code, including a Plotkin-type bound, a local ball--Plotkin bound, and a Delsarte linear programming bound. We also exhibit examples showing that these bounds are sharp in some cases. Moreover, we present several code constructions with good minimum distance, some of which are MTD codes. For","authors_text":"Jinquan Luo, Pengjie Zhong, Yufeng Song","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-11T07:42:56Z","title":"Bounds and Constructions of Maximum Toroidal Distance Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13008","kind":"arxiv","version":1},"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:9384c653ee9285e89bc77fdbbdf2892e2f3242e0e632d52a216236dc881d0ee5","target":"record","created_at":"2026-06-12T01:09:36Z","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":"6667da8305c8f46642b98eb1eda9f831d3fed840adb3a08df6e1cd566b5cb57c","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-11T07:42:56Z","title_canon_sha256":"dda61d532dfee778ce5d1c9373b269de863addba933c2de4fe8bca5cf465aa2a"},"schema_version":"1.0","source":{"id":"2606.13008","kind":"arxiv","version":1}},"canonical_sha256":"5684fedf0eebfebf293953586b3c29850debaa5cbab2f162a93db2b6041e4c16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5684fedf0eebfebf293953586b3c29850debaa5cbab2f162a93db2b6041e4c16","first_computed_at":"2026-06-12T01:09:36.869341Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-12T01:09:36.869341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5xT3byKObhnEN5WseRJglAURcLkDppEBeoYq+CmHvcOOGoH00T3x5q7asdpywaCXoWI53MdkTAyQVseU0s6QCA==","signature_status":"signed_v1","signed_at":"2026-06-12T01:09:36.869870Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.13008","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9384c653ee9285e89bc77fdbbdf2892e2f3242e0e632d52a216236dc881d0ee5","sha256:73b59b9dd9ea4793dd030825a57e7bca4cf120d5dee3cedfd7b99769cc03fa47"],"state_sha256":"1ccab7f68c57ac5c318820e590d95a5f276c4d28eb2c4a625ecbaaf43b52e99e"}