{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4LGXRHD4CLCNA6TQIQYYCF3N44","short_pith_number":"pith:4LGXRHD4","schema_version":"1.0","canonical_sha256":"e2cd789c7c12c4d07a70443181176de715be4374610538b3594abb3b936ed4dc","source":{"kind":"arxiv","id":"1504.04470","version":2},"attestation_state":"computed","paper":{"title":"Unit Interval Editing is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yixin Cao","submitted_at":"2015-04-17T09:43:30Z","abstract_excerpt":"Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions. We give an algorithm solving this problem in time $2^{O(k\\log k)}\\cdot (n+m)$, where $k := k_1 + k_2 + k_3$, and $n, m$ denote respectively the numbers of vertices and edges of $G$. Therefore, it is fixed-parameter tractable parameterized by the total number of allowed operations.\n  Our algorithm implies the fixed-parameter tractability of the unit interval edge"},"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":"1504.04470","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T09:43:30Z","cross_cats_sorted":[],"title_canon_sha256":"d18e2a965eb3bc94d17841f91fd070a57ab5e4bc009eb374529e8f2bd99dc8fe","abstract_canon_sha256":"256a107e6f184b6d65aacb6c12bc602bca9be64763c955e2baea03c2150e975b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:40.610653Z","signature_b64":"803TViWM1EghGaErxdzs53dctZZOnBlFoMGLk0xqI+IVy3KzQGHV/6AwmKUDduiUGPHh7RrSV+Ufg0R4fksPBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2cd789c7c12c4d07a70443181176de715be4374610538b3594abb3b936ed4dc","last_reissued_at":"2026-05-18T00:53:40.610181Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:40.610181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unit Interval Editing is Fixed-Parameter Tractable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Yixin Cao","submitted_at":"2015-04-17T09:43:30Z","abstract_excerpt":"Given a graph~$G$ and integers $k_1$, $k_2$, and~$k_3$, the unit interval editing problem asks whether $G$ can be transformed into a unit interval graph by at most $k_1$ vertex deletions, $k_2$ edge deletions, and $k_3$ edge additions. We give an algorithm solving this problem in time $2^{O(k\\log k)}\\cdot (n+m)$, where $k := k_1 + k_2 + k_3$, and $n, m$ denote respectively the numbers of vertices and edges of $G$. Therefore, it is fixed-parameter tractable parameterized by the total number of allowed operations.\n  Our algorithm implies the fixed-parameter tractability of the unit interval edge"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04470","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":"1504.04470","created_at":"2026-05-18T00:53:40.610252+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04470v2","created_at":"2026-05-18T00:53:40.610252+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04470","created_at":"2026-05-18T00:53:40.610252+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LGXRHD4CLCN","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LGXRHD4CLCNA6TQ","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LGXRHD4","created_at":"2026-05-18T12:29:05.191682+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/4LGXRHD4CLCNA6TQIQYYCF3N44","json":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44.json","graph_json":"https://pith.science/api/pith-number/4LGXRHD4CLCNA6TQIQYYCF3N44/graph.json","events_json":"https://pith.science/api/pith-number/4LGXRHD4CLCNA6TQIQYYCF3N44/events.json","paper":"https://pith.science/paper/4LGXRHD4"},"agent_actions":{"view_html":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44","download_json":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44.json","view_paper":"https://pith.science/paper/4LGXRHD4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04470&json=true","fetch_graph":"https://pith.science/api/pith-number/4LGXRHD4CLCNA6TQIQYYCF3N44/graph.json","fetch_events":"https://pith.science/api/pith-number/4LGXRHD4CLCNA6TQIQYYCF3N44/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/action/storage_attestation","attest_author":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/action/author_attestation","sign_citation":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/action/citation_signature","submit_replication":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/action/replication_record"}},"created_at":"2026-05-18T00:53:40.610252+00:00","updated_at":"2026-05-18T00:53:40.610252+00:00"}