{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:LVLC554PRHG7BXFSKQWLJYQUIM","short_pith_number":"pith:LVLC554P","schema_version":"1.0","canonical_sha256":"5d562ef78f89cdf0dcb2542cb4e214432d4ceb9e8db0a0930a99e337ebae5fc4","source":{"kind":"arxiv","id":"2608.05947","version":1},"attestation_state":"computed","paper":{"title":"On a spectral booksize problem fo non bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benju Wang, Jinlong Shu, ZhenZhen Lou","submitted_at":"2026-08-06T12:17:33Z","abstract_excerpt":"The $\\text{bk}(G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. Motivated by a classical conjecture of Erd\\H{o}s, spectral lower bounds for the booksize have received considerable attention. For a positive divisor $s$ of $m-1$ with $\\frac{m-1}{s}\\ge2$, let $S_{m,s}^{+}$ be obtained from $K_{s,\\frac{m-1}{s}}$ by adding one edge inside the part of order $\\frac{m-1}{s}$. Zhai et al. proved that, apart from this explicit family, every $m$-edge non-bipartite graph satisfying $\\rho(G)^2\\ge m-1+\\frac{2}{\\rho(G)-1}$ has booksize greater than $\\frac{1}{240}\\sqrt{m}$, and the"},"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":"2608.05947","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T12:17:33Z","cross_cats_sorted":[],"title_canon_sha256":"48c98238c710c40291180bcb39bf0f90e9914a3e46c289b554a04ffa873a6863","abstract_canon_sha256":"bf10f040fae640addd3c4d807f4eb2dab09af04d60aa1c45fb352a7d337fd580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-07T00:53:55.864750Z","signature_b64":"eWERynO7XTiVTYZG0RRNYTo+t93XjL9QP7hsiUqXnKQk7zTctVQRLdKYqQgd9yftmYx5qDrUjmUvnHaunxBCCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5d562ef78f89cdf0dcb2542cb4e214432d4ceb9e8db0a0930a99e337ebae5fc4","last_reissued_at":"2026-08-07T00:53:55.863381Z","signature_status":"signed_v1","first_computed_at":"2026-08-07T00:53:55.863381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On a spectral booksize problem fo non bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benju Wang, Jinlong Shu, ZhenZhen Lou","submitted_at":"2026-08-06T12:17:33Z","abstract_excerpt":"The $\\text{bk}(G)$ of a graph $G$ is the maximum number of triangles sharing a common edge. Motivated by a classical conjecture of Erd\\H{o}s, spectral lower bounds for the booksize have received considerable attention. For a positive divisor $s$ of $m-1$ with $\\frac{m-1}{s}\\ge2$, let $S_{m,s}^{+}$ be obtained from $K_{s,\\frac{m-1}{s}}$ by adding one edge inside the part of order $\\frac{m-1}{s}$. Zhai et al. proved that, apart from this explicit family, every $m$-edge non-bipartite graph satisfying $\\rho(G)^2\\ge m-1+\\frac{2}{\\rho(G)-1}$ has booksize greater than $\\frac{1}{240}\\sqrt{m}$, and the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05947","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/2608.05947/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":"2608.05947","created_at":"2026-08-07T00:53:55.864908+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.05947v1","created_at":"2026-08-07T00:53:55.864908+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05947","created_at":"2026-08-07T00:53:55.864908+00:00"},{"alias_kind":"pith_short_12","alias_value":"LVLC554PRHG7","created_at":"2026-08-07T00:53:55.864908+00:00"},{"alias_kind":"pith_short_16","alias_value":"LVLC554PRHG7BXFS","created_at":"2026-08-07T00:53:55.864908+00:00"},{"alias_kind":"pith_short_8","alias_value":"LVLC554P","created_at":"2026-08-07T00:53:55.864908+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM","json":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM.json","graph_json":"https://pith.science/api/pith-number/LVLC554PRHG7BXFSKQWLJYQUIM/graph.json","events_json":"https://pith.science/api/pith-number/LVLC554PRHG7BXFSKQWLJYQUIM/events.json","paper":"https://pith.science/paper/LVLC554P"},"agent_actions":{"view_html":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM","download_json":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM.json","view_paper":"https://pith.science/paper/LVLC554P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.05947&json=true","fetch_graph":"https://pith.science/api/pith-number/LVLC554PRHG7BXFSKQWLJYQUIM/graph.json","fetch_events":"https://pith.science/api/pith-number/LVLC554PRHG7BXFSKQWLJYQUIM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/action/storage_attestation","attest_author":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/action/author_attestation","sign_citation":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/action/citation_signature","submit_replication":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/action/replication_record"}},"created_at":"2026-08-07T00:53:55.864908+00:00","updated_at":"2026-08-07T00:53:55.864908+00:00"}