{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GNPYFG3YK4WAITULZE6QC2L52F","short_pith_number":"pith:GNPYFG3Y","schema_version":"1.0","canonical_sha256":"335f829b78572c044e8bc93d01697dd14ef4490285b676835908653733ee7cc6","source":{"kind":"arxiv","id":"1402.3473","version":3},"attestation_state":"computed","paper":{"title":"A subexponential parameterized algorithm for Interval Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Ivan Bliznets, Marcin Pilipczuk, Micha{\\l} Pilipczuk","submitted_at":"2014-02-13T20:06:50Z","abstract_excerpt":"In the Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge additions into an interval graph, i.e., a graph admitting an intersection model of intervals on a line. Motivated by applications in sparse matrix multiplication and molecular biology, Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999] asked for a fixed-parameter algorithm solving this problem. This question was answer affirmatively more than a decade later by Villanger at el. [STOC 2007; SIAM J. Comput. 2009], who presented an algorithm with running time $O(k^{2k"},"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":"1402.3473","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:06:50Z","cross_cats_sorted":[],"title_canon_sha256":"4a5934250c8ae3c94733da33d51f9673372543b00ccaccefd9c0649ad5c8e9c4","abstract_canon_sha256":"ee14fdbc9e836758efae10e8771e4baa7146b6eb677462db139886572b60e55d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:38:10.257864Z","signature_b64":"siYEmHse9g6RGOMTXZwVo9kUmSFJgkkumGhe/qyu4EQgZKxUOPAj/BeQi6Js/Ws/U5NG/6YxMfLIlQ+v8ovOAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"335f829b78572c044e8bc93d01697dd14ef4490285b676835908653733ee7cc6","last_reissued_at":"2026-05-18T02:38:10.257190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:38:10.257190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A subexponential parameterized algorithm for Interval Completion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Ivan Bliznets, Marcin Pilipczuk, Micha{\\l} Pilipczuk","submitted_at":"2014-02-13T20:06:50Z","abstract_excerpt":"In the Interval Completion problem we are given a graph G and an integer k, and the task is to turn G using at most k edge additions into an interval graph, i.e., a graph admitting an intersection model of intervals on a line. Motivated by applications in sparse matrix multiplication and molecular biology, Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999] asked for a fixed-parameter algorithm solving this problem. This question was answer affirmatively more than a decade later by Villanger at el. [STOC 2007; SIAM J. Comput. 2009], who presented an algorithm with running time $O(k^{2k"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3473","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":""},"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":"1402.3473","created_at":"2026-05-18T02:38:10.257290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3473v3","created_at":"2026-05-18T02:38:10.257290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3473","created_at":"2026-05-18T02:38:10.257290+00:00"},{"alias_kind":"pith_short_12","alias_value":"GNPYFG3YK4WA","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GNPYFG3YK4WAITUL","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GNPYFG3Y","created_at":"2026-05-18T12:28:30.664211+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/GNPYFG3YK4WAITULZE6QC2L52F","json":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F.json","graph_json":"https://pith.science/api/pith-number/GNPYFG3YK4WAITULZE6QC2L52F/graph.json","events_json":"https://pith.science/api/pith-number/GNPYFG3YK4WAITULZE6QC2L52F/events.json","paper":"https://pith.science/paper/GNPYFG3Y"},"agent_actions":{"view_html":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F","download_json":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F.json","view_paper":"https://pith.science/paper/GNPYFG3Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3473&json=true","fetch_graph":"https://pith.science/api/pith-number/GNPYFG3YK4WAITULZE6QC2L52F/graph.json","fetch_events":"https://pith.science/api/pith-number/GNPYFG3YK4WAITULZE6QC2L52F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/action/storage_attestation","attest_author":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/action/author_attestation","sign_citation":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/action/citation_signature","submit_replication":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/action/replication_record"}},"created_at":"2026-05-18T02:38:10.257290+00:00","updated_at":"2026-05-18T02:38:10.257290+00:00"}