{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:UDOB5UEBPTJCDTMMYQHGGY3TWN","short_pith_number":"pith:UDOB5UEB","schema_version":"1.0","canonical_sha256":"a0dc1ed0817cd221cd8cc40e636373b34d00589b42ddd19ca37c7964f9eed071","source":{"kind":"arxiv","id":"1409.7922","version":1},"attestation_state":"computed","paper":{"title":"Computing downward closures for stacked counter automata","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2014-09-28T15:35:44Z","abstract_excerpt":"The downward closure of a language $L$ of words is the set of all (not necessarily contiguous) subwords of members of $L$. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a promising abstraction, there are only few language classes for which an automaton for the downward closure is known to be computable.\n  It is shown here that for stacked counter automata, the downward closure is computable. Stacked counter automata are finite automata with a storage mechanism obtained by \\emph{adding blind counters} and \\emph{building stacks}."},"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":"1409.7922","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.FL","submitted_at":"2014-09-28T15:35:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"0d4640b08dd9b8d777e4747b17fb252358c9856f54bd4b90d8486c882897a528","abstract_canon_sha256":"af5d96a7549a795a061c7f6787b623161f346c5a1473cf02405afdfb89f723e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:34.065070Z","signature_b64":"vPAaVrvydHlkEINrr8uroy/f+A8akRkkvUPy2AJFpSHOO9HkGtGki7pFaFpk3etvE6vT3pbDqfk114ZkKaZ/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a0dc1ed0817cd221cd8cc40e636373b34d00589b42ddd19ca37c7964f9eed071","last_reissued_at":"2026-05-18T02:41:34.064527Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:34.064527Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing downward closures for stacked counter automata","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche","submitted_at":"2014-09-28T15:35:44Z","abstract_excerpt":"The downward closure of a language $L$ of words is the set of all (not necessarily contiguous) subwords of members of $L$. It is well known that the downward closure of any language is regular. Although the downward closure seems to be a promising abstraction, there are only few language classes for which an automaton for the downward closure is known to be computable.\n  It is shown here that for stacked counter automata, the downward closure is computable. Stacked counter automata are finite automata with a storage mechanism obtained by \\emph{adding blind counters} and \\emph{building stacks}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7922","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":"1409.7922","created_at":"2026-05-18T02:41:34.064592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.7922v1","created_at":"2026-05-18T02:41:34.064592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7922","created_at":"2026-05-18T02:41:34.064592+00:00"},{"alias_kind":"pith_short_12","alias_value":"UDOB5UEBPTJC","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"UDOB5UEBPTJCDTMM","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"UDOB5UEB","created_at":"2026-05-18T12:28:52.271510+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/UDOB5UEBPTJCDTMMYQHGGY3TWN","json":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN.json","graph_json":"https://pith.science/api/pith-number/UDOB5UEBPTJCDTMMYQHGGY3TWN/graph.json","events_json":"https://pith.science/api/pith-number/UDOB5UEBPTJCDTMMYQHGGY3TWN/events.json","paper":"https://pith.science/paper/UDOB5UEB"},"agent_actions":{"view_html":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN","download_json":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN.json","view_paper":"https://pith.science/paper/UDOB5UEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.7922&json=true","fetch_graph":"https://pith.science/api/pith-number/UDOB5UEBPTJCDTMMYQHGGY3TWN/graph.json","fetch_events":"https://pith.science/api/pith-number/UDOB5UEBPTJCDTMMYQHGGY3TWN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN/action/storage_attestation","attest_author":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN/action/author_attestation","sign_citation":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN/action/citation_signature","submit_replication":"https://pith.science/pith/UDOB5UEBPTJCDTMMYQHGGY3TWN/action/replication_record"}},"created_at":"2026-05-18T02:41:34.064592+00:00","updated_at":"2026-05-18T02:41:34.064592+00:00"}