{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:P75FB3WW6WBYOYAA2NJWWETOSD","short_pith_number":"pith:P75FB3WW","schema_version":"1.0","canonical_sha256":"7ffa50eed6f583876000d3536b126e90ee7f103cd6d7813d7af0aef6e864cedc","source":{"kind":"arxiv","id":"2506.03418","version":1},"attestation_state":"computed","paper":{"title":"Survey of generalized Tur\\'an problems -- counting subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory Palmer, D\\'aniel Gerbner","submitted_at":"2025-06-03T21:57:06Z","abstract_excerpt":"For fixed graphs $H$ and $F$, the \\emph{generalized Tur\\'an number} $\\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose study was initiated in an influential 2016 article by Alon and Shikhelman (\\emph{J. Combin. Theory, B}, {\\bf 121}, 2016)."},"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":"2506.03418","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T21:57:06Z","cross_cats_sorted":[],"title_canon_sha256":"ddc9924a699ff7e90d21b365e60cf9a8b349f220d3a69777a5ca776c5fff2463","abstract_canon_sha256":"30293cdc7a7a0a67c78db963c1c42b6449134bcc4c19f08a901fb04731cb628b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:27.174675Z","signature_b64":"bUj+p5U1e4MxYQoz/UFTxs14jOk1VPvDR0RH/CjUvns20gPhb+ZfMK83QQxqA7VptUlsIdG5YQom8upOYXkvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7ffa50eed6f583876000d3536b126e90ee7f103cd6d7813d7af0aef6e864cedc","last_reissued_at":"2026-07-05T11:15:27.174008Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:27.174008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Survey of generalized Tur\\'an problems -- counting subgraphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cory Palmer, D\\'aniel Gerbner","submitted_at":"2025-06-03T21:57:06Z","abstract_excerpt":"For fixed graphs $H$ and $F$, the \\emph{generalized Tur\\'an number} $\\mathrm{ex}(n,H,F)$ is the maximum possible number of copies of a subgraph $H$ in an $n$-vertex $F$-free graph. This article is a survey of this extremal function whose study was initiated in an influential 2016 article by Alon and Shikhelman (\\emph{J. Combin. Theory, B}, {\\bf 121}, 2016)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03418","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/2506.03418/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":"2506.03418","created_at":"2026-07-05T11:15:27.174093+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.03418v1","created_at":"2026-07-05T11:15:27.174093+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03418","created_at":"2026-07-05T11:15:27.174093+00:00"},{"alias_kind":"pith_short_12","alias_value":"P75FB3WW6WBY","created_at":"2026-07-05T11:15:27.174093+00:00"},{"alias_kind":"pith_short_16","alias_value":"P75FB3WW6WBYOYAA","created_at":"2026-07-05T11:15:27.174093+00:00"},{"alias_kind":"pith_short_8","alias_value":"P75FB3WW","created_at":"2026-07-05T11:15:27.174093+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00770","citing_title":"Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00212","citing_title":"Strong Majority Edge-Coloring","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2607.00770","citing_title":"Further Results on the Maximum Number of Stars in Graphs with Forbidden Properties","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2605.25905","citing_title":"$K_{2,t+1}$-free graphs with many copies of $K_{t,t}$","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02855","citing_title":"$K_{2, t+1}$-free graphs containing an optimal number of $K_{t, t}$'s","ref_index":2,"is_internal_anchor":false},{"citing_arxiv_id":"2604.06357","citing_title":"Helly Theorems for Generalized Tur\\'an Problems","ref_index":15,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18217","citing_title":"Generalized Tur\\'an problems for Berge hypergraphs","ref_index":19,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD","json":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD.json","graph_json":"https://pith.science/api/pith-number/P75FB3WW6WBYOYAA2NJWWETOSD/graph.json","events_json":"https://pith.science/api/pith-number/P75FB3WW6WBYOYAA2NJWWETOSD/events.json","paper":"https://pith.science/paper/P75FB3WW"},"agent_actions":{"view_html":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD","download_json":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD.json","view_paper":"https://pith.science/paper/P75FB3WW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.03418&json=true","fetch_graph":"https://pith.science/api/pith-number/P75FB3WW6WBYOYAA2NJWWETOSD/graph.json","fetch_events":"https://pith.science/api/pith-number/P75FB3WW6WBYOYAA2NJWWETOSD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD/action/storage_attestation","attest_author":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD/action/author_attestation","sign_citation":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD/action/citation_signature","submit_replication":"https://pith.science/pith/P75FB3WW6WBYOYAA2NJWWETOSD/action/replication_record"}},"created_at":"2026-07-05T11:15:27.174093+00:00","updated_at":"2026-07-05T11:15:27.174093+00:00"}