{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:RH24TXVOCRL6GYMW5KHMSI2B5M","short_pith_number":"pith:RH24TXVO","schema_version":"1.0","canonical_sha256":"89f5c9deae1457e36196ea8ec92341eb0fdbab3de4f311d0104e45adac3d7f0b","source":{"kind":"arxiv","id":"1108.3413","version":2},"attestation_state":"computed","paper":{"title":"Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ke Yi, Qin Zhang, Zengfeng Huang","submitted_at":"2011-08-17T07:31:27Z","abstract_excerpt":"We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the {\\em count-tracking} problem, where there are $k$ players, each holding a counter $n_i$ that gets incremented over time, and the goal is to track an $\\eps$-approximation of their sum $n=\\sum_i n_i$ continuously at all times, using minimum communication. While the deterministic communication complexity of the problem is $\\Theta(k/\\eps \\cdot \\log N)$, where $N$ is the final value of $n$ when the tracking finishes, we show that with randomization, the communicat"},"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":"1108.3413","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T07:31:27Z","cross_cats_sorted":[],"title_canon_sha256":"a9777cc2c7b4041cb6f125cb39f2a21a9e71963b75c83f70c783392e9680249d","abstract_canon_sha256":"9138015f6de1799cd28ee6080c664911dca2d94369737e8e235f2c9eaf6d6e9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:07.746745Z","signature_b64":"eq8iORurWg9fHPfUnFn9olpr/G/D52m8pjkFTFOzXA8zG7+tna3GvlQHpF6YV4dZNB6oRyEq++K11jU+t/F7AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89f5c9deae1457e36196ea8ec92341eb0fdbab3de4f311d0104e45adac3d7f0b","last_reissued_at":"2026-05-18T04:07:07.746195Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:07.746195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ke Yi, Qin Zhang, Zengfeng Huang","submitted_at":"2011-08-17T07:31:27Z","abstract_excerpt":"We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the {\\em count-tracking} problem, where there are $k$ players, each holding a counter $n_i$ that gets incremented over time, and the goal is to track an $\\eps$-approximation of their sum $n=\\sum_i n_i$ continuously at all times, using minimum communication. While the deterministic communication complexity of the problem is $\\Theta(k/\\eps \\cdot \\log N)$, where $N$ is the final value of $n$ when the tracking finishes, we show that with randomization, the communicat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3413","kind":"arxiv","version":2},"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":"1108.3413","created_at":"2026-05-18T04:07:07.746304+00:00"},{"alias_kind":"arxiv_version","alias_value":"1108.3413v2","created_at":"2026-05-18T04:07:07.746304+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3413","created_at":"2026-05-18T04:07:07.746304+00:00"},{"alias_kind":"pith_short_12","alias_value":"RH24TXVOCRL6","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"RH24TXVOCRL6GYMW","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"RH24TXVO","created_at":"2026-05-18T12:26:41.206345+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/RH24TXVOCRL6GYMW5KHMSI2B5M","json":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M.json","graph_json":"https://pith.science/api/pith-number/RH24TXVOCRL6GYMW5KHMSI2B5M/graph.json","events_json":"https://pith.science/api/pith-number/RH24TXVOCRL6GYMW5KHMSI2B5M/events.json","paper":"https://pith.science/paper/RH24TXVO"},"agent_actions":{"view_html":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M","download_json":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M.json","view_paper":"https://pith.science/paper/RH24TXVO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1108.3413&json=true","fetch_graph":"https://pith.science/api/pith-number/RH24TXVOCRL6GYMW5KHMSI2B5M/graph.json","fetch_events":"https://pith.science/api/pith-number/RH24TXVOCRL6GYMW5KHMSI2B5M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/action/storage_attestation","attest_author":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/action/author_attestation","sign_citation":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/action/citation_signature","submit_replication":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/action/replication_record"}},"created_at":"2026-05-18T04:07:07.746304+00:00","updated_at":"2026-05-18T04:07:07.746304+00:00"}