{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:R4C6EPI5VZQ2PUSUFZBH75UQOY","short_pith_number":"pith:R4C6EPI5","schema_version":"1.0","canonical_sha256":"8f05e23d1dae61a7d2542e427ff69076358822e7587b831006b790a42aa1ab95","source":{"kind":"arxiv","id":"1202.2624","version":2},"attestation_state":"computed","paper":{"title":"A linear-time algorithm for finding a complete graph minor in a dense graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Bruce Reed, Daniel J. Harvey, David R. Wood, Gwena\\\"el Joret, Vida Dujmovi\\'c","submitted_at":"2012-02-13T04:46:01Z","abstract_excerpt":"Let g(t) be the minimum number such that every graph G with average degree d(G) \\geq g(t) contains a K_{t}-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) \\in \\Theta(t*sqrt{log t}). This article shows that for all fixed \\epsilon > 0 and fixed sufficiently large t \\geq t(\\epsilon), if d(G) \\geq (2+\\epsilon)g(t) then we can find this K_{t}-minor in linear time. This improves a previous result by Reed and Wood who gave a linear-time algorithm when d(G) \\geq 2^{t-2}."},"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":"1202.2624","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-13T04:46:01Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"eb428efa109a768bce25b639d792ad9ac552e53f08dd7218103020c3e16925e8","abstract_canon_sha256":"ebf064a91dc9f7e014ee9818d96e865bd278ab61c76f13aaa4582851269615a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:03:21.431276Z","signature_b64":"9p2ippwctHI/K/4mAhjgNYgnwSqNpsIaabtwETK9WSTKxII/iwfFboUudIwc73CtIB/+6bLB1NPo5HgPMFQfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f05e23d1dae61a7d2542e427ff69076358822e7587b831006b790a42aa1ab95","last_reissued_at":"2026-05-18T03:03:21.430697Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:03:21.430697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A linear-time algorithm for finding a complete graph minor in a dense graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Bruce Reed, Daniel J. Harvey, David R. Wood, Gwena\\\"el Joret, Vida Dujmovi\\'c","submitted_at":"2012-02-13T04:46:01Z","abstract_excerpt":"Let g(t) be the minimum number such that every graph G with average degree d(G) \\geq g(t) contains a K_{t}-minor. Such a function is known to exist, as originally shown by Mader. Kostochka and Thomason independently proved that g(t) \\in \\Theta(t*sqrt{log t}). This article shows that for all fixed \\epsilon > 0 and fixed sufficiently large t \\geq t(\\epsilon), if d(G) \\geq (2+\\epsilon)g(t) then we can find this K_{t}-minor in linear time. This improves a previous result by Reed and Wood who gave a linear-time algorithm when d(G) \\geq 2^{t-2}."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2624","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":"1202.2624","created_at":"2026-05-18T03:03:21.430786+00:00"},{"alias_kind":"arxiv_version","alias_value":"1202.2624v2","created_at":"2026-05-18T03:03:21.430786+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2624","created_at":"2026-05-18T03:03:21.430786+00:00"},{"alias_kind":"pith_short_12","alias_value":"R4C6EPI5VZQ2","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"R4C6EPI5VZQ2PUSU","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"R4C6EPI5","created_at":"2026-05-18T12:27:20.899486+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/R4C6EPI5VZQ2PUSUFZBH75UQOY","json":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY.json","graph_json":"https://pith.science/api/pith-number/R4C6EPI5VZQ2PUSUFZBH75UQOY/graph.json","events_json":"https://pith.science/api/pith-number/R4C6EPI5VZQ2PUSUFZBH75UQOY/events.json","paper":"https://pith.science/paper/R4C6EPI5"},"agent_actions":{"view_html":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY","download_json":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY.json","view_paper":"https://pith.science/paper/R4C6EPI5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1202.2624&json=true","fetch_graph":"https://pith.science/api/pith-number/R4C6EPI5VZQ2PUSUFZBH75UQOY/graph.json","fetch_events":"https://pith.science/api/pith-number/R4C6EPI5VZQ2PUSUFZBH75UQOY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/action/storage_attestation","attest_author":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/action/author_attestation","sign_citation":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/action/citation_signature","submit_replication":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/action/replication_record"}},"created_at":"2026-05-18T03:03:21.430786+00:00","updated_at":"2026-05-18T03:03:21.430786+00:00"}