{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DMCZBEJFGYHI5JKSLJYP2YM4S4","short_pith_number":"pith:DMCZBEJF","schema_version":"1.0","canonical_sha256":"1b05909125360e8ea5525a70fd619c970498817f24ec4ddc5f624189c8b86833","source":{"kind":"arxiv","id":"2508.12034","version":1},"attestation_state":"computed","paper":{"title":"Spectral Tur\\'an-type problem in non-$r$-partite graphs: Forbidden generalized book graph $B_{r,k}$","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-16T13:18:49Z","abstract_excerpt":"Given a graph $H$, a graph is said to be $H$-free if it does not contain $H$ as a subgraph. A graph is color-critical when it has an edge whose removal leads to a reduction in its chromatic number. For a graph $H$ with a chromatic number of \\(r + 1\\), we use \\(\\text{spex}_{r + 1}(n, H)\\) to represent the maximum spectral radius among non-$r$-partite $H$-free graphs of order $n$. The set of all non-$r$-partite $H$-free graphs of order $n$ that have a spectral radius of \\(\\text{spex}_{r + 1}(n, H)\\) is denoted as \\(\\text{SPEX}_{r + 1}(n, H)\\). For \\(r\\geq2\\) and \\(k\\geq1\\), we define \\(B_{r,k}\\)"},"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.12034","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-16T13:18:49Z","cross_cats_sorted":[],"title_canon_sha256":"4b60e897b6e43c076c23f0c7e37f58e3970d17d649190fb0e43522583222494a","abstract_canon_sha256":"01e9811325ac60cabe1074cc5f404477b250148339ebd5671b8bad383c8d3308"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:59.064713Z","signature_b64":"hLiXnUrDlntcoFRj667l5TgLbOLoGkNZOpb7ZHAu8Ngd7pKp7KLiYHN2etQTuDeliE1rGuHyYZT4FcFDXSq8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b05909125360e8ea5525a70fd619c970498817f24ec4ddc5f624189c8b86833","last_reissued_at":"2026-07-05T11:54:59.064225Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:59.064225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral Tur\\'an-type problem in non-$r$-partite graphs: Forbidden generalized book graph $B_{r,k}$","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-16T13:18:49Z","abstract_excerpt":"Given a graph $H$, a graph is said to be $H$-free if it does not contain $H$ as a subgraph. A graph is color-critical when it has an edge whose removal leads to a reduction in its chromatic number. For a graph $H$ with a chromatic number of \\(r + 1\\), we use \\(\\text{spex}_{r + 1}(n, H)\\) to represent the maximum spectral radius among non-$r$-partite $H$-free graphs of order $n$. The set of all non-$r$-partite $H$-free graphs of order $n$ that have a spectral radius of \\(\\text{spex}_{r + 1}(n, H)\\) is denoted as \\(\\text{SPEX}_{r + 1}(n, H)\\). For \\(r\\geq2\\) and \\(k\\geq1\\), we define \\(B_{r,k}\\)"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12034","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.12034/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.12034","created_at":"2026-07-05T11:54:59.064289+00:00"},{"alias_kind":"arxiv_version","alias_value":"2508.12034v1","created_at":"2026-07-05T11:54:59.064289+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12034","created_at":"2026-07-05T11:54:59.064289+00:00"},{"alias_kind":"pith_short_12","alias_value":"DMCZBEJFGYHI","created_at":"2026-07-05T11:54:59.064289+00:00"},{"alias_kind":"pith_short_16","alias_value":"DMCZBEJFGYHI5JKS","created_at":"2026-07-05T11:54:59.064289+00:00"},{"alias_kind":"pith_short_8","alias_value":"DMCZBEJF","created_at":"2026-07-05T11:54:59.064289+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2607.00561","citing_title":"A reduction principle for non-$r$-partite spectral extremal problems, with a complete multipartite classification","ref_index":16,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4","json":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4.json","graph_json":"https://pith.science/api/pith-number/DMCZBEJFGYHI5JKSLJYP2YM4S4/graph.json","events_json":"https://pith.science/api/pith-number/DMCZBEJFGYHI5JKSLJYP2YM4S4/events.json","paper":"https://pith.science/paper/DMCZBEJF"},"agent_actions":{"view_html":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4","download_json":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4.json","view_paper":"https://pith.science/paper/DMCZBEJF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2508.12034&json=true","fetch_graph":"https://pith.science/api/pith-number/DMCZBEJFGYHI5JKSLJYP2YM4S4/graph.json","fetch_events":"https://pith.science/api/pith-number/DMCZBEJFGYHI5JKSLJYP2YM4S4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/action/storage_attestation","attest_author":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/action/author_attestation","sign_citation":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/action/citation_signature","submit_replication":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/action/replication_record"}},"created_at":"2026-07-05T11:54:59.064289+00:00","updated_at":"2026-07-05T11:54:59.064289+00:00"}