{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LBLTVTCA4KFBBJJPPCJQDFUGLK","short_pith_number":"pith:LBLTVTCA","schema_version":"1.0","canonical_sha256":"58573acc40e28a10a52f78930196865a8fe9566990c6cae8a4ae563fd98bff59","source":{"kind":"arxiv","id":"2104.02998","version":1},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Elimination Distance to First-Order Logic Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.LO","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2021-04-07T08:55:36Z","abstract_excerpt":"The elimination distance to some target graph property P is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We delimit the problem's fixed-parameter tractability by identifying sufficient and necessary conditions on the structure of prefixes of first-order logic formulas. Our main result is the following meta-theorem: for every graph property P expressible by a first order-logic formula \\phi\\in \\Sigma_3, that is, of the form \\phi=\\exists x_1\\exists x_2\\cdots \\exists x_r \\"},"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":"2104.02998","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LO","submitted_at":"2021-04-07T08:55:36Z","cross_cats_sorted":["cs.CC","cs.DM","cs.DS"],"title_canon_sha256":"81184dfc6f15adf766200b4c90d509e45117be44efb3f0c702e3c2013b8e37d2","abstract_canon_sha256":"b6dda04b67b3b7562aa15cf5f4db98df7d0be1e2a8850b8fb9a365fe43ca2a4d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:01.800342Z","signature_b64":"TQN03aw+BB5FGo6r46PDHuFQLmKE1+bzK5asN02p2DdSR/UoyP9q5qJk5/MDlouEUzMINUKNC4E5IGdtqf81CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58573acc40e28a10a52f78930196865a8fe9566990c6cae8a4ae563fd98bff59","last_reissued_at":"2026-07-05T02:30:01.799908Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:01.799908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Elimination Distance to First-Order Logic Properties","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CC","cs.DM","cs.DS"],"primary_cat":"cs.LO","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2021-04-07T08:55:36Z","abstract_excerpt":"The elimination distance to some target graph property P is a general graph modification parameter introduced by Bulian and Dawar. We initiate the study of elimination distances to graph properties expressible in first-order logic. We delimit the problem's fixed-parameter tractability by identifying sufficient and necessary conditions on the structure of prefixes of first-order logic formulas. Our main result is the following meta-theorem: for every graph property P expressible by a first order-logic formula \\phi\\in \\Sigma_3, that is, of the form \\phi=\\exists x_1\\exists x_2\\cdots \\exists x_r \\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2104.02998","kind":"arxiv","version":1},"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/2104.02998/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":"2104.02998","created_at":"2026-07-05T02:30:01.799965+00:00"},{"alias_kind":"arxiv_version","alias_value":"2104.02998v1","created_at":"2026-07-05T02:30:01.799965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2104.02998","created_at":"2026-07-05T02:30:01.799965+00:00"},{"alias_kind":"pith_short_12","alias_value":"LBLTVTCA4KFB","created_at":"2026-07-05T02:30:01.799965+00:00"},{"alias_kind":"pith_short_16","alias_value":"LBLTVTCA4KFBBJJP","created_at":"2026-07-05T02:30:01.799965+00:00"},{"alias_kind":"pith_short_8","alias_value":"LBLTVTCA","created_at":"2026-07-05T02:30:01.799965+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/LBLTVTCA4KFBBJJPPCJQDFUGLK","json":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK.json","graph_json":"https://pith.science/api/pith-number/LBLTVTCA4KFBBJJPPCJQDFUGLK/graph.json","events_json":"https://pith.science/api/pith-number/LBLTVTCA4KFBBJJPPCJQDFUGLK/events.json","paper":"https://pith.science/paper/LBLTVTCA"},"agent_actions":{"view_html":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK","download_json":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK.json","view_paper":"https://pith.science/paper/LBLTVTCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2104.02998&json=true","fetch_graph":"https://pith.science/api/pith-number/LBLTVTCA4KFBBJJPPCJQDFUGLK/graph.json","fetch_events":"https://pith.science/api/pith-number/LBLTVTCA4KFBBJJPPCJQDFUGLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK/action/storage_attestation","attest_author":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK/action/author_attestation","sign_citation":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK/action/citation_signature","submit_replication":"https://pith.science/pith/LBLTVTCA4KFBBJJPPCJQDFUGLK/action/replication_record"}},"created_at":"2026-07-05T02:30:01.799965+00:00","updated_at":"2026-07-05T02:30:01.799965+00:00"}