{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MYYFNXHEHJ7TXB5O3TWUOJVS2M","short_pith_number":"pith:MYYFNXHE","canonical_record":{"source":{"id":"1404.6503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-25T18:58:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0374a353b7d674b37bf5710d0ce00c041e63f9f5f164642481a6aaa0cbd7fd2f","abstract_canon_sha256":"3f8b21a5ab2de965d9f0cadac6bf34ab9b7626e145cb3b3249e6a9d6703cd846"},"schema_version":"1.0"},"canonical_sha256":"663056dce43a7f3b87aedced4726b2d31189c54641b6cc7c394708be371499dd","source":{"kind":"arxiv","id":"1404.6503","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6503","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6503v1","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6503","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"MYYFNXHEHJ7T","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MYYFNXHEHJ7TXB5O","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MYYFNXHE","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MYYFNXHEHJ7TXB5O3TWUOJVS2M","target":"record","payload":{"canonical_record":{"source":{"id":"1404.6503","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-25T18:58:40Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0374a353b7d674b37bf5710d0ce00c041e63f9f5f164642481a6aaa0cbd7fd2f","abstract_canon_sha256":"3f8b21a5ab2de965d9f0cadac6bf34ab9b7626e145cb3b3249e6a9d6703cd846"},"schema_version":"1.0"},"canonical_sha256":"663056dce43a7f3b87aedced4726b2d31189c54641b6cc7c394708be371499dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:16.174057Z","signature_b64":"XP8NaSjoJv5RhOhDq6uRWi4UAGdM+7RoVYsFPzBbQVCbQvEsOdSfEGqNndqBLX70vJHxAXaOPO/lFkHtrBioAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"663056dce43a7f3b87aedced4726b2d31189c54641b6cc7c394708be371499dd","last_reissued_at":"2026-05-18T02:53:16.173385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:16.173385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.6503","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qht+Pg6NMiAJpHKSv1QjdnEJQZo4oTl3sTHDXBVELbs7fyvikMJz3lKOBVDpWzwNMht0LYaoz0DoJjSi67V7Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:41:47.290737Z"},"content_sha256":"6e36dd6ce26bf85ba62c51accd739d7c8a2be417e60c80534b8751dbd22115e0","schema_version":"1.0","event_id":"sha256:6e36dd6ce26bf85ba62c51accd739d7c8a2be417e60c80534b8751dbd22115e0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MYYFNXHEHJ7TXB5O3TWUOJVS2M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Graph Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Fabian Reiter","submitted_at":"2014-04-25T18:58:40Z","abstract_excerpt":"Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the regular languages are precisely those definable in monadic second-order logic. In this regard, the automata proposed in the present work can be seen, to some extent, as a generalization of finite automata to graphs.\n  Furthermore, we show that, unlike for finite automata on words and trees, the deterministic, nondeterministic and alternating variants of our au"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6503","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-18T02:53:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fi6gfJwchGFgff9Eqbr9KLd/tvaDGFoxRgkxjUeBIijLjsaY9nL/7BmBVW6+AZYys0uUUdxN3YuoacYLbO4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:41:47.291094Z"},"content_sha256":"e4ae118ad9eb02506262a9580b69a7124b7eef6ea85c9acc0b8d4d15670efbd9","schema_version":"1.0","event_id":"sha256:e4ae118ad9eb02506262a9580b69a7124b7eef6ea85c9acc0b8d4d15670efbd9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M/bundle.json","state_url":"https://pith.science/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M/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-05T11:41:47Z","links":{"resolver":"https://pith.science/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M","bundle":"https://pith.science/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M/bundle.json","state":"https://pith.science/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MYYFNXHEHJ7TXB5O3TWUOJVS2M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MYYFNXHEHJ7TXB5O3TWUOJVS2M","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":"3f8b21a5ab2de965d9f0cadac6bf34ab9b7626e145cb3b3249e6a9d6703cd846","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-25T18:58:40Z","title_canon_sha256":"0374a353b7d674b37bf5710d0ce00c041e63f9f5f164642481a6aaa0cbd7fd2f"},"schema_version":"1.0","source":{"id":"1404.6503","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.6503","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"arxiv_version","alias_value":"1404.6503v1","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.6503","created_at":"2026-05-18T02:53:16Z"},{"alias_kind":"pith_short_12","alias_value":"MYYFNXHEHJ7T","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MYYFNXHEHJ7TXB5O","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MYYFNXHE","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:e4ae118ad9eb02506262a9580b69a7124b7eef6ea85c9acc0b8d4d15670efbd9","target":"graph","created_at":"2026-05-18T02:53:16Z","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":"Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the regular languages are precisely those definable in monadic second-order logic. In this regard, the automata proposed in the present work can be seen, to some extent, as a generalization of finite automata to graphs.\n  Furthermore, we show that, unlike for finite automata on words and trees, the deterministic, nondeterministic and alternating variants of our au","authors_text":"Fabian Reiter","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-25T18:58:40Z","title":"Distributed Graph Automata"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6503","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:6e36dd6ce26bf85ba62c51accd739d7c8a2be417e60c80534b8751dbd22115e0","target":"record","created_at":"2026-05-18T02:53:16Z","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":"3f8b21a5ab2de965d9f0cadac6bf34ab9b7626e145cb3b3249e6a9d6703cd846","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2014-04-25T18:58:40Z","title_canon_sha256":"0374a353b7d674b37bf5710d0ce00c041e63f9f5f164642481a6aaa0cbd7fd2f"},"schema_version":"1.0","source":{"id":"1404.6503","kind":"arxiv","version":1}},"canonical_sha256":"663056dce43a7f3b87aedced4726b2d31189c54641b6cc7c394708be371499dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"663056dce43a7f3b87aedced4726b2d31189c54641b6cc7c394708be371499dd","first_computed_at":"2026-05-18T02:53:16.173385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:16.173385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XP8NaSjoJv5RhOhDq6uRWi4UAGdM+7RoVYsFPzBbQVCbQvEsOdSfEGqNndqBLX70vJHxAXaOPO/lFkHtrBioAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:16.174057Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.6503","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e36dd6ce26bf85ba62c51accd739d7c8a2be417e60c80534b8751dbd22115e0","sha256:e4ae118ad9eb02506262a9580b69a7124b7eef6ea85c9acc0b8d4d15670efbd9"],"state_sha256":"6e143240c601d665267de19a6ca0a460cb5db36e4f9c6b9b3cc1fa6bdec7c91d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9BJJEvjuFXelE/SqbBw6T3PGjRK5bECLyaNbu/EoWnH4VFYPlw5+Y+DGDbWf5dZVqI7nPlOyrnE+QCfgIjAAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:41:47.293048Z","bundle_sha256":"97e1e7255dd970669428fd71c54e723fc12dc0dbde09ef09cd97c1428e82b4e3"}}