{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:5PV66DQ7RXGIA5AARERDXGUDMB","short_pith_number":"pith:5PV66DQ7","schema_version":"1.0","canonical_sha256":"ebebef0e1f8dcc80740089223b9a83604b2a1bb6e3873e02038ef238bfb45510","source":{"kind":"arxiv","id":"1312.0042","version":1},"attestation_state":"computed","paper":{"title":"Boosting the Basic Counting on Distributed Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.DS","authors_text":"Bojian Xu","submitted_at":"2013-11-29T23:56:52Z","abstract_excerpt":"We revisit the classic basic counting problem in the distributed streaming model that was studied by Gibbons and Tirthapura (GT). In the solution for maintaining an $(\\epsilon,\\delta)$-estimate, as what GT's method does, we make the following new contributions: (1) For a bit stream of size $n$, where each bit has a probability at least $\\gamma$ to be 1, we exponentially reduced the average total processing time from GT's $\\Theta(n \\log(1/\\delta))$ to $O((1/(\\gamma\\epsilon^2))(\\log^2 n) \\log(1/\\delta))$, thus providing the first sublinear-time streaming algorithm for this problem. (2) In additi"},"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":"1312.0042","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-29T23:56:52Z","cross_cats_sorted":["cs.DB","cs.DC"],"title_canon_sha256":"a4c0ac0076a0c41cc2c4c036b2b958034832db642daa18dd700867c50b23f0b2","abstract_canon_sha256":"e5cf442e3bee8b3aa5584082d1715af3e4bda8e5dd2f3f45823da15d06055056"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:47.022724Z","signature_b64":"OEp79pRGekbRhcvkyreKutJIlhyvz70K5eMunU8rf1bCq+VzNuMfdyVoMxH9nDJICsiEvjRhArYbrlngfakpCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ebebef0e1f8dcc80740089223b9a83604b2a1bb6e3873e02038ef238bfb45510","last_reissued_at":"2026-05-18T03:05:47.022088Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:47.022088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Boosting the Basic Counting on Distributed Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.DC"],"primary_cat":"cs.DS","authors_text":"Bojian Xu","submitted_at":"2013-11-29T23:56:52Z","abstract_excerpt":"We revisit the classic basic counting problem in the distributed streaming model that was studied by Gibbons and Tirthapura (GT). In the solution for maintaining an $(\\epsilon,\\delta)$-estimate, as what GT's method does, we make the following new contributions: (1) For a bit stream of size $n$, where each bit has a probability at least $\\gamma$ to be 1, we exponentially reduced the average total processing time from GT's $\\Theta(n \\log(1/\\delta))$ to $O((1/(\\gamma\\epsilon^2))(\\log^2 n) \\log(1/\\delta))$, thus providing the first sublinear-time streaming algorithm for this problem. (2) In additi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0042","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":"1312.0042","created_at":"2026-05-18T03:05:47.022196+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0042v1","created_at":"2026-05-18T03:05:47.022196+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0042","created_at":"2026-05-18T03:05:47.022196+00:00"},{"alias_kind":"pith_short_12","alias_value":"5PV66DQ7RXGI","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_16","alias_value":"5PV66DQ7RXGIA5AA","created_at":"2026-05-18T12:27:34.582898+00:00"},{"alias_kind":"pith_short_8","alias_value":"5PV66DQ7","created_at":"2026-05-18T12:27:34.582898+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/5PV66DQ7RXGIA5AARERDXGUDMB","json":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB.json","graph_json":"https://pith.science/api/pith-number/5PV66DQ7RXGIA5AARERDXGUDMB/graph.json","events_json":"https://pith.science/api/pith-number/5PV66DQ7RXGIA5AARERDXGUDMB/events.json","paper":"https://pith.science/paper/5PV66DQ7"},"agent_actions":{"view_html":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB","download_json":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB.json","view_paper":"https://pith.science/paper/5PV66DQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0042&json=true","fetch_graph":"https://pith.science/api/pith-number/5PV66DQ7RXGIA5AARERDXGUDMB/graph.json","fetch_events":"https://pith.science/api/pith-number/5PV66DQ7RXGIA5AARERDXGUDMB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB/action/storage_attestation","attest_author":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB/action/author_attestation","sign_citation":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB/action/citation_signature","submit_replication":"https://pith.science/pith/5PV66DQ7RXGIA5AARERDXGUDMB/action/replication_record"}},"created_at":"2026-05-18T03:05:47.022196+00:00","updated_at":"2026-05-18T03:05:47.022196+00:00"}