{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:NIBNROJ6OBB6TTIKE4JKQGLLKZ","short_pith_number":"pith:NIBNROJ6","canonical_record":{"source":{"id":"1805.06238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-16T10:42:41Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"e85fbdb107612a79452fae93634398624c427de5e000e0250887ed0c34e26160","abstract_canon_sha256":"84d0dc6697f7555d08d19b1d39f4f7396aa23a0d0aee029ed0f62cf872588579"},"schema_version":"1.0"},"canonical_sha256":"6a02d8b93e7043e9cd0a2712a8196b565951205fbf08067c2686b529a5b6a2cc","source":{"kind":"arxiv","id":"1805.06238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06238","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06238v1","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06238","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"NIBNROJ6OBB6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIBNROJ6OBB6TTIK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIBNROJ6","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:NIBNROJ6OBB6TTIKE4JKQGLLKZ","target":"record","payload":{"canonical_record":{"source":{"id":"1805.06238","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-16T10:42:41Z","cross_cats_sorted":["cs.DC","cs.LO"],"title_canon_sha256":"e85fbdb107612a79452fae93634398624c427de5e000e0250887ed0c34e26160","abstract_canon_sha256":"84d0dc6697f7555d08d19b1d39f4f7396aa23a0d0aee029ed0f62cf872588579"},"schema_version":"1.0"},"canonical_sha256":"6a02d8b93e7043e9cd0a2712a8196b565951205fbf08067c2686b529a5b6a2cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:50.617736Z","signature_b64":"aQZx1qdlkYFierRy7z3ExTFjxhN9IfJUYz/tK0e2+7VK1trx/PLxHh8k6PK63o8xVq1EMNJRXjqfciwRkDc9BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a02d8b93e7043e9cd0a2712a8196b565951205fbf08067c2686b529a5b6a2cc","last_reissued_at":"2026-05-17T23:57:50.617212Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:50.617212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.06238","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-17T23:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4dwYdW5oFRKWrsZT5dNDLOe7qOzFqBS223ROLngW9T8Vkn174j/xHamc0z49XdVCOrzAWSDulEODtlXb8os3Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:04.589827Z"},"content_sha256":"6c18b7c60f5f451e991334d068be78f2225b6578c7eeb7a507a2085e1931e1c9","schema_version":"1.0","event_id":"sha256:6c18b7c60f5f451e991334d068be78f2225b6578c7eeb7a507a2085e1931e1c9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:NIBNROJ6OBB6TTIKE4JKQGLLKZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Automata and Logic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Fabian Reiter","submitted_at":"2018-05-16T10:42:41Z","abstract_excerpt":"Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite number of synchronous rounds. For the local variant of those automata, where the number of rounds is bounded by a constant, Hella et al. (2012, 2015) have established a logical characterization in terms of basic modal logic. In this thesis, we provide similar logical characterizations for two more expressive classes of distributed automata.\n  The first class "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06238","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-17T23:57:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zd+YBf4Zr/FhBz0lGqXROXzWDSXy7v/UUrB0JWFQn/FXeyRTQPGUBclIkrrzAul1uP9tEpKfeqwsu8o6GwomBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:24:04.590173Z"},"content_sha256":"6f6bfcdadb837853d0af1409c1399d0f08b8589cbf315accd841da58cc4f6e53","schema_version":"1.0","event_id":"sha256:6f6bfcdadb837853d0af1409c1399d0f08b8589cbf315accd841da58cc4f6e53"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ/bundle.json","state_url":"https://pith.science/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ/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-05T09:24:04Z","links":{"resolver":"https://pith.science/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ","bundle":"https://pith.science/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ/bundle.json","state":"https://pith.science/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIBNROJ6OBB6TTIKE4JKQGLLKZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NIBNROJ6OBB6TTIKE4JKQGLLKZ","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":"84d0dc6697f7555d08d19b1d39f4f7396aa23a0d0aee029ed0f62cf872588579","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-16T10:42:41Z","title_canon_sha256":"e85fbdb107612a79452fae93634398624c427de5e000e0250887ed0c34e26160"},"schema_version":"1.0","source":{"id":"1805.06238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.06238","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"arxiv_version","alias_value":"1805.06238v1","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06238","created_at":"2026-05-17T23:57:50Z"},{"alias_kind":"pith_short_12","alias_value":"NIBNROJ6OBB6","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NIBNROJ6OBB6TTIK","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NIBNROJ6","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:6f6bfcdadb837853d0af1409c1399d0f08b8589cbf315accd841da58cc4f6e53","target":"graph","created_at":"2026-05-17T23:57:50Z","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":"Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite number of synchronous rounds. For the local variant of those automata, where the number of rounds is bounded by a constant, Hella et al. (2012, 2015) have established a logical characterization in terms of basic modal logic. In this thesis, we provide similar logical characterizations for two more expressive classes of distributed automata.\n  The first class ","authors_text":"Fabian Reiter","cross_cats":["cs.DC","cs.LO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-16T10:42:41Z","title":"Distributed Automata and Logic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06238","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:6c18b7c60f5f451e991334d068be78f2225b6578c7eeb7a507a2085e1931e1c9","target":"record","created_at":"2026-05-17T23:57:50Z","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":"84d0dc6697f7555d08d19b1d39f4f7396aa23a0d0aee029ed0f62cf872588579","cross_cats_sorted":["cs.DC","cs.LO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2018-05-16T10:42:41Z","title_canon_sha256":"e85fbdb107612a79452fae93634398624c427de5e000e0250887ed0c34e26160"},"schema_version":"1.0","source":{"id":"1805.06238","kind":"arxiv","version":1}},"canonical_sha256":"6a02d8b93e7043e9cd0a2712a8196b565951205fbf08067c2686b529a5b6a2cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a02d8b93e7043e9cd0a2712a8196b565951205fbf08067c2686b529a5b6a2cc","first_computed_at":"2026-05-17T23:57:50.617212Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:50.617212Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aQZx1qdlkYFierRy7z3ExTFjxhN9IfJUYz/tK0e2+7VK1trx/PLxHh8k6PK63o8xVq1EMNJRXjqfciwRkDc9BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:50.617736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.06238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c18b7c60f5f451e991334d068be78f2225b6578c7eeb7a507a2085e1931e1c9","sha256:6f6bfcdadb837853d0af1409c1399d0f08b8589cbf315accd841da58cc4f6e53"],"state_sha256":"743d5d915fac2d6b089ba33af429ffba9104a02516b0a6fbf4577a81140bcb26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wd9CvNoMUFJOeLA9Uuzq2f+v+6n9ZK05Hd32aPTQjCOSjM70/1EpIxFPQCyK5IsvLtmvoOGkQnwLk75JXm6NAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:24:04.592146Z","bundle_sha256":"eb4ad8c5681ff7d2103188b57d52c0b3c4b3058ba9f08661e64ea6cc500c1335"}}