{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:R4C6EPI5VZQ2PUSUFZBH75UQOY","short_pith_number":"pith:R4C6EPI5","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"},"canonical_sha256":"8f05e23d1dae61a7d2542e427ff69076358822e7587b831006b790a42aa1ab95","source":{"kind":"arxiv","id":"1202.2624","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2624","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2624v2","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2624","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"R4C6EPI5VZQ2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R4C6EPI5VZQ2PUSU","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R4C6EPI5","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:R4C6EPI5VZQ2PUSUFZBH75UQOY","target":"record","payload":{"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"},"canonical_sha256":"8f05e23d1dae61a7d2542e427ff69076358822e7587b831006b790a42aa1ab95","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"},"source_kind":"arxiv","source_id":"1202.2624","source_version":2,"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:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PB1N1EvVpFr51kuNDDAjY2NPrs7jG6X/CTIjNN6WaKsDoiCTEz592IJSsj2orNA//VD0xVNm6+HIVgJ8j9vNDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:15:05.686007Z"},"content_sha256":"94ad99a80daba321c3e93cf51a640bd737f2297b06596cb724a85bf6d765765a","schema_version":"1.0","event_id":"sha256:94ad99a80daba321c3e93cf51a640bd737f2297b06596cb724a85bf6d765765a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:R4C6EPI5VZQ2PUSUFZBH75UQOY","target":"graph","payload":{"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"},"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:03:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L6U09ZxTVjjvnjGJDB/WtW+hvq/Q/vQzt0HneFTdH8WwwMcgiD9XWnbbcNTsH383lRVHqo8+1jWfV0YFBNrkCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:15:05.686715Z"},"content_sha256":"09e9c0a25bf27e2f38bd14bdaf506afb55f997a771dcaf41e96123e50b0fa5a0","schema_version":"1.0","event_id":"sha256:09e9c0a25bf27e2f38bd14bdaf506afb55f997a771dcaf41e96123e50b0fa5a0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/bundle.json","state_url":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/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-30T15:15:05Z","links":{"resolver":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY","bundle":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/bundle.json","state":"https://pith.science/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R4C6EPI5VZQ2PUSUFZBH75UQOY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:R4C6EPI5VZQ2PUSUFZBH75UQOY","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":"ebf064a91dc9f7e014ee9818d96e865bd278ab61c76f13aaa4582851269615a9","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-13T04:46:01Z","title_canon_sha256":"eb428efa109a768bce25b639d792ad9ac552e53f08dd7218103020c3e16925e8"},"schema_version":"1.0","source":{"id":"1202.2624","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1202.2624","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"arxiv_version","alias_value":"1202.2624v2","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1202.2624","created_at":"2026-05-18T03:03:21Z"},{"alias_kind":"pith_short_12","alias_value":"R4C6EPI5VZQ2","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"R4C6EPI5VZQ2PUSU","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"R4C6EPI5","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:09e9c0a25bf27e2f38bd14bdaf506afb55f997a771dcaf41e96123e50b0fa5a0","target":"graph","created_at":"2026-05-18T03:03:21Z","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":"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}.","authors_text":"Bruce Reed, Daniel J. Harvey, David R. Wood, Gwena\\\"el Joret, Vida Dujmovi\\'c","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-13T04:46:01Z","title":"A linear-time algorithm for finding a complete graph minor in a dense graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1202.2624","kind":"arxiv","version":2},"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:94ad99a80daba321c3e93cf51a640bd737f2297b06596cb724a85bf6d765765a","target":"record","created_at":"2026-05-18T03:03:21Z","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":"ebf064a91dc9f7e014ee9818d96e865bd278ab61c76f13aaa4582851269615a9","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-02-13T04:46:01Z","title_canon_sha256":"eb428efa109a768bce25b639d792ad9ac552e53f08dd7218103020c3e16925e8"},"schema_version":"1.0","source":{"id":"1202.2624","kind":"arxiv","version":2}},"canonical_sha256":"8f05e23d1dae61a7d2542e427ff69076358822e7587b831006b790a42aa1ab95","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f05e23d1dae61a7d2542e427ff69076358822e7587b831006b790a42aa1ab95","first_computed_at":"2026-05-18T03:03:21.430697Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:03:21.430697Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9p2ippwctHI/K/4mAhjgNYgnwSqNpsIaabtwETK9WSTKxII/iwfFboUudIwc73CtIB/+6bLB1NPo5HgPMFQfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:03:21.431276Z","signed_message":"canonical_sha256_bytes"},"source_id":"1202.2624","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94ad99a80daba321c3e93cf51a640bd737f2297b06596cb724a85bf6d765765a","sha256:09e9c0a25bf27e2f38bd14bdaf506afb55f997a771dcaf41e96123e50b0fa5a0"],"state_sha256":"b6e1f3d1db90e77c2025ada5e0421eaa07d7f4b6bb199317d23ee321f0bd38f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJCLb48gl58+uCyfMuvm3VS+AMTcsC9ISaEEaxaIovgy1RCVr9qBE4UAVQeOzXGqFHwwtWO/aRwptpVhRC5ABg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:15:05.690858Z","bundle_sha256":"c931baac608fb2c277718f07a26fb726d7ac74401d06814315b73a2651a4e05b"}}