{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DDKGYN6K5K5ZYTF56STBTVRUPB","short_pith_number":"pith:DDKGYN6K","schema_version":"1.0","canonical_sha256":"18d46c37caeabb9c4cbdf4a619d63478417d6df458a7702f7c001024375b3ec5","source":{"kind":"arxiv","id":"1703.04367","version":3},"attestation_state":"computed","paper":{"title":"Towards Efficient Verification of Population Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Javier Esparza, Michael Blondin, Philipp J. Meyer, Stefan Jaax","submitted_at":"2017-03-13T13:03:47Z","abstract_excerpt":"Population protocols are a well established model of computation by anonymous, identical finite state agents. A protocol is well-specified if from every initial configuration, all fair executions reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is EXPSPACE-hard, and for which only algorithms of non-primitive recur"},"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":"1703.04367","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-13T13:03:47Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"65ce799aa4cd3f3cc34d52593485860edde67633d19359849730e96ea68e37aa","abstract_canon_sha256":"9f6799ddcb853acccb28136d0fc19d5e4810a130799c7f864e7b6d067c8add4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:36.706066Z","signature_b64":"sjioL3DAtqwZyDsQysFKV+L5/W5qAMjVfPtm8SEMwOry6gDsOl2eVqkReALuDORnrdNm/xsUBL+T8pHtcosJCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"18d46c37caeabb9c4cbdf4a619d63478417d6df458a7702f7c001024375b3ec5","last_reissued_at":"2026-05-18T00:09:36.705569Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:36.705569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards Efficient Verification of Population Protocols","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.LO","authors_text":"Javier Esparza, Michael Blondin, Philipp J. Meyer, Stefan Jaax","submitted_at":"2017-03-13T13:03:47Z","abstract_excerpt":"Population protocols are a well established model of computation by anonymous, identical finite state agents. A protocol is well-specified if from every initial configuration, all fair executions reach a common consensus. The central verification question for population protocols is the well-specification problem: deciding if a given protocol is well-specified. Esparza et al. have recently shown that this problem is decidable, but with very high complexity: it is at least as hard as the Petri net reachability problem, which is EXPSPACE-hard, and for which only algorithms of non-primitive recur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04367","kind":"arxiv","version":3},"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":"1703.04367","created_at":"2026-05-18T00:09:36.705645+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04367v3","created_at":"2026-05-18T00:09:36.705645+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04367","created_at":"2026-05-18T00:09:36.705645+00:00"},{"alias_kind":"pith_short_12","alias_value":"DDKGYN6K5K5Z","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_16","alias_value":"DDKGYN6K5K5ZYTF5","created_at":"2026-05-18T12:31:10.602751+00:00"},{"alias_kind":"pith_short_8","alias_value":"DDKGYN6K","created_at":"2026-05-18T12:31:10.602751+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/DDKGYN6K5K5ZYTF56STBTVRUPB","json":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB.json","graph_json":"https://pith.science/api/pith-number/DDKGYN6K5K5ZYTF56STBTVRUPB/graph.json","events_json":"https://pith.science/api/pith-number/DDKGYN6K5K5ZYTF56STBTVRUPB/events.json","paper":"https://pith.science/paper/DDKGYN6K"},"agent_actions":{"view_html":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB","download_json":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB.json","view_paper":"https://pith.science/paper/DDKGYN6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04367&json=true","fetch_graph":"https://pith.science/api/pith-number/DDKGYN6K5K5ZYTF56STBTVRUPB/graph.json","fetch_events":"https://pith.science/api/pith-number/DDKGYN6K5K5ZYTF56STBTVRUPB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/action/storage_attestation","attest_author":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/action/author_attestation","sign_citation":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/action/citation_signature","submit_replication":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/action/replication_record"}},"created_at":"2026-05-18T00:09:36.705645+00:00","updated_at":"2026-05-18T00:09:36.705645+00:00"}