{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:A3SV2YFCMIEYMMN6Z4OI2ALNRG","short_pith_number":"pith:A3SV2YFC","canonical_record":{"source":{"id":"1005.0895","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-06T06:30:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5b41232d897949efc91f5faefca0997f649a4a654fe8c6e7f2d9236172e765fd","abstract_canon_sha256":"f825ea46fad04e124a90422603ecb7de270d74cbe65dade925878dec47d01b92"},"schema_version":"1.0"},"canonical_sha256":"06e55d60a262098631becf1c8d016d899f45c6a976e64bfeaa805d7c009dd3cc","source":{"kind":"arxiv","id":"1005.0895","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0895","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0895v4","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0895","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"A3SV2YFCMIEY","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A3SV2YFCMIEYMMN6","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A3SV2YFC","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:A3SV2YFCMIEYMMN6Z4OI2ALNRG","target":"record","payload":{"canonical_record":{"source":{"id":"1005.0895","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-06T06:30:49Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"5b41232d897949efc91f5faefca0997f649a4a654fe8c6e7f2d9236172e765fd","abstract_canon_sha256":"f825ea46fad04e124a90422603ecb7de270d74cbe65dade925878dec47d01b92"},"schema_version":"1.0"},"canonical_sha256":"06e55d60a262098631becf1c8d016d899f45c6a976e64bfeaa805d7c009dd3cc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:06.333056Z","signature_b64":"B/nf96yYQnw0S5ZDo9rIPsOyRKi248YerJN0dDQ5eaZyWmMeICbKoFVksA87bGOBnHP2/zbAecDrfSA1MTNbDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06e55d60a262098631becf1c8d016d899f45c6a976e64bfeaa805d7c009dd3cc","last_reissued_at":"2026-05-18T03:25:06.332275Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:06.332275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1005.0895","source_version":4,"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-18T03:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FV1FTSdYOvgfMrRVRSgdVg8OURKmqu3w/dRmtyZi7nRq1UcIH1/6SDm1YqbDH2yPnFcVIqVyH8C8NDzA4SUTBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:19:26.414480Z"},"content_sha256":"cd262c781c5bc6a9a02a57d3967e5524cf6de3523e5eaf3f5f1ea56f76f0870e","schema_version":"1.0","event_id":"sha256:cd262c781c5bc6a9a02a57d3967e5524cf6de3523e5eaf3f5f1ea56f76f0870e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:A3SV2YFCMIEYMMN6Z4OI2ALNRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Small Minors in Dense Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"David R. Wood, Dirk Oliver Theis, Gwena\\\"el Joret, Samuel Fiorini","submitted_at":"2010-05-06T06:30:49Z","abstract_excerpt":"A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of the whole graph. More precisely, we describe functions $f$ and $h$ such that every graph with $n$ vertices and average degree at least $f(t)$ contains a $K_t$-model with at most $h(t)\\cdot\\log n$ vertices. The logarithmic dependence on $n$ is best possible (for fixed $t$). In general, we prove that $f(t)\\leq 2^{t-1}+\\eps$. For $t\\leq 4$, we determine the lea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0895","kind":"arxiv","version":4},"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-18T03:25:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyZA64dye+7BIxH7nG61T4TmiCtdYJ94xY3rQD9QQRexpgLfJgz3djUylXgP+Q3QeJ+akcquslI2qyVfrd9OBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-24T00:19:26.415118Z"},"content_sha256":"c1c9c12a812fa7f47941bbe4115b0525d93eb97c8f1298ab2618ba4847816a00","schema_version":"1.0","event_id":"sha256:c1c9c12a812fa7f47941bbe4115b0525d93eb97c8f1298ab2618ba4847816a00"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG/bundle.json","state_url":"https://pith.science/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG/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-24T00:19:26Z","links":{"resolver":"https://pith.science/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG","bundle":"https://pith.science/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG/bundle.json","state":"https://pith.science/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/A3SV2YFCMIEYMMN6Z4OI2ALNRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:A3SV2YFCMIEYMMN6Z4OI2ALNRG","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":"f825ea46fad04e124a90422603ecb7de270d74cbe65dade925878dec47d01b92","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-06T06:30:49Z","title_canon_sha256":"5b41232d897949efc91f5faefca0997f649a4a654fe8c6e7f2d9236172e765fd"},"schema_version":"1.0","source":{"id":"1005.0895","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1005.0895","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"arxiv_version","alias_value":"1005.0895v4","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.0895","created_at":"2026-05-18T03:25:06Z"},{"alias_kind":"pith_short_12","alias_value":"A3SV2YFCMIEY","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"A3SV2YFCMIEYMMN6","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"A3SV2YFC","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:c1c9c12a812fa7f47941bbe4115b0525d93eb97c8f1298ab2618ba4847816a00","target":"graph","created_at":"2026-05-18T03:25:06Z","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":"A fundamental result in structural graph theory states that every graph with large average degree contains a large complete graph as a minor. We prove this result with the extra property that the minor is small with respect to the order of the whole graph. More precisely, we describe functions $f$ and $h$ such that every graph with $n$ vertices and average degree at least $f(t)$ contains a $K_t$-model with at most $h(t)\\cdot\\log n$ vertices. The logarithmic dependence on $n$ is best possible (for fixed $t$). In general, we prove that $f(t)\\leq 2^{t-1}+\\eps$. For $t\\leq 4$, we determine the lea","authors_text":"David R. Wood, Dirk Oliver Theis, Gwena\\\"el Joret, Samuel Fiorini","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-06T06:30:49Z","title":"Small Minors in Dense Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.0895","kind":"arxiv","version":4},"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:cd262c781c5bc6a9a02a57d3967e5524cf6de3523e5eaf3f5f1ea56f76f0870e","target":"record","created_at":"2026-05-18T03:25:06Z","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":"f825ea46fad04e124a90422603ecb7de270d74cbe65dade925878dec47d01b92","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-05-06T06:30:49Z","title_canon_sha256":"5b41232d897949efc91f5faefca0997f649a4a654fe8c6e7f2d9236172e765fd"},"schema_version":"1.0","source":{"id":"1005.0895","kind":"arxiv","version":4}},"canonical_sha256":"06e55d60a262098631becf1c8d016d899f45c6a976e64bfeaa805d7c009dd3cc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"06e55d60a262098631becf1c8d016d899f45c6a976e64bfeaa805d7c009dd3cc","first_computed_at":"2026-05-18T03:25:06.332275Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:06.332275Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B/nf96yYQnw0S5ZDo9rIPsOyRKi248YerJN0dDQ5eaZyWmMeICbKoFVksA87bGOBnHP2/zbAecDrfSA1MTNbDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:06.333056Z","signed_message":"canonical_sha256_bytes"},"source_id":"1005.0895","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd262c781c5bc6a9a02a57d3967e5524cf6de3523e5eaf3f5f1ea56f76f0870e","sha256:c1c9c12a812fa7f47941bbe4115b0525d93eb97c8f1298ab2618ba4847816a00"],"state_sha256":"03d60ced10ef7b72daf7ed47f3de0d2ec9e954265638f56a7950161efff6e540"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N752hgLfWi16rzylyljFeASmO2kTlYTwtdHrxFtrCoTlXkWBJa7+Ww5OPv5y/0guu+DgRCvsZ02wXHJulGAlDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-24T00:19:26.419011Z","bundle_sha256":"c55f7fcf91ffca664c1a726cebd6a9fd09d6748dd8669e55b20cf764c3835e3b"}}