{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:E6QDVPJQXEW6K63T44347C3SSM","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":"eef71667058e934672818192914bd22175c26c98f1e1ddf0404a2dd37555d2a7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T13:51:23Z","title_canon_sha256":"2f721303da5579afe7e54769ae8e3d6d314f6475d20ae769ebcabf7fd49efe15"},"schema_version":"1.0","source":{"id":"1703.05156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.05156","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"arxiv_version","alias_value":"1703.05156v1","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05156","created_at":"2026-05-18T00:48:38Z"},{"alias_kind":"pith_short_12","alias_value":"E6QDVPJQXEW6","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"E6QDVPJQXEW6K63T","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"E6QDVPJQ","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:a8e0ce11793d713ed9dcc5737d3640127585ef2e0c718e59253e152ec5d4dc15","target":"graph","created_at":"2026-05-18T00:48:38Z","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":"For a (possibly infinite) fixed family of graphs F, we say that a graph G overlays F on a hypergraph H if V(H) is equal to V(G) and the subgraph of G induced by every hyperedge of H contains some member of F as a spanning subgraph.While it is easy to see that the complete graph on |V(H)| overlays F on a hypergraph H whenever the problem admits a solution, the Minimum F-Overlay problem asks for such a graph with the minimum number of edges.This problem allows to generalize some natural problems which may arise in practice. For instance, if the family F contains all connected graphs, then Minimu","authors_text":"ABS), Dorian Mazauric (UCA, Fr\\'ed\\'eric Havet (COATI, Ignasi Sau (ALGCO), Nathann Cohen (LRI), R\\'emi Watrigant (UCA, UCA)","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T13:51:23Z","title":"Complexity Dichotomies for the Minimum F-Overlay Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05156","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:34185095d7e9a91757100d8ff45be72ae474a01b33006db76be7f591456af6b1","target":"record","created_at":"2026-05-18T00:48:38Z","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":"eef71667058e934672818192914bd22175c26c98f1e1ddf0404a2dd37555d2a7","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T13:51:23Z","title_canon_sha256":"2f721303da5579afe7e54769ae8e3d6d314f6475d20ae769ebcabf7fd49efe15"},"schema_version":"1.0","source":{"id":"1703.05156","kind":"arxiv","version":1}},"canonical_sha256":"27a03abd30b92de57b73e737cf8b72930b20134d22cb50cd223ac5cbf223a2ca","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27a03abd30b92de57b73e737cf8b72930b20134d22cb50cd223ac5cbf223a2ca","first_computed_at":"2026-05-18T00:48:38.201082Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:38.201082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tQMSKSIbSblgMpv4IEGQ4FybXVHaxacY/R8WSIC5VX2lcm2tq6fTqi5LpwS1s3iVtEJ3XLAsON/ITQdeeuv/Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:38.201711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.05156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34185095d7e9a91757100d8ff45be72ae474a01b33006db76be7f591456af6b1","sha256:a8e0ce11793d713ed9dcc5737d3640127585ef2e0c718e59253e152ec5d4dc15"],"state_sha256":"5ffe5d3d2ddf43ae117e9feaa7f6ac008fb9c4eaf01d77cb774f9c470cb5f59e"}