{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:XBMY3C3ZR5YAQALENT6VYL4STF","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":"2134c392524fed974a99013490c07765486f2164e3e9a74f207912c8aa73e08d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-10T13:55:59Z","title_canon_sha256":"dcce6d458c8bd67f1375f03cf470cd5b8c579a7d87702908b9cffca1ea61fa70"},"schema_version":"1.0","source":{"id":"2502.06477","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2502.06477","created_at":"2026-07-05T11:31:26Z"},{"alias_kind":"arxiv_version","alias_value":"2502.06477v2","created_at":"2026-07-05T11:31:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.06477","created_at":"2026-07-05T11:31:26Z"},{"alias_kind":"pith_short_12","alias_value":"XBMY3C3ZR5YA","created_at":"2026-07-05T11:31:26Z"},{"alias_kind":"pith_short_16","alias_value":"XBMY3C3ZR5YAQALE","created_at":"2026-07-05T11:31:26Z"},{"alias_kind":"pith_short_8","alias_value":"XBMY3C3Z","created_at":"2026-07-05T11:31:26Z"}],"graph_snapshots":[{"event_id":"sha256:5f7cb3f0d875dc3a85a57250f1c9dae00e2c2b699bd8075887a17f79fe8c8bf1","target":"graph","created_at":"2026-07-05T11:31:26Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2502.06477/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Sebastian Haslebacher","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-10T13:55:59Z","title":"ARRIVAL: Recursive Framework & $\\ell_1$-Contraction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.06477","kind":"arxiv","version":2},"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:44c09084ba411f0caf0bc6ea86588357f9679e1010bca1513a11cce3b3faa90e","target":"record","created_at":"2026-07-05T11:31:26Z","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":"2134c392524fed974a99013490c07765486f2164e3e9a74f207912c8aa73e08d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-02-10T13:55:59Z","title_canon_sha256":"dcce6d458c8bd67f1375f03cf470cd5b8c579a7d87702908b9cffca1ea61fa70"},"schema_version":"1.0","source":{"id":"2502.06477","kind":"arxiv","version":2}},"canonical_sha256":"b8598d8b798f700801646cfd5c2f929978479a2fa29130338ce06c7b7d5fd85a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b8598d8b798f700801646cfd5c2f929978479a2fa29130338ce06c7b7d5fd85a","first_computed_at":"2026-07-05T11:31:26.549060Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:31:26.549060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d/JqzW7TDprmLJzUeEJ8L3WPjcJODcFrTIdBWw6qnefucj5mowLi4znUauBoVFM12D+JLXYT4RxX1y6PvVMLDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T11:31:26.549683Z","signed_message":"canonical_sha256_bytes"},"source_id":"2502.06477","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44c09084ba411f0caf0bc6ea86588357f9679e1010bca1513a11cce3b3faa90e","sha256:5f7cb3f0d875dc3a85a57250f1c9dae00e2c2b699bd8075887a17f79fe8c8bf1"],"state_sha256":"3e1785e0d292b486828e6b7738e93154c08a05350ce848b3285377c61c895111"}