{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:R6D3HBCKHFBAOSOFRV4WLSKFYA","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":"d83d76c679ccf23cb1e9a7165693d95dec42cb9849fbe30564680d08b1ae7697","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T11:03:45Z","title_canon_sha256":"07d0af84a4bcd14f21aaccfe36726d4d300e9dd5e387e6b26b0d01fd4029712a"},"schema_version":"1.0","source":{"id":"2506.04884","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2506.04884","created_at":"2026-07-05T11:16:38Z"},{"alias_kind":"arxiv_version","alias_value":"2506.04884v1","created_at":"2026-07-05T11:16:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04884","created_at":"2026-07-05T11:16:38Z"},{"alias_kind":"pith_short_12","alias_value":"R6D3HBCKHFBA","created_at":"2026-07-05T11:16:38Z"},{"alias_kind":"pith_short_16","alias_value":"R6D3HBCKHFBAOSOF","created_at":"2026-07-05T11:16:38Z"},{"alias_kind":"pith_short_8","alias_value":"R6D3HBCK","created_at":"2026-07-05T11:16:38Z"}],"graph_snapshots":[{"event_id":"sha256:7035745ca94c2b9669ff6a47175298ea999581ff5ceb32bef0d6d8e168cacf7a","target":"graph","created_at":"2026-07-05T11:16:38Z","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.04884/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A book graph $B_{r+1}$ is a set of $r+1$ triangles with a common edge, where $r\\geq0$ is an integer. Zhai and Lin [J. Graph Theory 102 (2023) 502-520] proved that for $n\\geq\\frac{13}{2}r$, if $G$ is a $B_{r+1}$-free graph of order $n$, then $\\rho(G)\\leq\\rho(T_{n,2})$, with equality if and only if $G\\cong T_{n,2}$. Note that the extremal graph $T_{n,2}$ is bipartite. Motivated by the above elegant result, we investigate the spectral Tur\\'{a}n problem of non-bipartite $B_{r+1}$-free graphs of order $n$. For general $r\\geq1$, let $K_{\\lfloor\\frac{n-1}{2}\\rfloor,\\lceil\\frac{n-1}{2}\\rceil}^{r, r}$ ","authors_text":"Lu Miao, Ruifang Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T11:03:45Z","title":"Spectral Tur\\'{a}n problem of non-bipartite graphs: Forbidden books"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04884","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:cad37056e644de3f16e300f3dc32c403de0f04a45ffd10a1e6a3d5a024a7aa0c","target":"record","created_at":"2026-07-05T11:16:38Z","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":"d83d76c679ccf23cb1e9a7165693d95dec42cb9849fbe30564680d08b1ae7697","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-06-05T11:03:45Z","title_canon_sha256":"07d0af84a4bcd14f21aaccfe36726d4d300e9dd5e387e6b26b0d01fd4029712a"},"schema_version":"1.0","source":{"id":"2506.04884","kind":"arxiv","version":1}},"canonical_sha256":"8f87b3844a39420749c58d7965c945c022e42aba59a384e7762b9d04783089ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f87b3844a39420749c58d7965c945c022e42aba59a384e7762b9d04783089ea","first_computed_at":"2026-07-05T11:16:38.497032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:38.497032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2swRlEIGIVirqJFp3kfXpOqsoaO204y5gRA8yQ7tjkyAexdNghknKBHcTj1oRpCM+ChPIyz7+MXfeMKWwavAAA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:38.497586Z","signed_message":"canonical_sha256_bytes"},"source_id":"2506.04884","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cad37056e644de3f16e300f3dc32c403de0f04a45ffd10a1e6a3d5a024a7aa0c","sha256:7035745ca94c2b9669ff6a47175298ea999581ff5ceb32bef0d6d8e168cacf7a"],"state_sha256":"e48047ddc5c3c2e7a4179e33980f67f85166c3dbd22ff22406f72289ce176e89"}