{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:2EX3ZNJELL3U3AE4ZLZNY6AJT4","short_pith_number":"pith:2EX3ZNJE","schema_version":"1.0","canonical_sha256":"d12fbcb5245af74d809ccaf2dc78099f0f10c5970598de229cdb7201cb289d6c","source":{"kind":"arxiv","id":"1705.02609","version":2},"attestation_state":"computed","paper":{"title":"Emptiness Problems for Distributed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.FL","authors_text":"Antti Kuusisto, Fabian Reiter","submitted_at":"2017-05-07T12:45:27Z","abstract_excerpt":"We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite sequence of synchronous rounds. The problem is shown to be decidable in LogSpace for a class of forgetful automata, where the nodes see the messages received from their neighbors but cannot remember their own state. When restricted to the appropriate families of graphs, these forgetful automata are equivalent to classical finite word automata, but strictly more e"},"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":"1705.02609","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-05-07T12:45:27Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"e070fba8e7133acca16d640c3f42d837722f39c35dc57a95344ea5a7763e7ccb","abstract_canon_sha256":"088802572abf10536aeb074e257955bfaa6f9cd0d8ebf0f00b456172003d7b03"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:35:51.299162Z","signature_b64":"7VE5GAu8+W3nJYaJfeKTmQ9wPv9i6FAzXmEI0RZUWl+hxzk3WnmR1J7ekmhuN0kgIS8QJXyHThIGZt/WjA2yAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d12fbcb5245af74d809ccaf2dc78099f0f10c5970598de229cdb7201cb289d6c","last_reissued_at":"2026-05-18T00:35:51.298580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:35:51.298580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Emptiness Problems for Distributed Automata","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.FL","authors_text":"Antti Kuusisto, Fabian Reiter","submitted_at":"2017-05-07T12:45:27Z","abstract_excerpt":"We investigate the decidability of the emptiness problem for three classes of distributed automata. These devices operate on finite directed graphs, acting as networks of identical finite-state machines that communicate in an infinite sequence of synchronous rounds. The problem is shown to be decidable in LogSpace for a class of forgetful automata, where the nodes see the messages received from their neighbors but cannot remember their own state. When restricted to the appropriate families of graphs, these forgetful automata are equivalent to classical finite word automata, but strictly more e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.02609","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.02609","created_at":"2026-05-18T00:35:51.298659+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.02609v2","created_at":"2026-05-18T00:35:51.298659+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.02609","created_at":"2026-05-18T00:35:51.298659+00:00"},{"alias_kind":"pith_short_12","alias_value":"2EX3ZNJELL3U","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_16","alias_value":"2EX3ZNJELL3U3AE4","created_at":"2026-05-18T12:30:55.937587+00:00"},{"alias_kind":"pith_short_8","alias_value":"2EX3ZNJE","created_at":"2026-05-18T12:30:55.937587+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/2EX3ZNJELL3U3AE4ZLZNY6AJT4","json":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4.json","graph_json":"https://pith.science/api/pith-number/2EX3ZNJELL3U3AE4ZLZNY6AJT4/graph.json","events_json":"https://pith.science/api/pith-number/2EX3ZNJELL3U3AE4ZLZNY6AJT4/events.json","paper":"https://pith.science/paper/2EX3ZNJE"},"agent_actions":{"view_html":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4","download_json":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4.json","view_paper":"https://pith.science/paper/2EX3ZNJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.02609&json=true","fetch_graph":"https://pith.science/api/pith-number/2EX3ZNJELL3U3AE4ZLZNY6AJT4/graph.json","fetch_events":"https://pith.science/api/pith-number/2EX3ZNJELL3U3AE4ZLZNY6AJT4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4/action/storage_attestation","attest_author":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4/action/author_attestation","sign_citation":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4/action/citation_signature","submit_replication":"https://pith.science/pith/2EX3ZNJELL3U3AE4ZLZNY6AJT4/action/replication_record"}},"created_at":"2026-05-18T00:35:51.298659+00:00","updated_at":"2026-05-18T00:35:51.298659+00:00"}