{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FSOC36C5VL3EGS5VP3YLFHSHBF","short_pith_number":"pith:FSOC36C5","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"},"canonical_sha256":"2c9c2df85daaf6434bb57ef0b29e47094b9597b4795b132799e6e549b20b072b","source":{"kind":"arxiv","id":"2501.14218","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14218","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14218v2","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14218","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"FSOC36C5VL3E","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"FSOC36C5VL3EGS5V","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"FSOC36C5","created_at":"2026-07-05T10:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FSOC36C5VL3EGS5VP3YLFHSHBF","target":"record","payload":{"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"},"canonical_sha256":"2c9c2df85daaf6434bb57ef0b29e47094b9597b4795b132799e6e549b20b072b","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"},"source_kind":"arxiv","source_id":"2501.14218","source_version":2,"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-07-05T10:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lkomTZyiS6YvCuT9Uc94nf+pZMjaz1wbgTtOLV6GcLlMCxZ948pZfLdr4kn1MnPHitM0PnsQbnJi28x2GX6QAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:13:11.324390Z"},"content_sha256":"a31cd3bef424866994adb9039eb7c0588e72d2da3afb8bca435dc49ff18d6480","schema_version":"1.0","event_id":"sha256:a31cd3bef424866994adb9039eb7c0588e72d2da3afb8bca435dc49ff18d6480"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FSOC36C5VL3EGS5VP3YLFHSHBF","target":"graph","payload":{"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"},"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-07-05T10:31:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1XAgYtXw/Xdp7L7CQfbmwVvDKU8RCaqD3MELLYHmzhoeu10a8Jaey1f6vnnB7fVddeLWFPhkRHU8potusqCFDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T02:13:11.324884Z"},"content_sha256":"5c92cc36793fa0c3bcdbc4766b1f1971ef851f7ae3098e979349f393c4d44894","schema_version":"1.0","event_id":"sha256:5c92cc36793fa0c3bcdbc4766b1f1971ef851f7ae3098e979349f393c4d44894"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/bundle.json","state_url":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/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-06T02:13:11Z","links":{"resolver":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF","bundle":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/bundle.json","state":"https://pith.science/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FSOC36C5VL3EGS5VP3YLFHSHBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FSOC36C5VL3EGS5VP3YLFHSHBF","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":"49e0ad103d9043efed06071baf298a3558a54f82cfa2a4928acd9803b022cd0e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T03:50:05Z","title_canon_sha256":"52b74feaaaf1bbe5e1329fd653b051738b8c35e92b4697d032914136dfa57c58"},"schema_version":"1.0","source":{"id":"2501.14218","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.14218","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"arxiv_version","alias_value":"2501.14218v2","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.14218","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"pith_short_12","alias_value":"FSOC36C5VL3E","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"FSOC36C5VL3EGS5V","created_at":"2026-07-05T10:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"FSOC36C5","created_at":"2026-07-05T10:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:5c92cc36793fa0c3bcdbc4766b1f1971ef851f7ae3098e979349f393c4d44894","target":"graph","created_at":"2026-07-05T10:31:00Z","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/2501.14218/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Wenqian Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T03:50:05Z","title":"Spectral skeletons and applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.14218","kind":"arxiv","version":2},"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:a31cd3bef424866994adb9039eb7c0588e72d2da3afb8bca435dc49ff18d6480","target":"record","created_at":"2026-07-05T10:31:00Z","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":"49e0ad103d9043efed06071baf298a3558a54f82cfa2a4928acd9803b022cd0e","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-01-24T03:50:05Z","title_canon_sha256":"52b74feaaaf1bbe5e1329fd653b051738b8c35e92b4697d032914136dfa57c58"},"schema_version":"1.0","source":{"id":"2501.14218","kind":"arxiv","version":2}},"canonical_sha256":"2c9c2df85daaf6434bb57ef0b29e47094b9597b4795b132799e6e549b20b072b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2c9c2df85daaf6434bb57ef0b29e47094b9597b4795b132799e6e549b20b072b","first_computed_at":"2026-07-05T10:31:00.854286Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:31:00.854286Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/gfzqdlik0I1I18lr9rgjchgtXjNqu3mXizFTqmU3RceqH679rrYtcECVlzj9+R7UV9CmR3DnCGk8xft+3IZCw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:31:00.854988Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.14218","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a31cd3bef424866994adb9039eb7c0588e72d2da3afb8bca435dc49ff18d6480","sha256:5c92cc36793fa0c3bcdbc4766b1f1971ef851f7ae3098e979349f393c4d44894"],"state_sha256":"1296f94367c237d337f7ad7316ef6b001864b2e2cec89675ff48a61babf94e3a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yyPA29NNOaDxJ5c0R6HryXTpN1Ztp4HMF9RvZm1pSUM27kSl074T2k4KI+uFrrKje8XBRe1gvGPS3oL7Pd3BCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T02:13:11.328921Z","bundle_sha256":"60f6d6b0a655a9499d9b37114fcc9ee1cf93a42f0c7ac59096864fea57769866"}}