{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IVK37N47XZOG2R24B3SOTQSZIH","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":"ae917a1a584b626322a1df1ca5f07d1b6dbde9bb412d6ca60fc46d1fe92ed326","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-16T16:16:41Z","title_canon_sha256":"53430d1955c19236d6c1c21c8aa48e7268c5e9108e255a1a777976732fc353b1"},"schema_version":"1.0","source":{"id":"1309.4022","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.4022","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1309.4022v2","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.4022","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"IVK37N47XZOG","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"IVK37N47XZOG2R24","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"IVK37N47","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:7513b818ae4228609c29385d1773d03e25192a02ecd993e80f1f31ccb6950193","target":"graph","created_at":"2026-05-18T02:52:04Z","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 ${\\cal F}$ be a family of graphs. In the ${\\cal F}$-Completion problem, we are given a graph $G$ and an integer $k$ as input, and asked whether at most $k$ edges can be added to $G$ so that the resulting graph does not contain a graph from ${\\cal F}$ as an induced subgraph. It appeared recently that special cases of ${\\cal F}$-Completion, the problem of completing into a chordal graph known as Minimum Fill-in, corresponding to the case of ${\\cal F}=\\{C_4,C_5,C_6,\\ldots\\}$, and the problem of completing into a split graph, i.e., the case of ${\\cal F}=\\{C_4, 2K_2, C_5\\}$, are solvable in par","authors_text":"Fedor V. Fomin, Micha{\\l} Pilipczuk, P{\\aa}l Gr{\\o}n{\\aa}s Drange, Yngve Villanger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-16T16:16:41Z","title":"Exploring Subexponential Parameterized Complexity of Completion Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.4022","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:1d08a6d53cdf2c416b0755eb510357b0f6c4f7dc74b612aabd6fac1ae3b5e89d","target":"record","created_at":"2026-05-18T02:52:04Z","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":"ae917a1a584b626322a1df1ca5f07d1b6dbde9bb412d6ca60fc46d1fe92ed326","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-09-16T16:16:41Z","title_canon_sha256":"53430d1955c19236d6c1c21c8aa48e7268c5e9108e255a1a777976732fc353b1"},"schema_version":"1.0","source":{"id":"1309.4022","kind":"arxiv","version":2}},"canonical_sha256":"4555bfb79fbe5c6d475c0ee4e9c25941d8447c350e0ce28f0c09d21dd8d80583","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4555bfb79fbe5c6d475c0ee4e9c25941d8447c350e0ce28f0c09d21dd8d80583","first_computed_at":"2026-05-18T02:52:04.157425Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:04.157425Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qAkrtLNEk0pg853Tr6RLCivYQYtCFkiD1W0mUs5bBxwrO5bZRMORymTjpEQZGOufJCHRHlSd3KHiB9hfc/m3BA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:04.157983Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.4022","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d08a6d53cdf2c416b0755eb510357b0f6c4f7dc74b612aabd6fac1ae3b5e89d","sha256:7513b818ae4228609c29385d1773d03e25192a02ecd993e80f1f31ccb6950193"],"state_sha256":"91fa9ae929b3e78276187029bec90ef3154da0e5a52c09d92179c53803d40ddc"}