{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:CS7BRNPTIM2GP4HT7IAGLM6VCM","short_pith_number":"pith:CS7BRNPT","schema_version":"1.0","canonical_sha256":"14be18b5f3433467f0f3fa0065b3d5132e20ef0707565690dbc4a9d0b6ca1acf","source":{"kind":"arxiv","id":"1202.6598","version":1},"attestation_state":"computed","paper":{"title":"Sublinear Time Approximate Sum via Uniform Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Fu, Wenfeng Li, Zhiyong Peng","submitted_at":"2012-02-29T16:52:17Z","abstract_excerpt":"We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an $(1+\\epsilon)$-approximation for the sum problem in time ${O({n(\\log\\log n)\\over\\sum_{i=1}^n a_i})}$, where $\\epsilon$ is a constant in $(0,1)$. Our randomized algorithm is based on the uniform random sampling, which selects one element with equal probability from the input list each time. We also prove a lower bound $\\Omega({n\\over \\sum_{i=1}^n a_i})$, which almost matc"},"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":"1202.6598","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T16:52:17Z","cross_cats_sorted":[],"title_canon_sha256":"abc5352806610c251cb1b61b6b241562a6f94c233c8fb64b0eb8f20b6f3fbdf7","abstract_canon_sha256":"4e0ca904c014f40bf3d653d372633e9a3dfe139bfed1451ff824f2982f839443"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:12.116796Z","signature_b64":"WgVPAFXW0IElEm/jqGGSG8lu+1bIxvUhXi1Xz7EEB/05g8GtRuaunFMzH8i4fixrKZW+TUzJtcEKpsJmSmNTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"14be18b5f3433467f0f3fa0065b3d5132e20ef0707565690dbc4a9d0b6ca1acf","last_reissued_at":"2026-05-18T04:01:12.116253Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:12.116253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sublinear Time Approximate Sum via Uniform Random Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bin Fu, Wenfeng Li, Zhiyong Peng","submitted_at":"2012-02-29T16:52:17Z","abstract_excerpt":"We investigate the approximation for computing the sum $a_1+...+a_n$ with an input of a list of nonnegative elements $a_1,..., a_n$. If all elements are in the range $[0,1]$, there is a randomized algorithm that can compute an $(1+\\epsilon)$-approximation for the sum problem in time ${O({n(\\log\\log n)\\over\\sum_{i=1}^n a_i})}$, where $\\epsilon$ is a constant in $(0,1)$. Our randomized algorithm is based on the uniform random sampling, which selects one element with equal probability from the input list each time. We also prove a lower bound $\\Omega({n\\over \\sum_{i=1}^n a_i})$, which almost matc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6598","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":"1202.6598","created_at":"2026-05-18T04:01:12.116348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.6598v1","created_at":"2026-05-18T04:01:12.116348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6598","created_at":"2026-05-18T04:01:12.116348+00:00"},{"alias_kind":"pith_short_12","alias_value":"CS7BRNPTIM2G","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_16","alias_value":"CS7BRNPTIM2GP4HT","created_at":"2026-05-18T12:27:01.376967+00:00"},{"alias_kind":"pith_short_8","alias_value":"CS7BRNPT","created_at":"2026-05-18T12:27:01.376967+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/CS7BRNPTIM2GP4HT7IAGLM6VCM","json":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM.json","graph_json":"https://pith.science/api/pith-number/CS7BRNPTIM2GP4HT7IAGLM6VCM/graph.json","events_json":"https://pith.science/api/pith-number/CS7BRNPTIM2GP4HT7IAGLM6VCM/events.json","paper":"https://pith.science/paper/CS7BRNPT"},"agent_actions":{"view_html":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM","download_json":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM.json","view_paper":"https://pith.science/paper/CS7BRNPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.6598&json=true","fetch_graph":"https://pith.science/api/pith-number/CS7BRNPTIM2GP4HT7IAGLM6VCM/graph.json","fetch_events":"https://pith.science/api/pith-number/CS7BRNPTIM2GP4HT7IAGLM6VCM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/action/storage_attestation","attest_author":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/action/author_attestation","sign_citation":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/action/citation_signature","submit_replication":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/action/replication_record"}},"created_at":"2026-05-18T04:01:12.116348+00:00","updated_at":"2026-05-18T04:01:12.116348+00:00"}