{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:K2CP5XYO5P7L6KJZKNMGWPBJQU","short_pith_number":"pith:K2CP5XYO","schema_version":"1.0","canonical_sha256":"5684fedf0eebfebf293953586b3c29850debaa5cbab2f162a93db2b6041e4c16","source":{"kind":"arxiv","id":"2606.13008","version":1},"attestation_state":"computed","paper":{"title":"Bounds and Constructions of Maximum Toroidal Distance Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinquan Luo, Pengjie Zhong, Yufeng Song","submitted_at":"2026-06-11T07:42:56Z","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"},"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":"2606.13008","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2026-06-11T07:42:56Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"dda61d532dfee778ce5d1c9373b269de863addba933c2de4fe8bca5cf465aa2a","abstract_canon_sha256":"6667da8305c8f46642b98eb1eda9f831d3fed840adb3a08df6e1cd566b5cb57c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-12T01:09:36.869870Z","signature_b64":"5xT3byKObhnEN5WseRJglAURcLkDppEBeoYq+CmHvcOOGoH00T3x5q7asdpywaCXoWI53MdkTAyQVseU0s6QCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5684fedf0eebfebf293953586b3c29850debaa5cbab2f162a93db2b6041e4c16","last_reissued_at":"2026-06-12T01:09:36.869341Z","signature_status":"signed_v1","first_computed_at":"2026-06-12T01:09:36.869341Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds and Constructions of Maximum Toroidal Distance Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Jinquan Luo, Pengjie Zhong, Yufeng Song","submitted_at":"2026-06-11T07:42:56Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.13008","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/2606.13008/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":"2606.13008","created_at":"2026-06-12T01:09:36.869426+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.13008v1","created_at":"2026-06-12T01:09:36.869426+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.13008","created_at":"2026-06-12T01:09:36.869426+00:00"},{"alias_kind":"pith_short_12","alias_value":"K2CP5XYO5P7L","created_at":"2026-06-12T01:09:36.869426+00:00"},{"alias_kind":"pith_short_16","alias_value":"K2CP5XYO5P7L6KJZ","created_at":"2026-06-12T01:09:36.869426+00:00"},{"alias_kind":"pith_short_8","alias_value":"K2CP5XYO","created_at":"2026-06-12T01:09:36.869426+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/K2CP5XYO5P7L6KJZKNMGWPBJQU","json":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU.json","graph_json":"https://pith.science/api/pith-number/K2CP5XYO5P7L6KJZKNMGWPBJQU/graph.json","events_json":"https://pith.science/api/pith-number/K2CP5XYO5P7L6KJZKNMGWPBJQU/events.json","paper":"https://pith.science/paper/K2CP5XYO"},"agent_actions":{"view_html":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU","download_json":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU.json","view_paper":"https://pith.science/paper/K2CP5XYO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.13008&json=true","fetch_graph":"https://pith.science/api/pith-number/K2CP5XYO5P7L6KJZKNMGWPBJQU/graph.json","fetch_events":"https://pith.science/api/pith-number/K2CP5XYO5P7L6KJZKNMGWPBJQU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/action/storage_attestation","attest_author":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/action/author_attestation","sign_citation":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/action/citation_signature","submit_replication":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/action/replication_record"}},"created_at":"2026-06-12T01:09:36.869426+00:00","updated_at":"2026-06-12T01:09:36.869426+00:00"}