{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:M5CFOBEOYQYTXXE5UWMKO3LJEE","short_pith_number":"pith:M5CFOBEO","schema_version":"1.0","canonical_sha256":"674457048ec4313bdc9da598a76d692114e2415162d600efb9062cfa831e34ed","source":{"kind":"arxiv","id":"2508.07533","version":1},"attestation_state":"computed","paper":{"title":"The exact Tur\\'an number of generalized book graph $B_{r,k}$ in non-$r$-partite graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Yuantian Yu","submitted_at":"2025-08-11T01:25:34Z","abstract_excerpt":"Given a graph $H,$ we say that a graph is \\textit{$H$-free} if it does not contain $H$ as a subgraph. The Tur\\'an number $\\ex(n,H)$ of $H$ is the maximum number of edges in an $n$-vertex $H$-free graph, the set of all the corresponding extremal graphs is denoted by $\\Ex(n, H)$. The study of Tur\\'an number of graphs is a central topic in extremal graph theory. A graph is \\textit{color-critical} if it contains an edge whose deletion reduces its chromatic number. Simonovits showed that if $H$ is a color-critical graph of chromatic number $r+1,$ then for sufficiently large $n,$ $\\Ex(n, H)=\\{T_r(n)"},"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":"2508.07533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T01:25:34Z","cross_cats_sorted":[],"title_canon_sha256":"a0b99abdd1a99758d6705010816d24d2380feb3be8912b78892af504f18fb8f7","abstract_canon_sha256":"8ff36731dee035a9726bf1dedef99a885c3bbdacbad9eaa0e8855bb8bf73f230"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:51:47.729045Z","signature_b64":"MUbfrgLgdulTVtVgZvte6dyHQ8C7K1BHo7zIDzwwJUWCQxQgFUmG5Y8X4xZYWAyxlp9R2ULygVWNfGzH6kOUAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"674457048ec4313bdc9da598a76d692114e2415162d600efb9062cfa831e34ed","last_reissued_at":"2026-07-05T11:51:47.728551Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:51:47.728551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The exact Tur\\'an number of generalized book graph $B_{r,k}$ in non-$r$-partite graphs","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Yuantian Yu","submitted_at":"2025-08-11T01:25:34Z","abstract_excerpt":"Given a graph $H,$ we say that a graph is \\textit{$H$-free} if it does not contain $H$ as a subgraph. The Tur\\'an number $\\ex(n,H)$ of $H$ is the maximum number of edges in an $n$-vertex $H$-free graph, the set of all the corresponding extremal graphs is denoted by $\\Ex(n, H)$. The study of Tur\\'an number of graphs is a central topic in extremal graph theory. A graph is \\textit{color-critical} if it contains an edge whose deletion reduces its chromatic number. Simonovits showed that if $H$ is a color-critical graph of chromatic number $r+1,$ then for sufficiently large $n,$ $\\Ex(n, H)=\\{T_r(n)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07533","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/2508.07533/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":"2508.07533","created_at":"2026-07-05T11:51:47.728607+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.07533v1","created_at":"2026-07-05T11:51:47.728607+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07533","created_at":"2026-07-05T11:51:47.728607+00:00"},{"alias_kind":"pith_short_12","alias_value":"M5CFOBEOYQYT","created_at":"2026-07-05T11:51:47.728607+00:00"},{"alias_kind":"pith_short_16","alias_value":"M5CFOBEOYQYTXXE5","created_at":"2026-07-05T11:51:47.728607+00:00"},{"alias_kind":"pith_short_8","alias_value":"M5CFOBEO","created_at":"2026-07-05T11:51:47.728607+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.12034","citing_title":"Spectral Tur\\'an-type problem in non-$r$-partite graphs: Forbidden generalized book graph $B_{r,k}$","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE","json":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE.json","graph_json":"https://pith.science/api/pith-number/M5CFOBEOYQYTXXE5UWMKO3LJEE/graph.json","events_json":"https://pith.science/api/pith-number/M5CFOBEOYQYTXXE5UWMKO3LJEE/events.json","paper":"https://pith.science/paper/M5CFOBEO"},"agent_actions":{"view_html":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE","download_json":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE.json","view_paper":"https://pith.science/paper/M5CFOBEO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.07533&json=true","fetch_graph":"https://pith.science/api/pith-number/M5CFOBEOYQYTXXE5UWMKO3LJEE/graph.json","fetch_events":"https://pith.science/api/pith-number/M5CFOBEOYQYTXXE5UWMKO3LJEE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/action/storage_attestation","attest_author":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/action/author_attestation","sign_citation":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/action/citation_signature","submit_replication":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/action/replication_record"}},"created_at":"2026-07-05T11:51:47.728607+00:00","updated_at":"2026-07-05T11:51:47.728607+00:00"}