{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:3JJFHUPFVSN7HDP4RGUETH3BWU","short_pith_number":"pith:3JJFHUPF","schema_version":"1.0","canonical_sha256":"da5253d1e5ac9bf38dfc89a8499f61b520797b10132c3eebf2cdf6e0c3b456a4","source":{"kind":"arxiv","id":"2211.01723","version":3},"attestation_state":"computed","paper":{"title":"Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.LO","authors_text":"Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach","submitted_at":"2022-11-03T11:24:03Z","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 "},"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":"2211.01723","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2022-11-03T11:24:03Z","cross_cats_sorted":["cs.DS","math.CO"],"title_canon_sha256":"55d74153743e61fdb209a89b3fc8860a7ab211212ea3102a8dd249f4c8de2a99","abstract_canon_sha256":"13526cbbc540e3c218f2048c6043d9b5c77177c100f449007ef71cdc3ff07b78"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:49:54.657002Z","signature_b64":"uLTo1df8sZnLZNomol97S/NmYk05RI9hKhbpT2+124SXklbWbmpbaqBxMySmC5To/x+s1Fo7MtRwo8wURCEdAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da5253d1e5ac9bf38dfc89a8499f61b520797b10132c3eebf2cdf6e0c3b456a4","last_reissued_at":"2026-07-05T07:49:54.656491Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:49:54.656491Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DS","math.CO"],"primary_cat":"cs.LO","authors_text":"Dimitrios M. Thilikos, Giannos Stamoulis, Petr A. Golovach","submitted_at":"2022-11-03T11:24:03Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.01723","kind":"arxiv","version":3},"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/2211.01723/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":"2211.01723","created_at":"2026-07-05T07:49:54.656557+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.01723v3","created_at":"2026-07-05T07:49:54.656557+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.01723","created_at":"2026-07-05T07:49:54.656557+00:00"},{"alias_kind":"pith_short_12","alias_value":"3JJFHUPFVSN7","created_at":"2026-07-05T07:49:54.656557+00:00"},{"alias_kind":"pith_short_16","alias_value":"3JJFHUPFVSN7HDP4","created_at":"2026-07-05T07:49:54.656557+00:00"},{"alias_kind":"pith_short_8","alias_value":"3JJFHUPF","created_at":"2026-07-05T07:49:54.656557+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2507.10467","citing_title":"Colorful Minors","ref_index":39,"is_internal_anchor":false},{"citing_arxiv_id":"2507.10467","citing_title":"Colorful Minors","ref_index":40,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU","json":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU.json","graph_json":"https://pith.science/api/pith-number/3JJFHUPFVSN7HDP4RGUETH3BWU/graph.json","events_json":"https://pith.science/api/pith-number/3JJFHUPFVSN7HDP4RGUETH3BWU/events.json","paper":"https://pith.science/paper/3JJFHUPF"},"agent_actions":{"view_html":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU","download_json":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU.json","view_paper":"https://pith.science/paper/3JJFHUPF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.01723&json=true","fetch_graph":"https://pith.science/api/pith-number/3JJFHUPFVSN7HDP4RGUETH3BWU/graph.json","fetch_events":"https://pith.science/api/pith-number/3JJFHUPFVSN7HDP4RGUETH3BWU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU/action/storage_attestation","attest_author":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU/action/author_attestation","sign_citation":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU/action/citation_signature","submit_replication":"https://pith.science/pith/3JJFHUPFVSN7HDP4RGUETH3BWU/action/replication_record"}},"created_at":"2026-07-05T07:49:54.656557+00:00","updated_at":"2026-07-05T07:49:54.656557+00:00"}