{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:O2KXP4CASKQ5V3ANKCOH4IDAEU","short_pith_number":"pith:O2KXP4CA","canonical_record":{"source":{"id":"1211.4629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-19T23:55:21Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e76f89ec4edf084d803ec5c298ea93b7eb42ad057598da404efcc9e834c3d23c","abstract_canon_sha256":"bedb9cfd0cddcd158513a0e63e379f2911e1a399fda3f71e5ea08679497721e8"},"schema_version":"1.0"},"canonical_sha256":"769577f04092a1daec0d509c7e2060251172ebbd38750b0181da5aa64d8ff0b9","source":{"kind":"arxiv","id":"1211.4629","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4629","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4629v2","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4629","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"O2KXP4CASKQ5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O2KXP4CASKQ5V3AN","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O2KXP4CA","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:O2KXP4CASKQ5V3ANKCOH4IDAEU","target":"record","payload":{"canonical_record":{"source":{"id":"1211.4629","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-19T23:55:21Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"e76f89ec4edf084d803ec5c298ea93b7eb42ad057598da404efcc9e834c3d23c","abstract_canon_sha256":"bedb9cfd0cddcd158513a0e63e379f2911e1a399fda3f71e5ea08679497721e8"},"schema_version":"1.0"},"canonical_sha256":"769577f04092a1daec0d509c7e2060251172ebbd38750b0181da5aa64d8ff0b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:14.156196Z","signature_b64":"2MNyp0Gs7FZWDVw0TpgEywkc4mUG3nUATB5ZMuvdbLvnoH2ttvY+RhdSDLlvn7Bb0LNd+HfV3Y/8T+nU/VJnCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"769577f04092a1daec0d509c7e2060251172ebbd38750b0181da5aa64d8ff0b9","last_reissued_at":"2026-05-18T01:21:14.155532Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:14.155532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.4629","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-18T01:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E0ZIi2a7zq5P7BeVSU6GBrVtknRc7EkrFlQWQw/ecuDhSh/s7cMUOrndEVtN3SdccGHnRggfxQnBjwnQZn30Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:11:40.329817Z"},"content_sha256":"e0bf15e8892f70eb7521022a8b61d7354b7a93da6b25b3a53b4a170f6fd61a25","schema_version":"1.0","event_id":"sha256:e0bf15e8892f70eb7521022a8b61d7354b7a93da6b25b3a53b4a170f6fd61a25"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:O2KXP4CASKQ5V3ANKCOH4IDAEU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Arash Rafiey","submitted_at":"2012-11-19T23:55:21Z","abstract_excerpt":"Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(c^kn(n+m)), c= min {18,k} that turns graph G into an interval graph by deleting at most k vertices from G. This solves an open problem posed by D.Marx [19]. We also provide a single exponential FPT algorithm with running time O(c^kn(n+m)), c= min {17,k} that turns G into an interval graph by adding at most$k edges. The first FPT algorithm with run time O(k^{2k}n^3m) appeared in STOC 2007 [24]. Our algorithm is the the first single exponential FPT"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4629","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-18T01:21:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AD2otCQEIAZK+FpzDjDigkRjbxVPetVplE+KB4yTDtXMdL60qtuIV+D+Qvz0ITx/UJ2ebIYyHH5SAh/KlTyxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T13:11:40.330201Z"},"content_sha256":"4a2afd2817ce2611f1c4e83bd3ac278fe751a914b4eef386e942b187711ce329","schema_version":"1.0","event_id":"sha256:4a2afd2817ce2611f1c4e83bd3ac278fe751a914b4eef386e942b187711ce329"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU/bundle.json","state_url":"https://pith.science/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU/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-01T13:11:40Z","links":{"resolver":"https://pith.science/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU","bundle":"https://pith.science/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU/bundle.json","state":"https://pith.science/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/O2KXP4CASKQ5V3ANKCOH4IDAEU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:O2KXP4CASKQ5V3ANKCOH4IDAEU","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":"bedb9cfd0cddcd158513a0e63e379f2911e1a399fda3f71e5ea08679497721e8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-19T23:55:21Z","title_canon_sha256":"e76f89ec4edf084d803ec5c298ea93b7eb42ad057598da404efcc9e834c3d23c"},"schema_version":"1.0","source":{"id":"1211.4629","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.4629","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"arxiv_version","alias_value":"1211.4629v2","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.4629","created_at":"2026-05-18T01:21:14Z"},{"alias_kind":"pith_short_12","alias_value":"O2KXP4CASKQ5","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"O2KXP4CASKQ5V3AN","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"O2KXP4CA","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:4a2afd2817ce2611f1c4e83bd3ac278fe751a914b4eef386e942b187711ce329","target":"graph","created_at":"2026-05-18T01:21:14Z","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":"Let G be an input graph with n vertices and m edges and let k be a fixed parameter. We provide a single exponential FPT algorithm with running time O(c^kn(n+m)), c= min {18,k} that turns graph G into an interval graph by deleting at most k vertices from G. This solves an open problem posed by D.Marx [19]. We also provide a single exponential FPT algorithm with running time O(c^kn(n+m)), c= min {17,k} that turns G into an interval graph by adding at most$k edges. The first FPT algorithm with run time O(k^{2k}n^3m) appeared in STOC 2007 [24]. Our algorithm is the the first single exponential FPT","authors_text":"Arash Rafiey","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-19T23:55:21Z","title":"Single Exponential FPT Algorithm for Interval Vertex Deletion and Interval Completion Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.4629","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:e0bf15e8892f70eb7521022a8b61d7354b7a93da6b25b3a53b4a170f6fd61a25","target":"record","created_at":"2026-05-18T01:21:14Z","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":"bedb9cfd0cddcd158513a0e63e379f2911e1a399fda3f71e5ea08679497721e8","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-11-19T23:55:21Z","title_canon_sha256":"e76f89ec4edf084d803ec5c298ea93b7eb42ad057598da404efcc9e834c3d23c"},"schema_version":"1.0","source":{"id":"1211.4629","kind":"arxiv","version":2}},"canonical_sha256":"769577f04092a1daec0d509c7e2060251172ebbd38750b0181da5aa64d8ff0b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"769577f04092a1daec0d509c7e2060251172ebbd38750b0181da5aa64d8ff0b9","first_computed_at":"2026-05-18T01:21:14.155532Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:21:14.155532Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2MNyp0Gs7FZWDVw0TpgEywkc4mUG3nUATB5ZMuvdbLvnoH2ttvY+RhdSDLlvn7Bb0LNd+HfV3Y/8T+nU/VJnCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:21:14.156196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.4629","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e0bf15e8892f70eb7521022a8b61d7354b7a93da6b25b3a53b4a170f6fd61a25","sha256:4a2afd2817ce2611f1c4e83bd3ac278fe751a914b4eef386e942b187711ce329"],"state_sha256":"775fb60a4496d466c661a7744d959d8277b36c4dbbe432ea6a723926b35e071d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oq4FbULf8jENP5eSGrMPzq3awo9NX0LeAUtJOTX2ePH921FTSm3HzYNsZb8jkuAp3me8+3Iwodm+BPB+SsAXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T13:11:40.332399Z","bundle_sha256":"d442093b19fc7fe47370b373fd9333322146cd06dbdad1ec062e7782c5d6fe41"}}