{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:GEIWQGQLIFERICVW3UAU2NNSBM","short_pith_number":"pith:GEIWQGQL","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"},"canonical_sha256":"3111681a0b4149140ab6dd014d35b20b0ab40b3e6e3dec9785bded648b419dc0","source":{"kind":"arxiv","id":"1404.1182","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1182","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1182v1","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1182","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"GEIWQGQLIFER","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GEIWQGQLIFERICVW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GEIWQGQL","created_at":"2026-05-18T12:28:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:GEIWQGQLIFERICVW3UAU2NNSBM","target":"record","payload":{"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"},"canonical_sha256":"3111681a0b4149140ab6dd014d35b20b0ab40b3e6e3dec9785bded648b419dc0","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"},"source_kind":"arxiv","source_id":"1404.1182","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-05-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f1Yym+S0/e1YZzEXp+vYY7bljpg6rsx7Ig8YmhK7T/xnz8IHUn0DrSKow7wy3RqlZGmqDhSfjQfszw5DBUimBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:30:46.551884Z"},"content_sha256":"9dd73fa372c38e1e1326dd0f7fac245e50bbfc870920b4592e4163669969bb5e","schema_version":"1.0","event_id":"sha256:9dd73fa372c38e1e1326dd0f7fac245e50bbfc870920b4592e4163669969bb5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:GEIWQGQLIFERICVW3UAU2NNSBM","target":"graph","payload":{"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"},"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-05-18T02:54:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y4GPUf9344sQPf7MREMqF19xJ0SS255f+y8Q3nJ0zUvUVxhdhOEeaB3AdN+iOj7pLzb6ko3HvuEnrttf1VmfCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:30:46.552665Z"},"content_sha256":"74ba6015294da25db8dcb9ea513af73aeea51a6431603c4fdd6f7b4688435a63","schema_version":"1.0","event_id":"sha256:74ba6015294da25db8dcb9ea513af73aeea51a6431603c4fdd6f7b4688435a63"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/bundle.json","state_url":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GEIWQGQLIFERICVW3UAU2NNSBM/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-05-31T00:30:46Z","links":{"resolver":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM","bundle":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/bundle.json","state":"https://pith.science/pith/GEIWQGQLIFERICVW3UAU2NNSBM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GEIWQGQLIFERICVW3UAU2NNSBM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:GEIWQGQLIFERICVW3UAU2NNSBM","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":"86329b85f5ce1a6a1c13202dd76659e32358fa557dcbfefdd74609439675178a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T08:20:58Z","title_canon_sha256":"55bb577f2d38bccf34794b4be30ce1bc02549b3af334f2d90b805e5f7dffa42a"},"schema_version":"1.0","source":{"id":"1404.1182","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.1182","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"arxiv_version","alias_value":"1404.1182v1","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.1182","created_at":"2026-05-18T02:54:54Z"},{"alias_kind":"pith_short_12","alias_value":"GEIWQGQLIFER","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_16","alias_value":"GEIWQGQLIFERICVW","created_at":"2026-05-18T12:28:30Z"},{"alias_kind":"pith_short_8","alias_value":"GEIWQGQL","created_at":"2026-05-18T12:28:30Z"}],"graph_snapshots":[{"event_id":"sha256:74ba6015294da25db8dcb9ea513af73aeea51a6431603c4fdd6f7b4688435a63","target":"graph","created_at":"2026-05-18T02:54:54Z","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"},"paper":{"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","authors_text":"Noga Alon, Raphael Yuster","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T08:20:58Z","title":"The Tur\\'an number of sparse spanning graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.1182","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:9dd73fa372c38e1e1326dd0f7fac245e50bbfc870920b4592e4163669969bb5e","target":"record","created_at":"2026-05-18T02:54:54Z","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":"86329b85f5ce1a6a1c13202dd76659e32358fa557dcbfefdd74609439675178a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-04-04T08:20:58Z","title_canon_sha256":"55bb577f2d38bccf34794b4be30ce1bc02549b3af334f2d90b805e5f7dffa42a"},"schema_version":"1.0","source":{"id":"1404.1182","kind":"arxiv","version":1}},"canonical_sha256":"3111681a0b4149140ab6dd014d35b20b0ab40b3e6e3dec9785bded648b419dc0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3111681a0b4149140ab6dd014d35b20b0ab40b3e6e3dec9785bded648b419dc0","first_computed_at":"2026-05-18T02:54:54.002839Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:54:54.002839Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fm9KcRSuzN1x2T29jkrnPdf6PqsgZFzC2lPtetIPfqeyZ844Wzi1/vFU6i8oj2KYOqNge5ey8kj/CTe6YYM9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:54:54.003261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.1182","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9dd73fa372c38e1e1326dd0f7fac245e50bbfc870920b4592e4163669969bb5e","sha256:74ba6015294da25db8dcb9ea513af73aeea51a6431603c4fdd6f7b4688435a63"],"state_sha256":"4a8656f62b5c6803ac4d8fbe13286fea1a801a5b852ade3ca1dea035c97d5bd2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZxgCbTb1pUnFBlmabnl+TSsaFMfAen3obEGV56stpbk/kMY+lIVh33r2yWynlrioxXgdvcYf5W3QVmw1J2PXBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:30:46.556220Z","bundle_sha256":"eda8e40531c96204215396ae17367eeb9ce43d22740750f1732b140dcf30f76b"}}