{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:RH24TXVOCRL6GYMW5KHMSI2B5M","short_pith_number":"pith:RH24TXVO","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"},"canonical_sha256":"89f5c9deae1457e36196ea8ec92341eb0fdbab3de4f311d0104e45adac3d7f0b","source":{"kind":"arxiv","id":"1108.3413","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3413","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3413v2","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3413","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"RH24TXVOCRL6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RH24TXVOCRL6GYMW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RH24TXVO","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:RH24TXVOCRL6GYMW5KHMSI2B5M","target":"record","payload":{"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"},"canonical_sha256":"89f5c9deae1457e36196ea8ec92341eb0fdbab3de4f311d0104e45adac3d7f0b","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"},"source_kind":"arxiv","source_id":"1108.3413","source_version":2,"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:07:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MxNgYNNgAsHp9LfSz9nqk6+gdoQEFoaM3VRryWKS+Uj5AjPkT8hjT8Xvm73qexQwjuulRYiX7caGozvVEoQKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:02.179004Z"},"content_sha256":"7ddeb4e998d0ee666d7309e870ec2fe84a04a30541df13c61cb15f36dd333dd6","schema_version":"1.0","event_id":"sha256:7ddeb4e998d0ee666d7309e870ec2fe84a04a30541df13c61cb15f36dd333dd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:RH24TXVOCRL6GYMW5KHMSI2B5M","target":"graph","payload":{"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"},"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:07:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HtUKBKGA2SP3CXGitKpnz/99q8KwRYLThdumFVR0zHWQyAYtG//FGyLSQqu+xhk/B67HtLflwMYQBcGHlJxWDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T04:51:02.179707Z"},"content_sha256":"d1fb532278cc1eb8970d44771817ace3e5cea09823f2af7bd07cf93cb36d4dd9","schema_version":"1.0","event_id":"sha256:d1fb532278cc1eb8970d44771817ace3e5cea09823f2af7bd07cf93cb36d4dd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/bundle.json","state_url":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/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-05T04:51:02Z","links":{"resolver":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M","bundle":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/bundle.json","state":"https://pith.science/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RH24TXVOCRL6GYMW5KHMSI2B5M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:RH24TXVOCRL6GYMW5KHMSI2B5M","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":"9138015f6de1799cd28ee6080c664911dca2d94369737e8e235f2c9eaf6d6e9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T07:31:27Z","title_canon_sha256":"a9777cc2c7b4041cb6f125cb39f2a21a9e71963b75c83f70c783392e9680249d"},"schema_version":"1.0","source":{"id":"1108.3413","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.3413","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1108.3413v2","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.3413","created_at":"2026-05-18T04:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"RH24TXVOCRL6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"RH24TXVOCRL6GYMW","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"RH24TXVO","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:d1fb532278cc1eb8970d44771817ace3e5cea09823f2af7bd07cf93cb36d4dd9","target":"graph","created_at":"2026-05-18T04:07:07Z","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 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","authors_text":"Ke Yi, Qin Zhang, Zengfeng Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T07:31:27Z","title":"Randomized Algorithms for Tracking Distributed Count, Frequencies, and Ranks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.3413","kind":"arxiv","version":2},"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:7ddeb4e998d0ee666d7309e870ec2fe84a04a30541df13c61cb15f36dd333dd6","target":"record","created_at":"2026-05-18T04:07:07Z","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":"9138015f6de1799cd28ee6080c664911dca2d94369737e8e235f2c9eaf6d6e9c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-08-17T07:31:27Z","title_canon_sha256":"a9777cc2c7b4041cb6f125cb39f2a21a9e71963b75c83f70c783392e9680249d"},"schema_version":"1.0","source":{"id":"1108.3413","kind":"arxiv","version":2}},"canonical_sha256":"89f5c9deae1457e36196ea8ec92341eb0fdbab3de4f311d0104e45adac3d7f0b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"89f5c9deae1457e36196ea8ec92341eb0fdbab3de4f311d0104e45adac3d7f0b","first_computed_at":"2026-05-18T04:07:07.746195Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:07.746195Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eq8iORurWg9fHPfUnFn9olpr/G/D52m8pjkFTFOzXA8zG7+tna3GvlQHpF6YV4dZNB6oRyEq++K11jU+t/F7AA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:07.746745Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.3413","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7ddeb4e998d0ee666d7309e870ec2fe84a04a30541df13c61cb15f36dd333dd6","sha256:d1fb532278cc1eb8970d44771817ace3e5cea09823f2af7bd07cf93cb36d4dd9"],"state_sha256":"1584f41cf176ada90da434d8619df73efda0d796a64762ef777c28b05fd89ac4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LCbW8ybFvHXWCSWtej91fepwPa7UIIISbl/++W0D5Z2ioMla4Ks8wulebC51qP8QtfqyX2gk5wF8oerZYXaUDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T04:51:02.187044Z","bundle_sha256":"6161fe1c6e2a6e647969bc9a54e576246589deb74501777adba9b026fa333c35"}}