{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:CS7BRNPTIM2GP4HT7IAGLM6VCM","short_pith_number":"pith:CS7BRNPT","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"},"canonical_sha256":"14be18b5f3433467f0f3fa0065b3d5132e20ef0707565690dbc4a9d0b6ca1acf","source":{"kind":"arxiv","id":"1202.6598","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6598","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6598v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6598","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"CS7BRNPTIM2G","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CS7BRNPTIM2GP4HT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CS7BRNPT","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:CS7BRNPTIM2GP4HT7IAGLM6VCM","target":"record","payload":{"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"},"canonical_sha256":"14be18b5f3433467f0f3fa0065b3d5132e20ef0707565690dbc4a9d0b6ca1acf","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"},"source_kind":"arxiv","source_id":"1202.6598","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-18T04:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QQYrGRB21dDv7W5+36SHbDdpv1cRfFzty1oiUL0pYspf/AEt3hwgMgqxLrDFlWnq7UZA4RhKt/83f779SYJXDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:49:24.802278Z"},"content_sha256":"5031c5fb64072566e21315f6466e2a5c4ba2c39ef53c40eb412cbcb9abaaaea7","schema_version":"1.0","event_id":"sha256:5031c5fb64072566e21315f6466e2a5c4ba2c39ef53c40eb412cbcb9abaaaea7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:CS7BRNPTIM2GP4HT7IAGLM6VCM","target":"graph","payload":{"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"},"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-18T04:01:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IuMAk1s1duH4xv5J++eakqrq8Rwc8jXl5jM7nRYEMBVTzCUroFtBPd46f1c9lhkieSpGlBqgOb4X+hvz/dNSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:49:24.802640Z"},"content_sha256":"2362b4f07ce9193e5cd8eca837a77f4b26222781c15a52e5a11bec7d3a740cec","schema_version":"1.0","event_id":"sha256:2362b4f07ce9193e5cd8eca837a77f4b26222781c15a52e5a11bec7d3a740cec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/bundle.json","state_url":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/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-02T10:49:24Z","links":{"resolver":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM","bundle":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/bundle.json","state":"https://pith.science/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CS7BRNPTIM2GP4HT7IAGLM6VCM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:CS7BRNPTIM2GP4HT7IAGLM6VCM","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":"4e0ca904c014f40bf3d653d372633e9a3dfe139bfed1451ff824f2982f839443","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T16:52:17Z","title_canon_sha256":"abc5352806610c251cb1b61b6b241562a6f94c233c8fb64b0eb8f20b6f3fbdf7"},"schema_version":"1.0","source":{"id":"1202.6598","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.6598","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"arxiv_version","alias_value":"1202.6598v1","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.6598","created_at":"2026-05-18T04:01:12Z"},{"alias_kind":"pith_short_12","alias_value":"CS7BRNPTIM2G","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"CS7BRNPTIM2GP4HT","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"CS7BRNPT","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:2362b4f07ce9193e5cd8eca837a77f4b26222781c15a52e5a11bec7d3a740cec","target":"graph","created_at":"2026-05-18T04:01:12Z","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":"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","authors_text":"Bin Fu, Wenfeng Li, Zhiyong Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T16:52:17Z","title":"Sublinear Time Approximate Sum via Uniform Random Sampling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.6598","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:5031c5fb64072566e21315f6466e2a5c4ba2c39ef53c40eb412cbcb9abaaaea7","target":"record","created_at":"2026-05-18T04:01:12Z","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":"4e0ca904c014f40bf3d653d372633e9a3dfe139bfed1451ff824f2982f839443","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-02-29T16:52:17Z","title_canon_sha256":"abc5352806610c251cb1b61b6b241562a6f94c233c8fb64b0eb8f20b6f3fbdf7"},"schema_version":"1.0","source":{"id":"1202.6598","kind":"arxiv","version":1}},"canonical_sha256":"14be18b5f3433467f0f3fa0065b3d5132e20ef0707565690dbc4a9d0b6ca1acf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"14be18b5f3433467f0f3fa0065b3d5132e20ef0707565690dbc4a9d0b6ca1acf","first_computed_at":"2026-05-18T04:01:12.116253Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:12.116253Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WgVPAFXW0IElEm/jqGGSG8lu+1bIxvUhXi1Xz7EEB/05g8GtRuaunFMzH8i4fixrKZW+TUzJtcEKpsJmSmNTBg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:12.116796Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.6598","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5031c5fb64072566e21315f6466e2a5c4ba2c39ef53c40eb412cbcb9abaaaea7","sha256:2362b4f07ce9193e5cd8eca837a77f4b26222781c15a52e5a11bec7d3a740cec"],"state_sha256":"cf5d0a2d3f08863b727e04dff6c90c326c94f8aea4fa20803a3a417dde3f8998"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"csALZeW22Z3ObcO63JgM++rUIo6z/QTKYcbL0JkTcRpvVHNijBcz7MpwGSORehfyhz/doyiAfMl4PIS/3iGzAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:49:24.804663Z","bundle_sha256":"b69d3a5c0f4a0ffd97482352a60412c83ae609262ee92ce4d6e34f986980abcf"}}