{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:AIMHCANJI7PZX5BIYSD5RGZEZX","short_pith_number":"pith:AIMHCANJ","canonical_record":{"source":{"id":"1112.0520","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-02T17:50:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b72eba9ff44051681d2f98f69db6ce358e3c4c316fc49826744e0520221bce8c","abstract_canon_sha256":"84d0a4a7f361750837c6b8683cc8d5e9b011e2850db3bdf0abc76f69d65bf53d"},"schema_version":"1.0"},"canonical_sha256":"02187101a947df9bf428c487d89b24cdf767531fc2906280a46edda016732c43","source":{"kind":"arxiv","id":"1112.0520","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0520","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0520v4","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0520","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"AIMHCANJI7PZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AIMHCANJI7PZX5BI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AIMHCANJ","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:AIMHCANJI7PZX5BIYSD5RGZEZX","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0520","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-02T17:50:10Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"b72eba9ff44051681d2f98f69db6ce358e3c4c316fc49826744e0520221bce8c","abstract_canon_sha256":"84d0a4a7f361750837c6b8683cc8d5e9b011e2850db3bdf0abc76f69d65bf53d"},"schema_version":"1.0"},"canonical_sha256":"02187101a947df9bf428c487d89b24cdf767531fc2906280a46edda016732c43","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:04:06.364760Z","signature_b64":"cIYt04pnQr0Nzrh8X0FpWzCKR/DnNdBDgNr3J7RDY29zKWX/Z0aZ7aOi1N2Y/Ckq98LAh80FwlY3h8BjBwxuDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02187101a947df9bf428c487d89b24cdf767531fc2906280a46edda016732c43","last_reissued_at":"2026-05-18T04:04:06.364153Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:04:06.364153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0520","source_version":4,"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC1WWORELV1JRaqakuDtL6grRzY/TEuc84AAdiOkJ8d5Fw2bA23OwmERghABurxR6dXmW9LT5/0PatKgE6q6Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:29:02.998691Z"},"content_sha256":"23e42c1689cf7aec30401dcc876f85688c393867eef64ba0bb3cede8457313a1","schema_version":"1.0","event_id":"sha256:23e42c1689cf7aec30401dcc876f85688c393867eef64ba0bb3cede8457313a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:AIMHCANJI7PZX5BIYSD5RGZEZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Complexity of Approximate Sum of Sorted List","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Bin Fu","submitted_at":"2011-12-02T17:50:10Z","abstract_excerpt":"We consider the complexity for computing the approximate sum $a_1+a_2+...+a_n$ of a sorted list of numbers $a_1\\le a_2\\le ...\\le a_n$. We show an algorithm that computes an $(1+\\epsilon)$-approximation for the sum of a sorted list of nonnegative numbers in an $O({1\\over \\epsilon}\\min(\\log n, {\\log ({x_{max}\\over x_{min}})})\\cdot (\\log {1\\over \\epsilon}+\\log\\log n))$ time, where $x_{max}$ and $x_{min}$ are the largest and the least positive elements of the input list, respectively. We prove a lower bound $\\Omega(\\min(\\log n,\\log ({x_{max}\\over x_{min}}))$ time for every O(1)-approximation algor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0520","kind":"arxiv","version":4},"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JxKDsI8x48gPabbMxQjBJOZweu4dZvvZKrRe3OC660gU8zFWwc47TNab8gviu3Sah0eaA/M3lTVXStVsi5cxAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T16:29:02.999412Z"},"content_sha256":"4e57b0e1ec25d67acf1e66e46cd79abf9f88b826afab3a901c7299cbda7bb1db","schema_version":"1.0","event_id":"sha256:4e57b0e1ec25d67acf1e66e46cd79abf9f88b826afab3a901c7299cbda7bb1db"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AIMHCANJI7PZX5BIYSD5RGZEZX/bundle.json","state_url":"https://pith.science/pith/AIMHCANJI7PZX5BIYSD5RGZEZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AIMHCANJI7PZX5BIYSD5RGZEZX/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-07T16:29:03Z","links":{"resolver":"https://pith.science/pith/AIMHCANJI7PZX5BIYSD5RGZEZX","bundle":"https://pith.science/pith/AIMHCANJI7PZX5BIYSD5RGZEZX/bundle.json","state":"https://pith.science/pith/AIMHCANJI7PZX5BIYSD5RGZEZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AIMHCANJI7PZX5BIYSD5RGZEZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:AIMHCANJI7PZX5BIYSD5RGZEZX","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":"84d0a4a7f361750837c6b8683cc8d5e9b011e2850db3bdf0abc76f69d65bf53d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-02T17:50:10Z","title_canon_sha256":"b72eba9ff44051681d2f98f69db6ce358e3c4c316fc49826744e0520221bce8c"},"schema_version":"1.0","source":{"id":"1112.0520","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0520","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0520v4","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0520","created_at":"2026-05-18T04:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"AIMHCANJI7PZ","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"AIMHCANJI7PZX5BI","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"AIMHCANJ","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:4e57b0e1ec25d67acf1e66e46cd79abf9f88b826afab3a901c7299cbda7bb1db","target":"graph","created_at":"2026-05-18T04:04:06Z","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 consider the complexity for computing the approximate sum $a_1+a_2+...+a_n$ of a sorted list of numbers $a_1\\le a_2\\le ...\\le a_n$. We show an algorithm that computes an $(1+\\epsilon)$-approximation for the sum of a sorted list of nonnegative numbers in an $O({1\\over \\epsilon}\\min(\\log n, {\\log ({x_{max}\\over x_{min}})})\\cdot (\\log {1\\over \\epsilon}+\\log\\log n))$ time, where $x_{max}$ and $x_{min}$ are the largest and the least positive elements of the input list, respectively. We prove a lower bound $\\Omega(\\min(\\log n,\\log ({x_{max}\\over x_{min}}))$ time for every O(1)-approximation algor","authors_text":"Bin Fu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-02T17:50:10Z","title":"On the Complexity of Approximate Sum of Sorted List"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0520","kind":"arxiv","version":4},"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:23e42c1689cf7aec30401dcc876f85688c393867eef64ba0bb3cede8457313a1","target":"record","created_at":"2026-05-18T04:04:06Z","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":"84d0a4a7f361750837c6b8683cc8d5e9b011e2850db3bdf0abc76f69d65bf53d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-12-02T17:50:10Z","title_canon_sha256":"b72eba9ff44051681d2f98f69db6ce358e3c4c316fc49826744e0520221bce8c"},"schema_version":"1.0","source":{"id":"1112.0520","kind":"arxiv","version":4}},"canonical_sha256":"02187101a947df9bf428c487d89b24cdf767531fc2906280a46edda016732c43","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02187101a947df9bf428c487d89b24cdf767531fc2906280a46edda016732c43","first_computed_at":"2026-05-18T04:04:06.364153Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:04:06.364153Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cIYt04pnQr0Nzrh8X0FpWzCKR/DnNdBDgNr3J7RDY29zKWX/Z0aZ7aOi1N2Y/Ckq98LAh80FwlY3h8BjBwxuDA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:04:06.364760Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0520","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23e42c1689cf7aec30401dcc876f85688c393867eef64ba0bb3cede8457313a1","sha256:4e57b0e1ec25d67acf1e66e46cd79abf9f88b826afab3a901c7299cbda7bb1db"],"state_sha256":"0a2a09d77a08dbac804a9f06ab17c0541d1ef35fce5a12fcf5fffebbae32166b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JobRgm6YTMbgaWr8QwaDbtnriLco3/dUH3AJQN3PBbQ4ybqapZ90pvf6SrCLfDmvAmnuSJfN5qYD283jyVy5DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T16:29:03.003723Z","bundle_sha256":"c4c9cc228ea37be8d3e071edd8561d2aaf75abc374d29f886037e8e68edda36c"}}