{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:V52JACE5ELS74TK7KZXA64LMZM","short_pith_number":"pith:V52JACE5","schema_version":"1.0","canonical_sha256":"af7490089d22e5fe4d5f566e0f716ccb0651a0f38456aeaa41e0af06d2e704a9","source":{"kind":"arxiv","id":"2608.04485","version":1},"attestation_state":"computed","paper":{"title":"Edge-spectra supersaturation for tripartite color-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiqiu Lin, Longfei Fang, Mingqing Zhai","submitted_at":"2026-08-05T06:17:52Z","abstract_excerpt":"We study edge-spectral supersaturation for two families of color-critical graphs with chromatic number three. For an integer $r\\geq 1$, we define the spectral threshold \\[ g_r(m):=\\frac{r-1+\\sqrt{4m-r^2+1}}{2}, \\] which is the tight upper bound on the spectral radius of graphs avoiding $K_{s,t}^+$ (when $t+1\\geq s\\geq 3$) and $C_{2k+1}$ (when $r=k$), realized by split-graph constructions. First, let $t+1 \\geq s\\geq 3$ be fixed integers, and let $K_{s,t}^{+}$ be obtained by adding an edge to the part of size $s$ in $K_{s,t}$. We prove that every sufficiently large $m$-edge graph $G$ with $\\rho("},"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.04485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-08-05T06:17:52Z","cross_cats_sorted":[],"title_canon_sha256":"bbefee7dee565e20ce1ec45e6596d97494ca414ddd498508eee08ef25c1aa9ed","abstract_canon_sha256":"3db77fccf52d1a0f59565ce08238b48e3e233d5d94c146a323e78fb56c978506"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-06T01:35:41.823412Z","signature_b64":"4gca7V+LSmmcTZZq3arvqNvR/ol1h84P8ev5AuS6O3cwz4iFyRbc+XCSwngYTIzeIo5IVJVMbWldu7EAUk+IAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af7490089d22e5fe4d5f566e0f716ccb0651a0f38456aeaa41e0af06d2e704a9","last_reissued_at":"2026-08-06T01:35:41.821974Z","signature_status":"signed_v1","first_computed_at":"2026-08-06T01:35:41.821974Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Edge-spectra supersaturation for tripartite color-critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Huiqiu Lin, Longfei Fang, Mingqing Zhai","submitted_at":"2026-08-05T06:17:52Z","abstract_excerpt":"We study edge-spectral supersaturation for two families of color-critical graphs with chromatic number three. For an integer $r\\geq 1$, we define the spectral threshold \\[ g_r(m):=\\frac{r-1+\\sqrt{4m-r^2+1}}{2}, \\] which is the tight upper bound on the spectral radius of graphs avoiding $K_{s,t}^+$ (when $t+1\\geq s\\geq 3$) and $C_{2k+1}$ (when $r=k$), realized by split-graph constructions. First, let $t+1 \\geq s\\geq 3$ be fixed integers, and let $K_{s,t}^{+}$ be obtained by adding an edge to the part of size $s$ in $K_{s,t}$. We prove that every sufficiently large $m$-edge graph $G$ with $\\rho("},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.04485","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.04485/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.04485","created_at":"2026-08-06T01:35:41.823777+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.04485v1","created_at":"2026-08-06T01:35:41.823777+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.04485","created_at":"2026-08-06T01:35:41.823777+00:00"},{"alias_kind":"pith_short_12","alias_value":"V52JACE5ELS7","created_at":"2026-08-06T01:35:41.823777+00:00"},{"alias_kind":"pith_short_16","alias_value":"V52JACE5ELS74TK7","created_at":"2026-08-06T01:35:41.823777+00:00"},{"alias_kind":"pith_short_8","alias_value":"V52JACE5","created_at":"2026-08-06T01:35:41.823777+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/V52JACE5ELS74TK7KZXA64LMZM","json":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM.json","graph_json":"https://pith.science/api/pith-number/V52JACE5ELS74TK7KZXA64LMZM/graph.json","events_json":"https://pith.science/api/pith-number/V52JACE5ELS74TK7KZXA64LMZM/events.json","paper":"https://pith.science/paper/V52JACE5"},"agent_actions":{"view_html":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM","download_json":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM.json","view_paper":"https://pith.science/paper/V52JACE5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.04485&json=true","fetch_graph":"https://pith.science/api/pith-number/V52JACE5ELS74TK7KZXA64LMZM/graph.json","fetch_events":"https://pith.science/api/pith-number/V52JACE5ELS74TK7KZXA64LMZM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM/action/storage_attestation","attest_author":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM/action/author_attestation","sign_citation":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM/action/citation_signature","submit_replication":"https://pith.science/pith/V52JACE5ELS74TK7KZXA64LMZM/action/replication_record"}},"created_at":"2026-08-06T01:35:41.823777+00:00","updated_at":"2026-08-06T01:35:41.823777+00:00"}