{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:JRV26D3UM5OPGFDYHH5WGGD26I","short_pith_number":"pith:JRV26D3U","schema_version":"1.0","canonical_sha256":"4c6baf0f74675cf3147839fb63187af2039b086195b83454c4ae76a90c30473d","source":{"kind":"arxiv","id":"1310.1767","version":1},"attestation_state":"computed","paper":{"title":"The reachability problem for vector addition systems with a stack is not elementary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ranko Lazic","submitted_at":"2013-10-07T13:00:07Z","abstract_excerpt":"By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity. As a corollary, the same lower bound holds for the satisfiability problem for a two-variable first-order logic on trees in which unbounded data may label only leaf nodes. Whether the two problems are decidable remains an open question."},"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":"1310.1767","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T13:00:07Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"ef568decad0409649e5e9ca5d0840ba0e6acf2fc73a80e54468d44c03e303d67","abstract_canon_sha256":"253e308a060aac78a6041578b6763551d38eb2c821193a2e44c67c178c0c4e9b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:10.653479Z","signature_b64":"R5cjv7HHM1+aZQ6Wsox/m3xRcq4DVJ3ddXz2ejCDRfJoacVqTQFCLigVSmjlm/iQW1CZKwxc+UCeU6KgIZHdAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c6baf0f74675cf3147839fb63187af2039b086195b83454c4ae76a90c30473d","last_reissued_at":"2026-05-18T03:11:10.652622Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:10.652622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The reachability problem for vector addition systems with a stack is not elementary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.FL","authors_text":"Ranko Lazic","submitted_at":"2013-10-07T13:00:07Z","abstract_excerpt":"By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity. As a corollary, the same lower bound holds for the satisfiability problem for a two-variable first-order logic on trees in which unbounded data may label only leaf nodes. Whether the two problems are decidable remains an open question."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1767","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":"1310.1767","created_at":"2026-05-18T03:11:10.652753+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.1767v1","created_at":"2026-05-18T03:11:10.652753+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1767","created_at":"2026-05-18T03:11:10.652753+00:00"},{"alias_kind":"pith_short_12","alias_value":"JRV26D3UM5OP","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"JRV26D3UM5OPGFDY","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"JRV26D3U","created_at":"2026-05-18T12:27:49.015174+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/JRV26D3UM5OPGFDYHH5WGGD26I","json":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I.json","graph_json":"https://pith.science/api/pith-number/JRV26D3UM5OPGFDYHH5WGGD26I/graph.json","events_json":"https://pith.science/api/pith-number/JRV26D3UM5OPGFDYHH5WGGD26I/events.json","paper":"https://pith.science/paper/JRV26D3U"},"agent_actions":{"view_html":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I","download_json":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I.json","view_paper":"https://pith.science/paper/JRV26D3U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.1767&json=true","fetch_graph":"https://pith.science/api/pith-number/JRV26D3UM5OPGFDYHH5WGGD26I/graph.json","fetch_events":"https://pith.science/api/pith-number/JRV26D3UM5OPGFDYHH5WGGD26I/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I/action/storage_attestation","attest_author":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I/action/author_attestation","sign_citation":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I/action/citation_signature","submit_replication":"https://pith.science/pith/JRV26D3UM5OPGFDYHH5WGGD26I/action/replication_record"}},"created_at":"2026-05-18T03:11:10.652753+00:00","updated_at":"2026-05-18T03:11:10.652753+00:00"}