{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:H4G7XAXVKUDF2E5UOXPCK77VVC","short_pith_number":"pith:H4G7XAXV","schema_version":"1.0","canonical_sha256":"3f0dfb82f555065d13b475de257ff5a8b8848aed5a9a2fa46b72337c0d9ccc93","source":{"kind":"arxiv","id":"2606.26784","version":1},"attestation_state":"computed","paper":{"title":"MergeLLL: A Hierarchical Divide-and-Conquer Framework for LLL-Based Lattice Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Niharika Gauraha","submitted_at":"2026-06-25T09:20:03Z","abstract_excerpt":"Lattice basis reduction algorithms have various applications in computational number theory and lattice-based cryptography, but their complexity increases rapidly with the dimension. Motivated by the divide-and-conquer strategy of merge sort and incorporating PotLLL-style deep insertions during recombination, MergeLLL is proposed. In this framework, a lattice basis is split into sub-bases, local reductions are performed independently, and the full basis is reconstructed through hierarchical merging.\n  The approach is focused on improving local lattice structure first before global basis proper"},"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.26784","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2026-06-25T09:20:03Z","cross_cats_sorted":[],"title_canon_sha256":"bb3727009686f29f356f6ea4d42cc509f4e23482e9cd11dcda31af14c949ca68","abstract_canon_sha256":"8dadb5f6f9145cbe5e1f585b609af3dae8e7cb57a60230ebc0bf6e59702abf4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:15:59.610159Z","signature_b64":"TgiyB3wbWQyOI2AdlkPiP+6xpqsw1lsYqoGI3A5ONLp4Dek/k9vPmNWxtplXgHmklVySgpJE00CpbFBWdNbsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3f0dfb82f555065d13b475de257ff5a8b8848aed5a9a2fa46b72337c0d9ccc93","last_reissued_at":"2026-06-26T01:15:59.609813Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:15:59.609813Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MergeLLL: A Hierarchical Divide-and-Conquer Framework for LLL-Based Lattice Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Niharika Gauraha","submitted_at":"2026-06-25T09:20:03Z","abstract_excerpt":"Lattice basis reduction algorithms have various applications in computational number theory and lattice-based cryptography, but their complexity increases rapidly with the dimension. Motivated by the divide-and-conquer strategy of merge sort and incorporating PotLLL-style deep insertions during recombination, MergeLLL is proposed. In this framework, a lattice basis is split into sub-bases, local reductions are performed independently, and the full basis is reconstructed through hierarchical merging.\n  The approach is focused on improving local lattice structure first before global basis proper"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.26784","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.26784/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.26784","created_at":"2026-06-26T01:15:59.609867+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.26784v1","created_at":"2026-06-26T01:15:59.609867+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.26784","created_at":"2026-06-26T01:15:59.609867+00:00"},{"alias_kind":"pith_short_12","alias_value":"H4G7XAXVKUDF","created_at":"2026-06-26T01:15:59.609867+00:00"},{"alias_kind":"pith_short_16","alias_value":"H4G7XAXVKUDF2E5U","created_at":"2026-06-26T01:15:59.609867+00:00"},{"alias_kind":"pith_short_8","alias_value":"H4G7XAXV","created_at":"2026-06-26T01:15:59.609867+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/H4G7XAXVKUDF2E5UOXPCK77VVC","json":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC.json","graph_json":"https://pith.science/api/pith-number/H4G7XAXVKUDF2E5UOXPCK77VVC/graph.json","events_json":"https://pith.science/api/pith-number/H4G7XAXVKUDF2E5UOXPCK77VVC/events.json","paper":"https://pith.science/paper/H4G7XAXV"},"agent_actions":{"view_html":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC","download_json":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC.json","view_paper":"https://pith.science/paper/H4G7XAXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.26784&json=true","fetch_graph":"https://pith.science/api/pith-number/H4G7XAXVKUDF2E5UOXPCK77VVC/graph.json","fetch_events":"https://pith.science/api/pith-number/H4G7XAXVKUDF2E5UOXPCK77VVC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC/action/storage_attestation","attest_author":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC/action/author_attestation","sign_citation":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC/action/citation_signature","submit_replication":"https://pith.science/pith/H4G7XAXVKUDF2E5UOXPCK77VVC/action/replication_record"}},"created_at":"2026-06-26T01:15:59.609867+00:00","updated_at":"2026-06-26T01:15:59.609867+00:00"}