{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:P75FB3WW6WBYOYAA2NJWWETOSD","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":"30293cdc7a7a0a67c78db963c1c42b6449134bcc4c19f08a901fb04731cb628b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T21:57:06Z","title_canon_sha256":"ddc9924a699ff7e90d21b365e60cf9a8b349f220d3a69777a5ca776c5fff2463"},"schema_version":"1.0","source":{"id":"2506.03418","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.03418","created_at":"2026-07-05T11:15:27Z"},{"alias_kind":"arxiv_version","alias_value":"2506.03418v1","created_at":"2026-07-05T11:15:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.03418","created_at":"2026-07-05T11:15:27Z"},{"alias_kind":"pith_short_12","alias_value":"P75FB3WW6WBY","created_at":"2026-07-05T11:15:27Z"},{"alias_kind":"pith_short_16","alias_value":"P75FB3WW6WBYOYAA","created_at":"2026-07-05T11:15:27Z"},{"alias_kind":"pith_short_8","alias_value":"P75FB3WW","created_at":"2026-07-05T11:15:27Z"}],"graph_snapshots":[{"event_id":"sha256:9f9023425ac1acd233d420a492b343d348db6d6036566af1b61e93537fd00bf0","target":"graph","created_at":"2026-07-05T11:15:27Z","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/2506.03418/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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).","authors_text":"Cory Palmer, D\\'aniel Gerbner","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T21:57:06Z","title":"Survey of generalized Tur\\'an problems -- counting subgraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.03418","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:19faeb69ee90890585d2dca83cf430ec2c80ec970ed7f7b847cad98bc94f0548","target":"record","created_at":"2026-07-05T11:15:27Z","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":"30293cdc7a7a0a67c78db963c1c42b6449134bcc4c19f08a901fb04731cb628b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-03T21:57:06Z","title_canon_sha256":"ddc9924a699ff7e90d21b365e60cf9a8b349f220d3a69777a5ca776c5fff2463"},"schema_version":"1.0","source":{"id":"2506.03418","kind":"arxiv","version":1}},"canonical_sha256":"7ffa50eed6f583876000d3536b126e90ee7f103cd6d7813d7af0aef6e864cedc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7ffa50eed6f583876000d3536b126e90ee7f103cd6d7813d7af0aef6e864cedc","first_computed_at":"2026-07-05T11:15:27.174008Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:15:27.174008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bUj+p5U1e4MxYQoz/UFTxs14jOk1VPvDR0RH/CjUvns20gPhb+ZfMK83QQxqA7VptUlsIdG5YQom8upOYXkvAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:15:27.174675Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.03418","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:19faeb69ee90890585d2dca83cf430ec2c80ec970ed7f7b847cad98bc94f0548","sha256:9f9023425ac1acd233d420a492b343d348db6d6036566af1b61e93537fd00bf0"],"state_sha256":"fe07bbd443028336c596179d9c39c0046ac6d217119204d103f2c7a78328771c"}