{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:QSADK6TSZAYKQZI7BPUJFDADJV","short_pith_number":"pith:QSADK6TS","schema_version":"1.0","canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","source":{"kind":"arxiv","id":"2206.09295","version":2},"attestation_state":"computed","paper":{"title":"Extensions on spectral extrema of $C_5/C_6$-free graphs with given size","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Wanting Sun, Wei Wei","submitted_at":"2022-06-18T23:11:45Z","abstract_excerpt":"Let $\\mathcal{F}$ denote a set of graphs. A graph $G$ is said to be $\\mathcal{F}$-free if it does not contain any element of $\\mathcal{F}$ as a subgraph. The Tur\\'an number is the maximum possible number of edges in an $\\mathcal{F}$-free graph with $n$ vertices. It is well known that classical Tur\\'an type extremal problem aims to study the Tur\\'an number of fixed graphs. In 2010, Nikiforov \\cite{Nik2} proposed analogously a spectral Tur\\'an type problem which asks to determine the maximum spectral radius of an $\\mathcal{F}$-free graph with $n$ vertices. It attracts much attention and many suc"},"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":"2206.09295","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2022-06-18T23:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"6f9c845eff35211aa9417d8f28d1e402cc3af6ecf855a8d8dc14a735e0b54209","abstract_canon_sha256":"91836841ac62bf61be700254c561f329336f8c2111f3ca6f122f8f954b099c18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:37:06.701606Z","signature_b64":"Lb/eybelxrwSyH6wIkZtgs7at55Ja+SMxC+xeIDwuItdy0/qb4A4L5JpcEEkKb3z14ofV71r+vho4VnMLkZ4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8480357a72c830a8651f0be8928c034d6653396daf137577b0880f3076845144","last_reissued_at":"2026-07-05T05:37:06.701069Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:37:06.701069Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extensions on spectral extrema of $C_5/C_6$-free graphs with given size","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Shuchao Li, Wanting Sun, Wei Wei","submitted_at":"2022-06-18T23:11:45Z","abstract_excerpt":"Let $\\mathcal{F}$ denote a set of graphs. A graph $G$ is said to be $\\mathcal{F}$-free if it does not contain any element of $\\mathcal{F}$ as a subgraph. The Tur\\'an number is the maximum possible number of edges in an $\\mathcal{F}$-free graph with $n$ vertices. It is well known that classical Tur\\'an type extremal problem aims to study the Tur\\'an number of fixed graphs. In 2010, Nikiforov \\cite{Nik2} proposed analogously a spectral Tur\\'an type problem which asks to determine the maximum spectral radius of an $\\mathcal{F}$-free graph with $n$ vertices. It attracts much attention and many suc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.09295","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/2206.09295/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":"2206.09295","created_at":"2026-07-05T05:37:06.701140+00:00"},{"alias_kind":"arxiv_version","alias_value":"2206.09295v2","created_at":"2026-07-05T05:37:06.701140+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.09295","created_at":"2026-07-05T05:37:06.701140+00:00"},{"alias_kind":"pith_short_12","alias_value":"QSADK6TSZAYK","created_at":"2026-07-05T05:37:06.701140+00:00"},{"alias_kind":"pith_short_16","alias_value":"QSADK6TSZAYKQZI7","created_at":"2026-07-05T05:37:06.701140+00:00"},{"alias_kind":"pith_short_8","alias_value":"QSADK6TS","created_at":"2026-07-05T05:37:06.701140+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/QSADK6TSZAYKQZI7BPUJFDADJV","json":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV.json","graph_json":"https://pith.science/api/pith-number/QSADK6TSZAYKQZI7BPUJFDADJV/graph.json","events_json":"https://pith.science/api/pith-number/QSADK6TSZAYKQZI7BPUJFDADJV/events.json","paper":"https://pith.science/paper/QSADK6TS"},"agent_actions":{"view_html":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV","download_json":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV.json","view_paper":"https://pith.science/paper/QSADK6TS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2206.09295&json=true","fetch_graph":"https://pith.science/api/pith-number/QSADK6TSZAYKQZI7BPUJFDADJV/graph.json","fetch_events":"https://pith.science/api/pith-number/QSADK6TSZAYKQZI7BPUJFDADJV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/action/storage_attestation","attest_author":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/action/author_attestation","sign_citation":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/action/citation_signature","submit_replication":"https://pith.science/pith/QSADK6TSZAYKQZI7BPUJFDADJV/action/replication_record"}},"created_at":"2026-07-05T05:37:06.701140+00:00","updated_at":"2026-07-05T05:37:06.701140+00:00"}