{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OAYZGIMTSLCTCC3JPHZB5LNOQJ","short_pith_number":"pith:OAYZGIMT","canonical_record":{"source":{"id":"2404.09069","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-13T19:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"defa2482cd5beb7a2bee928c7b0b98f1e2c75c08ad07ec3272a08cf08bfd6f86","abstract_canon_sha256":"ef579db523c285c51578493850d63b2245cad65a6b3fc027e2bf06e9286e4ded"},"schema_version":"1.0"},"canonical_sha256":"703193219392c5310b6979f21eadae8252759e3870ddb42cf0892d622d484e3f","source":{"kind":"arxiv","id":"2404.09069","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.09069","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"2404.09069v1","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09069","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"OAYZGIMTSLCT","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"pith_short_16","alias_value":"OAYZGIMTSLCTCC3J","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"pith_short_8","alias_value":"OAYZGIMT","created_at":"2026-07-05T08:07:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OAYZGIMTSLCTCC3JPHZB5LNOQJ","target":"record","payload":{"canonical_record":{"source":{"id":"2404.09069","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-13T19:35:50Z","cross_cats_sorted":[],"title_canon_sha256":"defa2482cd5beb7a2bee928c7b0b98f1e2c75c08ad07ec3272a08cf08bfd6f86","abstract_canon_sha256":"ef579db523c285c51578493850d63b2245cad65a6b3fc027e2bf06e9286e4ded"},"schema_version":"1.0"},"canonical_sha256":"703193219392c5310b6979f21eadae8252759e3870ddb42cf0892d622d484e3f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:07:44.806127Z","signature_b64":"Yqt4oc6ECSsHcEcoL8Quw/FgZLGErSOgPqcengnlkSB+DCPYLg+tjIYLyyhiC29wJHtnRslMHjZtc0ytL+tmDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"703193219392c5310b6979f21eadae8252759e3870ddb42cf0892d622d484e3f","last_reissued_at":"2026-07-05T08:07:44.805628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:07:44.805628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.09069","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-07-05T08:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RCHVyqO1/CpqYjjHAGcKiKsaveQ8dfRGDr38Z9L3hn5xxZrgGuxj5vx7axfFXe11/H5nJ/OyqZnTPBlw1NesCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:58:21.274515Z"},"content_sha256":"e8b245653cb2ef2811d0b8343790aded171e37466597f30fcc3788e8b5d0962b","schema_version":"1.0","event_id":"sha256:e8b245653cb2ef2811d0b8343790aded171e37466597f30fcc3788e8b5d0962b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OAYZGIMTSLCTCC3JPHZB5LNOQJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tur\\'an numbers for non-bipartite graphs and applications to spectral extremal problems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Longfei Fang, Michael Tait, Mingqing Zhai","submitted_at":"2024-04-13T19:35:50Z","abstract_excerpt":"Given a graph family $\\mathcal{H}$ with $\\min_{H\\in \\mathcal{H}}\\chi(H)=r+1\\geq 3$. Let ${\\rm ex}(n,\\mathcal{H})$ and ${\\rm spex}(n,\\mathcal{H})$ be the maximum number of edges and the maximum spectral radius of the adjacency matrix over all $\\mathcal{H}$-free graphs of order $n$, respectively. Denote by ${\\rm EX}(n,\\mathcal{H})$ (resp. ${\\rm SPEX}(n,\\mathcal{H})$) the set of extremal graphs with respect to ${\\rm ex}(n,\\mathcal{H})$ (resp. ${\\rm spex}(n,\\mathcal{H})$).\n  In this paper, we use a decomposition family defined by Simonovits to give a characterization of which graph families $\\math"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09069","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/2404.09069/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-05T08:07:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wMr94RuAJbVTTwPCyvgWGqYqqul1Rp312aqJaMZpVpVNwxiSrZCeREzJngATf0Ev8/2vqLdfLAH9rgmSO7kpCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T09:58:21.275014Z"},"content_sha256":"f9908384d3e310cf430d324ee6fa869f433b1a92a51077ae2fe2a3bc22c1b996","schema_version":"1.0","event_id":"sha256:f9908384d3e310cf430d324ee6fa869f433b1a92a51077ae2fe2a3bc22c1b996"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ/bundle.json","state_url":"https://pith.science/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ/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-08T09:58:21Z","links":{"resolver":"https://pith.science/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ","bundle":"https://pith.science/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ/bundle.json","state":"https://pith.science/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OAYZGIMTSLCTCC3JPHZB5LNOQJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OAYZGIMTSLCTCC3JPHZB5LNOQJ","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":"ef579db523c285c51578493850d63b2245cad65a6b3fc027e2bf06e9286e4ded","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-13T19:35:50Z","title_canon_sha256":"defa2482cd5beb7a2bee928c7b0b98f1e2c75c08ad07ec3272a08cf08bfd6f86"},"schema_version":"1.0","source":{"id":"2404.09069","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.09069","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"arxiv_version","alias_value":"2404.09069v1","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.09069","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"pith_short_12","alias_value":"OAYZGIMTSLCT","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"pith_short_16","alias_value":"OAYZGIMTSLCTCC3J","created_at":"2026-07-05T08:07:44Z"},{"alias_kind":"pith_short_8","alias_value":"OAYZGIMT","created_at":"2026-07-05T08:07:44Z"}],"graph_snapshots":[{"event_id":"sha256:f9908384d3e310cf430d324ee6fa869f433b1a92a51077ae2fe2a3bc22c1b996","target":"graph","created_at":"2026-07-05T08:07:44Z","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/2404.09069/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Given a graph family $\\mathcal{H}$ with $\\min_{H\\in \\mathcal{H}}\\chi(H)=r+1\\geq 3$. Let ${\\rm ex}(n,\\mathcal{H})$ and ${\\rm spex}(n,\\mathcal{H})$ be the maximum number of edges and the maximum spectral radius of the adjacency matrix over all $\\mathcal{H}$-free graphs of order $n$, respectively. Denote by ${\\rm EX}(n,\\mathcal{H})$ (resp. ${\\rm SPEX}(n,\\mathcal{H})$) the set of extremal graphs with respect to ${\\rm ex}(n,\\mathcal{H})$ (resp. ${\\rm spex}(n,\\mathcal{H})$).\n  In this paper, we use a decomposition family defined by Simonovits to give a characterization of which graph families $\\math","authors_text":"Longfei Fang, Michael Tait, Mingqing Zhai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-13T19:35:50Z","title":"Tur\\'an numbers for non-bipartite graphs and applications to spectral extremal problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.09069","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:e8b245653cb2ef2811d0b8343790aded171e37466597f30fcc3788e8b5d0962b","target":"record","created_at":"2026-07-05T08:07:44Z","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":"ef579db523c285c51578493850d63b2245cad65a6b3fc027e2bf06e9286e4ded","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2024-04-13T19:35:50Z","title_canon_sha256":"defa2482cd5beb7a2bee928c7b0b98f1e2c75c08ad07ec3272a08cf08bfd6f86"},"schema_version":"1.0","source":{"id":"2404.09069","kind":"arxiv","version":1}},"canonical_sha256":"703193219392c5310b6979f21eadae8252759e3870ddb42cf0892d622d484e3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"703193219392c5310b6979f21eadae8252759e3870ddb42cf0892d622d484e3f","first_computed_at":"2026-07-05T08:07:44.805628Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:07:44.805628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Yqt4oc6ECSsHcEcoL8Quw/FgZLGErSOgPqcengnlkSB+DCPYLg+tjIYLyyhiC29wJHtnRslMHjZtc0ytL+tmDA==","signature_status":"signed_v1","signed_at":"2026-07-05T08:07:44.806127Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.09069","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8b245653cb2ef2811d0b8343790aded171e37466597f30fcc3788e8b5d0962b","sha256:f9908384d3e310cf430d324ee6fa869f433b1a92a51077ae2fe2a3bc22c1b996"],"state_sha256":"3d01dc5483ad527f406aa62bf2662ccbba1d26c5613ec4b9bd09f518411f83c5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6adT32MFRwRmGNEwsKIbwCPQd+lpQRo9Gfr+iXFLmcR7gJMLNacEAji4li0H1Dj0UqBDbKEkgZH/W0Wn4T4iAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T09:58:21.280005Z","bundle_sha256":"dd1aafae5c47191fe8bf5f5e0cdbc7a64ec15f7ecda9a818d7ad7a8d50a88ecf"}}