{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T4WF7GHTZ4LW6YAKHO56NP265W","short_pith_number":"pith:T4WF7GHT","canonical_record":{"source":{"id":"1508.05282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T14:29:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4fb8ffd43cab31d1ebed58f66446b53735d0a34b6b5a59c2b2d7dd8850dfad20","abstract_canon_sha256":"eab6d688676495b4d2c343c58a8162ec63420b24ee4234e82b3a8d95b67394d4"},"schema_version":"1.0"},"canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","source":{"kind":"arxiv","id":"1508.05282","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05282","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05282v2","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05282","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"T4WF7GHTZ4LW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4WF7GHTZ4LW6YAK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4WF7GHT","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T4WF7GHTZ4LW6YAKHO56NP265W","target":"record","payload":{"canonical_record":{"source":{"id":"1508.05282","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T14:29:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"4fb8ffd43cab31d1ebed58f66446b53735d0a34b6b5a59c2b2d7dd8850dfad20","abstract_canon_sha256":"eab6d688676495b4d2c343c58a8162ec63420b24ee4234e82b3a8d95b67394d4"},"schema_version":"1.0"},"canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:30:07.773471Z","signature_b64":"rcF6kqKjvaHYEffNQ5IKwceWp5XQzNtySJaoGT/gxj1lFqv+BoxvdTsiv2yz0ZJ2Oy+YAkP0HE59j08zh/gACA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","last_reissued_at":"2026-05-18T01:30:07.772825Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:30:07.772825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1508.05282","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:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h5WqVld1CFv6bgmzXNy5+2Upl7hAlug92HA+0v/DNxOqSkNtq7/Tt+7aswrlfft3+ta85HA3NtXvBqC5UG2CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:55:08.932014Z"},"content_sha256":"c06c73679a51e9e34ee58e7586b092b5382f86f9beda701f78ce6dc024135a05","schema_version":"1.0","event_id":"sha256:c06c73679a51e9e34ee58e7586b092b5382f86f9beda701f78ce6dc024135a05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T4WF7GHTZ4LW6YAKHO56NP265W","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Ivan Bliznets, Lukas Mach, Marek Cygan, Michal Pilipczuk, Pawel Komosa","submitted_at":"2015-08-21T14:29:21Z","abstract_excerpt":"In this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper Interval Completion, Threshold Completion, and Trivially Perfect Completion. In these problems, the task is to add at most k edges to a given graph in order to obtain a chordal, interval, proper interval, threshold, or trivially perfect graph, respectively. We prove the following lower bounds for all these problems, as well as for the related Chain Completion problem: Assuming the Exponential Time Hypothesis, none of these problems can be solved in time 2^O(n^(1/"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05282","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:30:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UwyCiORLS5x1mmzk1l2OwYieX5sbSNHPdPtz+LYQaArWnJrxZ95mPGScnI6QPb2OjGyzmh0vziHfMNVwiS7mCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T22:55:08.932619Z"},"content_sha256":"f0825951a081e167d5367f0c38d800a207d7c1351d616557db0d0cfc66e9ff61","schema_version":"1.0","event_id":"sha256:f0825951a081e167d5367f0c38d800a207d7c1351d616557db0d0cfc66e9ff61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/bundle.json","state_url":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T4WF7GHTZ4LW6YAKHO56NP265W/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-18T22:55:08Z","links":{"resolver":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W","bundle":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/bundle.json","state":"https://pith.science/pith/T4WF7GHTZ4LW6YAKHO56NP265W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T4WF7GHTZ4LW6YAKHO56NP265W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T4WF7GHTZ4LW6YAKHO56NP265W","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":"eab6d688676495b4d2c343c58a8162ec63420b24ee4234e82b3a8d95b67394d4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T14:29:21Z","title_canon_sha256":"4fb8ffd43cab31d1ebed58f66446b53735d0a34b6b5a59c2b2d7dd8850dfad20"},"schema_version":"1.0","source":{"id":"1508.05282","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05282","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05282v2","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05282","created_at":"2026-05-18T01:30:07Z"},{"alias_kind":"pith_short_12","alias_value":"T4WF7GHTZ4LW","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T4WF7GHTZ4LW6YAK","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T4WF7GHT","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:f0825951a081e167d5367f0c38d800a207d7c1351d616557db0d0cfc66e9ff61","target":"graph","created_at":"2026-05-18T01:30:07Z","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 this work, we focus on several completion problems for subclasses of chordal graphs: Minimum Fill-In, Interval Completion, Proper Interval Completion, Threshold Completion, and Trivially Perfect Completion. In these problems, the task is to add at most k edges to a given graph in order to obtain a chordal, interval, proper interval, threshold, or trivially perfect graph, respectively. We prove the following lower bounds for all these problems, as well as for the related Chain Completion problem: Assuming the Exponential Time Hypothesis, none of these problems can be solved in time 2^O(n^(1/","authors_text":"Ivan Bliznets, Lukas Mach, Marek Cygan, Michal Pilipczuk, Pawel Komosa","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T14:29:21Z","title":"Lower bounds for the parameterized complexity of Minimum Fill-in and other completion problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05282","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:c06c73679a51e9e34ee58e7586b092b5382f86f9beda701f78ce6dc024135a05","target":"record","created_at":"2026-05-18T01:30:07Z","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":"eab6d688676495b4d2c343c58a8162ec63420b24ee4234e82b3a8d95b67394d4","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-08-21T14:29:21Z","title_canon_sha256":"4fb8ffd43cab31d1ebed58f66446b53735d0a34b6b5a59c2b2d7dd8850dfad20"},"schema_version":"1.0","source":{"id":"1508.05282","kind":"arxiv","version":2}},"canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9f2c5f98f3cf176f600a3bbbe6bf5eed9e4a9537700ed4e4e697e340073c4f44","first_computed_at":"2026-05-18T01:30:07.772825Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:30:07.772825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rcF6kqKjvaHYEffNQ5IKwceWp5XQzNtySJaoGT/gxj1lFqv+BoxvdTsiv2yz0ZJ2Oy+YAkP0HE59j08zh/gACA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:30:07.773471Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05282","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c06c73679a51e9e34ee58e7586b092b5382f86f9beda701f78ce6dc024135a05","sha256:f0825951a081e167d5367f0c38d800a207d7c1351d616557db0d0cfc66e9ff61"],"state_sha256":"0fb68aa4e2bf69bd2128bc5e6bd1cda935629627d694ae7a869fb723fbf8fa56"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VcNXyY7IUfsLOkT9JkMekgnO/Nn1mI6Vgc6Ucl6Eu7D1ioNw3qJUZinKpR+BClmQYt7gdYZuCqszaaKPIZlkAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T22:55:08.934567Z","bundle_sha256":"1e44efaed0b9bef02be65648514620d168e6eaf5e0ba3bea3ef2c4794c9cb2d8"}}