{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:M5CFOBEOYQYTXXE5UWMKO3LJEE","short_pith_number":"pith:M5CFOBEO","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"},"canonical_sha256":"674457048ec4313bdc9da598a76d692114e2415162d600efb9062cfa831e34ed","source":{"kind":"arxiv","id":"2508.07533","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07533","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07533v1","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07533","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"M5CFOBEOYQYT","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"pith_short_16","alias_value":"M5CFOBEOYQYTXXE5","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"pith_short_8","alias_value":"M5CFOBEO","created_at":"2026-07-05T11:51:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:M5CFOBEOYQYTXXE5UWMKO3LJEE","target":"record","payload":{"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"},"canonical_sha256":"674457048ec4313bdc9da598a76d692114e2415162d600efb9062cfa831e34ed","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"},"source_kind":"arxiv","source_id":"2508.07533","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1BD0Ykt/+vyZk/YxN/onS5eER0s7edRe8khUPEhuEnlLP2zMaQeu3niQuugdjBrg++7q1RkQeS6lSTm+CRuBAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:44:46.449621Z"},"content_sha256":"137bed19ce97e837de383d22ce5cce3cc28b87603880639c16854a5a5f6dd991","schema_version":"1.0","event_id":"sha256:137bed19ce97e837de383d22ce5cce3cc28b87603880639c16854a5a5f6dd991"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:M5CFOBEOYQYTXXE5UWMKO3LJEE","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:51:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tL1v0yMUBCINtNpTG4g6PUWRbd8dtM2Ng/4/b+Z/y2vxNJExf2pmHRqILuCbJ+kQNl5SafjpaDf42LL1Y+hqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T20:44:46.450002Z"},"content_sha256":"b969695a2cdcce2090441b5b1dd6416310d320ebfa53495c43a5d36865fb0ab6","schema_version":"1.0","event_id":"sha256:b969695a2cdcce2090441b5b1dd6416310d320ebfa53495c43a5d36865fb0ab6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/bundle.json","state_url":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-20T20:44:46Z","links":{"resolver":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE","bundle":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/bundle.json","state":"https://pith.science/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/M5CFOBEOYQYTXXE5UWMKO3LJEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:M5CFOBEOYQYTXXE5UWMKO3LJEE","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":"8ff36731dee035a9726bf1dedef99a885c3bbdacbad9eaa0e8855bb8bf73f230","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T01:25:34Z","title_canon_sha256":"a0b99abdd1a99758d6705010816d24d2380feb3be8912b78892af504f18fb8f7"},"schema_version":"1.0","source":{"id":"2508.07533","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.07533","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"arxiv_version","alias_value":"2508.07533v1","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.07533","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"pith_short_12","alias_value":"M5CFOBEOYQYT","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"pith_short_16","alias_value":"M5CFOBEOYQYTXXE5","created_at":"2026-07-05T11:51:47Z"},{"alias_kind":"pith_short_8","alias_value":"M5CFOBEO","created_at":"2026-07-05T11:51:47Z"}],"graph_snapshots":[{"event_id":"sha256:b969695a2cdcce2090441b5b1dd6416310d320ebfa53495c43a5d36865fb0ab6","target":"graph","created_at":"2026-07-05T11:51:47Z","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/2508.07533/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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)","authors_text":"Shuchao Li, Yuantian Yu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T01:25:34Z","title":"The exact Tur\\'an number of generalized book graph $B_{r,k}$ in non-$r$-partite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.07533","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:137bed19ce97e837de383d22ce5cce3cc28b87603880639c16854a5a5f6dd991","target":"record","created_at":"2026-07-05T11:51:47Z","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":"8ff36731dee035a9726bf1dedef99a885c3bbdacbad9eaa0e8855bb8bf73f230","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-11T01:25:34Z","title_canon_sha256":"a0b99abdd1a99758d6705010816d24d2380feb3be8912b78892af504f18fb8f7"},"schema_version":"1.0","source":{"id":"2508.07533","kind":"arxiv","version":1}},"canonical_sha256":"674457048ec4313bdc9da598a76d692114e2415162d600efb9062cfa831e34ed","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"674457048ec4313bdc9da598a76d692114e2415162d600efb9062cfa831e34ed","first_computed_at":"2026-07-05T11:51:47.728551Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:51:47.728551Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MUbfrgLgdulTVtVgZvte6dyHQ8C7K1BHo7zIDzwwJUWCQxQgFUmG5Y8X4xZYWAyxlp9R2ULygVWNfGzH6kOUAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:51:47.729045Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.07533","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:137bed19ce97e837de383d22ce5cce3cc28b87603880639c16854a5a5f6dd991","sha256:b969695a2cdcce2090441b5b1dd6416310d320ebfa53495c43a5d36865fb0ab6"],"state_sha256":"d6dd8e07c79e1ee277e256437b7297c7855e63bd92e428ccc60a7f566bf6afc0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OqqO405Q/0skN9/2tQZyZLisEMMsR3o/SfThlnoZBlC9e9xNQEnm/zsQsIc0dO7ES2xiKznEEFVIGLAoBiuoBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T20:44:46.453626Z","bundle_sha256":"61fd0ba6fe4323b531da667820064e26e41a220afef1f809bd3c232a477c3edf"}}