{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ECMZYI3ZWFYZHDG63Y7MYFMHTU","short_pith_number":"pith:ECMZYI3Z","schema_version":"1.0","canonical_sha256":"20999c2379b171938cdede3ecc15879d29d7eec94de1cf1a7aea654382a62f12","source":{"kind":"arxiv","id":"2312.08265","version":1},"attestation_state":"computed","paper":{"title":"Clique Supersaturation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Gunby, Bhargav Narayanan, Quentin Dubroff, Sam Spiro","submitted_at":"2023-12-13T16:24:56Z","abstract_excerpt":"We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles and $k$ is sufficiently large in terms of $t$, then $G$ contains at least\n  \\[\\Omega(\\min\\{k^t n^{3/2},k^{\\frac{2t^2}{3t-1}}n^{\\frac{5t-2}{3t-1}}\\})\\]\n  copies of $K_{2,t}$, and furthermore, we show these bounds are essentially best-possible provided either $k\\ge n^{1/2t}$ or if certain bipartite-analogues of well known conjectures for Tur\\'an numbers hold."},"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":"2312.08265","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-13T16:24:56Z","cross_cats_sorted":[],"title_canon_sha256":"5df65d1a8b5a7f0297eda4f2fd0c6808a93abedd5c5bb6f566d68b0aa3d4fb74","abstract_canon_sha256":"4c166aa7a619df36efdf022db96d9cb65e71083aaa5cd2a380383e4044538159"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:23:43.672180Z","signature_b64":"AK89INiOKmNzJT/GRa+yfeCqiXmN81us7YgFZODL/KtxB+OpY1poG7+mVjPlxPojy6C2VbFdiqC3rx4zLDSzAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20999c2379b171938cdede3ecc15879d29d7eec94de1cf1a7aea654382a62f12","last_reissued_at":"2026-07-05T07:23:43.671724Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:23:43.671724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Clique Supersaturation","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benjamin Gunby, Bhargav Narayanan, Quentin Dubroff, Sam Spiro","submitted_at":"2023-12-13T16:24:56Z","abstract_excerpt":"We study how many copies of a graph $F$ that another graph $G$ with a given number of cliques is guaranteed to have. For example, one of our main results states that for all $t\\ge 2$, if $G$ is an $n$ vertex graph with $kn^{3/2}$ triangles and $k$ is sufficiently large in terms of $t$, then $G$ contains at least\n  \\[\\Omega(\\min\\{k^t n^{3/2},k^{\\frac{2t^2}{3t-1}}n^{\\frac{5t-2}{3t-1}}\\})\\]\n  copies of $K_{2,t}$, and furthermore, we show these bounds are essentially best-possible provided either $k\\ge n^{1/2t}$ or if certain bipartite-analogues of well known conjectures for Tur\\'an numbers hold."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08265","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.08265/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.08265","created_at":"2026-07-05T07:23:43.671801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.08265v1","created_at":"2026-07-05T07:23:43.671801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08265","created_at":"2026-07-05T07:23:43.671801+00:00"},{"alias_kind":"pith_short_12","alias_value":"ECMZYI3ZWFYZ","created_at":"2026-07-05T07:23:43.671801+00:00"},{"alias_kind":"pith_short_16","alias_value":"ECMZYI3ZWFYZHDG6","created_at":"2026-07-05T07:23:43.671801+00:00"},{"alias_kind":"pith_short_8","alias_value":"ECMZYI3Z","created_at":"2026-07-05T07:23:43.671801+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.09020","citing_title":"Induced rational exponents and bipartite subgraphs in $K_{s, s}$-free graphs","ref_index":14,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU","json":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU.json","graph_json":"https://pith.science/api/pith-number/ECMZYI3ZWFYZHDG63Y7MYFMHTU/graph.json","events_json":"https://pith.science/api/pith-number/ECMZYI3ZWFYZHDG63Y7MYFMHTU/events.json","paper":"https://pith.science/paper/ECMZYI3Z"},"agent_actions":{"view_html":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU","download_json":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU.json","view_paper":"https://pith.science/paper/ECMZYI3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.08265&json=true","fetch_graph":"https://pith.science/api/pith-number/ECMZYI3ZWFYZHDG63Y7MYFMHTU/graph.json","fetch_events":"https://pith.science/api/pith-number/ECMZYI3ZWFYZHDG63Y7MYFMHTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/action/storage_attestation","attest_author":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/action/author_attestation","sign_citation":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/action/citation_signature","submit_replication":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/action/replication_record"}},"created_at":"2026-07-05T07:23:43.671801+00:00","updated_at":"2026-07-05T07:23:43.671801+00:00"}