{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:K2CP5XYO5P7L6KJZKNMGWPBJQU","short_pith_number":"pith:K2CP5XYO","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"},"canonical_sha256":"5684fedf0eebfebf293953586b3c29850debaa5cbab2f162a93db2b6041e4c16","source":{"kind":"arxiv","id":"2606.13008","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:K2CP5XYO5P7L6KJZKNMGWPBJQU","target":"record","payload":{"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"},"canonical_sha256":"5684fedf0eebfebf293953586b3c29850debaa5cbab2f162a93db2b6041e4c16","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"},"source_kind":"arxiv","source_id":"2606.13008","source_version":1,"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-12T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNU4fdlUgW7modM6dGJIYtlWdo67uQ1BVrARSNt3m0yvUualBPdabeFTRTB1zKoj5W2fOPt76Ja2SlX7nuQ+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:47:22.879505Z"},"content_sha256":"9384c653ee9285e89bc77fdbbdf2892e2f3242e0e632d52a216236dc881d0ee5","schema_version":"1.0","event_id":"sha256:9384c653ee9285e89bc77fdbbdf2892e2f3242e0e632d52a216236dc881d0ee5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:K2CP5XYO5P7L6KJZKNMGWPBJQU","target":"graph","payload":{"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"},"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-12T01:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CC1bOVtAZAWDLnbdDRUKAXYMp12+utDCoMz5vJspiDg5Xc8Iuu9BpAiWl6jFPIUHD/rFehdNIfd/Celo7medCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:47:22.879893Z"},"content_sha256":"73b59b9dd9ea4793dd030825a57e7bca4cf120d5dee3cedfd7b99769cc03fa47","schema_version":"1.0","event_id":"sha256:73b59b9dd9ea4793dd030825a57e7bca4cf120d5dee3cedfd7b99769cc03fa47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/bundle.json","state_url":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/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-25T03:47:22Z","links":{"resolver":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU","bundle":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/bundle.json","state":"https://pith.science/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/K2CP5XYO5P7L6KJZKNMGWPBJQU/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nIBiPz9Iu4JGsc8KiZA7HU9AFgS4mHuosXeefuZiE9b2GYiOnH/8X5JI+uTkBoyRHTDG8KU8r1x/2d4dfbHFCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:47:22.882006Z","bundle_sha256":"241489fceba01b0cfced5f251c3d8f57f104a2b4dbdf399081932c2b6d954e4c"}}