{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:E6QDVPJQXEW6K63T44347C3SSM","short_pith_number":"pith:E6QDVPJQ","schema_version":"1.0","canonical_sha256":"27a03abd30b92de57b73e737cf8b72930b20134d22cb50cd223ac5cbf223a2ca","source":{"kind":"arxiv","id":"1703.05156","version":1},"attestation_state":"computed","paper":{"title":"Complexity Dichotomies for the Minimum F-Overlay Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"ABS), Dorian Mazauric (UCA, Fr\\'ed\\'eric Havet (COATI, Ignasi Sau (ALGCO), Nathann Cohen (LRI), R\\'emi Watrigant (UCA, UCA)","submitted_at":"2017-03-15T13:51:23Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1703.05156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T13:51:23Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"2f721303da5579afe7e54769ae8e3d6d314f6475d20ae769ebcabf7fd49efe15","abstract_canon_sha256":"eef71667058e934672818192914bd22175c26c98f1e1ddf0404a2dd37555d2a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.201711Z","signature_b64":"tQMSKSIbSblgMpv4IEGQ4FybXVHaxacY/R8WSIC5VX2lcm2tq6fTqi5LpwS1s3iVtEJ3XLAsON/ITQdeeuv/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27a03abd30b92de57b73e737cf8b72930b20134d22cb50cd223ac5cbf223a2ca","last_reissued_at":"2026-05-18T00:48:38.201082Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.201082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity Dichotomies for the Minimum F-Overlay Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"ABS), Dorian Mazauric (UCA, Fr\\'ed\\'eric Havet (COATI, Ignasi Sau (ALGCO), Nathann Cohen (LRI), R\\'emi Watrigant (UCA, UCA)","submitted_at":"2017-03-15T13:51:23Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.05156","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.05156","created_at":"2026-05-18T00:48:38.201204+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.05156v1","created_at":"2026-05-18T00:48:38.201204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.05156","created_at":"2026-05-18T00:48:38.201204+00:00"},{"alias_kind":"pith_short_12","alias_value":"E6QDVPJQXEW6","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"E6QDVPJQXEW6K63T","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"E6QDVPJQ","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM","json":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM.json","graph_json":"https://pith.science/api/pith-number/E6QDVPJQXEW6K63T44347C3SSM/graph.json","events_json":"https://pith.science/api/pith-number/E6QDVPJQXEW6K63T44347C3SSM/events.json","paper":"https://pith.science/paper/E6QDVPJQ"},"agent_actions":{"view_html":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM","download_json":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM.json","view_paper":"https://pith.science/paper/E6QDVPJQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.05156&json=true","fetch_graph":"https://pith.science/api/pith-number/E6QDVPJQXEW6K63T44347C3SSM/graph.json","fetch_events":"https://pith.science/api/pith-number/E6QDVPJQXEW6K63T44347C3SSM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM/action/storage_attestation","attest_author":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM/action/author_attestation","sign_citation":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM/action/citation_signature","submit_replication":"https://pith.science/pith/E6QDVPJQXEW6K63T44347C3SSM/action/replication_record"}},"created_at":"2026-05-18T00:48:38.201204+00:00","updated_at":"2026-05-18T00:48:38.201204+00:00"}