{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:H34QX2YJLQHEB75BWWCI4PJ5SP","short_pith_number":"pith:H34QX2YJ","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"},"canonical_sha256":"3ef90beb095c0e40ffa1b5848e3d3d93f3af00218799e5c328bb0c337bcfb9f4","source":{"kind":"arxiv","id":"1402.3472","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3472","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3472v1","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3472","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"pith_short_12","alias_value":"H34QX2YJLQHE","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H34QX2YJLQHEB75B","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H34QX2YJ","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:H34QX2YJLQHEB75BWWCI4PJ5SP","target":"record","payload":{"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"},"canonical_sha256":"3ef90beb095c0e40ffa1b5848e3d3d93f3af00218799e5c328bb0c337bcfb9f4","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"},"source_kind":"arxiv","source_id":"1402.3472","source_version":1,"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:58:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"npl+YCA41/10efat1CgL6Bw5E4KMe+yTLxaiECLcSEyMvPu38m2D6FjSN1BtVBl6JaZLAjPebvkzd/SYerofBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:33:06.651354Z"},"content_sha256":"faba3335727203846a346a80d7ad35b163ddccf51c1ac95d40d3258deb92afa3","schema_version":"1.0","event_id":"sha256:faba3335727203846a346a80d7ad35b163ddccf51c1ac95d40d3258deb92afa3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:H34QX2YJLQHEB75BWWCI4PJ5SP","target":"graph","payload":{"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"},"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:58:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0K1SxdD2hpJMXAwEzwuM5jmFpEe7ersw19ZRB2Ln0OBy/7nOO9qD7rMasRGtzeOv4fGtUhkOhGDi9N0SKLQrDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:33:06.651716Z"},"content_sha256":"2bd3b4a30fdc2b93cf2d1f0dd06522b118ed93082f4fee718c57ae72041a73b0","schema_version":"1.0","event_id":"sha256:2bd3b4a30fdc2b93cf2d1f0dd06522b118ed93082f4fee718c57ae72041a73b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/bundle.json","state_url":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/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-05-31T22:33:06Z","links":{"resolver":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP","bundle":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/bundle.json","state":"https://pith.science/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/H34QX2YJLQHEB75BWWCI4PJ5SP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:H34QX2YJLQHEB75BWWCI4PJ5SP","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":"55bb22ff52ab88675ba23a43e7855a252e237059b123102a96f92a3e31bded37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:03:41Z","title_canon_sha256":"f71c8a2f3c37b6137e1eb3a77659fc28daa807ce549c14185572c379929ff52b"},"schema_version":"1.0","source":{"id":"1402.3472","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.3472","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"arxiv_version","alias_value":"1402.3472v1","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3472","created_at":"2026-05-18T02:58:58Z"},{"alias_kind":"pith_short_12","alias_value":"H34QX2YJLQHE","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"H34QX2YJLQHEB75B","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"H34QX2YJ","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:2bd3b4a30fdc2b93cf2d1f0dd06522b118ed93082f4fee718c57ae72041a73b0","target":"graph","created_at":"2026-05-18T02:58:58Z","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 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","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:03:41Z","title":"A subexponential parameterized algorithm for Proper Interval Completion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3472","kind":"arxiv","version":1},"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:faba3335727203846a346a80d7ad35b163ddccf51c1ac95d40d3258deb92afa3","target":"record","created_at":"2026-05-18T02:58:58Z","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":"55bb22ff52ab88675ba23a43e7855a252e237059b123102a96f92a3e31bded37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-13T20:03:41Z","title_canon_sha256":"f71c8a2f3c37b6137e1eb3a77659fc28daa807ce549c14185572c379929ff52b"},"schema_version":"1.0","source":{"id":"1402.3472","kind":"arxiv","version":1}},"canonical_sha256":"3ef90beb095c0e40ffa1b5848e3d3d93f3af00218799e5c328bb0c337bcfb9f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3ef90beb095c0e40ffa1b5848e3d3d93f3af00218799e5c328bb0c337bcfb9f4","first_computed_at":"2026-05-18T02:58:58.678345Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:58.678345Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5t/v2u9qwnR6GNInTl6Vt7t9wJlFscdK9yF5aIwRvV3VTFtG+ZON9nW5vDGeVH3OZa8WXs3Ouzf/nCK9AmL3Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:58.679129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.3472","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faba3335727203846a346a80d7ad35b163ddccf51c1ac95d40d3258deb92afa3","sha256:2bd3b4a30fdc2b93cf2d1f0dd06522b118ed93082f4fee718c57ae72041a73b0"],"state_sha256":"1fe076bb1152da1df6b73b583549968cec056a7e086de53c0a31f14bb6ed8eab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NHdxXBjJb5U97OBy5bRcVVtbBMuaL2zGtCOeplxa6jgPhV8+IICH4Y3ggYToD5jEU/8PMoqP6AUPkj/0ykygCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:33:06.653767Z","bundle_sha256":"e494cfcc31ea2eb96813811ab5011eed212b012d73296a450d55b86382f5f73c"}}