{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:H34QX2YJLQHEB75BWWCI4PJ5SP","short_pith_number":"pith:H34QX2YJ","schema_version":"1.0","canonical_sha256":"3ef90beb095c0e40ffa1b5848e3d3d93f3af00218799e5c328bb0c337bcfb9f4","source":{"kind":"arxiv","id":"1402.3472","version":1},"attestation_state":"computed","paper":{"title":"A subexponential parameterized algorithm for Proper 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:03:41Z","abstract_excerpt":"In the Proper 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 a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999], who showed an algorithm for the problem working in $O(16^k (n + m))$ time. In this paper we present an algorithm with running time $k^{O(k^{2/3})} + O(nm(kn + m))$, which is the"},"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.3472","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:03:41Z","cross_cats_sorted":[],"title_canon_sha256":"f71c8a2f3c37b6137e1eb3a77659fc28daa807ce549c14185572c379929ff52b","abstract_canon_sha256":"55bb22ff52ab88675ba23a43e7855a252e237059b123102a96f92a3e31bded37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:58.679129Z","signature_b64":"5t/v2u9qwnR6GNInTl6Vt7t9wJlFscdK9yF5aIwRvV3VTFtG+ZON9nW5vDGeVH3OZa8WXs3Ouzf/nCK9AmL3Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ef90beb095c0e40ffa1b5848e3d3d93f3af00218799e5c328bb0c337bcfb9f4","last_reissued_at":"2026-05-18T02:58:58.678345Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:58.678345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A subexponential parameterized algorithm for Proper 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:03:41Z","abstract_excerpt":"In the Proper 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 a proper interval graph, i.e., a graph admitting an intersection model of equal-length intervals on a line. The study of Proper Interval Completion from the viewpoint of parameterized complexity has been initiated by Kaplan, Shamir and Tarjan [FOCS 1994; SIAM J. Comput. 1999], who showed an algorithm for the problem working in $O(16^k (n + m))$ time. In this paper we present an algorithm with running time $k^{O(k^{2/3})} + O(nm(kn + m))$, which is the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3472","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":""},"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.3472","created_at":"2026-05-18T02:58:58.678475+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3472v1","created_at":"2026-05-18T02:58:58.678475+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3472","created_at":"2026-05-18T02:58:58.678475+00:00"},{"alias_kind":"pith_short_12","alias_value":"H34QX2YJLQHE","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"H34QX2YJLQHEB75B","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"H34QX2YJ","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/H34QX2YJLQHEB75BWWCI4PJ5SP","json":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP.json","graph_json":"https://pith.science/api/pith-number/H34QX2YJLQHEB75BWWCI4PJ5SP/graph.json","events_json":"https://pith.science/api/pith-number/H34QX2YJLQHEB75BWWCI4PJ5SP/events.json","paper":"https://pith.science/paper/H34QX2YJ"},"agent_actions":{"view_html":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP","download_json":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP.json","view_paper":"https://pith.science/paper/H34QX2YJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3472&json=true","fetch_graph":"https://pith.science/api/pith-number/H34QX2YJLQHEB75BWWCI4PJ5SP/graph.json","fetch_events":"https://pith.science/api/pith-number/H34QX2YJLQHEB75BWWCI4PJ5SP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/action/storage_attestation","attest_author":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/action/author_attestation","sign_citation":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/action/citation_signature","submit_replication":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/action/replication_record"}},"created_at":"2026-05-18T02:58:58.678475+00:00","updated_at":"2026-05-18T02:58:58.678475+00:00"}