{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:3JJFHUPFVSN7HDP4RGUETH3BWU","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":"13526cbbc540e3c218f2048c6043d9b5c77177c100f449007ef71cdc3ff07b78","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-11-03T11:24:03Z","title_canon_sha256":"55d74153743e61fdb209a89b3fc8860a7ab211212ea3102a8dd249f4c8de2a99"},"schema_version":"1.0","source":{"id":"2211.01723","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.01723","created_at":"2026-07-05T07:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"2211.01723v3","created_at":"2026-07-05T07:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01723","created_at":"2026-07-05T07:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"3JJFHUPFVSN7","created_at":"2026-07-05T07:49:54Z"},{"alias_kind":"pith_short_16","alias_value":"3JJFHUPFVSN7HDP4","created_at":"2026-07-05T07:49:54Z"},{"alias_kind":"pith_short_8","alias_value":"3JJFHUPF","created_at":"2026-07-05T07:49:54Z"}],"graph_snapshots":[{"event_id":"sha256:cbba83a6a18b48348b3e0e14acc0fcd6d7160a790bd84500117b12859d75dfcc","target":"graph","created_at":"2026-07-05T07:49:54Z","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/2211.01723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The disjoint paths logic, FOL+DP, is an extension of First-Order Logic (FOL) with the extra atomic predicate $\\mathsf{dp}_k(x_1,y_1,\\ldots,x_k,y_k),$ expressing the existence of internally vertex-disjoint paths between $x_i$ and $y_i,$ for $i\\in\\{1,\\ldots, k\\}$. This logic can express a wide variety of problems that escape the expressibility potential of FOL. We prove that for every proper minor-closed graph class, model-checking for FOL+DP can be done in quadratic time. We also introduce an extension of FOL+DP, namely the scattered disjoint paths logic, FOL+SDP, where we further consider the ","authors_text":"Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach","cross_cats":["cs.DS","math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-11-03T11:24:03Z","title":"Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01723","kind":"arxiv","version":3},"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:6601015d0f644362dc521d63fca20f804fe29f5b8e41a49d191221f449f25328","target":"record","created_at":"2026-07-05T07:49:54Z","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":"13526cbbc540e3c218f2048c6043d9b5c77177c100f449007ef71cdc3ff07b78","cross_cats_sorted":["cs.DS","math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-11-03T11:24:03Z","title_canon_sha256":"55d74153743e61fdb209a89b3fc8860a7ab211212ea3102a8dd249f4c8de2a99"},"schema_version":"1.0","source":{"id":"2211.01723","kind":"arxiv","version":3}},"canonical_sha256":"da5253d1e5ac9bf38dfc89a8499f61b520797b10132c3eebf2cdf6e0c3b456a4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da5253d1e5ac9bf38dfc89a8499f61b520797b10132c3eebf2cdf6e0c3b456a4","first_computed_at":"2026-07-05T07:49:54.656491Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:49:54.656491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uLTo1df8sZnLZNomol97S/NmYk05RI9hKhbpT2+124SXklbWbmpbaqBxMySmC5To/x+s1Fo7MtRwo8wURCEdAw==","signature_status":"signed_v1","signed_at":"2026-07-05T07:49:54.657002Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.01723","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6601015d0f644362dc521d63fca20f804fe29f5b8e41a49d191221f449f25328","sha256:cbba83a6a18b48348b3e0e14acc0fcd6d7160a790bd84500117b12859d75dfcc"],"state_sha256":"3e9751d8befadb525d6b73713a48acc64faaccc16cb861eca28172df2e9bb2a9"}