{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OGCRQ6FRSFCCTGG3RS36FBY6MP","short_pith_number":"pith:OGCRQ6FR","schema_version":"1.0","canonical_sha256":"71851878b191442998db8cb7e2871e63f585cda7349770ece027afff43f2a792","source":{"kind":"arxiv","id":"1811.01235","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.01235","created_at":"2026-05-18T00:01:34.886062+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.01235v1","created_at":"2026-05-18T00:01:34.886062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.01235","created_at":"2026-05-18T00:01:34.886062+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGCRQ6FRSFCC","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGCRQ6FRSFCCTGG3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGCRQ6FR","created_at":"2026-05-18T12:32:43.782077+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP","json":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP.json","graph_json":"https://pith.science/api/pith-number/OGCRQ6FRSFCCTGG3RS36FBY6MP/graph.json","events_json":"https://pith.science/api/pith-number/OGCRQ6FRSFCCTGG3RS36FBY6MP/events.json","paper":"https://pith.science/paper/OGCRQ6FR"},"agent_actions":{"view_html":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP","download_json":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP.json","view_paper":"https://pith.science/paper/OGCRQ6FR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.01235&json=true","fetch_graph":"https://pith.science/api/pith-number/OGCRQ6FRSFCCTGG3RS36FBY6MP/graph.json","fetch_events":"https://pith.science/api/pith-number/OGCRQ6FRSFCCTGG3RS36FBY6MP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/action/storage_attestation","attest_author":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/action/author_attestation","sign_citation":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/action/citation_signature","submit_replication":"https://pith.science/pith/OGCRQ6FRSFCCTGG3RS36FBY6MP/action/replication_record"}},"created_at":"2026-05-18T00:01:34.886062+00:00","updated_at":"2026-05-18T00:01:34.886062+00:00"}