{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:Q2S6N7RIQBM6RP67F4R4JQFGQ2","short_pith_number":"pith:Q2S6N7RI","schema_version":"1.0","canonical_sha256":"86a5e6fe288059e8bfdf2f23c4c0a68692d0fc65dda6870cfa3802a398f38f4b","source":{"kind":"arxiv","id":"1309.7886","version":2},"attestation_state":"computed","paper":{"title":"Logarithmically-small Minors and Topological Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2013-09-30T15:39:40Z","abstract_excerpt":"Mader proved that for every integer $t$ there is a smallest real number $c(t)$ such that any graph with average degree at least $c(t)$ must contain a $K_t$-minor. Fiorini, Joret, Theis and Wood conjectured that any graph with $n$ vertices and average degree at least $c(t)+\\epsilon$ must contain a $K_t$-minor consisting of at most $C(\\epsilon,t)\\log n$ vertices. Shapira and Sudakov subsequently proved that such a graph contains a $K_t$-minor consisting of at most $C(\\epsilon,t)\\log n \\log\\log n$ vertices. Here we build on their method using graph expansion to remove the $\\log\\log n$ factor and "},"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":"1309.7886","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T15:39:40Z","cross_cats_sorted":[],"title_canon_sha256":"7e251de7b3f6bdcc1a4b44524dd3d32419422c59b62a29afb22a949c361e4e3e","abstract_canon_sha256":"b4d06850f7cd4fd67933f2f75039097145b7dff699367a817ebf99d71b6a83d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:53:09.692272Z","signature_b64":"QVWqjqPsGYgwMLzrluTKeERBojVsT2s9W8DFDcaOMHkrj1RF04Xe8BHEWVQoaAgdcDc5bAcmWXnkVrmrElkSCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"86a5e6fe288059e8bfdf2f23c4c0a68692d0fc65dda6870cfa3802a398f38f4b","last_reissued_at":"2026-05-18T01:53:09.691580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:53:09.691580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Logarithmically-small Minors and Topological Minors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Richard Montgomery","submitted_at":"2013-09-30T15:39:40Z","abstract_excerpt":"Mader proved that for every integer $t$ there is a smallest real number $c(t)$ such that any graph with average degree at least $c(t)$ must contain a $K_t$-minor. Fiorini, Joret, Theis and Wood conjectured that any graph with $n$ vertices and average degree at least $c(t)+\\epsilon$ must contain a $K_t$-minor consisting of at most $C(\\epsilon,t)\\log n$ vertices. Shapira and Sudakov subsequently proved that such a graph contains a $K_t$-minor consisting of at most $C(\\epsilon,t)\\log n \\log\\log n$ vertices. Here we build on their method using graph expansion to remove the $\\log\\log n$ factor and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7886","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":""},"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":"1309.7886","created_at":"2026-05-18T01:53:09.691695+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7886v2","created_at":"2026-05-18T01:53:09.691695+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7886","created_at":"2026-05-18T01:53:09.691695+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q2S6N7RIQBM6","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q2S6N7RIQBM6RP67","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q2S6N7RI","created_at":"2026-05-18T12:27:57.521954+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/Q2S6N7RIQBM6RP67F4R4JQFGQ2","json":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2.json","graph_json":"https://pith.science/api/pith-number/Q2S6N7RIQBM6RP67F4R4JQFGQ2/graph.json","events_json":"https://pith.science/api/pith-number/Q2S6N7RIQBM6RP67F4R4JQFGQ2/events.json","paper":"https://pith.science/paper/Q2S6N7RI"},"agent_actions":{"view_html":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2","download_json":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2.json","view_paper":"https://pith.science/paper/Q2S6N7RI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7886&json=true","fetch_graph":"https://pith.science/api/pith-number/Q2S6N7RIQBM6RP67F4R4JQFGQ2/graph.json","fetch_events":"https://pith.science/api/pith-number/Q2S6N7RIQBM6RP67F4R4JQFGQ2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/action/storage_attestation","attest_author":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/action/author_attestation","sign_citation":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/action/citation_signature","submit_replication":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/action/replication_record"}},"created_at":"2026-05-18T01:53:09.691695+00:00","updated_at":"2026-05-18T01:53:09.691695+00:00"}