{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:JLWBN7CF5OFCISJJCWRCBORCYG","short_pith_number":"pith:JLWBN7CF","schema_version":"1.0","canonical_sha256":"4aec16fc45eb8a24492915a220ba22c18b65555cb3d1f4d390f78af05c87ee29","source":{"kind":"arxiv","id":"2605.14850","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Nested Reset Counter Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Coverability for nested reset counter systems over order-k counters is F_Ωk-complete.","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"A. R. Balasubramanian, Franzisco Schmidt","submitted_at":"2026-05-14T13:58:33Z","abstract_excerpt":"Nested counter systems (NCS) are a generalization of counter systems to higher-order counters. Here, a higher-order counter is allowed to have other (lower-order) counters as elements, instead of just a number. Such systems can be viewed as working on trees, where the height of the tree naturally corresponds to the highest order counter that the system is working with. It is known that the coverability problem for NCS, which asks if a given final tree can be covered from a given initial tree, is $\\mathbf{F}_{\\epsilon_0}$-complete. Here $\\mathbf{F}_{\\epsilon_0}$ is a class in the fast-growing h"},"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":true,"formal_links_present":false},"canonical_record":{"source":{"id":"2605.14850","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2026-05-14T13:58:33Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"fede70b72cdbb1b15b7474d8e4e84b9068decf0c35e5c31ac25484849d60fbae","abstract_canon_sha256":"ec52033aacdf07608db37d04da4ac6e2fc88101dc679ebcbc655cf735518ab19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:56.335651Z","signature_b64":"6ZN+g0OtnmsSZF32qrUaMb/8TXT+Fc4u+CCQOIJXRh/hTXC88+mX2U/Z2DZ79+SmjDy1MGTQIcBl5mGcV52MCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4aec16fc45eb8a24492915a220ba22c18b65555cb3d1f4d390f78af05c87ee29","last_reissued_at":"2026-05-17T23:38:56.335035Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:56.335035Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Nested Reset Counter Systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Coverability for nested reset counter systems over order-k counters is F_Ωk-complete.","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"A. R. Balasubramanian, Franzisco Schmidt","submitted_at":"2026-05-14T13:58:33Z","abstract_excerpt":"Nested counter systems (NCS) are a generalization of counter systems to higher-order counters. Here, a higher-order counter is allowed to have other (lower-order) counters as elements, instead of just a number. Such systems can be viewed as working on trees, where the height of the tree naturally corresponds to the highest order counter that the system is working with. It is known that the coverability problem for NCS, which asks if a given final tree can be covered from a given initial tree, is $\\mathbf{F}_{\\epsilon_0}$-complete. Here $\\mathbf{F}_{\\epsilon_0}$ is a class in the fast-growing h"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that coverability for NRCS over order-k counters is F_Ωk-complete where Ωk is the tower of height k of the ω ordinal.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The chosen semantics for resets on higher-order counters does not introduce hidden complexity beyond the ordinal tower construction used in the length-function theorems.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Coverability for order-k nested reset counter systems is F_Ωk-complete.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Coverability for nested reset counter systems over order-k counters is F_Ωk-complete.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"501450752ec2e1e76a392701fc66434bd0b216b5675e9ae45e213fb8aeef5764"},"source":{"id":"2605.14850","kind":"arxiv","version":1},"verdict":{"id":"ebf7a1bb-bb5f-4c0a-bea7-71cac62426bb","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T03:07:31.483544Z","strongest_claim":"We show that coverability for NRCS over order-k counters is F_Ωk-complete where Ωk is the tower of height k of the ω ordinal.","one_line_summary":"Coverability for order-k nested reset counter systems is F_Ωk-complete.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The chosen semantics for resets on higher-order counters does not introduce hidden complexity beyond the ordinal tower construction used in the length-function theorems.","pith_extraction_headline":"Coverability for nested reset counter systems over order-k counters is F_Ωk-complete."},"references":{"count":48,"sample":[{"doi":"10.1145/2858784","year":2016,"title":"2016 , url =","work_id":"7d03b1ca-0560-49fe-a97e-4a6751e5bc3e","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-662-49630-5","year":2016,"title":"Normann Decker and Daniel Thoma , editor =. On Freeze. Foundations of Software Science and Computation Structures - 19th International Conference,. 2016 , url =. doi:10.1007/978-3-662-49630-5\\_16 , ti","work_id":"081a5bbd-d122-426d-be2d-916d3b3b8b95","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"On Freeze LTL with Ordered Attributes","work_id":"a989df17-e74e-4e91-972c-041a3c3405da","ref_index":3,"cited_arxiv_id":"1504.06355","is_internal_anchor":true},{"doi":"10.1007/3-540-46562-6","year":1999,"title":"Lomazova and Philippe Schnoebelen , editor =","work_id":"4280c671-4950-4bd7-8382-aea033e711cf","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-642-15155-2","year":2010,"title":"Revisiting Ackermann-Hardness for Lossy Counter Machines and Reset Petri Nets , booktitle =","work_id":"3235c795-7a73-4aa5-9a59-1de01a00b92f","ref_index":6,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":48,"snapshot_sha256":"859fb5346a98a88571707507c8779a669beb738ac73333607746c16dd7ad6954","internal_anchors":2},"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":"2605.14850","created_at":"2026-05-17T23:38:56.335146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.14850v1","created_at":"2026-05-17T23:38:56.335146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14850","created_at":"2026-05-17T23:38:56.335146+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLWBN7CF5OFC","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLWBN7CF5OFCISJJ","created_at":"2026-05-18T12:33:37.589309+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLWBN7CF","created_at":"2026-05-18T12:33:37.589309+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/JLWBN7CF5OFCISJJCWRCBORCYG","json":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG.json","graph_json":"https://pith.science/api/pith-number/JLWBN7CF5OFCISJJCWRCBORCYG/graph.json","events_json":"https://pith.science/api/pith-number/JLWBN7CF5OFCISJJCWRCBORCYG/events.json","paper":"https://pith.science/paper/JLWBN7CF"},"agent_actions":{"view_html":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG","download_json":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG.json","view_paper":"https://pith.science/paper/JLWBN7CF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.14850&json=true","fetch_graph":"https://pith.science/api/pith-number/JLWBN7CF5OFCISJJCWRCBORCYG/graph.json","fetch_events":"https://pith.science/api/pith-number/JLWBN7CF5OFCISJJCWRCBORCYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG/action/storage_attestation","attest_author":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG/action/author_attestation","sign_citation":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG/action/citation_signature","submit_replication":"https://pith.science/pith/JLWBN7CF5OFCISJJCWRCBORCYG/action/replication_record"}},"created_at":"2026-05-17T23:38:56.335146+00:00","updated_at":"2026-05-17T23:38:56.335146+00:00"}