{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ZZYZMYESPWU2AEUDJBHHPVSLPO","short_pith_number":"pith:ZZYZMYES","canonical_record":{"source":{"id":"1408.3030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-13T15:26:35Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"d955ff9fa7b6d9b7cd0aa634767b8c7b46ae9b5bec8dde893273b539340387a3","abstract_canon_sha256":"796a33d4265829d3ac71a43875bdbb62a6db6053f576edab82e95172e2d1669f"},"schema_version":"1.0"},"canonical_sha256":"ce719660927da9a01283484e77d64b7b92b5e3b71a866a8a1a93b22377a3edcc","source":{"kind":"arxiv","id":"1408.3030","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3030","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3030v2","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3030","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZZYZMYESPWU2","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZYZMYESPWU2AEUD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZYZMYES","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ZZYZMYESPWU2AEUDJBHHPVSLPO","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3030","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-13T15:26:35Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"d955ff9fa7b6d9b7cd0aa634767b8c7b46ae9b5bec8dde893273b539340387a3","abstract_canon_sha256":"796a33d4265829d3ac71a43875bdbb62a6db6053f576edab82e95172e2d1669f"},"schema_version":"1.0"},"canonical_sha256":"ce719660927da9a01283484e77d64b7b92b5e3b71a866a8a1a93b22377a3edcc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:01.251167Z","signature_b64":"/RoqZh4vUeIs+UrS3+jmLJ0swTV51/NFBmHbV/OQoONKNFOjzscOi75XTizEsrSpcSf9OOWurPVyVQpMu5ExBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce719660927da9a01283484e77d64b7b92b5e3b71a866a8a1a93b22377a3edcc","last_reissued_at":"2026-05-18T00:12:01.250498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:01.250498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3030","source_version":2,"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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PyLYyWeDnF3ltxMsCNLIJQowprsIjqC+ZZ1c6M+EZek6rIuGo9c1zXh/kc4ZAaxcouxQG43/bHlRAnqf3gicDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:45:41.013694Z"},"content_sha256":"d67f0628410014ac743f59d254cb09e3867700d8039b694f8b055ccc451d4ef1","schema_version":"1.0","event_id":"sha256:d67f0628410014ac743f59d254cb09e3867700d8039b694f8b055ccc451d4ef1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ZZYZMYESPWU2AEUDJBHHPVSLPO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Graph Automata and Verification of Distributed Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Fabian Reiter","submitted_at":"2014-08-13T15:26:35Z","abstract_excerpt":"Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting transitions to be nondeterministic or deterministic, we also obtain two strictly weaker variants of our automata for which the emptiness problem is decidable. As an application, we suggest how suitable graph automata might be useful in formal verification of distributed algorithms, using Floyd-Hoare logic."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3030","kind":"arxiv","version":2},"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:12:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPLkcDzBvm7NzxI8u8kIwk5oNpuWHq52T4YyBOwcyVlelJ1GTqBHuImxVd92wqbSO1y4f4I2OmenPR9ulhErAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T12:45:41.014043Z"},"content_sha256":"9476c29d96402fe189d2159f6b6747ab2b7ee3bc0e91d65fa204eebdddcef158","schema_version":"1.0","event_id":"sha256:9476c29d96402fe189d2159f6b6747ab2b7ee3bc0e91d65fa204eebdddcef158"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO/bundle.json","state_url":"https://pith.science/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO/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-06-05T12:45:41Z","links":{"resolver":"https://pith.science/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO","bundle":"https://pith.science/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO/bundle.json","state":"https://pith.science/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZZYZMYESPWU2AEUDJBHHPVSLPO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ZZYZMYESPWU2AEUDJBHHPVSLPO","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":"796a33d4265829d3ac71a43875bdbb62a6db6053f576edab82e95172e2d1669f","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-13T15:26:35Z","title_canon_sha256":"d955ff9fa7b6d9b7cd0aa634767b8c7b46ae9b5bec8dde893273b539340387a3"},"schema_version":"1.0","source":{"id":"1408.3030","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3030","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3030v2","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3030","created_at":"2026-05-18T00:12:01Z"},{"alias_kind":"pith_short_12","alias_value":"ZZYZMYESPWU2","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZZYZMYESPWU2AEUD","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZZYZMYES","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:9476c29d96402fe189d2159f6b6747ab2b7ee3bc0e91d65fa204eebdddcef158","target":"graph","created_at":"2026-05-18T00:12:01Z","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":"Combining ideas from distributed algorithms and alternating automata, we introduce a new class of finite graph automata that recognize precisely the languages of finite graphs definable in monadic second-order logic. By restricting transitions to be nondeterministic or deterministic, we also obtain two strictly weaker variants of our automata for which the emptiness problem is decidable. As an application, we suggest how suitable graph automata might be useful in formal verification of distributed algorithms, using Floyd-Hoare logic.","authors_text":"Fabian Reiter","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-13T15:26:35Z","title":"Distributed Graph Automata and Verification of Distributed Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3030","kind":"arxiv","version":2},"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:d67f0628410014ac743f59d254cb09e3867700d8039b694f8b055ccc451d4ef1","target":"record","created_at":"2026-05-18T00:12:01Z","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":"796a33d4265829d3ac71a43875bdbb62a6db6053f576edab82e95172e2d1669f","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-08-13T15:26:35Z","title_canon_sha256":"d955ff9fa7b6d9b7cd0aa634767b8c7b46ae9b5bec8dde893273b539340387a3"},"schema_version":"1.0","source":{"id":"1408.3030","kind":"arxiv","version":2}},"canonical_sha256":"ce719660927da9a01283484e77d64b7b92b5e3b71a866a8a1a93b22377a3edcc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce719660927da9a01283484e77d64b7b92b5e3b71a866a8a1a93b22377a3edcc","first_computed_at":"2026-05-18T00:12:01.250498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:01.250498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/RoqZh4vUeIs+UrS3+jmLJ0swTV51/NFBmHbV/OQoONKNFOjzscOi75XTizEsrSpcSf9OOWurPVyVQpMu5ExBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:01.251167Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3030","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d67f0628410014ac743f59d254cb09e3867700d8039b694f8b055ccc451d4ef1","sha256:9476c29d96402fe189d2159f6b6747ab2b7ee3bc0e91d65fa204eebdddcef158"],"state_sha256":"a34b2b95d3ccdf4c43e6786c35c6ebb8f391466bd8e8dcc64ec642800b9d61d6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/mB3iGjMr//9yS6rrNQBUVQjWWpDjF1KQZEbgeYQV4ZY54tFc1Ovaxte1hZr8GVF3ibD7GXdxTUEQieQ1d5HAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T12:45:41.016503Z","bundle_sha256":"9a0d005d50fd5ef5e0ee22eefaefcfb42ec8efc0b5851936dca4e43b11d42aeb"}}