{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:FS72QCYWP6WFWSAM4U22O4AW4F","short_pith_number":"pith:FS72QCYW","canonical_record":{"source":{"id":"1905.11962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T17:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"991b81c92e83940a79e2662194877ab7a3c0cff1efc71856a8fdaf40f64aec8b","abstract_canon_sha256":"29f1e147563d7cfcc297709f99abfe6475fbe703f0da67c69ced0ce0defe6ed2"},"schema_version":"1.0"},"canonical_sha256":"2cbfa80b167fac5b480ce535a77016e1671904980b92979d638af5dba6121ebd","source":{"kind":"arxiv","id":"1905.11962","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11962","created_at":"2026-05-17T23:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11962v1","created_at":"2026-05-17T23:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11962","created_at":"2026-05-17T23:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"FS72QCYWP6WF","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FS72QCYWP6WFWSAM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FS72QCYW","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:FS72QCYWP6WFWSAM4U22O4AW4F","target":"record","payload":{"canonical_record":{"source":{"id":"1905.11962","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T17:35:18Z","cross_cats_sorted":[],"title_canon_sha256":"991b81c92e83940a79e2662194877ab7a3c0cff1efc71856a8fdaf40f64aec8b","abstract_canon_sha256":"29f1e147563d7cfcc297709f99abfe6475fbe703f0da67c69ced0ce0defe6ed2"},"schema_version":"1.0"},"canonical_sha256":"2cbfa80b167fac5b480ce535a77016e1671904980b92979d638af5dba6121ebd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:49.827254Z","signature_b64":"gojOi9ihspox9AviSm0VYfphAvqhpBQ6X4cEAHbLCkB8wpm552Yyd0TBPd589pJcBropaQf99+IagJJIgQs8Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cbfa80b167fac5b480ce535a77016e1671904980b92979d638af5dba6121ebd","last_reissued_at":"2026-05-17T23:44:49.826655Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:49.826655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.11962","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-05-17T23:44:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DE7AzlKTSniBCgeYaltyLLMggwK9m5CzDm2aKjbUe/zFGpNZWflL/jmWCa2D794cZNh+TF7oWBCiD8vsp8xdAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:04.252675Z"},"content_sha256":"dc2a297b738ea585ce7a4225609705cdf7030331edc54b3ebda2f62fe5c0cf5c","schema_version":"1.0","event_id":"sha256:dc2a297b738ea585ce7a4225609705cdf7030331edc54b3ebda2f62fe5c0cf5c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:FS72QCYWP6WFWSAM4U22O4AW4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Counting the Population Size","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dominik Kaaser, Petra Berenbrink, Tomasz Radzik","submitted_at":"2019-05-28T17:35:18Z","abstract_excerpt":"We consider the problem of counting the population size in the population model. In this model, we are given a distributed system of $n$ identical agents which interact in pairs with the goal to solve a common task. In each time step, the two interacting agents are selected uniformly at random. In this paper, we consider so-called uniform protocols, where the actions of two agents upon an interaction may not depend on the population size $n$. We present two population protocols to count the size of the population: protocol Approximate, which computes with high probability either $\\lfloor\\log n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11962","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"},"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-17T23:44:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2th11/y98dBwA+mWRSvdrtTMXaEuUCYpMMmazS3038TeT8dYufaPeKqOtrwGqkDY2EKfL7zVmCIQa80xo2XAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T22:18:04.253149Z"},"content_sha256":"db5ca990175fedad06476f3883195589482599fd3892dd44d1453e5fa2d51fc5","schema_version":"1.0","event_id":"sha256:db5ca990175fedad06476f3883195589482599fd3892dd44d1453e5fa2d51fc5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FS72QCYWP6WFWSAM4U22O4AW4F/bundle.json","state_url":"https://pith.science/pith/FS72QCYWP6WFWSAM4U22O4AW4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FS72QCYWP6WFWSAM4U22O4AW4F/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-04T22:18:04Z","links":{"resolver":"https://pith.science/pith/FS72QCYWP6WFWSAM4U22O4AW4F","bundle":"https://pith.science/pith/FS72QCYWP6WFWSAM4U22O4AW4F/bundle.json","state":"https://pith.science/pith/FS72QCYWP6WFWSAM4U22O4AW4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FS72QCYWP6WFWSAM4U22O4AW4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:FS72QCYWP6WFWSAM4U22O4AW4F","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":"29f1e147563d7cfcc297709f99abfe6475fbe703f0da67c69ced0ce0defe6ed2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T17:35:18Z","title_canon_sha256":"991b81c92e83940a79e2662194877ab7a3c0cff1efc71856a8fdaf40f64aec8b"},"schema_version":"1.0","source":{"id":"1905.11962","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.11962","created_at":"2026-05-17T23:44:49Z"},{"alias_kind":"arxiv_version","alias_value":"1905.11962v1","created_at":"2026-05-17T23:44:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.11962","created_at":"2026-05-17T23:44:49Z"},{"alias_kind":"pith_short_12","alias_value":"FS72QCYWP6WF","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"FS72QCYWP6WFWSAM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"FS72QCYW","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:db5ca990175fedad06476f3883195589482599fd3892dd44d1453e5fa2d51fc5","target":"graph","created_at":"2026-05-17T23:44:49Z","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 problem of counting the population size in the population model. In this model, we are given a distributed system of $n$ identical agents which interact in pairs with the goal to solve a common task. In each time step, the two interacting agents are selected uniformly at random. In this paper, we consider so-called uniform protocols, where the actions of two agents upon an interaction may not depend on the population size $n$. We present two population protocols to count the size of the population: protocol Approximate, which computes with high probability either $\\lfloor\\log n","authors_text":"Dominik Kaaser, Petra Berenbrink, Tomasz Radzik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T17:35:18Z","title":"On Counting the Population Size"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.11962","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:dc2a297b738ea585ce7a4225609705cdf7030331edc54b3ebda2f62fe5c0cf5c","target":"record","created_at":"2026-05-17T23:44:49Z","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":"29f1e147563d7cfcc297709f99abfe6475fbe703f0da67c69ced0ce0defe6ed2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-28T17:35:18Z","title_canon_sha256":"991b81c92e83940a79e2662194877ab7a3c0cff1efc71856a8fdaf40f64aec8b"},"schema_version":"1.0","source":{"id":"1905.11962","kind":"arxiv","version":1}},"canonical_sha256":"2cbfa80b167fac5b480ce535a77016e1671904980b92979d638af5dba6121ebd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cbfa80b167fac5b480ce535a77016e1671904980b92979d638af5dba6121ebd","first_computed_at":"2026-05-17T23:44:49.826655Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:49.826655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gojOi9ihspox9AviSm0VYfphAvqhpBQ6X4cEAHbLCkB8wpm552Yyd0TBPd589pJcBropaQf99+IagJJIgQs8Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:49.827254Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.11962","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dc2a297b738ea585ce7a4225609705cdf7030331edc54b3ebda2f62fe5c0cf5c","sha256:db5ca990175fedad06476f3883195589482599fd3892dd44d1453e5fa2d51fc5"],"state_sha256":"7e620b31f758bd4c653509456e40059074ab8ec43d6ddd2ef44aa4174a82db01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iCQuBKGfjhIcg8oJc5CytXXVC3lKnm7VHGHEn3b+FccOJpSxZKV6bv48OMF6ahLXAA1roC6ZC4pWR8ZEf2moDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T22:18:04.256450Z","bundle_sha256":"16d66a821fd75355aa986e907ab8cd4c93746dcca153ae0bbe0a7c13034f8828"}}