{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:PO4JXSCUOAVYGT2C5WI3JKQY27","short_pith_number":"pith:PO4JXSCU","canonical_record":{"source":{"id":"1104.2230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T14:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"a0bb83debb047d8d965d2d9b278bb3aca379f3d1d4986cc94206b0eac57f5935","abstract_canon_sha256":"0b50711685fc43ccc25ba50b7a5552218fb4f11bb554254d62c7b63023123749"},"schema_version":"1.0"},"canonical_sha256":"7bb89bc854702b834f42ed91b4aa18d7c7106ddd1eef732e5b6f8cba9193b666","source":{"kind":"arxiv","id":"1104.2230","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2230","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2230v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2230","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"PO4JXSCUOAVY","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PO4JXSCUOAVYGT2C","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PO4JXSCU","created_at":"2026-05-18T12:26:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:PO4JXSCUOAVYGT2C5WI3JKQY27","target":"record","payload":{"canonical_record":{"source":{"id":"1104.2230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T14:39:13Z","cross_cats_sorted":[],"title_canon_sha256":"a0bb83debb047d8d965d2d9b278bb3aca379f3d1d4986cc94206b0eac57f5935","abstract_canon_sha256":"0b50711685fc43ccc25ba50b7a5552218fb4f11bb554254d62c7b63023123749"},"schema_version":"1.0"},"canonical_sha256":"7bb89bc854702b834f42ed91b4aa18d7c7106ddd1eef732e5b6f8cba9193b666","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:35.704617Z","signature_b64":"RTozbD1vz3eFdiXbXm8LHxKZ4/MVVCS3D0RfCYSX/JULLtYo9gu3DnlRnM4++giRDIfYBaMTieS36CcfVsyZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bb89bc854702b834f42ed91b4aa18d7c7106ddd1eef732e5b6f8cba9193b666","last_reissued_at":"2026-05-18T04:24:35.704122Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:35.704122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.2230","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"svIScheipuB4XNksK03XtxVJZtmpp3BzF88wodzF3HImXnA5QZbqrb9gCJJ0HbWRt7VmZIBI0ZahlP3Oy0scCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:45:07.939982Z"},"content_sha256":"4c1033ebaa4541d6a8cbb5d5b8f6607f7ea5010d74b0a3872a15f797e4568edb","schema_version":"1.0","event_id":"sha256:4c1033ebaa4541d6a8cbb5d5b8f6607f7ea5010d74b0a3872a15f797e4568edb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:PO4JXSCUOAVYGT2C5WI3JKQY27","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Subexponential Parameterized Algorithm for Minimum Fill-in","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Fedor V. Fomin, Yngve Villanger","submitted_at":"2011-04-12T14:39:13Z","abstract_excerpt":"The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2^(O(k)) + k2 * nm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fill-in in time O(2^(O(\\sqrt{k} log k)) + k2 * nm). This substantially lower the complexity of the problem. Techniques developed for Minimum Fill-in can be used to obtain subexponential parameterized algorithms for several related probl"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2230","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-18T04:24:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7XZMPdf/M7xtJyXtt5kR0LGZP8SxedkvN5SE5yapi7XJY68MeXyiQC5uQHkU7uJmh5ViwEqut9oVY8C0D3lkAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T03:45:07.940336Z"},"content_sha256":"4a380ce161975d1d75c6bea45750d92bd3d4f5a089960ece942dca9acbe0c0b5","schema_version":"1.0","event_id":"sha256:4a380ce161975d1d75c6bea45750d92bd3d4f5a089960ece942dca9acbe0c0b5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PO4JXSCUOAVYGT2C5WI3JKQY27/bundle.json","state_url":"https://pith.science/pith/PO4JXSCUOAVYGT2C5WI3JKQY27/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PO4JXSCUOAVYGT2C5WI3JKQY27/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-01T03:45:07Z","links":{"resolver":"https://pith.science/pith/PO4JXSCUOAVYGT2C5WI3JKQY27","bundle":"https://pith.science/pith/PO4JXSCUOAVYGT2C5WI3JKQY27/bundle.json","state":"https://pith.science/pith/PO4JXSCUOAVYGT2C5WI3JKQY27/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PO4JXSCUOAVYGT2C5WI3JKQY27/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:PO4JXSCUOAVYGT2C5WI3JKQY27","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":"0b50711685fc43ccc25ba50b7a5552218fb4f11bb554254d62c7b63023123749","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T14:39:13Z","title_canon_sha256":"a0bb83debb047d8d965d2d9b278bb3aca379f3d1d4986cc94206b0eac57f5935"},"schema_version":"1.0","source":{"id":"1104.2230","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.2230","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"arxiv_version","alias_value":"1104.2230v1","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.2230","created_at":"2026-05-18T04:24:35Z"},{"alias_kind":"pith_short_12","alias_value":"PO4JXSCUOAVY","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_16","alias_value":"PO4JXSCUOAVYGT2C","created_at":"2026-05-18T12:26:39Z"},{"alias_kind":"pith_short_8","alias_value":"PO4JXSCU","created_at":"2026-05-18T12:26:39Z"}],"graph_snapshots":[{"event_id":"sha256:4a380ce161975d1d75c6bea45750d92bd3d4f5a089960ece942dca9acbe0c0b5","target":"graph","created_at":"2026-05-18T04:24:35Z","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":"The Minimum Fill-in problem is to decide if a graph can be triangulated by adding at most k edges. Kaplan, Shamir, and Tarjan [FOCS 1994] have shown that the problem is solvable in time O(2^(O(k)) + k2 * nm) on graphs with n vertices and m edges and thus is fixed parameter tractable. Here, we give the first subexponential parameterized algorithm solving Minimum Fill-in in time O(2^(O(\\sqrt{k} log k)) + k2 * nm). This substantially lower the complexity of the problem. Techniques developed for Minimum Fill-in can be used to obtain subexponential parameterized algorithms for several related probl","authors_text":"Fedor V. Fomin, Yngve Villanger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T14:39:13Z","title":"Subexponential Parameterized Algorithm for Minimum Fill-in"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.2230","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:4c1033ebaa4541d6a8cbb5d5b8f6607f7ea5010d74b0a3872a15f797e4568edb","target":"record","created_at":"2026-05-18T04:24:35Z","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":"0b50711685fc43ccc25ba50b7a5552218fb4f11bb554254d62c7b63023123749","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-12T14:39:13Z","title_canon_sha256":"a0bb83debb047d8d965d2d9b278bb3aca379f3d1d4986cc94206b0eac57f5935"},"schema_version":"1.0","source":{"id":"1104.2230","kind":"arxiv","version":1}},"canonical_sha256":"7bb89bc854702b834f42ed91b4aa18d7c7106ddd1eef732e5b6f8cba9193b666","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bb89bc854702b834f42ed91b4aa18d7c7106ddd1eef732e5b6f8cba9193b666","first_computed_at":"2026-05-18T04:24:35.704122Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:35.704122Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RTozbD1vz3eFdiXbXm8LHxKZ4/MVVCS3D0RfCYSX/JULLtYo9gu3DnlRnM4++giRDIfYBaMTieS36CcfVsyZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:35.704617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.2230","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4c1033ebaa4541d6a8cbb5d5b8f6607f7ea5010d74b0a3872a15f797e4568edb","sha256:4a380ce161975d1d75c6bea45750d92bd3d4f5a089960ece942dca9acbe0c0b5"],"state_sha256":"a4ab82467fdec71837847b7f46f84e365561ea2b9c52202e56c921a00d90603b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"euikiPzw/ozYaH1O/Fv56xylV9BvQ9eEF3B0LAxxNUkafWR2EdOOtkgL7FDPthS095J8o4ab1FO84B7qAkUoCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T03:45:07.942479Z","bundle_sha256":"f17e2c96b53b063b0e79391d5ef3e7ed771dc95faba954eee89fc7be95dec267"}}