{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:B24BFSY4X66WTLVFJT74ENS3AL","short_pith_number":"pith:B24BFSY4","canonical_record":{"source":{"id":"1611.07238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T10:35:28Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"b4296f1f06f2e6d800c75337188cf12524331310226556be78fff6d7f8309a6b","abstract_canon_sha256":"dce5f4ea34517820c355fa8d5b187cd678ec1fd3282b8cc512f51b1159ccf73b"},"schema_version":"1.0"},"canonical_sha256":"0eb812cb1cbfbd69aea54cffc2365b02f3ba05b58c12344562dc2ced3a545aeb","source":{"kind":"arxiv","id":"1611.07238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07238","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07238v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07238","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"B24BFSY4X66W","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B24BFSY4X66WTLVF","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B24BFSY4","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:B24BFSY4X66WTLVFJT74ENS3AL","target":"record","payload":{"canonical_record":{"source":{"id":"1611.07238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T10:35:28Z","cross_cats_sorted":["cs.NI"],"title_canon_sha256":"b4296f1f06f2e6d800c75337188cf12524331310226556be78fff6d7f8309a6b","abstract_canon_sha256":"dce5f4ea34517820c355fa8d5b187cd678ec1fd3282b8cc512f51b1159ccf73b"},"schema_version":"1.0"},"canonical_sha256":"0eb812cb1cbfbd69aea54cffc2365b02f3ba05b58c12344562dc2ced3a545aeb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:24.482457Z","signature_b64":"f4HKoT4945nWzLthte4ATqq8Vwuzu39oxFhkCzW3O2J9muMJM2qfb6mzYDsZnNSl2/1D4QOfzyFuTGNWaorsDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0eb812cb1cbfbd69aea54cffc2365b02f3ba05b58c12344562dc2ced3a545aeb","last_reissued_at":"2026-05-18T00:57:24.481993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:24.481993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.07238","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-18T00:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dljjkYI0++FJp6HVJrFfjgtNbpFWkCECz0z6ET9mSIwci+Nbj2aMRo67MRHUmEc7NfGoTi2rZ02mGFIOwh+dAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:18:05.539755Z"},"content_sha256":"2268bb25ee1c357ff93950c185cc6a9c15f4a0a0d8771ca380c209169f417842","schema_version":"1.0","event_id":"sha256:2268bb25ee1c357ff93950c185cc6a9c15f4a0a0d8771ca380c209169f417842"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:B24BFSY4X66WTLVFJT74ENS3AL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Time and Space Optimal Counting in Population Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NI"],"primary_cat":"cs.DC","authors_text":"Devan Sohier, James Aspnes (YALE), Janna Burman (LRI), Joffroy Beauquier (LRI)","submitted_at":"2016-11-22T10:35:28Z","abstract_excerpt":"This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of (exact) counting resource-limited and passively mobile nodes in the model of population protocols, in which the space complexity is crucial. The counted nodes are memory-limited anonymous devices (called agents) communicating asynchronously in pairs (according to a fairness condition). Moreover, we assume that these agents are prone to failures so that they cannot be correctly initialized. This study considers two classical fairness conditions, and for eac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07238","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-18T00:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aP2FQtBawzbd4AfDQD7oQa7bIsPsIvR78MRULCkeoJ30ymf1X2ah052Pajg6/eO3caCEiTwNj1MXvn9h8TjGBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:18:05.540103Z"},"content_sha256":"f391ad841e44578d6a0cda932871bbd9a19ed9da1219d9570690bc4d05ccca2b","schema_version":"1.0","event_id":"sha256:f391ad841e44578d6a0cda932871bbd9a19ed9da1219d9570690bc4d05ccca2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B24BFSY4X66WTLVFJT74ENS3AL/bundle.json","state_url":"https://pith.science/pith/B24BFSY4X66WTLVFJT74ENS3AL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B24BFSY4X66WTLVFJT74ENS3AL/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-05-28T06:18:05Z","links":{"resolver":"https://pith.science/pith/B24BFSY4X66WTLVFJT74ENS3AL","bundle":"https://pith.science/pith/B24BFSY4X66WTLVFJT74ENS3AL/bundle.json","state":"https://pith.science/pith/B24BFSY4X66WTLVFJT74ENS3AL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B24BFSY4X66WTLVFJT74ENS3AL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:B24BFSY4X66WTLVFJT74ENS3AL","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":"dce5f4ea34517820c355fa8d5b187cd678ec1fd3282b8cc512f51b1159ccf73b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T10:35:28Z","title_canon_sha256":"b4296f1f06f2e6d800c75337188cf12524331310226556be78fff6d7f8309a6b"},"schema_version":"1.0","source":{"id":"1611.07238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.07238","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1611.07238v1","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07238","created_at":"2026-05-18T00:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"B24BFSY4X66W","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"B24BFSY4X66WTLVF","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"B24BFSY4","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:f391ad841e44578d6a0cda932871bbd9a19ed9da1219d9570690bc4d05ccca2b","target":"graph","created_at":"2026-05-18T00:57:24Z","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":"This work concerns the general issue of combined optimality in terms of time and space complexity. In this context, we study the problem of (exact) counting resource-limited and passively mobile nodes in the model of population protocols, in which the space complexity is crucial. The counted nodes are memory-limited anonymous devices (called agents) communicating asynchronously in pairs (according to a fairness condition). Moreover, we assume that these agents are prone to failures so that they cannot be correctly initialized. This study considers two classical fairness conditions, and for eac","authors_text":"Devan Sohier, James Aspnes (YALE), Janna Burman (LRI), Joffroy Beauquier (LRI)","cross_cats":["cs.NI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T10:35:28Z","title":"Time and Space Optimal Counting in Population Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07238","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:2268bb25ee1c357ff93950c185cc6a9c15f4a0a0d8771ca380c209169f417842","target":"record","created_at":"2026-05-18T00:57:24Z","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":"dce5f4ea34517820c355fa8d5b187cd678ec1fd3282b8cc512f51b1159ccf73b","cross_cats_sorted":["cs.NI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-11-22T10:35:28Z","title_canon_sha256":"b4296f1f06f2e6d800c75337188cf12524331310226556be78fff6d7f8309a6b"},"schema_version":"1.0","source":{"id":"1611.07238","kind":"arxiv","version":1}},"canonical_sha256":"0eb812cb1cbfbd69aea54cffc2365b02f3ba05b58c12344562dc2ced3a545aeb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0eb812cb1cbfbd69aea54cffc2365b02f3ba05b58c12344562dc2ced3a545aeb","first_computed_at":"2026-05-18T00:57:24.481993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:24.481993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"f4HKoT4945nWzLthte4ATqq8Vwuzu39oxFhkCzW3O2J9muMJM2qfb6mzYDsZnNSl2/1D4QOfzyFuTGNWaorsDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:24.482457Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.07238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2268bb25ee1c357ff93950c185cc6a9c15f4a0a0d8771ca380c209169f417842","sha256:f391ad841e44578d6a0cda932871bbd9a19ed9da1219d9570690bc4d05ccca2b"],"state_sha256":"a7dbc004f286626a64d02b9db83d9c02a0982554e5fe8904ce3318764d75746c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"POFa0BVtaZy3buuRefIJgqNKESIuRjsHoFqBT239zvBTI5yQYzJiC4+HrCWpFABpHw4uCii8s4w/OQ/QoGqLCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:18:05.542387Z","bundle_sha256":"02881a1d30df39a84228bfc7be6828bf408a14fd731b76988b450b514e86060a"}}