{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GEIWQGQLIFERICVW3UAU2NNSBM","short_pith_number":"pith:GEIWQGQL","schema_version":"1.0","canonical_sha256":"3111681a0b4149140ab6dd014d35b20b0ab40b3e6e3dec9785bded648b419dc0","source":{"kind":"arxiv","id":"1404.1182","version":1},"attestation_state":"computed","paper":{"title":"The Tur\\'an number of sparse spanning graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noga Alon, Raphael Yuster","submitted_at":"2014-04-04T08:20:58Z","abstract_excerpt":"For a graph $H$, the {\\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\\delta(H)>0$ and $\\Delta(H)$ denote the minimum degree and maximum degree of $H$, respectively. We prove that for all $n$ sufficiently large, if $H$ is any graph of order $n$ with $\\Delta(H) \\le \\sqrt{n}/200$, then $ex(n,H)={{n-1} \\choose 2}+\\delta(H)-1$. The condition on the maximum degree is tight up to a constant factor. This generalizes a classical result of Ore for the case $H=C_n$, and resolves, in a strong form, a conjecture of Gle"},"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":"1404.1182","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T08:20:58Z","cross_cats_sorted":[],"title_canon_sha256":"55bb577f2d38bccf34794b4be30ce1bc02549b3af334f2d90b805e5f7dffa42a","abstract_canon_sha256":"86329b85f5ce1a6a1c13202dd76659e32358fa557dcbfefdd74609439675178a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:54:54.003261Z","signature_b64":"fm9KcRSuzN1x2T29jkrnPdf6PqsgZFzC2lPtetIPfqeyZ844Wzi1/vFU6i8oj2KYOqNge5ey8kj/CTe6YYM9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3111681a0b4149140ab6dd014d35b20b0ab40b3e6e3dec9785bded648b419dc0","last_reissued_at":"2026-05-18T02:54:54.002839Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:54:54.002839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tur\\'an number of sparse spanning graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Noga Alon, Raphael Yuster","submitted_at":"2014-04-04T08:20:58Z","abstract_excerpt":"For a graph $H$, the {\\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\\delta(H)>0$ and $\\Delta(H)$ denote the minimum degree and maximum degree of $H$, respectively. We prove that for all $n$ sufficiently large, if $H$ is any graph of order $n$ with $\\Delta(H) \\le \\sqrt{n}/200$, then $ex(n,H)={{n-1} \\choose 2}+\\delta(H)-1$. The condition on the maximum degree is tight up to a constant factor. This generalizes a classical result of Ore for the case $H=C_n$, and resolves, in a strong form, a conjecture of Gle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1182","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":""},"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":"1404.1182","created_at":"2026-05-18T02:54:54.002902+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.1182v1","created_at":"2026-05-18T02:54:54.002902+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1182","created_at":"2026-05-18T02:54:54.002902+00:00"},{"alias_kind":"pith_short_12","alias_value":"GEIWQGQLIFER","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GEIWQGQLIFERICVW","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GEIWQGQL","created_at":"2026-05-18T12:28:30.664211+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/GEIWQGQLIFERICVW3UAU2NNSBM","json":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM.json","graph_json":"https://pith.science/api/pith-number/GEIWQGQLIFERICVW3UAU2NNSBM/graph.json","events_json":"https://pith.science/api/pith-number/GEIWQGQLIFERICVW3UAU2NNSBM/events.json","paper":"https://pith.science/paper/GEIWQGQL"},"agent_actions":{"view_html":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM","download_json":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM.json","view_paper":"https://pith.science/paper/GEIWQGQL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.1182&json=true","fetch_graph":"https://pith.science/api/pith-number/GEIWQGQLIFERICVW3UAU2NNSBM/graph.json","fetch_events":"https://pith.science/api/pith-number/GEIWQGQLIFERICVW3UAU2NNSBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/action/storage_attestation","attest_author":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/action/author_attestation","sign_citation":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/action/citation_signature","submit_replication":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/action/replication_record"}},"created_at":"2026-05-18T02:54:54.002902+00:00","updated_at":"2026-05-18T02:54:54.002902+00:00"}