{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JRV26D3UM5OPGFDYHH5WGGD26I","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"253e308a060aac78a6041578b6763551d38eb2c821193a2e44c67c178c0c4e9b","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T13:00:07Z","title_canon_sha256":"ef568decad0409649e5e9ca5d0840ba0e6acf2fc73a80e54468d44c03e303d67"},"schema_version":"1.0","source":{"id":"1310.1767","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.1767","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"arxiv_version","alias_value":"1310.1767v1","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.1767","created_at":"2026-05-18T03:11:10Z"},{"alias_kind":"pith_short_12","alias_value":"JRV26D3UM5OP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JRV26D3UM5OPGFDY","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JRV26D3U","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:de585fcfd71c746b37431b32d151c5c0f6ed4ce32dcfeeab11ad0504143c2984","target":"graph","created_at":"2026-05-18T03:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ranko Lazic","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T13:00:07Z","title":"The reachability problem for vector addition systems with a stack is not elementary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.1767","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:029d525f49a658942bbd46022444fb818d2d283593380483303fcbcbab7f1f96","target":"record","created_at":"2026-05-18T03:11:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"253e308a060aac78a6041578b6763551d38eb2c821193a2e44c67c178c0c4e9b","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2013-10-07T13:00:07Z","title_canon_sha256":"ef568decad0409649e5e9ca5d0840ba0e6acf2fc73a80e54468d44c03e303d67"},"schema_version":"1.0","source":{"id":"1310.1767","kind":"arxiv","version":1}},"canonical_sha256":"4c6baf0f74675cf3147839fb63187af2039b086195b83454c4ae76a90c30473d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4c6baf0f74675cf3147839fb63187af2039b086195b83454c4ae76a90c30473d","first_computed_at":"2026-05-18T03:11:10.652622Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:11:10.652622Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"R5cjv7HHM1+aZQ6Wsox/m3xRcq4DVJ3ddXz2ejCDRfJoacVqTQFCLigVSmjlm/iQW1CZKwxc+UCeU6KgIZHdAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:11:10.653479Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.1767","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:029d525f49a658942bbd46022444fb818d2d283593380483303fcbcbab7f1f96","sha256:de585fcfd71c746b37431b32d151c5c0f6ed4ce32dcfeeab11ad0504143c2984"],"state_sha256":"f6836c9503edde8b8d6408fbf6052a1da76f93e66a7ba1bc16812d6cdfece016"}