{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:5RZYHWLTSDRU7BO42CCBHWDQ76","short_pith_number":"pith:5RZYHWLT","schema_version":"1.0","canonical_sha256":"ec7383d97390e34f85dcd08413d870ff8d74212c50ccfe16236956f120ffef5f","source":{"kind":"arxiv","id":"1805.04375","version":4},"attestation_state":"computed","paper":{"title":"On the Parameterized Complexity of Graph Modification to First-Order Logic Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2018-05-11T13:09:47Z","abstract_excerpt":"We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some property definable in first-order logic. We establish a number of sufficient and necessary conditions on the quantification pattern of the first-order formula \\phi for the problem to be fixed-parameter tractable or to admit a polynomial kernel."},"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":"1805.04375","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-05-11T13:09:47Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"ab52f119eebb0c4fd68b6e0635f9ce29e6c0a1b3a5ebd74b13c57e0e29951ef8","abstract_canon_sha256":"11584fa0cd406b4d41f5616d36c20887ff42ffcd94125bf5ed86821019eb1f67"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:42.026573Z","signature_b64":"KIB03QBXEnryYpzit0VRQJaZHq4NQKL9tO7KwCxyOsMEt1mMEyyMU1AJUirGoyb+F87Zpll54AVx/FD+UlWJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec7383d97390e34f85dcd08413d870ff8d74212c50ccfe16236956f120ffef5f","last_reissued_at":"2026-05-17T23:52:42.025893Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:42.025893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Parameterized Complexity of Graph Modification to First-Order Logic Properties","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Dimitrios M. Thilikos, Fedor V. Fomin, Petr A. Golovach","submitted_at":"2018-05-11T13:09:47Z","abstract_excerpt":"We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some property definable in first-order logic. We establish a number of sufficient and necessary conditions on the quantification pattern of the first-order formula \\phi for the problem to be fixed-parameter tractable or to admit a polynomial kernel."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.04375","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1805.04375","created_at":"2026-05-17T23:52:42.025995+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.04375v4","created_at":"2026-05-17T23:52:42.025995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.04375","created_at":"2026-05-17T23:52:42.025995+00:00"},{"alias_kind":"pith_short_12","alias_value":"5RZYHWLTSDRU","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"5RZYHWLTSDRU7BO4","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"5RZYHWLT","created_at":"2026-05-18T12:32:08.215937+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/5RZYHWLTSDRU7BO42CCBHWDQ76","json":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76.json","graph_json":"https://pith.science/api/pith-number/5RZYHWLTSDRU7BO42CCBHWDQ76/graph.json","events_json":"https://pith.science/api/pith-number/5RZYHWLTSDRU7BO42CCBHWDQ76/events.json","paper":"https://pith.science/paper/5RZYHWLT"},"agent_actions":{"view_html":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76","download_json":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76.json","view_paper":"https://pith.science/paper/5RZYHWLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.04375&json=true","fetch_graph":"https://pith.science/api/pith-number/5RZYHWLTSDRU7BO42CCBHWDQ76/graph.json","fetch_events":"https://pith.science/api/pith-number/5RZYHWLTSDRU7BO42CCBHWDQ76/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76/action/storage_attestation","attest_author":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76/action/author_attestation","sign_citation":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76/action/citation_signature","submit_replication":"https://pith.science/pith/5RZYHWLTSDRU7BO42CCBHWDQ76/action/replication_record"}},"created_at":"2026-05-17T23:52:42.025995+00:00","updated_at":"2026-05-17T23:52:42.025995+00:00"}