{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:DTVYGPKJ5IB2TM5MTCYQYBVCEZ","short_pith_number":"pith:DTVYGPKJ","canonical_record":{"source":{"id":"2604.22900","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-24T13:54:33Z","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"title_canon_sha256":"f22d4343e2ae3f58bf1679107170bd675ec8d4262d17856ad5ca3c2b45bcce6b","abstract_canon_sha256":"753d4ab5ff835b2e1ea8debe452131b663a8d2a03a4345b4be5edb1822f2f9d7"},"schema_version":"1.0"},"canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","source":{"kind":"arxiv","id":"2604.22900","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22900","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22900v2","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22900","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"DTVYGPKJ5IB2","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"pith_short_16","alias_value":"DTVYGPKJ5IB2TM5M","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"pith_short_8","alias_value":"DTVYGPKJ","created_at":"2026-06-03T01:05:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:DTVYGPKJ5IB2TM5MTCYQYBVCEZ","target":"record","payload":{"canonical_record":{"source":{"id":"2604.22900","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-24T13:54:33Z","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"title_canon_sha256":"f22d4343e2ae3f58bf1679107170bd675ec8d4262d17856ad5ca3c2b45bcce6b","abstract_canon_sha256":"753d4ab5ff835b2e1ea8debe452131b663a8d2a03a4345b4be5edb1822f2f9d7"},"schema_version":"1.0"},"canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-03T01:05:50.644891Z","signature_b64":"vtGzkcjqgBfwl7R27skrzqyBnHqwRwKXnYknsBKKEtbVfJ8h7rE634/HXC7pkbc88J7gBz9sLLt/hRaDbu7gDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","last_reissued_at":"2026-06-03T01:05:50.644486Z","signature_status":"signed_v1","first_computed_at":"2026-06-03T01:05:50.644486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2604.22900","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-03T01:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7TVc3H7cBYTsQaypsH7FxgcldLluMoCnSNdnNKFotwFmzb//cbNb6ICWuc1KOuH+ZO0d2PWYO6xjK+tybu1TCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:27:03.063364Z"},"content_sha256":"16e5e182a73f5da49523db51b7657b6a46a41bc56f3404706f5fcbc4c8fd2b0b","schema_version":"1.0","event_id":"sha256:16e5e182a73f5da49523db51b7657b6a46a41bc56f3404706f5fcbc4c8fd2b0b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:DTVYGPKJ5IB2TM5MTCYQYBVCEZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","cross_cats":["cs.IT","math.IT","quant-ph"],"primary_cat":"cs.CR","authors_text":"Ming-Xing Luo","submitted_at":"2026-04-24T13:54:33Z","abstract_excerpt":"We extend the CDPR's quantum attack from ideal lattices to module lattices over $2^k$-th cyclotomic rings. Using trace orthogonality of the power basis, we decompose a rank-$d$ module into mutually orthogonal rank-$1$ submodules, and apply CDPR's analysis to each independently and return the shortest candidate. The Hermite factor $\\exp(\\tilde{O}(\\sqrt{n}))$ matches the ideal case, with a module reduction factor $\\alpha_d=O(1)$ independent of the rank, under a balance hypothesis (proved for Gaussian distribution) automatic for MLWE-distributed bases. To enable a bounded-precision implementation"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"This base module reduction achieves a Hermite factor exp(Õ(√n)) matching the ideal case, with a module reduction factor O(1) independent of the rank, under a balance hypothesis automatically satisfied for MLWE-distributed bases.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"All results build on the class number one condition h_k^+=1 established in Part I of this series; the balance hypothesis is assumed to hold automatically for MLWE bases without independent proof here.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"CDPR reduction extends to module lattices with Hermite factor exp(Õ(√n)), O(1) rank-independent module factor under MLWE balance, plus optimal sign discrepancy δ*≈0.4407 from MILP, assuming class number one from Part I.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8a8c983e07c500053276d690da7b25441ebc9247d97e5add0a8e71cd4d719f6d"},"source":{"id":"2604.22900","kind":"arxiv","version":2},"verdict":{"id":"0ff17cde-d17b-4527-aef7-b8397e5b9ee8","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-08T11:25:55.368898Z","strongest_claim":"This base module reduction achieves a Hermite factor exp(Õ(√n)) matching the ideal case, with a module reduction factor O(1) independent of the rank, under a balance hypothesis automatically satisfied for MLWE-distributed bases.","one_line_summary":"CDPR reduction extends to module lattices with Hermite factor exp(Õ(√n)), O(1) rank-independent module factor under MLWE balance, plus optimal sign discrepancy δ*≈0.4407 from MILP, assuming class number one from Part I.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"All results build on the class number one condition h_k^+=1 established in Part I of this series; the balance hypothesis is assumed to hold automatically for MLWE bases without independent proof here.","pith_extraction_headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2604.22900/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-21T10:37:26.541258Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T23:53:24.646855Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"4b0bf08ef350ab3a8d225857e3b85c884a5871121328928984e1b7301539a8ea"},"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":"0ff17cde-d17b-4527-aef7-b8397e5b9ee8"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-03T01:05:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/6BSIxjViPCgPz2Mye4BLo4fsf35vwVtP8uS+noD1PfFVntjVCCnvpqfllsLaF+i5xVPOAj5hqkIepbEMy9/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:27:03.064605Z"},"content_sha256":"32593250c5a4e89218c0837f27c78db8d9a9a523b3d62df5156b860b7a3d09dd","schema_version":"1.0","event_id":"sha256:32593250c5a4e89218c0837f27c78db8d9a9a523b3d62df5156b860b7a3d09dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/bundle.json","state_url":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/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-11T08:27:03Z","links":{"resolver":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ","bundle":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/bundle.json","state":"https://pith.science/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTVYGPKJ5IB2TM5MTCYQYBVCEZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:DTVYGPKJ5IB2TM5MTCYQYBVCEZ","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":"753d4ab5ff835b2e1ea8debe452131b663a8d2a03a4345b4be5edb1822f2f9d7","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-24T13:54:33Z","title_canon_sha256":"f22d4343e2ae3f58bf1679107170bd675ec8d4262d17856ad5ca3c2b45bcce6b"},"schema_version":"1.0","source":{"id":"2604.22900","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2604.22900","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"arxiv_version","alias_value":"2604.22900v2","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2604.22900","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"pith_short_12","alias_value":"DTVYGPKJ5IB2","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"pith_short_16","alias_value":"DTVYGPKJ5IB2TM5M","created_at":"2026-06-03T01:05:50Z"},{"alias_kind":"pith_short_8","alias_value":"DTVYGPKJ","created_at":"2026-06-03T01:05:50Z"}],"graph_snapshots":[{"event_id":"sha256:32593250c5a4e89218c0837f27c78db8d9a9a523b3d62df5156b860b7a3d09dd","target":"graph","created_at":"2026-06-03T01:05:50Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"This base module reduction achieves a Hermite factor exp(Õ(√n)) matching the ideal case, with a module reduction factor O(1) independent of the rank, under a balance hypothesis automatically satisfied for MLWE-distributed bases."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"All results build on the class number one condition h_k^+=1 established in Part I of this series; the balance hypothesis is assumed to hold automatically for MLWE bases without independent proof here."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"CDPR reduction extends to module lattices with Hermite factor exp(Õ(√n)), O(1) rank-independent module factor under MLWE balance, plus optimal sign discrepancy δ*≈0.4407 from MILP, assuming class number one from Part I."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices."}],"snapshot_sha256":"8a8c983e07c500053276d690da7b25441ebc9247d97e5add0a8e71cd4d719f6d"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-21T10:37:26.541258Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T23:53:24.646855Z","status":"completed","version":"1.0.0"}],"endpoint":"/pith/2604.22900/integrity.json","findings":[],"snapshot_sha256":"4b0bf08ef350ab3a8d225857e3b85c884a5871121328928984e1b7301539a8ea","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We extend the CDPR's quantum attack from ideal lattices to module lattices over $2^k$-th cyclotomic rings. Using trace orthogonality of the power basis, we decompose a rank-$d$ module into mutually orthogonal rank-$1$ submodules, and apply CDPR's analysis to each independently and return the shortest candidate. The Hermite factor $\\exp(\\tilde{O}(\\sqrt{n}))$ matches the ideal case, with a module reduction factor $\\alpha_d=O(1)$ independent of the rank, under a balance hypothesis (proved for Gaussian distribution) automatic for MLWE-distributed bases. To enable a bounded-precision implementation","authors_text":"Ming-Xing Luo","cross_cats":["cs.IT","math.IT","quant-ph"],"headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-24T13:54:33Z","title":"Module Lattice Security (Part II): Module Lattice Reduction via Optimal Sign Selection"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2604.22900","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-08T11:25:55.368898Z","id":"0ff17cde-d17b-4527-aef7-b8397e5b9ee8","model_set":{"reader":"grok-4.3"},"one_line_summary":"CDPR reduction extends to module lattices with Hermite factor exp(Õ(√n)), O(1) rank-independent module factor under MLWE balance, plus optimal sign discrepancy δ*≈0.4407 from MILP, assuming class number one from Part I.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Module lattices reduce to the same quality as ideal lattices by decomposing them into rank-1 submodules and optimizing sign choices.","strongest_claim":"This base module reduction achieves a Hermite factor exp(Õ(√n)) matching the ideal case, with a module reduction factor O(1) independent of the rank, under a balance hypothesis automatically satisfied for MLWE-distributed bases.","weakest_assumption":"All results build on the class number one condition h_k^+=1 established in Part I of this series; the balance hypothesis is assumed to hold automatically for MLWE bases without independent proof here."}},"verdict_id":"0ff17cde-d17b-4527-aef7-b8397e5b9ee8"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:16e5e182a73f5da49523db51b7657b6a46a41bc56f3404706f5fcbc4c8fd2b0b","target":"record","created_at":"2026-06-03T01:05:50Z","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":"753d4ab5ff835b2e1ea8debe452131b663a8d2a03a4345b4be5edb1822f2f9d7","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-04-24T13:54:33Z","title_canon_sha256":"f22d4343e2ae3f58bf1679107170bd675ec8d4262d17856ad5ca3c2b45bcce6b"},"schema_version":"1.0","source":{"id":"2604.22900","kind":"arxiv","version":2}},"canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ceb833d49ea03a9b3ac98b10c06a22647b6317106c2e784a930765ff9191726","first_computed_at":"2026-06-03T01:05:50.644486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-03T01:05:50.644486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vtGzkcjqgBfwl7R27skrzqyBnHqwRwKXnYknsBKKEtbVfJ8h7rE634/HXC7pkbc88J7gBz9sLLt/hRaDbu7gDA==","signature_status":"signed_v1","signed_at":"2026-06-03T01:05:50.644891Z","signed_message":"canonical_sha256_bytes"},"source_id":"2604.22900","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16e5e182a73f5da49523db51b7657b6a46a41bc56f3404706f5fcbc4c8fd2b0b","sha256:32593250c5a4e89218c0837f27c78db8d9a9a523b3d62df5156b860b7a3d09dd"],"state_sha256":"83af21b79c70e4c54c44f03bed7da4426988b281e49d55720daf67473199beaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SnqUjrOhCmrw0asTKzU4hyBnxdynzA9WLdsFtO7ovMQ0XchA0Q5tUkzcx2G5UT0KcBSjJHOUsK2S9D18FKmIAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:27:03.070280Z","bundle_sha256":"27d649f283abe64ede06b079df5a7a3261b48466a904e046ff684093fbefc024"}}