{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:Q2S6N7RIQBM6RP67F4R4JQFGQ2","short_pith_number":"pith:Q2S6N7RI","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"},"canonical_sha256":"86a5e6fe288059e8bfdf2f23c4c0a68692d0fc65dda6870cfa3802a398f38f4b","source":{"kind":"arxiv","id":"1309.7886","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7886","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7886v2","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7886","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q2S6N7RIQBM6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q2S6N7RIQBM6RP67","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q2S6N7RI","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:Q2S6N7RIQBM6RP67F4R4JQFGQ2","target":"record","payload":{"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"},"canonical_sha256":"86a5e6fe288059e8bfdf2f23c4c0a68692d0fc65dda6870cfa3802a398f38f4b","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"},"source_kind":"arxiv","source_id":"1309.7886","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-18T01:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QZIBvtGTO75WqvYVjVa75T3E6wAhhTGSfMqzt/MOogXOGeM+mMF6qk8Cvuom8MFQXMJ3yels8BesuukZ74YpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:36:37.905676Z"},"content_sha256":"4f2742d1cdea73091fdbf850063489199234575bdef1d4901b069c4ca986f64c","schema_version":"1.0","event_id":"sha256:4f2742d1cdea73091fdbf850063489199234575bdef1d4901b069c4ca986f64c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:Q2S6N7RIQBM6RP67F4R4JQFGQ2","target":"graph","payload":{"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"},"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-18T01:53:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/p1H7N7mw4OnPU+jDKfW1AokxSDkqDpOl0B6GD7vVkIGWlGCuQmt6H8C1RsJHsIWnSPBYqoQs9JRpU2CHQJ8CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T14:36:37.906025Z"},"content_sha256":"d4f5d26479b66f92b13fa7e38e2da98632a0a683e6cbc6dc5799a9f9c8215b25","schema_version":"1.0","event_id":"sha256:d4f5d26479b66f92b13fa7e38e2da98632a0a683e6cbc6dc5799a9f9c8215b25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/bundle.json","state_url":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/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-02T14:36:37Z","links":{"resolver":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2","bundle":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/bundle.json","state":"https://pith.science/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q2S6N7RIQBM6RP67F4R4JQFGQ2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:Q2S6N7RIQBM6RP67F4R4JQFGQ2","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":"b4d06850f7cd4fd67933f2f75039097145b7dff699367a817ebf99d71b6a83d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T15:39:40Z","title_canon_sha256":"7e251de7b3f6bdcc1a4b44524dd3d32419422c59b62a29afb22a949c361e4e3e"},"schema_version":"1.0","source":{"id":"1309.7886","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7886","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7886v2","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7886","created_at":"2026-05-18T01:53:09Z"},{"alias_kind":"pith_short_12","alias_value":"Q2S6N7RIQBM6","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"Q2S6N7RIQBM6RP67","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"Q2S6N7RI","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:d4f5d26479b66f92b13fa7e38e2da98632a0a683e6cbc6dc5799a9f9c8215b25","target":"graph","created_at":"2026-05-18T01:53:09Z","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":"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 ","authors_text":"Richard Montgomery","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T15:39:40Z","title":"Logarithmically-small Minors and Topological Minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7886","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:4f2742d1cdea73091fdbf850063489199234575bdef1d4901b069c4ca986f64c","target":"record","created_at":"2026-05-18T01:53:09Z","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":"b4d06850f7cd4fd67933f2f75039097145b7dff699367a817ebf99d71b6a83d8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T15:39:40Z","title_canon_sha256":"7e251de7b3f6bdcc1a4b44524dd3d32419422c59b62a29afb22a949c361e4e3e"},"schema_version":"1.0","source":{"id":"1309.7886","kind":"arxiv","version":2}},"canonical_sha256":"86a5e6fe288059e8bfdf2f23c4c0a68692d0fc65dda6870cfa3802a398f38f4b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"86a5e6fe288059e8bfdf2f23c4c0a68692d0fc65dda6870cfa3802a398f38f4b","first_computed_at":"2026-05-18T01:53:09.691580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:53:09.691580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVWqjqPsGYgwMLzrluTKeERBojVsT2s9W8DFDcaOMHkrj1RF04Xe8BHEWVQoaAgdcDc5bAcmWXnkVrmrElkSCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:53:09.692272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7886","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4f2742d1cdea73091fdbf850063489199234575bdef1d4901b069c4ca986f64c","sha256:d4f5d26479b66f92b13fa7e38e2da98632a0a683e6cbc6dc5799a9f9c8215b25"],"state_sha256":"cef178b034d650c7eebbf6f452522fcd7ec22808652efa110863d03fd58ccb30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qG8s/BPBl1jpZRGTcx8NXRPGWDEdcdXYgTpQ8vKKbgb+CiFQ7SDTOyhT8W/92zvSm127IKhOtyd5+CsPqlVDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T14:36:37.908029Z","bundle_sha256":"780c0bfed45aa9cbc294a07563cd8c962eb6f19e4da938a6cdec1604f330fb59"}}