{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:G6725N57OPHTAAK65HJMGGHPIE","short_pith_number":"pith:G6725N57","schema_version":"1.0","canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","source":{"kind":"arxiv","id":"1306.1069","version":1},"attestation_state":"computed","paper":{"title":"Reachability in Higher-Order-Counters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Heu{\\ss}ner, Alexander Kartzow","submitted_at":"2013-06-05T11:54:53Z","abstract_excerpt":"Higher-order counter automata (\\HOCS) can be either seen as a restriction of higher-order pushdown automata (\\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of \\HOCS: those that can test whether the topmost counter value is zero and those which cannot.\n  We show that control-state reachability for level $k$ \\HOCS with $0$-test is complete for \\mbox{$(k-2)$}-fold exponential space; leaving out the $0$-test leads to completeness for \\mbox{$(k-2)$}-fold exponential time. Restricting \\HOCS (without $0$-test) to level $2$"},"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":"1306.1069","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-06-05T11:54:53Z","cross_cats_sorted":[],"title_canon_sha256":"69013cad178806a036e6a73efc504c930ca04e186c71a6e7b02f75f3c5e8ddfe","abstract_canon_sha256":"8554e8e1d7e0f9a3837e84ff16511563cc5329dd528583329345c1f5ea4ffca4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:21:44.445415Z","signature_b64":"Nwve9cZpWEB4ZrHmMlMHhAhMp0+Uge6LKSMmcfFyjatgixEsswJQiSHdJbbWARoAC0ntIcQksOgwQhUiKTB4Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37bfaeb7bf73cf30015ee9d2c318ef411ae81732b5d5fe77b69bee806a96f92d","last_reissued_at":"2026-05-18T03:21:44.444676Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:21:44.444676Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reachability in Higher-Order-Counters","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.FL","authors_text":"Alexander Heu{\\ss}ner, Alexander Kartzow","submitted_at":"2013-06-05T11:54:53Z","abstract_excerpt":"Higher-order counter automata (\\HOCS) can be either seen as a restriction of higher-order pushdown automata (\\HOPS) to a unary stack alphabet, or as an extension of counter automata to higher levels. We distinguish two principal kinds of \\HOCS: those that can test whether the topmost counter value is zero and those which cannot.\n  We show that control-state reachability for level $k$ \\HOCS with $0$-test is complete for \\mbox{$(k-2)$}-fold exponential space; leaving out the $0$-test leads to completeness for \\mbox{$(k-2)$}-fold exponential time. Restricting \\HOCS (without $0$-test) to level $2$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.1069","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":"1306.1069","created_at":"2026-05-18T03:21:44.444799+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.1069v1","created_at":"2026-05-18T03:21:44.444799+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.1069","created_at":"2026-05-18T03:21:44.444799+00:00"},{"alias_kind":"pith_short_12","alias_value":"G6725N57OPHT","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_16","alias_value":"G6725N57OPHTAAK6","created_at":"2026-05-18T12:27:45.050594+00:00"},{"alias_kind":"pith_short_8","alias_value":"G6725N57","created_at":"2026-05-18T12:27:45.050594+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/G6725N57OPHTAAK65HJMGGHPIE","json":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE.json","graph_json":"https://pith.science/api/pith-number/G6725N57OPHTAAK65HJMGGHPIE/graph.json","events_json":"https://pith.science/api/pith-number/G6725N57OPHTAAK65HJMGGHPIE/events.json","paper":"https://pith.science/paper/G6725N57"},"agent_actions":{"view_html":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE","download_json":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE.json","view_paper":"https://pith.science/paper/G6725N57","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.1069&json=true","fetch_graph":"https://pith.science/api/pith-number/G6725N57OPHTAAK65HJMGGHPIE/graph.json","fetch_events":"https://pith.science/api/pith-number/G6725N57OPHTAAK65HJMGGHPIE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/action/storage_attestation","attest_author":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/action/author_attestation","sign_citation":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/action/citation_signature","submit_replication":"https://pith.science/pith/G6725N57OPHTAAK65HJMGGHPIE/action/replication_record"}},"created_at":"2026-05-18T03:21:44.444799+00:00","updated_at":"2026-05-18T03:21:44.444799+00:00"}