{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:MJ5K2NEXYVP3O42ZDF66GHOG4R","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":"c70228ea59b809fca525e1d89a8018aa3026ffc63285edc5ee3599d36ecea2c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T09:49:52Z","title_canon_sha256":"205e0535c8d2bf8fb2acb6b35326edbdec36da9110465f0f0d7e1c9c5437ec81"},"schema_version":"1.0","source":{"id":"1305.1451","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1451","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1451v2","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1451","created_at":"2026-05-18T01:15:59Z"},{"alias_kind":"pith_short_12","alias_value":"MJ5K2NEXYVP3","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"MJ5K2NEXYVP3O42Z","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"MJ5K2NEX","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:293328b5ee8f832ef487e500d44280dd55a00d32f766ed44f5a0b699c3cb8187","target":"graph","created_at":"2026-05-18T01:15: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":"Let $\\Sigma$ be a surface with boundary $b(\\Sigma)$, $\\mathcal{L}$ be a collection of $k$ disjoint $b(\\Sigma)$-paths in $\\Sigma$, and $P$ be a non-separating $b(\\Sigma)$-path in $\\Sigma$. We prove that there is a homeomorphism $\\phi: \\Sigma \\to \\Sigma$ that fixes each point of $b(\\Sigma)$ and such that $\\phi(\\mathcal{L})$ meets $P$ at most $2k$ times.\n  With this theorem, we derive explicit constants in the graph minor algorithms of Robertson and Seymour. We reprove a result concerning redundant vertices for graphs on surfaces, but with explicit bounds. That is, we prove that there exists a co","authors_text":"Jim Geelen, R. Bruce Richter, Tony Huynh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T09:49:52Z","title":"Explicit bounds for graph minors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1451","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:ec3decb3e4ac2538563eb9d8bf09ddaae660e2816650c6a0c4bce53c2751a9b2","target":"record","created_at":"2026-05-18T01:15: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":"c70228ea59b809fca525e1d89a8018aa3026ffc63285edc5ee3599d36ecea2c0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-05-07T09:49:52Z","title_canon_sha256":"205e0535c8d2bf8fb2acb6b35326edbdec36da9110465f0f0d7e1c9c5437ec81"},"schema_version":"1.0","source":{"id":"1305.1451","kind":"arxiv","version":2}},"canonical_sha256":"627aad3497c55fb77359197de31dc6e4740848e3a73d2ce6ab7f88287f8f8b71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"627aad3497c55fb77359197de31dc6e4740848e3a73d2ce6ab7f88287f8f8b71","first_computed_at":"2026-05-18T01:15:59.365049Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:59.365049Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVIS2oL7uHPLE8+eVbX8LXtFqnOGxoj597yk7cwHwo7i1A502AuIR/J63c1NA6uSD+WxkA+E7+PHIuutrwwEAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:59.365640Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1451","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ec3decb3e4ac2538563eb9d8bf09ddaae660e2816650c6a0c4bce53c2751a9b2","sha256:293328b5ee8f832ef487e500d44280dd55a00d32f766ed44f5a0b699c3cb8187"],"state_sha256":"65912ae4f662681f719225eb7e417e631bf3271134b4b3cb754868b86f808d32"}