{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GNPYFG3YK4WAITULZE6QC2L52F","short_pith_number":"pith:GNPYFG3Y","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"},"canonical_sha256":"335f829b78572c044e8bc93d01697dd14ef4490285b676835908653733ee7cc6","source":{"kind":"arxiv","id":"1402.3473","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3473","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3473v3","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3473","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"pith_short_12","alias_value":"GNPYFG3YK4WA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GNPYFG3YK4WAITUL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GNPYFG3Y","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GNPYFG3YK4WAITULZE6QC2L52F","target":"record","payload":{"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"},"canonical_sha256":"335f829b78572c044e8bc93d01697dd14ef4490285b676835908653733ee7cc6","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"},"source_kind":"arxiv","source_id":"1402.3473","source_version":3,"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-18T02:38:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DqdbhpR5x1ISPS3OZ3ym40KO+4Wgm8frnlYuT0yky0AUMt44zGbtyv//Xfld8Irkz1qDQnUTaVuGp2vzv7ywAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:43:09.483874Z"},"content_sha256":"65f4ba26bef37d6162f10ce70f2892acfaae1094bc3670a3ecdafa51153da3d5","schema_version":"1.0","event_id":"sha256:65f4ba26bef37d6162f10ce70f2892acfaae1094bc3670a3ecdafa51153da3d5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GNPYFG3YK4WAITULZE6QC2L52F","target":"graph","payload":{"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"},"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-18T02:38:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8ezv9XNP421NAIYPpZss00KgYTrSleL8/tFEda0OxIa4scT3BofDc/f+v7xB78Ywu5p1lSmsKB4d82/w021aBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T11:43:09.484216Z"},"content_sha256":"4381afad5cf0034d6c727c9f407b799688877294449e525c4f940f0c8e0ab24c","schema_version":"1.0","event_id":"sha256:4381afad5cf0034d6c727c9f407b799688877294449e525c4f940f0c8e0ab24c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/bundle.json","state_url":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GNPYFG3YK4WAITULZE6QC2L52F/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-01T11:43:09Z","links":{"resolver":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F","bundle":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/bundle.json","state":"https://pith.science/pith/GNPYFG3YK4WAITULZE6QC2L52F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GNPYFG3YK4WAITULZE6QC2L52F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GNPYFG3YK4WAITULZE6QC2L52F","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":"ee14fdbc9e836758efae10e8771e4baa7146b6eb677462db139886572b60e55d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:06:50Z","title_canon_sha256":"4a5934250c8ae3c94733da33d51f9673372543b00ccaccefd9c0649ad5c8e9c4"},"schema_version":"1.0","source":{"id":"1402.3473","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3473","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3473v3","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3473","created_at":"2026-05-18T02:38:10Z"},{"alias_kind":"pith_short_12","alias_value":"GNPYFG3YK4WA","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GNPYFG3YK4WAITUL","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GNPYFG3Y","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:4381afad5cf0034d6c727c9f407b799688877294449e525c4f940f0c8e0ab24c","target":"graph","created_at":"2026-05-18T02:38:10Z","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":"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","authors_text":"Fedor V. Fomin, Ivan Bliznets, Marcin Pilipczuk, Micha{\\l} Pilipczuk","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:06:50Z","title":"A subexponential parameterized algorithm for Interval Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3473","kind":"arxiv","version":3},"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:65f4ba26bef37d6162f10ce70f2892acfaae1094bc3670a3ecdafa51153da3d5","target":"record","created_at":"2026-05-18T02:38:10Z","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":"ee14fdbc9e836758efae10e8771e4baa7146b6eb677462db139886572b60e55d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:06:50Z","title_canon_sha256":"4a5934250c8ae3c94733da33d51f9673372543b00ccaccefd9c0649ad5c8e9c4"},"schema_version":"1.0","source":{"id":"1402.3473","kind":"arxiv","version":3}},"canonical_sha256":"335f829b78572c044e8bc93d01697dd14ef4490285b676835908653733ee7cc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"335f829b78572c044e8bc93d01697dd14ef4490285b676835908653733ee7cc6","first_computed_at":"2026-05-18T02:38:10.257190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:38:10.257190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"siYEmHse9g6RGOMTXZwVo9kUmSFJgkkumGhe/qyu4EQgZKxUOPAj/BeQi6Js/Ws/U5NG/6YxMfLIlQ+v8ovOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:38:10.257864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3473","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:65f4ba26bef37d6162f10ce70f2892acfaae1094bc3670a3ecdafa51153da3d5","sha256:4381afad5cf0034d6c727c9f407b799688877294449e525c4f940f0c8e0ab24c"],"state_sha256":"6bfa8e37c1050b05cbe6c98f6be09c0683b998dfbe6717ce8480db12102b443f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+LPS+Cl5Ai1wPgS3iyJnOobTYp3gaXvGqaFXdxEM+gAqsC046vpnH4es6MpzYtYBdZF9zJKmyrOgfxgAQh06CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T11:43:09.486150Z","bundle_sha256":"4e3531d851110d061b65942aa5f890438fc8b7d6feafcdfc7e4dee968fa4092f"}}