{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:IVK37N47XZOG2R24B3SOTQSZIH","short_pith_number":"pith:IVK37N47","schema_version":"1.0","canonical_sha256":"4555bfb79fbe5c6d475c0ee4e9c25941d8447c350e0ce28f0c09d21dd8d80583","source":{"kind":"arxiv","id":"1309.4022","version":2},"attestation_state":"computed","paper":{"title":"Exploring Subexponential Parameterized Complexity of Completion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Yngve Villanger","submitted_at":"2013-09-16T16:16:41Z","abstract_excerpt":"Let ${\\cal F}$ be a family of graphs. In the ${\\cal F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added to $G$ so that the resulting graph does not contain a graph from ${\\cal F}$ as an induced subgraph. It appeared recently that special cases of ${\\cal F}$-Completion, the problem of completing into a chordal graph known as Minimum Fill-in, corresponding to the case of ${\\cal F}=\\{C_4,C_5,C_6,\\ldots\\}$, and the problem of completing into a split graph, i.e., the case of ${\\cal F}=\\{C_4, 2K_2, C_5\\}$, are solvable in par"},"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":"1309.4022","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-16T16:16:41Z","cross_cats_sorted":[],"title_canon_sha256":"53430d1955c19236d6c1c21c8aa48e7268c5e9108e255a1a777976732fc353b1","abstract_canon_sha256":"ae917a1a584b626322a1df1ca5f07d1b6dbde9bb412d6ca60fc46d1fe92ed326"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.157983Z","signature_b64":"qAkrtLNEk0pg853Tr6RLCivYQYtCFkiD1W0mUs5bBxwrO5bZRMORymTjpEQZGOufJCHRHlSd3KHiB9hfc/m3BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4555bfb79fbe5c6d475c0ee4e9c25941d8447c350e0ce28f0c09d21dd8d80583","last_reissued_at":"2026-05-18T02:52:04.157425Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.157425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exploring Subexponential Parameterized Complexity of Completion Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Yngve Villanger","submitted_at":"2013-09-16T16:16:41Z","abstract_excerpt":"Let ${\\cal F}$ be a family of graphs. In the ${\\cal F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added to $G$ so that the resulting graph does not contain a graph from ${\\cal F}$ as an induced subgraph. It appeared recently that special cases of ${\\cal F}$-Completion, the problem of completing into a chordal graph known as Minimum Fill-in, corresponding to the case of ${\\cal F}=\\{C_4,C_5,C_6,\\ldots\\}$, and the problem of completing into a split graph, i.e., the case of ${\\cal F}=\\{C_4, 2K_2, C_5\\}$, are solvable in par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4022","kind":"arxiv","version":2},"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":"1309.4022","created_at":"2026-05-18T02:52:04.157514+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.4022v2","created_at":"2026-05-18T02:52:04.157514+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4022","created_at":"2026-05-18T02:52:04.157514+00:00"},{"alias_kind":"pith_short_12","alias_value":"IVK37N47XZOG","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_16","alias_value":"IVK37N47XZOG2R24","created_at":"2026-05-18T12:27:49.015174+00:00"},{"alias_kind":"pith_short_8","alias_value":"IVK37N47","created_at":"2026-05-18T12:27:49.015174+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/IVK37N47XZOG2R24B3SOTQSZIH","json":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH.json","graph_json":"https://pith.science/api/pith-number/IVK37N47XZOG2R24B3SOTQSZIH/graph.json","events_json":"https://pith.science/api/pith-number/IVK37N47XZOG2R24B3SOTQSZIH/events.json","paper":"https://pith.science/paper/IVK37N47"},"agent_actions":{"view_html":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH","download_json":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH.json","view_paper":"https://pith.science/paper/IVK37N47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.4022&json=true","fetch_graph":"https://pith.science/api/pith-number/IVK37N47XZOG2R24B3SOTQSZIH/graph.json","fetch_events":"https://pith.science/api/pith-number/IVK37N47XZOG2R24B3SOTQSZIH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH/action/storage_attestation","attest_author":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH/action/author_attestation","sign_citation":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH/action/citation_signature","submit_replication":"https://pith.science/pith/IVK37N47XZOG2R24B3SOTQSZIH/action/replication_record"}},"created_at":"2026-05-18T02:52:04.157514+00:00","updated_at":"2026-05-18T02:52:04.157514+00:00"}