{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4LGXRHD4CLCNA6TQIQYYCF3N44","short_pith_number":"pith:4LGXRHD4","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"},"canonical_sha256":"e2cd789c7c12c4d07a70443181176de715be4374610538b3594abb3b936ed4dc","source":{"kind":"arxiv","id":"1504.04470","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04470","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04470v2","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04470","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"4LGXRHD4CLCN","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4LGXRHD4CLCNA6TQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4LGXRHD4","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4LGXRHD4CLCNA6TQIQYYCF3N44","target":"record","payload":{"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"},"canonical_sha256":"e2cd789c7c12c4d07a70443181176de715be4374610538b3594abb3b936ed4dc","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"},"source_kind":"arxiv","source_id":"1504.04470","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"590kw1svnIeCFEQXCbUN40HMmEOiIJeGD6bm40lo7DCkFERHAEoA00vUYsTTnsr/97cbGtSzC/Y4a2mYHXd9BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:41:47.748208Z"},"content_sha256":"c6be09d4e98576f7ee7306a3f958d99f6a84781a946b05b1eb9e9389f3b2a7fa","schema_version":"1.0","event_id":"sha256:c6be09d4e98576f7ee7306a3f958d99f6a84781a946b05b1eb9e9389f3b2a7fa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4LGXRHD4CLCNA6TQIQYYCF3N44","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zAJcs5aIqltLrmccnt37qOF4Epo8KRFyVkfA4hsnpjIh2eeglvdHNFvDQEyCIlvaiDcx7zrNmiC7wDeLTuk4Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:41:47.748564Z"},"content_sha256":"5f88ba55b7aeee3e3de44d53030b2d66310a7327b20a0bd475e70e0035e53815","schema_version":"1.0","event_id":"sha256:5f88ba55b7aeee3e3de44d53030b2d66310a7327b20a0bd475e70e0035e53815"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/bundle.json","state_url":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T15:41:47Z","links":{"resolver":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44","bundle":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/bundle.json","state":"https://pith.science/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LGXRHD4CLCNA6TQIQYYCF3N44/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4LGXRHD4CLCNA6TQIQYYCF3N44","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"256a107e6f184b6d65aacb6c12bc602bca9be64763c955e2baea03c2150e975b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T09:43:30Z","title_canon_sha256":"d18e2a965eb3bc94d17841f91fd070a57ab5e4bc009eb374529e8f2bd99dc8fe"},"schema_version":"1.0","source":{"id":"1504.04470","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.04470","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"1504.04470v2","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04470","created_at":"2026-05-18T00:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"4LGXRHD4CLCN","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4LGXRHD4CLCNA6TQ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4LGXRHD4","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:5f88ba55b7aeee3e3de44d53030b2d66310a7327b20a0bd475e70e0035e53815","target":"graph","created_at":"2026-05-18T00:53:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Yixin Cao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T09:43:30Z","title":"Unit Interval Editing is Fixed-Parameter Tractable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04470","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c6be09d4e98576f7ee7306a3f958d99f6a84781a946b05b1eb9e9389f3b2a7fa","target":"record","created_at":"2026-05-18T00:53:40Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"256a107e6f184b6d65aacb6c12bc602bca9be64763c955e2baea03c2150e975b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-17T09:43:30Z","title_canon_sha256":"d18e2a965eb3bc94d17841f91fd070a57ab5e4bc009eb374529e8f2bd99dc8fe"},"schema_version":"1.0","source":{"id":"1504.04470","kind":"arxiv","version":2}},"canonical_sha256":"e2cd789c7c12c4d07a70443181176de715be4374610538b3594abb3b936ed4dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2cd789c7c12c4d07a70443181176de715be4374610538b3594abb3b936ed4dc","first_computed_at":"2026-05-18T00:53:40.610181Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:40.610181Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"803TViWM1EghGaErxdzs53dctZZOnBlFoMGLk0xqI+IVy3KzQGHV/6AwmKUDduiUGPHh7RrSV+Ufg0R4fksPBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:40.610653Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.04470","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c6be09d4e98576f7ee7306a3f958d99f6a84781a946b05b1eb9e9389f3b2a7fa","sha256:5f88ba55b7aeee3e3de44d53030b2d66310a7327b20a0bd475e70e0035e53815"],"state_sha256":"853d61853bf971fb9d5ae6d2d6abe1108d5ed09b61ff77caf18b9ebbd6b89e92"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G7Z6BGWeFt2Qk3YpUjI5lybSKz6h++IgyNcUrubj9DKshBG6+hPr7TOEvjEXsrD8nXtdgzKrXqRSoO8lE1u3CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:41:47.750491Z","bundle_sha256":"0ecbd51e3fdf8ae226a222a1d0ef08138a1b6ae016c4806967b8de36eabfdd9f"}}