{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:QT2Q4ZI67W2XVPEORNJCFJHD5H","short_pith_number":"pith:QT2Q4ZI6","schema_version":"1.0","canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","source":{"kind":"arxiv","id":"2310.08081","version":1},"attestation_state":"computed","paper":{"title":"Supersaturation beyond color-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Long-tu Yuan","submitted_at":"2023-10-12T07:10:22Z","abstract_excerpt":"The supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erd\\H{o}s, and Lov\\'{a}sz and Simonovits determine the optimal range of $q$ (which is linear in $n$) for cliques $F$ such that $h_F(n,q)$ equals the minimum number $t_F(n,q)$ of copies of $F$ obtained from a maximum $F$-free $n$-vertex graph by adding $q$ new edges. A breakthrough result of Mubayi extends this line of research from cliques to color-critical graphs $F$, and this was further strengthened by Pikhur"},"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":"2310.08081","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-12T07:10:22Z","cross_cats_sorted":[],"title_canon_sha256":"2cafd46cfe671970d6590c3a7bb2d127012c25c11821a1ae03d41ebb72f71672","abstract_canon_sha256":"a8defbbab8949d4d4ceeeb63ff6bb83dc1def6770aaa3110970197168104b2cd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:00:00.692020Z","signature_b64":"EMtr5ueircZYPmGHOskzIj2I5hyDXqcV4rMiaO/BcSvGxjQfSnJtquwLfgqTcU9XYG36KVk1pbWfHAEWVlEqAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"84f50e651efdb57abc8e8b5222a4e3e9e53265ccce8b11497fe150146d6f722f","last_reissued_at":"2026-07-05T07:00:00.691585Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:00:00.691585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supersaturation beyond color-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Ma, Long-tu Yuan","submitted_at":"2023-10-12T07:10:22Z","abstract_excerpt":"The supersaturation problem for a given graph $F$ asks for the minimum number $h_F(n,q)$ of copies of $F$ in an $n$-vertex graph with $ex(n,F)+q$ edges. Subsequent works by Rademacher, Erd\\H{o}s, and Lov\\'{a}sz and Simonovits determine the optimal range of $q$ (which is linear in $n$) for cliques $F$ such that $h_F(n,q)$ equals the minimum number $t_F(n,q)$ of copies of $F$ obtained from a maximum $F$-free $n$-vertex graph by adding $q$ new edges. A breakthrough result of Mubayi extends this line of research from cliques to color-critical graphs $F$, and this was further strengthened by Pikhur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.08081","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/2310.08081/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":"2310.08081","created_at":"2026-07-05T07:00:00.691640+00:00"},{"alias_kind":"arxiv_version","alias_value":"2310.08081v1","created_at":"2026-07-05T07:00:00.691640+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.08081","created_at":"2026-07-05T07:00:00.691640+00:00"},{"alias_kind":"pith_short_12","alias_value":"QT2Q4ZI67W2X","created_at":"2026-07-05T07:00:00.691640+00:00"},{"alias_kind":"pith_short_16","alias_value":"QT2Q4ZI67W2XVPEO","created_at":"2026-07-05T07:00:00.691640+00:00"},{"alias_kind":"pith_short_8","alias_value":"QT2Q4ZI6","created_at":"2026-07-05T07:00:00.691640+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/QT2Q4ZI67W2XVPEORNJCFJHD5H","json":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H.json","graph_json":"https://pith.science/api/pith-number/QT2Q4ZI67W2XVPEORNJCFJHD5H/graph.json","events_json":"https://pith.science/api/pith-number/QT2Q4ZI67W2XVPEORNJCFJHD5H/events.json","paper":"https://pith.science/paper/QT2Q4ZI6"},"agent_actions":{"view_html":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H","download_json":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H.json","view_paper":"https://pith.science/paper/QT2Q4ZI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2310.08081&json=true","fetch_graph":"https://pith.science/api/pith-number/QT2Q4ZI67W2XVPEORNJCFJHD5H/graph.json","fetch_events":"https://pith.science/api/pith-number/QT2Q4ZI67W2XVPEORNJCFJHD5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/action/storage_attestation","attest_author":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/action/author_attestation","sign_citation":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/action/citation_signature","submit_replication":"https://pith.science/pith/QT2Q4ZI67W2XVPEORNJCFJHD5H/action/replication_record"}},"created_at":"2026-07-05T07:00:00.691640+00:00","updated_at":"2026-07-05T07:00:00.691640+00:00"}