{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:ECMZYI3ZWFYZHDG63Y7MYFMHTU","short_pith_number":"pith:ECMZYI3Z","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"},"canonical_sha256":"20999c2379b171938cdede3ecc15879d29d7eec94de1cf1a7aea654382a62f12","source":{"kind":"arxiv","id":"2312.08265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.08265","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"arxiv_version","alias_value":"2312.08265v1","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08265","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"pith_short_12","alias_value":"ECMZYI3ZWFYZ","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"pith_short_16","alias_value":"ECMZYI3ZWFYZHDG6","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"pith_short_8","alias_value":"ECMZYI3Z","created_at":"2026-07-05T07:23:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:ECMZYI3ZWFYZHDG63Y7MYFMHTU","target":"record","payload":{"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"},"canonical_sha256":"20999c2379b171938cdede3ecc15879d29d7eec94de1cf1a7aea654382a62f12","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"},"source_kind":"arxiv","source_id":"2312.08265","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:23:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LOn9YxO/TfD/SjqOOm/gx+rblFsF93ids1Pc8tC4ylxEEz059oGEiamVs4v+nJWt1OUgKsI5AGNyuSSNOSDbDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:15:22.017331Z"},"content_sha256":"a653d2f0a913ac5816b8c248a906e38e26004558e3e2c2790cb0396297716571","schema_version":"1.0","event_id":"sha256:a653d2f0a913ac5816b8c248a906e38e26004558e3e2c2790cb0396297716571"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:ECMZYI3ZWFYZHDG63Y7MYFMHTU","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T07:23:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fn1R+y6VkUvLbsWhSZ0lzifFt8RRBRRHQ/2elWf6ZetaT1M/v7ly4GlH1YN4XpuwiiN+PP2o1J8tSsv3fRhJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T16:15:22.017827Z"},"content_sha256":"fa2bf21b76b8ae406ff37f6aae4fabc46203528d30276b717f04a3f2683748be","schema_version":"1.0","event_id":"sha256:fa2bf21b76b8ae406ff37f6aae4fabc46203528d30276b717f04a3f2683748be"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/bundle.json","state_url":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-08T16:15:22Z","links":{"resolver":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU","bundle":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/bundle.json","state":"https://pith.science/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ECMZYI3ZWFYZHDG63Y7MYFMHTU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:ECMZYI3ZWFYZHDG63Y7MYFMHTU","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":"4c166aa7a619df36efdf022db96d9cb65e71083aaa5cd2a380383e4044538159","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-13T16:24:56Z","title_canon_sha256":"5df65d1a8b5a7f0297eda4f2fd0c6808a93abedd5c5bb6f566d68b0aa3d4fb74"},"schema_version":"1.0","source":{"id":"2312.08265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.08265","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"arxiv_version","alias_value":"2312.08265v1","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.08265","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"pith_short_12","alias_value":"ECMZYI3ZWFYZ","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"pith_short_16","alias_value":"ECMZYI3ZWFYZHDG6","created_at":"2026-07-05T07:23:43Z"},{"alias_kind":"pith_short_8","alias_value":"ECMZYI3Z","created_at":"2026-07-05T07:23:43Z"}],"graph_snapshots":[{"event_id":"sha256:fa2bf21b76b8ae406ff37f6aae4fabc46203528d30276b717f04a3f2683748be","target":"graph","created_at":"2026-07-05T07:23:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.08265/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Benjamin Gunby, Bhargav Narayanan, Quentin Dubroff, Sam Spiro","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-13T16:24:56Z","title":"Clique Supersaturation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.08265","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:a653d2f0a913ac5816b8c248a906e38e26004558e3e2c2790cb0396297716571","target":"record","created_at":"2026-07-05T07:23:43Z","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":"4c166aa7a619df36efdf022db96d9cb65e71083aaa5cd2a380383e4044538159","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2023-12-13T16:24:56Z","title_canon_sha256":"5df65d1a8b5a7f0297eda4f2fd0c6808a93abedd5c5bb6f566d68b0aa3d4fb74"},"schema_version":"1.0","source":{"id":"2312.08265","kind":"arxiv","version":1}},"canonical_sha256":"20999c2379b171938cdede3ecc15879d29d7eec94de1cf1a7aea654382a62f12","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"20999c2379b171938cdede3ecc15879d29d7eec94de1cf1a7aea654382a62f12","first_computed_at":"2026-07-05T07:23:43.671724Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:23:43.671724Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AK89INiOKmNzJT/GRa+yfeCqiXmN81us7YgFZODL/KtxB+OpY1poG7+mVjPlxPojy6C2VbFdiqC3rx4zLDSzAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:23:43.672180Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.08265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a653d2f0a913ac5816b8c248a906e38e26004558e3e2c2790cb0396297716571","sha256:fa2bf21b76b8ae406ff37f6aae4fabc46203528d30276b717f04a3f2683748be"],"state_sha256":"2c89365f31390ebd2a81d317829453542443e644a2ed92a88e33ca8215b5a3c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nkdDIc8aGF65eVT8GiPFq3PaS+OI76FSJIvAOATmtw7VMqSsGrXlcg3WUN5H1ImwOC0kWsL2dBCf4FtPz8U3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T16:15:22.022589Z","bundle_sha256":"071c6ee60cf43a2063ea5d83acec5b65f7e22a728dd783db6cf100be3a5b8a4c"}}