{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:C36CAKC7MZRQCCEVPS7E4EKN3V","short_pith_number":"pith:C36CAKC7","schema_version":"1.0","canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","source":{"kind":"arxiv","id":"1710.07528","version":1},"attestation_state":"computed","paper":{"title":"The Emptiness Problem for Valence Automata over Graph Monoids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2017-10-20T13:44:30Z","abstract_excerpt":"This work studies which storage mechanisms in automata permit decidability of the emptiness problem. The question is formalized using valence automata, an abstract model of automata in which the storage mechanism is given by a monoid. For each of a variety of storage mechanisms, one can choose a (typically infinite) monoid $M$ such that valence automata over $M$ are equivalent to (one-way) automata with this type of storage. In fact, many important storage mechanisms can be realized by monoids defined by finite graphs, called graph monoids. Examples include pushdown stacks, partially blind cou"},"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":"1710.07528","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2017-10-20T13:44:30Z","cross_cats_sorted":["cs.LO","math.GR"],"title_canon_sha256":"68b99eefb6a235bbedbc477d36b766c1a88e29fd90b6605a86563502bf49e788","abstract_canon_sha256":"9c690d4ad99fc802c84da9cab52c9b130fb294d380a08e40726aa09f879c682f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:24.607358Z","signature_b64":"H9o9Lyvi+I3cdvZuxlYM3w8H1C97aBneeGjkluQDEP53RyO43w+7AUuYgm6+m4oYzUCJogt9CGlgWEvem/Q4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16fc20285f66630108957cbe4e114ddd4a175d189f8b4c4b785065e4626ea022","last_reissued_at":"2026-05-18T00:32:24.606700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:24.606700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Emptiness Problem for Valence Automata over Graph Monoids","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LO","math.GR"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2017-10-20T13:44:30Z","abstract_excerpt":"This work studies which storage mechanisms in automata permit decidability of the emptiness problem. The question is formalized using valence automata, an abstract model of automata in which the storage mechanism is given by a monoid. For each of a variety of storage mechanisms, one can choose a (typically infinite) monoid $M$ such that valence automata over $M$ are equivalent to (one-way) automata with this type of storage. In fact, many important storage mechanisms can be realized by monoids defined by finite graphs, called graph monoids. Examples include pushdown stacks, partially blind cou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.07528","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1710.07528","created_at":"2026-05-18T00:32:24.606795+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.07528v1","created_at":"2026-05-18T00:32:24.606795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.07528","created_at":"2026-05-18T00:32:24.606795+00:00"},{"alias_kind":"pith_short_12","alias_value":"C36CAKC7MZRQ","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"C36CAKC7MZRQCCEV","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"C36CAKC7","created_at":"2026-05-18T12:31:08.081275+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/C36CAKC7MZRQCCEVPS7E4EKN3V","json":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V.json","graph_json":"https://pith.science/api/pith-number/C36CAKC7MZRQCCEVPS7E4EKN3V/graph.json","events_json":"https://pith.science/api/pith-number/C36CAKC7MZRQCCEVPS7E4EKN3V/events.json","paper":"https://pith.science/paper/C36CAKC7"},"agent_actions":{"view_html":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V","download_json":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V.json","view_paper":"https://pith.science/paper/C36CAKC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.07528&json=true","fetch_graph":"https://pith.science/api/pith-number/C36CAKC7MZRQCCEVPS7E4EKN3V/graph.json","fetch_events":"https://pith.science/api/pith-number/C36CAKC7MZRQCCEVPS7E4EKN3V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/action/storage_attestation","attest_author":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/action/author_attestation","sign_citation":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/action/citation_signature","submit_replication":"https://pith.science/pith/C36CAKC7MZRQCCEVPS7E4EKN3V/action/replication_record"}},"created_at":"2026-05-18T00:32:24.606795+00:00","updated_at":"2026-05-18T00:32:24.606795+00:00"}