{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FSOC36C5VL3EGS5VP3YLFHSHBF","short_pith_number":"pith:FSOC36C5","schema_version":"1.0","canonical_sha256":"2c9c2df85daaf6434bb57ef0b29e47094b9597b4795b132799e6e549b20b072b","source":{"kind":"arxiv","id":"2501.14218","version":2},"attestation_state":"computed","paper":{"title":"Spectral skeletons and applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenqian Zhang","submitted_at":"2025-01-24T03:50:05Z","abstract_excerpt":"For a graph $G$, its spectral radius $\\rho(G)$ is the largest eigenvalue of its adjacency matrix. Let $\\mathcal{F}$ be a finite family of graphs with $\\min_{F\\in \\mathcal{F}}\\chi(F)=r+1\\geq3$, where $\\chi(F)$ is the chromatic number of $F$. Set $t=\\max_{F\\in\\mathcal{F}}|F|$. Let $T(rt,r)$ be the Tur\\'{a}n graph of order $rt$ with $r$ parts. Assume that some $F_{0}\\subseteq\\mathcal{F}$ is a subgraph of the graph obtained from $T(rt,r)$ by embedding a path or a matching in one part. Let ${\\rm EX}(n,\\mathcal{F})$ be the set of graphs with the maximum number of edges among all the graphs of order "},"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":"2501.14218","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T03:50:05Z","cross_cats_sorted":[],"title_canon_sha256":"52b74feaaaf1bbe5e1329fd653b051738b8c35e92b4697d032914136dfa57c58","abstract_canon_sha256":"49e0ad103d9043efed06071baf298a3558a54f82cfa2a4928acd9803b022cd0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:31:00.854988Z","signature_b64":"/gfzqdlik0I1I18lr9rgjchgtXjNqu3mXizFTqmU3RceqH679rrYtcECVlzj9+R7UV9CmR3DnCGk8xft+3IZCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c9c2df85daaf6434bb57ef0b29e47094b9597b4795b132799e6e549b20b072b","last_reissued_at":"2026-07-05T10:31:00.854286Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:31:00.854286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spectral skeletons and applications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Wenqian Zhang","submitted_at":"2025-01-24T03:50:05Z","abstract_excerpt":"For a graph $G$, its spectral radius $\\rho(G)$ is the largest eigenvalue of its adjacency matrix. Let $\\mathcal{F}$ be a finite family of graphs with $\\min_{F\\in \\mathcal{F}}\\chi(F)=r+1\\geq3$, where $\\chi(F)$ is the chromatic number of $F$. Set $t=\\max_{F\\in\\mathcal{F}}|F|$. Let $T(rt,r)$ be the Tur\\'{a}n graph of order $rt$ with $r$ parts. Assume that some $F_{0}\\subseteq\\mathcal{F}$ is a subgraph of the graph obtained from $T(rt,r)$ by embedding a path or a matching in one part. Let ${\\rm EX}(n,\\mathcal{F})$ be the set of graphs with the maximum number of edges among all the graphs of order "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14218","kind":"arxiv","version":2},"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/2501.14218/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":"2501.14218","created_at":"2026-07-05T10:31:00.854384+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.14218v2","created_at":"2026-07-05T10:31:00.854384+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14218","created_at":"2026-07-05T10:31:00.854384+00:00"},{"alias_kind":"pith_short_12","alias_value":"FSOC36C5VL3E","created_at":"2026-07-05T10:31:00.854384+00:00"},{"alias_kind":"pith_short_16","alias_value":"FSOC36C5VL3EGS5V","created_at":"2026-07-05T10:31:00.854384+00:00"},{"alias_kind":"pith_short_8","alias_value":"FSOC36C5","created_at":"2026-07-05T10:31:00.854384+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06987","citing_title":"Tight Bound for Nikiforov's Spectral Even-Cycle Conjecture","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF","json":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF.json","graph_json":"https://pith.science/api/pith-number/FSOC36C5VL3EGS5VP3YLFHSHBF/graph.json","events_json":"https://pith.science/api/pith-number/FSOC36C5VL3EGS5VP3YLFHSHBF/events.json","paper":"https://pith.science/paper/FSOC36C5"},"agent_actions":{"view_html":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF","download_json":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF.json","view_paper":"https://pith.science/paper/FSOC36C5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.14218&json=true","fetch_graph":"https://pith.science/api/pith-number/FSOC36C5VL3EGS5VP3YLFHSHBF/graph.json","fetch_events":"https://pith.science/api/pith-number/FSOC36C5VL3EGS5VP3YLFHSHBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/action/storage_attestation","attest_author":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/action/author_attestation","sign_citation":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/action/citation_signature","submit_replication":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/action/replication_record"}},"created_at":"2026-07-05T10:31:00.854384+00:00","updated_at":"2026-07-05T10:31:00.854384+00:00"}