{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:JB6774LVW3VH3LLYC46V252OP2","short_pith_number":"pith:JB6774LV","canonical_record":{"source":{"id":"1105.3549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-18T07:20:19Z","cross_cats_sorted":[],"title_canon_sha256":"68dc6dc6cc6e9a471aa6c352940175f5ae0e3367930be4347c26d061bddb73c6","abstract_canon_sha256":"d6b6467b16dc008eeb294285cd458ec7014237184cf61b72f5326721dd8e3fcc"},"schema_version":"1.0"},"canonical_sha256":"487dfff175b6ea7dad78173d5d774e7ebf9c33beed48eb75c57f32bf4875f985","source":{"kind":"arxiv","id":"1105.3549","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3549","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3549v2","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3549","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"JB6774LVW3VH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JB6774LVW3VH3LLY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JB6774LV","created_at":"2026-05-18T12:26:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:JB6774LVW3VH3LLYC46V252OP2","target":"record","payload":{"canonical_record":{"source":{"id":"1105.3549","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-18T07:20:19Z","cross_cats_sorted":[],"title_canon_sha256":"68dc6dc6cc6e9a471aa6c352940175f5ae0e3367930be4347c26d061bddb73c6","abstract_canon_sha256":"d6b6467b16dc008eeb294285cd458ec7014237184cf61b72f5326721dd8e3fcc"},"schema_version":"1.0"},"canonical_sha256":"487dfff175b6ea7dad78173d5d774e7ebf9c33beed48eb75c57f32bf4875f985","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:59.479512Z","signature_b64":"YHQiQsESMI2rGRPsEQtDsWDPd5teYlVyV3TsxxrcuMKHpEQ58SL3elEaQzeYrUweP/pm/pwaMT0/n34WpbG5DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"487dfff175b6ea7dad78173d5d774e7ebf9c33beed48eb75c57f32bf4875f985","last_reissued_at":"2026-05-18T02:21:59.478812Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:59.478812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1105.3549","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-18T02:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cB2rISy0SxmttTlE4vI9/aIVwQSqlnpV+tvVrejYtOcSr+G/7gRpfyYTGyWichDbzve+tTvJKzrLJF2BRKFECQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:38:24.413835Z"},"content_sha256":"4a352a36c30374585e1b2187ddff56f41bbbb205000e43ae47c0f7809a413382","schema_version":"1.0","event_id":"sha256:4a352a36c30374585e1b2187ddff56f41bbbb205000e43ae47c0f7809a413382"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:JB6774LVW3VH3LLYC46V252OP2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Complete Graph Minors and the Graph Minor Structure Theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"David R. Wood, Gwena\\\"el Joret","submitted_at":"2011-05-18T07:20:19Z","abstract_excerpt":"The graph minor structure theorem by Robertson and Seymour shows that every graph that excludes a fixed minor can be constructed by a combination of four ingredients: graphs embedded in a surface of bounded genus, a bounded number of vortices of bounded width, a bounded number of apex vertices, and the clique-sum operation. This paper studies the converse question: What is the maximum order of a complete graph minor in a graph constructed using these four ingredients? Our main result answers this question up to a constant factor."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3549","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-18T02:21:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cNw/ZUMB+cDL4VDGPU83jKd7Vp04YqryCZwiDoSicoj4dFr95YP03kPQtXVv/lqCqqNkCKhzIFB1Toc595OmDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T17:38:24.414185Z"},"content_sha256":"cb41e8af4431d6b3d3a305428bc735bdb5dea88f4a62dc091e4c312ab12aa7ce","schema_version":"1.0","event_id":"sha256:cb41e8af4431d6b3d3a305428bc735bdb5dea88f4a62dc091e4c312ab12aa7ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JB6774LVW3VH3LLYC46V252OP2/bundle.json","state_url":"https://pith.science/pith/JB6774LVW3VH3LLYC46V252OP2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JB6774LVW3VH3LLYC46V252OP2/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-06-05T17:38:24Z","links":{"resolver":"https://pith.science/pith/JB6774LVW3VH3LLYC46V252OP2","bundle":"https://pith.science/pith/JB6774LVW3VH3LLYC46V252OP2/bundle.json","state":"https://pith.science/pith/JB6774LVW3VH3LLYC46V252OP2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JB6774LVW3VH3LLYC46V252OP2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:JB6774LVW3VH3LLYC46V252OP2","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":"d6b6467b16dc008eeb294285cd458ec7014237184cf61b72f5326721dd8e3fcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-18T07:20:19Z","title_canon_sha256":"68dc6dc6cc6e9a471aa6c352940175f5ae0e3367930be4347c26d061bddb73c6"},"schema_version":"1.0","source":{"id":"1105.3549","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1105.3549","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"arxiv_version","alias_value":"1105.3549v2","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1105.3549","created_at":"2026-05-18T02:21:59Z"},{"alias_kind":"pith_short_12","alias_value":"JB6774LVW3VH","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_16","alias_value":"JB6774LVW3VH3LLY","created_at":"2026-05-18T12:26:32Z"},{"alias_kind":"pith_short_8","alias_value":"JB6774LV","created_at":"2026-05-18T12:26:32Z"}],"graph_snapshots":[{"event_id":"sha256:cb41e8af4431d6b3d3a305428bc735bdb5dea88f4a62dc091e4c312ab12aa7ce","target":"graph","created_at":"2026-05-18T02:21:59Z","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":"The graph minor structure theorem by Robertson and Seymour shows that every graph that excludes a fixed minor can be constructed by a combination of four ingredients: graphs embedded in a surface of bounded genus, a bounded number of vortices of bounded width, a bounded number of apex vertices, and the clique-sum operation. This paper studies the converse question: What is the maximum order of a complete graph minor in a graph constructed using these four ingredients? Our main result answers this question up to a constant factor.","authors_text":"David R. Wood, Gwena\\\"el Joret","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-18T07:20:19Z","title":"Complete Graph Minors and the Graph Minor Structure Theorem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1105.3549","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:4a352a36c30374585e1b2187ddff56f41bbbb205000e43ae47c0f7809a413382","target":"record","created_at":"2026-05-18T02:21:59Z","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":"d6b6467b16dc008eeb294285cd458ec7014237184cf61b72f5326721dd8e3fcc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-05-18T07:20:19Z","title_canon_sha256":"68dc6dc6cc6e9a471aa6c352940175f5ae0e3367930be4347c26d061bddb73c6"},"schema_version":"1.0","source":{"id":"1105.3549","kind":"arxiv","version":2}},"canonical_sha256":"487dfff175b6ea7dad78173d5d774e7ebf9c33beed48eb75c57f32bf4875f985","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"487dfff175b6ea7dad78173d5d774e7ebf9c33beed48eb75c57f32bf4875f985","first_computed_at":"2026-05-18T02:21:59.478812Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:59.478812Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YHQiQsESMI2rGRPsEQtDsWDPd5teYlVyV3TsxxrcuMKHpEQ58SL3elEaQzeYrUweP/pm/pwaMT0/n34WpbG5DA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:59.479512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1105.3549","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a352a36c30374585e1b2187ddff56f41bbbb205000e43ae47c0f7809a413382","sha256:cb41e8af4431d6b3d3a305428bc735bdb5dea88f4a62dc091e4c312ab12aa7ce"],"state_sha256":"81bd90beb885638e45b98d04c9e26ea0a2ddd9fd33b3351b8154f7886b32f03b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nsFeQHN8WpAic65wg894MMFYlW35VeFBlD1hnZ75KlO3pjGKxxQ4fhy5y1Bb14ULKtAKh98/rd0+TveTqYe+Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T17:38:24.416214Z","bundle_sha256":"dc0427cd89ab6c25623be07b7821fec33a1525b54af80b75e98cad564063a5a4"}}