{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:MZV4EM5RVEHKSGPEZ6RPCM4MTW","short_pith_number":"pith:MZV4EM5R","schema_version":"1.0","canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","source":{"kind":"arxiv","id":"2505.13749","version":1},"attestation_state":"computed","paper":{"title":"A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche, Henry Sinclair-Banks, Yousef Shakiba","submitted_at":"2025-05-19T21:52:56Z","abstract_excerpt":"In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose to place these problems in a more general context, which makes it possible to prove complexity dichotomies.\n  The more general setting arises as follows. We note that for coverability, we are given a vector $t$ and are asked if there is a reachable vector $x$ satisfying the relation $x\\ge t$. For reachability, we want to satisfy the relation $x=t$. In the m"},"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":"2505.13749","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.FL","submitted_at":"2025-05-19T21:52:56Z","cross_cats_sorted":["cs.CC","cs.LO"],"title_canon_sha256":"b6beb02dfbab1ad8fd960897dbaf8b301b3879596a22394c51b016a1e9507e08","abstract_canon_sha256":"86f4d8a509fdc0a65a7a43f7ae128f39d8a33bab3188872bec89c5ee6fba25ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:05:50.568907Z","signature_b64":"ETsi+Vko1PjaPj6b1kRSy9WFpyrL8fQQzbSVBMIZ24SUfLMpzsD7lAOD/FJSOCLG3gW3IlRTi/LHecVFcq6ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"666bc233b1a90ea919e4cfa2f1338c9da5dda95fa15e46e0e4ad2e866fcdfa30","last_reissued_at":"2026-07-05T11:05:50.568460Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:05:50.568460Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.LO"],"primary_cat":"cs.FL","authors_text":"Georg Zetzsche, Henry Sinclair-Banks, Yousef Shakiba","submitted_at":"2025-05-19T21:52:56Z","abstract_excerpt":"In many kinds of infinite-state systems, the coverability problem has significantly lower complexity than the reachability problem. In order to delineate the border of computational hardness between coverability and reachability, we propose to place these problems in a more general context, which makes it possible to prove complexity dichotomies.\n  The more general setting arises as follows. We note that for coverability, we are given a vector $t$ and are asked if there is a reachable vector $x$ satisfying the relation $x\\ge t$. For reachability, we want to satisfy the relation $x=t$. In the m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13749","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2505.13749/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2505.13749","created_at":"2026-07-05T11:05:50.568513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13749v1","created_at":"2026-07-05T11:05:50.568513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13749","created_at":"2026-07-05T11:05:50.568513+00:00"},{"alias_kind":"pith_short_12","alias_value":"MZV4EM5RVEHK","created_at":"2026-07-05T11:05:50.568513+00:00"},{"alias_kind":"pith_short_16","alias_value":"MZV4EM5RVEHKSGPE","created_at":"2026-07-05T11:05:50.568513+00:00"},{"alias_kind":"pith_short_8","alias_value":"MZV4EM5R","created_at":"2026-07-05T11:05:50.568513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2512.19060","citing_title":"On the complexity of computing Strahler numbers","ref_index":1990,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW","json":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW.json","graph_json":"https://pith.science/api/pith-number/MZV4EM5RVEHKSGPEZ6RPCM4MTW/graph.json","events_json":"https://pith.science/api/pith-number/MZV4EM5RVEHKSGPEZ6RPCM4MTW/events.json","paper":"https://pith.science/paper/MZV4EM5R"},"agent_actions":{"view_html":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW","download_json":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW.json","view_paper":"https://pith.science/paper/MZV4EM5R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13749&json=true","fetch_graph":"https://pith.science/api/pith-number/MZV4EM5RVEHKSGPEZ6RPCM4MTW/graph.json","fetch_events":"https://pith.science/api/pith-number/MZV4EM5RVEHKSGPEZ6RPCM4MTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/action/storage_attestation","attest_author":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/action/author_attestation","sign_citation":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/action/citation_signature","submit_replication":"https://pith.science/pith/MZV4EM5RVEHKSGPEZ6RPCM4MTW/action/replication_record"}},"created_at":"2026-07-05T11:05:50.568513+00:00","updated_at":"2026-07-05T11:05:50.568513+00:00"}