{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:LVLC554PRHG7BXFSKQWLJYQUIM","short_pith_number":"pith:LVLC554P","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"},"canonical_sha256":"5d562ef78f89cdf0dcb2542cb4e214432d4ceb9e8db0a0930a99e337ebae5fc4","source":{"kind":"arxiv","id":"2608.05947","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05947","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05947v1","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05947","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"LVLC554PRHG7","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"pith_short_16","alias_value":"LVLC554PRHG7BXFS","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"pith_short_8","alias_value":"LVLC554P","created_at":"2026-08-07T00:53:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:LVLC554PRHG7BXFSKQWLJYQUIM","target":"record","payload":{"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"},"canonical_sha256":"5d562ef78f89cdf0dcb2542cb4e214432d4ceb9e8db0a0930a99e337ebae5fc4","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"},"source_kind":"arxiv","source_id":"2608.05947","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-08-07T00:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fc/HNRkHhL/yXxlZcx7fBB59VLVm+cSBW2MmOBONPgwOtyNTPzYktnLm3VrtX45Dm+0L5oIfEViKiyO5SB16BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:45:09.403258Z"},"content_sha256":"419342cd023dc299d1c598540e103a296ecacf0132fe55db6cbe4136ff596f07","schema_version":"1.0","event_id":"sha256:419342cd023dc299d1c598540e103a296ecacf0132fe55db6cbe4136ff596f07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:LVLC554PRHG7BXFSKQWLJYQUIM","target":"graph","payload":{"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"},"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-08-07T00:53:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tLqkvijlzwQtkOg/4uaulTLldVsDfJ4mrHpqKZ/kS+UPbVfJxrrBnTjuCj46GBZbKraXCNte3xcra8VXFJbaAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T15:45:09.403772Z"},"content_sha256":"4b216a791ecb6587f1e8fdd74c7c7c61a8aea4c4fe32ab106910b5f5d33fe132","schema_version":"1.0","event_id":"sha256:4b216a791ecb6587f1e8fdd74c7c7c61a8aea4c4fe32ab106910b5f5d33fe132"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/bundle.json","state_url":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LVLC554PRHG7BXFSKQWLJYQUIM/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-08T15:45:09Z","links":{"resolver":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM","bundle":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/bundle.json","state":"https://pith.science/pith/LVLC554PRHG7BXFSKQWLJYQUIM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LVLC554PRHG7BXFSKQWLJYQUIM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:LVLC554PRHG7BXFSKQWLJYQUIM","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":"bf10f040fae640addd3c4d807f4eb2dab09af04d60aa1c45fb352a7d337fd580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T12:17:33Z","title_canon_sha256":"48c98238c710c40291180bcb39bf0f90e9914a3e46c289b554a04ffa873a6863"},"schema_version":"1.0","source":{"id":"2608.05947","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.05947","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"arxiv_version","alias_value":"2608.05947v1","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.05947","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"pith_short_12","alias_value":"LVLC554PRHG7","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"pith_short_16","alias_value":"LVLC554PRHG7BXFS","created_at":"2026-08-07T00:53:55Z"},{"alias_kind":"pith_short_8","alias_value":"LVLC554P","created_at":"2026-08-07T00:53:55Z"}],"graph_snapshots":[{"event_id":"sha256:4b216a791ecb6587f1e8fdd74c7c7c61a8aea4c4fe32ab106910b5f5d33fe132","target":"graph","created_at":"2026-08-07T00:53:55Z","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/2608.05947/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Benju Wang, Jinlong Shu, ZhenZhen Lou","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T12:17:33Z","title":"On a spectral booksize problem fo non bipartite graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.05947","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:419342cd023dc299d1c598540e103a296ecacf0132fe55db6cbe4136ff596f07","target":"record","created_at":"2026-08-07T00:53:55Z","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":"bf10f040fae640addd3c4d807f4eb2dab09af04d60aa1c45fb352a7d337fd580","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-06T12:17:33Z","title_canon_sha256":"48c98238c710c40291180bcb39bf0f90e9914a3e46c289b554a04ffa873a6863"},"schema_version":"1.0","source":{"id":"2608.05947","kind":"arxiv","version":1}},"canonical_sha256":"5d562ef78f89cdf0dcb2542cb4e214432d4ceb9e8db0a0930a99e337ebae5fc4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5d562ef78f89cdf0dcb2542cb4e214432d4ceb9e8db0a0930a99e337ebae5fc4","first_computed_at":"2026-08-07T00:53:55.863381Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-07T00:53:55.863381Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eWERynO7XTiVTYZG0RRNYTo+t93XjL9QP7hsiUqXnKQk7zTctVQRLdKYqQgd9yftmYx5qDrUjmUvnHaunxBCCA==","signature_status":"signed_v1","signed_at":"2026-08-07T00:53:55.864750Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.05947","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:419342cd023dc299d1c598540e103a296ecacf0132fe55db6cbe4136ff596f07","sha256:4b216a791ecb6587f1e8fdd74c7c7c61a8aea4c4fe32ab106910b5f5d33fe132"],"state_sha256":"0d82487f56fffb6aebbbf4b9fc7241011485f3166fa7b840a11006c586a1f85e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XM+q6fScmaOjjcREt6R6msNjvWNU56U2Jw39tAQHNEHVHiDVuWWmwTtqEsmLcr3S/4figOLY0vzSo0qocI91Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T15:45:09.410133Z","bundle_sha256":"a191b6e3ecd528f191d4052274cab46e07d88155d53ae2aa31c2132aa374bf88"}}