{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DMCZBEJFGYHI5JKSLJYP2YM4S4","short_pith_number":"pith:DMCZBEJF","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"},"canonical_sha256":"1b05909125360e8ea5525a70fd619c970498817f24ec4ddc5f624189c8b86833","source":{"kind":"arxiv","id":"2508.12034","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.12034","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"2508.12034v1","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12034","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"DMCZBEJFGYHI","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"pith_short_16","alias_value":"DMCZBEJFGYHI5JKS","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"pith_short_8","alias_value":"DMCZBEJF","created_at":"2026-07-05T11:54:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DMCZBEJFGYHI5JKSLJYP2YM4S4","target":"record","payload":{"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"},"canonical_sha256":"1b05909125360e8ea5525a70fd619c970498817f24ec4ddc5f624189c8b86833","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"},"source_kind":"arxiv","source_id":"2508.12034","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:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0BB9xTU46a23AkPEhQOv2irkUwLfQcmWHqow20mlvp8OpaRwKPaqdclWD7KT8SjsUjQvj59AIwdwHkfXVawDCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:12:57.102539Z"},"content_sha256":"4fc8220ea2b706266c57b62b73e087afb86455b52be8979c876fa3a4ae1f0804","schema_version":"1.0","event_id":"sha256:4fc8220ea2b706266c57b62b73e087afb86455b52be8979c876fa3a4ae1f0804"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DMCZBEJFGYHI5JKSLJYP2YM4S4","target":"graph","payload":{"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"},"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:54:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a5It7bAsazrUIjm/bR9CQ4CU+h5qd5CWucF6jwJhdxaD94HeChaGWoQBTVE5jWwYhj6N6CbDAGSM0vb3M3DiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T14:12:57.103132Z"},"content_sha256":"f3bd8ba7467f32ee6eb37ca3e88eefd933db4ebac12751b9c1c2a61ece6a8d39","schema_version":"1.0","event_id":"sha256:f3bd8ba7467f32ee6eb37ca3e88eefd933db4ebac12751b9c1c2a61ece6a8d39"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/bundle.json","state_url":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/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-06T14:12:57Z","links":{"resolver":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4","bundle":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/bundle.json","state":"https://pith.science/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DMCZBEJFGYHI5JKSLJYP2YM4S4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DMCZBEJFGYHI5JKSLJYP2YM4S4","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":"01e9811325ac60cabe1074cc5f404477b250148339ebd5671b8bad383c8d3308","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-16T13:18:49Z","title_canon_sha256":"4b60e897b6e43c076c23f0c7e37f58e3970d17d649190fb0e43522583222494a"},"schema_version":"1.0","source":{"id":"2508.12034","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2508.12034","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"arxiv_version","alias_value":"2508.12034v1","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2508.12034","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"pith_short_12","alias_value":"DMCZBEJFGYHI","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"pith_short_16","alias_value":"DMCZBEJFGYHI5JKS","created_at":"2026-07-05T11:54:59Z"},{"alias_kind":"pith_short_8","alias_value":"DMCZBEJF","created_at":"2026-07-05T11:54:59Z"}],"graph_snapshots":[{"event_id":"sha256:f3bd8ba7467f32ee6eb37ca3e88eefd933db4ebac12751b9c1c2a61ece6a8d39","target":"graph","created_at":"2026-07-05T11:54:59Z","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.12034/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}\\)","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-16T13:18:49Z","title":"Spectral Tur\\'an-type problem in non-$r$-partite graphs: Forbidden generalized book graph $B_{r,k}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2508.12034","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:4fc8220ea2b706266c57b62b73e087afb86455b52be8979c876fa3a4ae1f0804","target":"record","created_at":"2026-07-05T11:54:59Z","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":"01e9811325ac60cabe1074cc5f404477b250148339ebd5671b8bad383c8d3308","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"math.CO","submitted_at":"2025-08-16T13:18:49Z","title_canon_sha256":"4b60e897b6e43c076c23f0c7e37f58e3970d17d649190fb0e43522583222494a"},"schema_version":"1.0","source":{"id":"2508.12034","kind":"arxiv","version":1}},"canonical_sha256":"1b05909125360e8ea5525a70fd619c970498817f24ec4ddc5f624189c8b86833","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b05909125360e8ea5525a70fd619c970498817f24ec4ddc5f624189c8b86833","first_computed_at":"2026-07-05T11:54:59.064225Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:54:59.064225Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hLiXnUrDlntcoFRj667l5TgLbOLoGkNZOpb7ZHAu8Ngd7pKp7KLiYHN2etQTuDeliE1rGuHyYZT4FcFDXSq8Dw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:54:59.064713Z","signed_message":"canonical_sha256_bytes"},"source_id":"2508.12034","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fc8220ea2b706266c57b62b73e087afb86455b52be8979c876fa3a4ae1f0804","sha256:f3bd8ba7467f32ee6eb37ca3e88eefd933db4ebac12751b9c1c2a61ece6a8d39"],"state_sha256":"a5200b3e50f907011345e7c76ad2d6e21319bdd1e5231e1073e22ee750fb5e96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p7Fo5YJmUUAvjKmc2juKPEt0JcYSKAwRiS5PoLlY5ccB9nhfjhLTBSuwTy78UF2smiTcno9pqMW0TAxpe9P6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T14:12:57.107728Z","bundle_sha256":"ec28760957d7a8173c52da25cb1b5f3e6e6f55fc136889e7354b0a4a922c193f"}}