{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:ATWDM5O3NVC3M22TLTSSVBPBCC","short_pith_number":"pith:ATWDM5O3","schema_version":"1.0","canonical_sha256":"04ec3675db6d45b66b535ce52a85e110af3cdbe19f82abaf98c4c606c7dd349c","source":{"kind":"arxiv","id":"0905.4487","version":1},"attestation_state":"computed","paper":{"title":"Bounding the Sum of Square Roots via Lattice Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Celi Sun, Jiazhe Chen, Qi Cheng, Xianmeng Meng","submitted_at":"2009-05-27T18:23:11Z","abstract_excerpt":"Let $k$ and $n$ be positive integers. Define $R(n,k)$ to be the minimum positive value of $$ | e_i \\sqrt{s_1} + e_2 \\sqrt{s_2} + ... + e_k \\sqrt{s_k} -t | $$ where $ s_1, s_2, ..., s_k$ are positive integers no larger than $n$, $t$ is an integer and $e_i\\in \\{1,0, -1\\}$ for all $1\\leq i\\leq k$. It is important in computational geometry to determine a good lower and upper bound of $ R(n,k)$. In this paper we show that this problem is closely related to the shortest vector problem in certain integral lattices and present an algorithm to find lower bounds based on lattice reduction algorithms. Al"},"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":"0905.4487","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-05-27T18:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"31eff8b79028bcd0e46cd46502ec44a1e94cc172ecf279d77bb4546022ec6553","abstract_canon_sha256":"212a3fad79b354db2c4d7ca9bc4beedc2370e7d81048bc50e64e34af72fb2c2f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:13:31.495474Z","signature_b64":"eFH4lZ9gaIMVTp4DuhpHJ/iKChpdPKLGbFce3qrIRq9Tnc8gaRpAREuBbBddrnpr35tIsGYZIiTv3aoGR0ANCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04ec3675db6d45b66b535ce52a85e110af3cdbe19f82abaf98c4c606c7dd349c","last_reissued_at":"2026-05-18T02:13:31.494828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:13:31.494828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounding the Sum of Square Roots via Lattice Reduction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Celi Sun, Jiazhe Chen, Qi Cheng, Xianmeng Meng","submitted_at":"2009-05-27T18:23:11Z","abstract_excerpt":"Let $k$ and $n$ be positive integers. Define $R(n,k)$ to be the minimum positive value of $$ | e_i \\sqrt{s_1} + e_2 \\sqrt{s_2} + ... + e_k \\sqrt{s_k} -t | $$ where $ s_1, s_2, ..., s_k$ are positive integers no larger than $n$, $t$ is an integer and $e_i\\in \\{1,0, -1\\}$ for all $1\\leq i\\leq k$. It is important in computational geometry to determine a good lower and upper bound of $ R(n,k)$. In this paper we show that this problem is closely related to the shortest vector problem in certain integral lattices and present an algorithm to find lower bounds based on lattice reduction algorithms. Al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4487","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":""},"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":"0905.4487","created_at":"2026-05-18T02:13:31.494937+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.4487v1","created_at":"2026-05-18T02:13:31.494937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4487","created_at":"2026-05-18T02:13:31.494937+00:00"},{"alias_kind":"pith_short_12","alias_value":"ATWDM5O3NVC3","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_16","alias_value":"ATWDM5O3NVC3M22T","created_at":"2026-05-18T12:25:58.837520+00:00"},{"alias_kind":"pith_short_8","alias_value":"ATWDM5O3","created_at":"2026-05-18T12:25:58.837520+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/ATWDM5O3NVC3M22TLTSSVBPBCC","json":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC.json","graph_json":"https://pith.science/api/pith-number/ATWDM5O3NVC3M22TLTSSVBPBCC/graph.json","events_json":"https://pith.science/api/pith-number/ATWDM5O3NVC3M22TLTSSVBPBCC/events.json","paper":"https://pith.science/paper/ATWDM5O3"},"agent_actions":{"view_html":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC","download_json":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC.json","view_paper":"https://pith.science/paper/ATWDM5O3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.4487&json=true","fetch_graph":"https://pith.science/api/pith-number/ATWDM5O3NVC3M22TLTSSVBPBCC/graph.json","fetch_events":"https://pith.science/api/pith-number/ATWDM5O3NVC3M22TLTSSVBPBCC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/action/storage_attestation","attest_author":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/action/author_attestation","sign_citation":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/action/citation_signature","submit_replication":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/action/replication_record"}},"created_at":"2026-05-18T02:13:31.494937+00:00","updated_at":"2026-05-18T02:13:31.494937+00:00"}