{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:XBMY3C3ZR5YAQALENT6VYL4STF","short_pith_number":"pith:XBMY3C3Z","schema_version":"1.0","canonical_sha256":"b8598d8b798f700801646cfd5c2f929978479a2fa29130338ce06c7b7d5fd85a","source":{"kind":"arxiv","id":"2502.06477","version":2},"attestation_state":"computed","paper":{"title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Haslebacher","submitted_at":"2025-02-10T13:55:59Z","abstract_excerpt":"ARRIVAL is the problem of deciding which out of two possible destinations will be reached first by a token that moves deterministically along the edges of a directed graph, according to so-called switching rules. It is known to lie in NP $\\cap$ CoNP, but not known to lie in P. The state-of-the-art algorithm due to G\\\"artner et al. (ICALP `21) runs in time $2^{O(\\sqrt{n} \\log n)}$ on an $n$-vertex graph.\n  We prove that ARRIVAL can be solved in time $2^{O(k \\log^2 n)}$ on $n$-vertex graphs of treewidth $k$. Our algorithm is derived by adapting a simple recursive algorithm for a generalization o"},"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":"2502.06477","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-10T13:55:59Z","cross_cats_sorted":[],"title_canon_sha256":"dcce6d458c8bd67f1375f03cf470cd5b8c579a7d87702908b9cffca1ea61fa70","abstract_canon_sha256":"2134c392524fed974a99013490c07765486f2164e3e9a74f207912c8aa73e08d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:26.549683Z","signature_b64":"d/JqzW7TDprmLJzUeEJ8L3WPjcJODcFrTIdBWw6qnefucj5mowLi4znUauBoVFM12D+JLXYT4RxX1y6PvVMLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b8598d8b798f700801646cfd5c2f929978479a2fa29130338ce06c7b7d5fd85a","last_reissued_at":"2026-07-05T11:31:26.549060Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:26.549060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Haslebacher","submitted_at":"2025-02-10T13:55:59Z","abstract_excerpt":"ARRIVAL is the problem of deciding which out of two possible destinations will be reached first by a token that moves deterministically along the edges of a directed graph, according to so-called switching rules. It is known to lie in NP $\\cap$ CoNP, but not known to lie in P. The state-of-the-art algorithm due to G\\\"artner et al. (ICALP `21) runs in time $2^{O(\\sqrt{n} \\log n)}$ on an $n$-vertex graph.\n  We prove that ARRIVAL can be solved in time $2^{O(k \\log^2 n)}$ on $n$-vertex graphs of treewidth $k$. Our algorithm is derived by adapting a simple recursive algorithm for a generalization o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06477","kind":"arxiv","version":2},"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/2502.06477/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":"2502.06477","created_at":"2026-07-05T11:31:26.549146+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.06477v2","created_at":"2026-07-05T11:31:26.549146+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06477","created_at":"2026-07-05T11:31:26.549146+00:00"},{"alias_kind":"pith_short_12","alias_value":"XBMY3C3ZR5YA","created_at":"2026-07-05T11:31:26.549146+00:00"},{"alias_kind":"pith_short_16","alias_value":"XBMY3C3ZR5YAQALE","created_at":"2026-07-05T11:31:26.549146+00:00"},{"alias_kind":"pith_short_8","alias_value":"XBMY3C3Z","created_at":"2026-07-05T11:31:26.549146+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/XBMY3C3ZR5YAQALENT6VYL4STF","json":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF.json","graph_json":"https://pith.science/api/pith-number/XBMY3C3ZR5YAQALENT6VYL4STF/graph.json","events_json":"https://pith.science/api/pith-number/XBMY3C3ZR5YAQALENT6VYL4STF/events.json","paper":"https://pith.science/paper/XBMY3C3Z"},"agent_actions":{"view_html":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF","download_json":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF.json","view_paper":"https://pith.science/paper/XBMY3C3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.06477&json=true","fetch_graph":"https://pith.science/api/pith-number/XBMY3C3ZR5YAQALENT6VYL4STF/graph.json","fetch_events":"https://pith.science/api/pith-number/XBMY3C3ZR5YAQALENT6VYL4STF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF/action/storage_attestation","attest_author":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF/action/author_attestation","sign_citation":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF/action/citation_signature","submit_replication":"https://pith.science/pith/XBMY3C3ZR5YAQALENT6VYL4STF/action/replication_record"}},"created_at":"2026-07-05T11:31:26.549146+00:00","updated_at":"2026-07-05T11:31:26.549146+00:00"}