{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:2T7FJKBCMEKBTYVXYYSIIOF3HO","short_pith_number":"pith:2T7FJKBC","canonical_record":{"source":{"id":"2509.05870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-06T23:57:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c89683724cff05e86c82044a62178d78fd8ca3b27b57b8f0e4ac99093624a913","abstract_canon_sha256":"5d7e2ce19e1a1f93d17cf545871df0048dea6d9f66981187f63a4474dc6e2ae2"},"schema_version":"1.0"},"canonical_sha256":"d4fe54a822611419e2b7c6248438bb3b80e0dba1f38b9a10d715ac0de13ae5b5","source":{"kind":"arxiv","id":"2509.05870","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.05870","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"2509.05870v1","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05870","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"2T7FJKBCMEKB","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"pith_short_16","alias_value":"2T7FJKBCMEKBTYVX","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"pith_short_8","alias_value":"2T7FJKBC","created_at":"2026-07-05T12:06:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:2T7FJKBCMEKBTYVXYYSIIOF3HO","target":"record","payload":{"canonical_record":{"source":{"id":"2509.05870","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-06T23:57:57Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"c89683724cff05e86c82044a62178d78fd8ca3b27b57b8f0e4ac99093624a913","abstract_canon_sha256":"5d7e2ce19e1a1f93d17cf545871df0048dea6d9f66981187f63a4474dc6e2ae2"},"schema_version":"1.0"},"canonical_sha256":"d4fe54a822611419e2b7c6248438bb3b80e0dba1f38b9a10d715ac0de13ae5b5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:06:25.534101Z","signature_b64":"+wVtwlrEGmPlSGVVkGokVvCQROTaYLzQWUR+9qjECG1azVXVniISemezafwjXv6CV1NyAjqYGQILW3VthQ6MAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fe54a822611419e2b7c6248438bb3b80e0dba1f38b9a10d715ac0de13ae5b5","last_reissued_at":"2026-07-05T12:06:25.533688Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:06:25.533688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2509.05870","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-07-05T12:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7LyJqwsEnwo5NaqFofot3z2aGYNB8t/6EVMhocsyXyfKLKd1RItedoG61Cnf8DnZDcR3cVEGzVljXH1aAaBAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:01:55.052670Z"},"content_sha256":"25920a454e8d2187ced63b83d526e2e8ab4289758f42a52b6ebba0a8b561311b","schema_version":"1.0","event_id":"sha256:25920a454e8d2187ced63b83d526e2e8ab4289758f42a52b6ebba0a8b561311b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:2T7FJKBCMEKBTYVXYYSIIOF3HO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Simple and Robust Protocol for Distributed Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Edith Cohen, Moshe Shechner, Uri Stemmer","submitted_at":"2025-09-06T23:57:57Z","abstract_excerpt":"We revisit the distributed counting problem, where a server must continuously approximate the total number of events occurring across $k$ sites while minimizing communication. The communication complexity of this problem is known to be $\\Theta(\\frac{k}{\\epsilon}\\log N)$ for deterministic protocols. Huang, Yi, and Zhang (2012) showed that randomization can reduce this to $\\Theta(\\frac{\\sqrt{k}}{\\epsilon}\\log N)$, but their analysis is restricted to the {\\em oblivious setting}, where the stream of events is independent of the protocol's outputs.\n  Xiong, Zhu, and Huang (2023) presented a robust "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05870","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2509.05870/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T12:06:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RKqkwEDvAT5Hl9AEA8FazwZnfCqtIieHEcnv44Sm3OmzBSKjLSwmsn8MfPxibDb31fkICTuNXfBwYdRryZaaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:01:55.053378Z"},"content_sha256":"153866b924ec7b0b30eef75f00a177df3b3796ddd1fdb00a16cb26807455087a","schema_version":"1.0","event_id":"sha256:153866b924ec7b0b30eef75f00a177df3b3796ddd1fdb00a16cb26807455087a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO/bundle.json","state_url":"https://pith.science/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO/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-08-16T06:01:55Z","links":{"resolver":"https://pith.science/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO","bundle":"https://pith.science/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO/bundle.json","state":"https://pith.science/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2T7FJKBCMEKBTYVXYYSIIOF3HO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:2T7FJKBCMEKBTYVXYYSIIOF3HO","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":"5d7e2ce19e1a1f93d17cf545871df0048dea6d9f66981187f63a4474dc6e2ae2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-06T23:57:57Z","title_canon_sha256":"c89683724cff05e86c82044a62178d78fd8ca3b27b57b8f0e4ac99093624a913"},"schema_version":"1.0","source":{"id":"2509.05870","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2509.05870","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"arxiv_version","alias_value":"2509.05870v1","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.05870","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"pith_short_12","alias_value":"2T7FJKBCMEKB","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"pith_short_16","alias_value":"2T7FJKBCMEKBTYVX","created_at":"2026-07-05T12:06:25Z"},{"alias_kind":"pith_short_8","alias_value":"2T7FJKBC","created_at":"2026-07-05T12:06:25Z"}],"graph_snapshots":[{"event_id":"sha256:153866b924ec7b0b30eef75f00a177df3b3796ddd1fdb00a16cb26807455087a","target":"graph","created_at":"2026-07-05T12:06:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2509.05870/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We revisit the distributed counting problem, where a server must continuously approximate the total number of events occurring across $k$ sites while minimizing communication. The communication complexity of this problem is known to be $\\Theta(\\frac{k}{\\epsilon}\\log N)$ for deterministic protocols. Huang, Yi, and Zhang (2012) showed that randomization can reduce this to $\\Theta(\\frac{\\sqrt{k}}{\\epsilon}\\log N)$, but their analysis is restricted to the {\\em oblivious setting}, where the stream of events is independent of the protocol's outputs.\n  Xiong, Zhu, and Huang (2023) presented a robust ","authors_text":"Edith Cohen, Moshe Shechner, Uri Stemmer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-06T23:57:57Z","title":"A Simple and Robust Protocol for Distributed Counting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.05870","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:25920a454e8d2187ced63b83d526e2e8ab4289758f42a52b6ebba0a8b561311b","target":"record","created_at":"2026-07-05T12:06:25Z","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":"5d7e2ce19e1a1f93d17cf545871df0048dea6d9f66981187f63a4474dc6e2ae2","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-09-06T23:57:57Z","title_canon_sha256":"c89683724cff05e86c82044a62178d78fd8ca3b27b57b8f0e4ac99093624a913"},"schema_version":"1.0","source":{"id":"2509.05870","kind":"arxiv","version":1}},"canonical_sha256":"d4fe54a822611419e2b7c6248438bb3b80e0dba1f38b9a10d715ac0de13ae5b5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4fe54a822611419e2b7c6248438bb3b80e0dba1f38b9a10d715ac0de13ae5b5","first_computed_at":"2026-07-05T12:06:25.533688Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T12:06:25.533688Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+wVtwlrEGmPlSGVVkGokVvCQROTaYLzQWUR+9qjECG1azVXVniISemezafwjXv6CV1NyAjqYGQILW3VthQ6MAA==","signature_status":"signed_v1","signed_at":"2026-07-05T12:06:25.534101Z","signed_message":"canonical_sha256_bytes"},"source_id":"2509.05870","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25920a454e8d2187ced63b83d526e2e8ab4289758f42a52b6ebba0a8b561311b","sha256:153866b924ec7b0b30eef75f00a177df3b3796ddd1fdb00a16cb26807455087a"],"state_sha256":"92fc78331e67f90fe0669d0b09fd450d17d8bd3734ab574b53df39b7bd1ac69c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QXKPWBJu0mj1ds/rB9xTj+db7BwTGJEOBL2vTf//Aw8F3onDOYmYx8uY4v2I8UpbDhCwxNZLrYSktFb/qpUnBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:01:55.058918Z","bundle_sha256":"53f46723e237a7a7c6581240a09e20284abd9e1fec244add74a16d56f33082d8"}}