{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DDKGYN6K5K5ZYTF56STBTVRUPB","short_pith_number":"pith:DDKGYN6K","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"},"canonical_sha256":"18d46c37caeabb9c4cbdf4a619d63478417d6df458a7702f7c001024375b3ec5","source":{"kind":"arxiv","id":"1703.04367","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04367","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04367v3","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04367","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"DDKGYN6K5K5Z","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DDKGYN6K5K5ZYTF5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DDKGYN6K","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DDKGYN6K5K5ZYTF56STBTVRUPB","target":"record","payload":{"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"},"canonical_sha256":"18d46c37caeabb9c4cbdf4a619d63478417d6df458a7702f7c001024375b3ec5","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"},"source_kind":"arxiv","source_id":"1703.04367","source_version":3,"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:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y/PwYQKy3L68DK/TgIQFROr+/cO3jMHFHS3vny15TPrjLREyHrysORhAZj+3w/QJm2TSb+19pclZqUL8Nbr0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:56:11.671093Z"},"content_sha256":"c6a1476d477ffb42f473ee46308960584756f1db284f97f1c7c5510a83feb80e","schema_version":"1.0","event_id":"sha256:c6a1476d477ffb42f473ee46308960584756f1db284f97f1c7c5510a83feb80e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DDKGYN6K5K5ZYTF56STBTVRUPB","target":"graph","payload":{"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"},"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:09:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"X3IEKNXTz42cLHt8lH1WJPAUYH34gesL6hyOgUf6Ggz8EeDXmIb/vDFBClfWH4u0NXQAg5EvjIWxozNPLTT5Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:56:11.671780Z"},"content_sha256":"64e7c5779c9e9c10e70f54a3b9c46c93daf45dcc118c467f48fb19ce60828da6","schema_version":"1.0","event_id":"sha256:64e7c5779c9e9c10e70f54a3b9c46c93daf45dcc118c467f48fb19ce60828da6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/bundle.json","state_url":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/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-26T06:56:11Z","links":{"resolver":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB","bundle":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/bundle.json","state":"https://pith.science/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DDKGYN6K5K5ZYTF56STBTVRUPB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DDKGYN6K5K5ZYTF56STBTVRUPB","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":"9f6799ddcb853acccb28136d0fc19d5e4810a130799c7f864e7b6d067c8add4a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-13T13:03:47Z","title_canon_sha256":"65ce799aa4cd3f3cc34d52593485860edde67633d19359849730e96ea68e37aa"},"schema_version":"1.0","source":{"id":"1703.04367","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04367","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04367v3","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04367","created_at":"2026-05-18T00:09:36Z"},{"alias_kind":"pith_short_12","alias_value":"DDKGYN6K5K5Z","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DDKGYN6K5K5ZYTF5","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DDKGYN6K","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:64e7c5779c9e9c10e70f54a3b9c46c93daf45dcc118c467f48fb19ce60828da6","target":"graph","created_at":"2026-05-18T00:09:36Z","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 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","authors_text":"Javier Esparza, Michael Blondin, Philipp J. Meyer, Stefan Jaax","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-13T13:03:47Z","title":"Towards Efficient Verification of Population Protocols"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04367","kind":"arxiv","version":3},"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:c6a1476d477ffb42f473ee46308960584756f1db284f97f1c7c5510a83feb80e","target":"record","created_at":"2026-05-18T00:09:36Z","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":"9f6799ddcb853acccb28136d0fc19d5e4810a130799c7f864e7b6d067c8add4a","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-03-13T13:03:47Z","title_canon_sha256":"65ce799aa4cd3f3cc34d52593485860edde67633d19359849730e96ea68e37aa"},"schema_version":"1.0","source":{"id":"1703.04367","kind":"arxiv","version":3}},"canonical_sha256":"18d46c37caeabb9c4cbdf4a619d63478417d6df458a7702f7c001024375b3ec5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"18d46c37caeabb9c4cbdf4a619d63478417d6df458a7702f7c001024375b3ec5","first_computed_at":"2026-05-18T00:09:36.705569Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:09:36.705569Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sjioL3DAtqwZyDsQysFKV+L5/W5qAMjVfPtm8SEMwOry6gDsOl2eVqkReALuDORnrdNm/xsUBL+T8pHtcosJCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:09:36.706066Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04367","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6a1476d477ffb42f473ee46308960584756f1db284f97f1c7c5510a83feb80e","sha256:64e7c5779c9e9c10e70f54a3b9c46c93daf45dcc118c467f48fb19ce60828da6"],"state_sha256":"d406ecbc4a9c7f71554ce9e8c757c758bb64ea5d8492d12820c6984e08ed7513"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fnvBHlThZsDDyiZVRFmjKO0D+EY/Ut070BzQuej5KJuKS5+FyCNML4h/SVye+R6VI7Mois0Tpc0eOSJ/Co+lCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:56:11.675845Z","bundle_sha256":"2cb7f8e4e6150075b9b2bcb211649c2083d99ec60fd58caf6bdc3128fede6329"}}