{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AVUSYFPH3VKZMQ7QU3RVMCGYLX","short_pith_number":"pith:AVUSYFPH","schema_version":"1.0","canonical_sha256":"05692c15e7dd559643f0a6e35608d85ddf813af05e7fe40251808780ea26a398","source":{"kind":"arxiv","id":"1810.00817","version":1},"attestation_state":"computed","paper":{"title":"On the maximum number of copies of H in graphs with given size and order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","submitted_at":"2018-10-01T16:54:00Z","abstract_excerpt":"We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge density is sufficiently large. We also investigate a variant of this problem, when the host graph is bipartite."},"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":"1810.00817","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-01T16:54:00Z","cross_cats_sorted":[],"title_canon_sha256":"7551a3e34d42ce36fb88cad7e3bc3a11bc488c881efd64429e24a7d3149cbb72","abstract_canon_sha256":"0d88ff4a1af12e0e60068decdc31b7d9e5671de1276a9fdb269caecf89c6a5ab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:24.765685Z","signature_b64":"JG8AnRsfmIGA61XbYNvnoqEN3aMZWsCYI+QaZRGgAQEa56bWT5m4Je+cuVytZnt75/12oCyN2Vx6xd2yAy1XDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05692c15e7dd559643f0a6e35608d85ddf813af05e7fe40251808780ea26a398","last_reissued_at":"2026-05-18T00:04:24.765171Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:24.765171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the maximum number of copies of H in graphs with given size and order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\'aniel T. Nagy, M\\'at\\'e Vizer","submitted_at":"2018-10-01T16:54:00Z","abstract_excerpt":"We study the maximum number $ex(n,e,H)$ of copies of a graph $H$ in graphs with given number of vertices and edges. We show that for any fixed graph $H$, $ex(n,e,H)$ is asymptotically realized by the quasi-clique provided that the edge density is sufficiently large. We also investigate a variant of this problem, when the host graph is bipartite."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.00817","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":"1810.00817","created_at":"2026-05-18T00:04:24.765255+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.00817v1","created_at":"2026-05-18T00:04:24.765255+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.00817","created_at":"2026-05-18T00:04:24.765255+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVUSYFPH3VKZ","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVUSYFPH3VKZMQ7Q","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVUSYFPH","created_at":"2026-05-18T12:32:13.499390+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/AVUSYFPH3VKZMQ7QU3RVMCGYLX","json":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX.json","graph_json":"https://pith.science/api/pith-number/AVUSYFPH3VKZMQ7QU3RVMCGYLX/graph.json","events_json":"https://pith.science/api/pith-number/AVUSYFPH3VKZMQ7QU3RVMCGYLX/events.json","paper":"https://pith.science/paper/AVUSYFPH"},"agent_actions":{"view_html":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX","download_json":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX.json","view_paper":"https://pith.science/paper/AVUSYFPH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.00817&json=true","fetch_graph":"https://pith.science/api/pith-number/AVUSYFPH3VKZMQ7QU3RVMCGYLX/graph.json","fetch_events":"https://pith.science/api/pith-number/AVUSYFPH3VKZMQ7QU3RVMCGYLX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX/action/storage_attestation","attest_author":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX/action/author_attestation","sign_citation":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX/action/citation_signature","submit_replication":"https://pith.science/pith/AVUSYFPH3VKZMQ7QU3RVMCGYLX/action/replication_record"}},"created_at":"2026-05-18T00:04:24.765255+00:00","updated_at":"2026-05-18T00:04:24.765255+00:00"}