{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3BQNHVAPRPFYUJSM5N466F6CV7","short_pith_number":"pith:3BQNHVAP","schema_version":"1.0","canonical_sha256":"d860d3d40f8bcb8a264ceb79ef17c2afe0646d1db23d268b12ae932dd016739d","source":{"kind":"arxiv","id":"1302.3798","version":1},"attestation_state":"computed","paper":{"title":"Silent Transitions in Automata with Storage","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2013-02-15T16:35:19Z","abstract_excerpt":"We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step.\n  We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism that is given by a monoid.\n  This work presents generalizations of known results on silent transitions. For two classes of monoids, it provides characterizations of those monoids that allow the removal of"},"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":"1302.3798","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2013-02-15T16:35:19Z","cross_cats_sorted":[],"title_canon_sha256":"f62fa25ee9a83d188e5b72bb0ba18daddcc51d5a3ef23812129b4dce8ac35685","abstract_canon_sha256":"3c9e873b903d9c7ad3ed56fee10a7a78e10b65c5d75b7a74dfa63aecb402f3e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:35.659418Z","signature_b64":"QtCz8+HNREKUykNEQ64xPpjBPzfyFNKt16jPVVa1T6MipSu9hpfCGd/AMbzmkpXCc80g4i6QIVqdy1E4oI9bBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d860d3d40f8bcb8a264ceb79ef17c2afe0646d1db23d268b12ae932dd016739d","last_reissued_at":"2026-05-18T03:33:35.658789Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:35.658789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Silent Transitions in Automata with Storage","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2013-02-15T16:35:19Z","abstract_excerpt":"We consider the computational power of silent transitions in one-way automata with storage. Specifically, we ask which storage mechanisms admit a transformation of a given automaton into one that accepts the same language and reads at least one input symbol in each step.\n  We study this question using the model of valence automata. Here, a finite automaton is equipped with a storage mechanism that is given by a monoid.\n  This work presents generalizations of known results on silent transitions. For two classes of monoids, it provides characterizations of those monoids that allow the removal of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3798","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":"1302.3798","created_at":"2026-05-18T03:33:35.658892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3798v1","created_at":"2026-05-18T03:33:35.658892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3798","created_at":"2026-05-18T03:33:35.658892+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BQNHVAPRPFY","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BQNHVAPRPFYUJSM","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BQNHVAP","created_at":"2026-05-18T12:27:32.513160+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/3BQNHVAPRPFYUJSM5N466F6CV7","json":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7.json","graph_json":"https://pith.science/api/pith-number/3BQNHVAPRPFYUJSM5N466F6CV7/graph.json","events_json":"https://pith.science/api/pith-number/3BQNHVAPRPFYUJSM5N466F6CV7/events.json","paper":"https://pith.science/paper/3BQNHVAP"},"agent_actions":{"view_html":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7","download_json":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7.json","view_paper":"https://pith.science/paper/3BQNHVAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3798&json=true","fetch_graph":"https://pith.science/api/pith-number/3BQNHVAPRPFYUJSM5N466F6CV7/graph.json","fetch_events":"https://pith.science/api/pith-number/3BQNHVAPRPFYUJSM5N466F6CV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7/action/storage_attestation","attest_author":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7/action/author_attestation","sign_citation":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7/action/citation_signature","submit_replication":"https://pith.science/pith/3BQNHVAPRPFYUJSM5N466F6CV7/action/replication_record"}},"created_at":"2026-05-18T03:33:35.658892+00:00","updated_at":"2026-05-18T03:33:35.658892+00:00"}