{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:ATWDM5O3NVC3M22TLTSSVBPBCC","short_pith_number":"pith:ATWDM5O3","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"},"canonical_sha256":"04ec3675db6d45b66b535ce52a85e110af3cdbe19f82abaf98c4c606c7dd349c","source":{"kind":"arxiv","id":"0905.4487","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4487","created_at":"2026-05-18T02:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4487v1","created_at":"2026-05-18T02:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4487","created_at":"2026-05-18T02:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"ATWDM5O3NVC3","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ATWDM5O3NVC3M22T","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ATWDM5O3","created_at":"2026-05-18T12:25:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:ATWDM5O3NVC3M22TLTSSVBPBCC","target":"record","payload":{"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"},"canonical_sha256":"04ec3675db6d45b66b535ce52a85e110af3cdbe19f82abaf98c4c606c7dd349c","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"},"source_kind":"arxiv","source_id":"0905.4487","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-05-18T02:13:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rt57ourJ5UdFWUWOgv8zU6vdgir2KxM3sC6K2R2uaNpP5t/zr24LL7+GJaz7065nkprjUN/8sDE2ECDmBGpkBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:30:22.500594Z"},"content_sha256":"4f7f5547dbb92eb5094e7efd6618e12ad6ec1e78cbdec60cd203545f3000c759","schema_version":"1.0","event_id":"sha256:4f7f5547dbb92eb5094e7efd6618e12ad6ec1e78cbdec60cd203545f3000c759"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:ATWDM5O3NVC3M22TLTSSVBPBCC","target":"graph","payload":{"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"},"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-05-18T02:13:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9T/Fvcq1DWhpKWOlUSrI6r6GEPZe+f1qSefYzf6+4ucpBIuK9v/JeVaiMZUUo6yfSFsFhIlOKbur9wiDbiuVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T15:30:22.500941Z"},"content_sha256":"b3348ad7fe1abf47583b9684cd36a1eb81f5de8e5eb458b673a059cf86f00757","schema_version":"1.0","event_id":"sha256:b3348ad7fe1abf47583b9684cd36a1eb81f5de8e5eb458b673a059cf86f00757"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/bundle.json","state_url":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/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-09T15:30:22Z","links":{"resolver":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC","bundle":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/bundle.json","state":"https://pith.science/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATWDM5O3NVC3M22TLTSSVBPBCC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:ATWDM5O3NVC3M22TLTSSVBPBCC","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":"212a3fad79b354db2c4d7ca9bc4beedc2370e7d81048bc50e64e34af72fb2c2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-05-27T18:23:11Z","title_canon_sha256":"31eff8b79028bcd0e46cd46502ec44a1e94cc172ecf279d77bb4546022ec6553"},"schema_version":"1.0","source":{"id":"0905.4487","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.4487","created_at":"2026-05-18T02:13:31Z"},{"alias_kind":"arxiv_version","alias_value":"0905.4487v1","created_at":"2026-05-18T02:13:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.4487","created_at":"2026-05-18T02:13:31Z"},{"alias_kind":"pith_short_12","alias_value":"ATWDM5O3NVC3","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_16","alias_value":"ATWDM5O3NVC3M22T","created_at":"2026-05-18T12:25:58Z"},{"alias_kind":"pith_short_8","alias_value":"ATWDM5O3","created_at":"2026-05-18T12:25:58Z"}],"graph_snapshots":[{"event_id":"sha256:b3348ad7fe1abf47583b9684cd36a1eb81f5de8e5eb458b673a059cf86f00757","target":"graph","created_at":"2026-05-18T02:13:31Z","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"},"paper":{"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","authors_text":"Celi Sun, Jiazhe Chen, Qi Cheng, Xianmeng Meng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-05-27T18:23:11Z","title":"Bounding the Sum of Square Roots via Lattice Reduction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.4487","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:4f7f5547dbb92eb5094e7efd6618e12ad6ec1e78cbdec60cd203545f3000c759","target":"record","created_at":"2026-05-18T02:13:31Z","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":"212a3fad79b354db2c4d7ca9bc4beedc2370e7d81048bc50e64e34af72fb2c2f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2009-05-27T18:23:11Z","title_canon_sha256":"31eff8b79028bcd0e46cd46502ec44a1e94cc172ecf279d77bb4546022ec6553"},"schema_version":"1.0","source":{"id":"0905.4487","kind":"arxiv","version":1}},"canonical_sha256":"04ec3675db6d45b66b535ce52a85e110af3cdbe19f82abaf98c4c606c7dd349c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04ec3675db6d45b66b535ce52a85e110af3cdbe19f82abaf98c4c606c7dd349c","first_computed_at":"2026-05-18T02:13:31.494828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:13:31.494828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eFH4lZ9gaIMVTp4DuhpHJ/iKChpdPKLGbFce3qrIRq9Tnc8gaRpAREuBbBddrnpr35tIsGYZIiTv3aoGR0ANCA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:13:31.495474Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.4487","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f7f5547dbb92eb5094e7efd6618e12ad6ec1e78cbdec60cd203545f3000c759","sha256:b3348ad7fe1abf47583b9684cd36a1eb81f5de8e5eb458b673a059cf86f00757"],"state_sha256":"a043e475cf46872fa147e4d14c738fdc0157a490d056528cd2da247eea5fb257"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0OfIGwzvz/xPlri+zQzwdX/oD4Ajc5mv9EElek3N01VK9aC9bkoZX+YiWsoGnRHjM9ySoD870uQhSeIvm9gBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T15:30:22.502899Z","bundle_sha256":"cf7f3dd67c5a67216ba412da4ebf6e617e66bd1a7329287a941d0a31ca048c17"}}