{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T4WF7GHTZ4LW6YAKHO56NP265W","short_pith_number":"pith:T4WF7GHT","schema_version":"1.0","canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","source":{"kind":"arxiv","id":"1508.05282","version":2},"attestation_state":"computed","paper":{"title":"Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ivan Bliznets, Lukas Mach, Marek Cygan, Michal Pilipczuk, Pawel Komosa","submitted_at":"2015-08-21T14:29:21Z","abstract_excerpt":"In this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper Interval Completion, Threshold Completion, and Trivially Perfect Completion. In these problems, the task is to add at most k edges to a given graph in order to obtain a chordal, interval, proper interval, threshold, or trivially perfect graph, respectively. We prove the following lower bounds for all these problems, as well as for the related Chain Completion problem: Assuming the Exponential Time Hypothesis, none of these problems can be solved in time 2^O(n^(1/"},"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":"1508.05282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T14:29:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4fb8ffd43cab31d1ebed58f66446b53735d0a34b6b5a59c2b2d7dd8850dfad20","abstract_canon_sha256":"eab6d688676495b4d2c343c58a8162ec63420b24ee4234e82b3a8d95b67394d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.773471Z","signature_b64":"rcF6kqKjvaHYEffNQ5IKwceWp5XQzNtySJaoGT/gxj1lFqv+BoxvdTsiv2yz0ZJ2Oy+YAkP0HE59j08zh/gACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","last_reissued_at":"2026-05-18T01:30:07.772825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.772825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ivan Bliznets, Lukas Mach, Marek Cygan, Michal Pilipczuk, Pawel Komosa","submitted_at":"2015-08-21T14:29:21Z","abstract_excerpt":"In this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper Interval Completion, Threshold Completion, and Trivially Perfect Completion. In these problems, the task is to add at most k edges to a given graph in order to obtain a chordal, interval, proper interval, threshold, or trivially perfect graph, respectively. We prove the following lower bounds for all these problems, as well as for the related Chain Completion problem: Assuming the Exponential Time Hypothesis, none of these problems can be solved in time 2^O(n^(1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05282","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":"1508.05282","created_at":"2026-05-18T01:30:07.772918+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05282v2","created_at":"2026-05-18T01:30:07.772918+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05282","created_at":"2026-05-18T01:30:07.772918+00:00"},{"alias_kind":"pith_short_12","alias_value":"T4WF7GHTZ4LW","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T4WF7GHTZ4LW6YAK","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T4WF7GHT","created_at":"2026-05-18T12:29:42.218222+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/T4WF7GHTZ4LW6YAKHO56NP265W","json":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W.json","graph_json":"https://pith.science/api/pith-number/T4WF7GHTZ4LW6YAKHO56NP265W/graph.json","events_json":"https://pith.science/api/pith-number/T4WF7GHTZ4LW6YAKHO56NP265W/events.json","paper":"https://pith.science/paper/T4WF7GHT"},"agent_actions":{"view_html":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W","download_json":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W.json","view_paper":"https://pith.science/paper/T4WF7GHT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05282&json=true","fetch_graph":"https://pith.science/api/pith-number/T4WF7GHTZ4LW6YAKHO56NP265W/graph.json","fetch_events":"https://pith.science/api/pith-number/T4WF7GHTZ4LW6YAKHO56NP265W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/action/storage_attestation","attest_author":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/action/author_attestation","sign_citation":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/action/citation_signature","submit_replication":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/action/replication_record"}},"created_at":"2026-05-18T01:30:07.772918+00:00","updated_at":"2026-05-18T01:30:07.772918+00:00"}