{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:P3T7VFYVTAMAZBNDB5OPZOFQHD","short_pith_number":"pith:P3T7VFYV","schema_version":"1.0","canonical_sha256":"7ee7fa971598180c85a30f5cfcb8b038c417ac06f626cba95ad21885fb0377b0","source":{"kind":"arxiv","id":"1208.4319","version":3},"attestation_state":"computed","paper":{"title":"Supersaturation Problem for Color-Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oleg Pikhurko, Zelealem B. Yilma","submitted_at":"2012-08-21T17:45:29Z","abstract_excerpt":"The \\emph{Tur\\'an function} $\\ex(n,F)$ of a graph $F$ is the maximum number of edges in an $F$-free graph with $n$ vertices. The classical results of Tur\\'an and Rademacher from 1941 led to the study of supersaturated graphs where the key question is to determine $h_F(n,q)$, the minimum number of copies of $F$ that a graph with $n$ vertices and $\\ex(n,F)+q$ edges can have.\n  We determine $h_F(n,q)$ asymptotically when $F$ is \\emph{color-critical} (that is, $F$ contains an edge whose deletion reduces its chromatic number) and $q=o(n^2)$.\n  Determining the exact value of $h_F(n,q)$ seems rather "},"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":"1208.4319","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-21T17:45:29Z","cross_cats_sorted":[],"title_canon_sha256":"4f5c723597eff05cba7a1a82575334d3abda60ec142d1af7a2ac4b49a77bfdd5","abstract_canon_sha256":"49a153f26e57c49f0c2d1e61829ed2e458e546b8c1c607a565b462457d08fa5f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:10.673021Z","signature_b64":"fVlvUvr7wArmHlStdWUQ9/AXf5oS0V629ArCEQtFQmB1sLjGqHjosQ38Gv01x/u3QCPedoQW12uqWPx0bn+mAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ee7fa971598180c85a30f5cfcb8b038c417ac06f626cba95ad21885fb0377b0","last_reissued_at":"2026-05-18T01:00:10.672257Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:10.672257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Supersaturation Problem for Color-Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Oleg Pikhurko, Zelealem B. Yilma","submitted_at":"2012-08-21T17:45:29Z","abstract_excerpt":"The \\emph{Tur\\'an function} $\\ex(n,F)$ of a graph $F$ is the maximum number of edges in an $F$-free graph with $n$ vertices. The classical results of Tur\\'an and Rademacher from 1941 led to the study of supersaturated graphs where the key question is to determine $h_F(n,q)$, the minimum number of copies of $F$ that a graph with $n$ vertices and $\\ex(n,F)+q$ edges can have.\n  We determine $h_F(n,q)$ asymptotically when $F$ is \\emph{color-critical} (that is, $F$ contains an edge whose deletion reduces its chromatic number) and $q=o(n^2)$.\n  Determining the exact value of $h_F(n,q)$ seems rather "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.4319","kind":"arxiv","version":3},"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":"1208.4319","created_at":"2026-05-18T01:00:10.672399+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.4319v3","created_at":"2026-05-18T01:00:10.672399+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.4319","created_at":"2026-05-18T01:00:10.672399+00:00"},{"alias_kind":"pith_short_12","alias_value":"P3T7VFYVTAMA","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_16","alias_value":"P3T7VFYVTAMAZBND","created_at":"2026-05-18T12:27:18.751474+00:00"},{"alias_kind":"pith_short_8","alias_value":"P3T7VFYV","created_at":"2026-05-18T12:27:18.751474+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/P3T7VFYVTAMAZBNDB5OPZOFQHD","json":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD.json","graph_json":"https://pith.science/api/pith-number/P3T7VFYVTAMAZBNDB5OPZOFQHD/graph.json","events_json":"https://pith.science/api/pith-number/P3T7VFYVTAMAZBNDB5OPZOFQHD/events.json","paper":"https://pith.science/paper/P3T7VFYV"},"agent_actions":{"view_html":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD","download_json":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD.json","view_paper":"https://pith.science/paper/P3T7VFYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.4319&json=true","fetch_graph":"https://pith.science/api/pith-number/P3T7VFYVTAMAZBNDB5OPZOFQHD/graph.json","fetch_events":"https://pith.science/api/pith-number/P3T7VFYVTAMAZBNDB5OPZOFQHD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD/action/storage_attestation","attest_author":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD/action/author_attestation","sign_citation":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD/action/citation_signature","submit_replication":"https://pith.science/pith/P3T7VFYVTAMAZBNDB5OPZOFQHD/action/replication_record"}},"created_at":"2026-05-18T01:00:10.672399+00:00","updated_at":"2026-05-18T01:00:10.672399+00:00"}