{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:OGCRQ6FRSFCCTGG3RS36FBY6MP","short_pith_number":"pith:OGCRQ6FR","canonical_record":{"source":{"id":"1811.01235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-03T15:36:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"00dac0b4f70417cc68f98356a96ddd47d3f29cdc6e9b51edc0a55c3d2b0aac03","abstract_canon_sha256":"2a82213515e3f19d9ea856d1b5d8c6a43bd40c51e9399b5e17c2883b9f208d99"},"schema_version":"1.0"},"canonical_sha256":"71851878b191442998db8cb7e2871e63f585cda7349770ece027afff43f2a792","source":{"kind":"arxiv","id":"1811.01235","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01235","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01235v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01235","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"OGCRQ6FRSFCC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGCRQ6FRSFCCTGG3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGCRQ6FR","created_at":"2026-05-18T12:32:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:OGCRQ6FRSFCCTGG3RS36FBY6MP","target":"record","payload":{"canonical_record":{"source":{"id":"1811.01235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-03T15:36:30Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"00dac0b4f70417cc68f98356a96ddd47d3f29cdc6e9b51edc0a55c3d2b0aac03","abstract_canon_sha256":"2a82213515e3f19d9ea856d1b5d8c6a43bd40c51e9399b5e17c2883b9f208d99"},"schema_version":"1.0"},"canonical_sha256":"71851878b191442998db8cb7e2871e63f585cda7349770ece027afff43f2a792","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:34.886670Z","signature_b64":"qV8sRD5m4bd+E+OawyOdlywcykjoGrz3nArVNXRn870NGC9eTGmQWLph2bhOvc10Rm1+zGwbOwXi1ofU5cPmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71851878b191442998db8cb7e2871e63f585cda7349770ece027afff43f2a792","last_reissued_at":"2026-05-18T00:01:34.885947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:34.885947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.01235","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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jlpoSgcvCU0fdjExYXPZO1zQPQ1e2yDSUVgwKJ4NH2X5+4SpK+BDHcHnD3zjCy+uSaZOacbDRG+xLFpWz5tZBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:52:39.434843Z"},"content_sha256":"14f05c8aa02ed6b3d208aff526749934442176c9d38c2ef3a7af4712ab647b53","schema_version":"1.0","event_id":"sha256:14f05c8aa02ed6b3d208aff526749934442176c9d38c2ef3a7af4712ab647b53"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:OGCRQ6FRSFCCTGG3RS36FBY6MP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of computing and approximating predicates and functions with leaderless population protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Amanda Belleville, David Doty, David Soloveichik","submitted_at":"2018-11-03T15:36:30Z","abstract_excerpt":"Population protocols are a distributed computing model appropriate for describing massive numbers of agents with limited computational power. A population protocol \"has an initial leader\" if every valid initial configuration contains a single agent in a special \"leader\" state that helps to coordinate the computation. Although the class of predicates and functions computable with probability 1 is the same whether or not there is an initial leader (semilinear functions and predicates), it is not known whether a leader is necessary for fast computation. Efficient population protocols are generall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01235","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:01:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jh7PgCaXavjDEcJfCpgzkocXJP/WdnSBVF1r0A4p06BoZfUvQk0wSXBdgvcGCJ30Yl8hCFXnF6yNtPCytiRICA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:52:39.435192Z"},"content_sha256":"f63879c3cc72b7bba8d8d3ebafa2189aece43eb4ce88da3aa66d389e9428b621","schema_version":"1.0","event_id":"sha256:f63879c3cc72b7bba8d8d3ebafa2189aece43eb4ce88da3aa66d389e9428b621"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/bundle.json","state_url":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/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-31T16:52:39Z","links":{"resolver":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP","bundle":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/bundle.json","state":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:OGCRQ6FRSFCCTGG3RS36FBY6MP","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":"2a82213515e3f19d9ea856d1b5d8c6a43bd40c51e9399b5e17c2883b9f208d99","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-03T15:36:30Z","title_canon_sha256":"00dac0b4f70417cc68f98356a96ddd47d3f29cdc6e9b51edc0a55c3d2b0aac03"},"schema_version":"1.0","source":{"id":"1811.01235","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.01235","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"arxiv_version","alias_value":"1811.01235v1","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01235","created_at":"2026-05-18T00:01:34Z"},{"alias_kind":"pith_short_12","alias_value":"OGCRQ6FRSFCC","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_16","alias_value":"OGCRQ6FRSFCCTGG3","created_at":"2026-05-18T12:32:43Z"},{"alias_kind":"pith_short_8","alias_value":"OGCRQ6FR","created_at":"2026-05-18T12:32:43Z"}],"graph_snapshots":[{"event_id":"sha256:f63879c3cc72b7bba8d8d3ebafa2189aece43eb4ce88da3aa66d389e9428b621","target":"graph","created_at":"2026-05-18T00:01:34Z","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":"Population protocols are a distributed computing model appropriate for describing massive numbers of agents with limited computational power. A population protocol \"has an initial leader\" if every valid initial configuration contains a single agent in a special \"leader\" state that helps to coordinate the computation. Although the class of predicates and functions computable with probability 1 is the same whether or not there is an initial leader (semilinear functions and predicates), it is not known whether a leader is necessary for fast computation. Efficient population protocols are generall","authors_text":"Amanda Belleville, David Doty, David Soloveichik","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-03T15:36:30Z","title":"Hardness of computing and approximating predicates and functions with leaderless population protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.01235","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:14f05c8aa02ed6b3d208aff526749934442176c9d38c2ef3a7af4712ab647b53","target":"record","created_at":"2026-05-18T00:01:34Z","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":"2a82213515e3f19d9ea856d1b5d8c6a43bd40c51e9399b5e17c2883b9f208d99","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-11-03T15:36:30Z","title_canon_sha256":"00dac0b4f70417cc68f98356a96ddd47d3f29cdc6e9b51edc0a55c3d2b0aac03"},"schema_version":"1.0","source":{"id":"1811.01235","kind":"arxiv","version":1}},"canonical_sha256":"71851878b191442998db8cb7e2871e63f585cda7349770ece027afff43f2a792","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"71851878b191442998db8cb7e2871e63f585cda7349770ece027afff43f2a792","first_computed_at":"2026-05-18T00:01:34.885947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:34.885947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qV8sRD5m4bd+E+OawyOdlywcykjoGrz3nArVNXRn870NGC9eTGmQWLph2bhOvc10Rm1+zGwbOwXi1ofU5cPmAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:34.886670Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.01235","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:14f05c8aa02ed6b3d208aff526749934442176c9d38c2ef3a7af4712ab647b53","sha256:f63879c3cc72b7bba8d8d3ebafa2189aece43eb4ce88da3aa66d389e9428b621"],"state_sha256":"0a2c16ba90e906551df6b9cb9a6822b3dbfeff3586800e61c5ed6cf7569f2a80"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EdXwz3nb5eutdyJheeuo4Mi1dZzaC/HIwg7ljASXygL6Myj8SWa7hbFTwbq8rbCkvAdW9WpRl09Bu+QYFQ0aCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:52:39.438218Z","bundle_sha256":"0a1cd2133da4de86aee01aa8bd7159f11eb172d5ef7aa08ead372f9000f7fd12"}}