{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:CW5LVPLZAUZDHOVHQXPD2Y637K","short_pith_number":"pith:CW5LVPLZ","schema_version":"1.0","canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","source":{"kind":"arxiv","id":"2607.15071","version":1},"attestation_state":"computed","paper":{"title":"Two problems on booksize and triangular edges in Nosal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Zeng, Lihua You, Xiaoxue Zhang, Xinghui Zhao","submitted_at":"2026-07-16T14:43:37Z","abstract_excerpt":"A graph $G$ with $m$ edges is said to be a Nosal graph if $\\rho(G)>\\sqrt{m}$. For a graph $G$, we write $bk(G)$ for its maximum book size and $\\tau(G)$ for the number of edges contained in triangles. Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026) 219--249] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{24}\\sqrt{m}$ and $\\tau(G) > \\frac{1}{12}\\sqrt{m}$. Recently, Zhai, Li and Lou [arXiv:2601.10163v2] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{9}\\sqrt{m}$. In this paper, we establish the following result: Every $m$-edge graph $G$ with no isolated"},"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":"2607.15071","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-16T14:43:37Z","cross_cats_sorted":[],"title_canon_sha256":"37ff9667e83f3dd065b848ae0cf0b431d298af7d7addc1afda57031878f32ecf","abstract_canon_sha256":"44e549f1d793f945340553d75e928677ab80eea6d2505090468bdc05d25aa4ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-17T01:22:07.983910Z","signature_b64":"4dvomxXQqGOfwu99dXETRPf5uk4ahSiC7mKysWwMYLiY6Y2ajDqvPZY+gLL6vMIfr+eolxJjQAzxe2FiJOIoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"15bababd79053233baa785de3d63dbfabd874a789ae3b79057b8cac7063c394a","last_reissued_at":"2026-07-17T01:22:07.983088Z","signature_status":"signed_v1","first_computed_at":"2026-07-17T01:22:07.983088Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Two problems on booksize and triangular edges in Nosal graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jing Zeng, Lihua You, Xiaoxue Zhang, Xinghui Zhao","submitted_at":"2026-07-16T14:43:37Z","abstract_excerpt":"A graph $G$ with $m$ edges is said to be a Nosal graph if $\\rho(G)>\\sqrt{m}$. For a graph $G$, we write $bk(G)$ for its maximum book size and $\\tau(G)$ for the number of edges contained in triangles. Li, Liu and Zhang [J. Combin. Theory Ser. B 179 (2026) 219--249] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{24}\\sqrt{m}$ and $\\tau(G) > \\frac{1}{12}\\sqrt{m}$. Recently, Zhai, Li and Lou [arXiv:2601.10163v2] proved that every $m$-edge Nosal graph satisfies $bk(G)> \\frac{1}{9}\\sqrt{m}$. In this paper, we establish the following result: Every $m$-edge graph $G$ with no isolated"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.15071","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/2607.15071/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":"2607.15071","created_at":"2026-07-17T01:22:07.983513+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.15071v1","created_at":"2026-07-17T01:22:07.983513+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.15071","created_at":"2026-07-17T01:22:07.983513+00:00"},{"alias_kind":"pith_short_12","alias_value":"CW5LVPLZAUZD","created_at":"2026-07-17T01:22:07.983513+00:00"},{"alias_kind":"pith_short_16","alias_value":"CW5LVPLZAUZDHOVH","created_at":"2026-07-17T01:22:07.983513+00:00"},{"alias_kind":"pith_short_8","alias_value":"CW5LVPLZ","created_at":"2026-07-17T01:22:07.983513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.05947","citing_title":"On a spectral booksize problem fo non bipartite graphs","ref_index":24,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K","json":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K.json","graph_json":"https://pith.science/api/pith-number/CW5LVPLZAUZDHOVHQXPD2Y637K/graph.json","events_json":"https://pith.science/api/pith-number/CW5LVPLZAUZDHOVHQXPD2Y637K/events.json","paper":"https://pith.science/paper/CW5LVPLZ"},"agent_actions":{"view_html":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K","download_json":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K.json","view_paper":"https://pith.science/paper/CW5LVPLZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.15071&json=true","fetch_graph":"https://pith.science/api/pith-number/CW5LVPLZAUZDHOVHQXPD2Y637K/graph.json","fetch_events":"https://pith.science/api/pith-number/CW5LVPLZAUZDHOVHQXPD2Y637K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/action/storage_attestation","attest_author":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/action/author_attestation","sign_citation":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/action/citation_signature","submit_replication":"https://pith.science/pith/CW5LVPLZAUZDHOVHQXPD2Y637K/action/replication_record"}},"created_at":"2026-07-17T01:22:07.983513+00:00","updated_at":"2026-07-17T01:22:07.983513+00:00"}