{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:G4JZXG6727VDHEF7WCHUKHPIRG","short_pith_number":"pith:G4JZXG67","schema_version":"1.0","canonical_sha256":"37139b9bdfd7ea3390bfb08f451de8899d791e90336ceae53d1508ead64517da","source":{"kind":"arxiv","id":"1712.07072","version":2},"attestation_state":"computed","paper":{"title":"Generalized Tur\\'an problems for disjoint copies of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2017-12-19T17:36:20Z","abstract_excerpt":"Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed graph $F$. Our results include cases when $F$ is a complete graph, cycle or a complete bipartite graph."},"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":"1712.07072","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-19T17:36:20Z","cross_cats_sorted":[],"title_canon_sha256":"3876c81eda9fd336038f7ff698b96c77a866ebb3db55c3bd2950189940d43df2","abstract_canon_sha256":"cecc6da2e397280dd28afcd2213aa8e78376b0073b57eb626c3e424c639e1b69"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:22.012635Z","signature_b64":"5fhVq7S5uZW3rbVgD2v7hcrx9s9/oC/cnL9ir1C1Fl90wISksOwLHwekLR0mzJZK4G/h4wmWWv183b2G5i9xBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37139b9bdfd7ea3390bfb08f451de8899d791e90336ceae53d1508ead64517da","last_reissued_at":"2026-05-18T00:14:22.012027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:22.012027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Tur\\'an problems for disjoint copies of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abhishek Methuku, D\\'aniel Gerbner, M\\'at\\'e Vizer","submitted_at":"2017-12-19T17:36:20Z","abstract_excerpt":"Given two graphs $H$ and $F$, the maximum possible number of copies of $H$ in an $F$-free graph on $n$ vertices is denoted by $ex(n,H,F)$. We investigate the function $ex(n,H,kF)$, where $kF$ denotes $k$ vertex disjoint copies of a fixed graph $F$. Our results include cases when $F$ is a complete graph, cycle or a complete bipartite graph."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.07072","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1712.07072","created_at":"2026-05-18T00:14:22.012117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.07072v2","created_at":"2026-05-18T00:14:22.012117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.07072","created_at":"2026-05-18T00:14:22.012117+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4JZXG6727VD","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4JZXG6727VDHEF7","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4JZXG67","created_at":"2026-05-18T12:31:15.632608+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/G4JZXG6727VDHEF7WCHUKHPIRG","json":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG.json","graph_json":"https://pith.science/api/pith-number/G4JZXG6727VDHEF7WCHUKHPIRG/graph.json","events_json":"https://pith.science/api/pith-number/G4JZXG6727VDHEF7WCHUKHPIRG/events.json","paper":"https://pith.science/paper/G4JZXG67"},"agent_actions":{"view_html":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG","download_json":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG.json","view_paper":"https://pith.science/paper/G4JZXG67","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.07072&json=true","fetch_graph":"https://pith.science/api/pith-number/G4JZXG6727VDHEF7WCHUKHPIRG/graph.json","fetch_events":"https://pith.science/api/pith-number/G4JZXG6727VDHEF7WCHUKHPIRG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG/action/storage_attestation","attest_author":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG/action/author_attestation","sign_citation":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG/action/citation_signature","submit_replication":"https://pith.science/pith/G4JZXG6727VDHEF7WCHUKHPIRG/action/replication_record"}},"created_at":"2026-05-18T00:14:22.012117+00:00","updated_at":"2026-05-18T00:14:22.012117+00:00"}