{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:RGGS2KDJFUXF2GXHBYKHUXHO6K","short_pith_number":"pith:RGGS2KDJ","schema_version":"1.0","canonical_sha256":"898d2d28692d2e5d1ae70e147a5ceef28da6f81512ad39bcfdecbb4229d22e22","source":{"kind":"arxiv","id":"1309.7820","version":1},"attestation_state":"computed","paper":{"title":"A single exponential bound for the redundant vertex Theorem on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Mazoit (LaBRI)","submitted_at":"2013-09-30T12:25:38Z","abstract_excerpt":"Let s1, t1,. . . sk, tk be vertices in a graph G embedded on a surface \\sigma of genus g. A vertex v of G is \"redundant\" if there exist k vertex disjoint paths linking si and ti (1 \\lequal i \\lequal k) in G if and only if such paths also exist in G - v. Robertson and Seymour proved in Graph Minors VII that if v is \"far\" from the vertices si and tj and v is surrounded in a planar part of \\sigma by l(g, k) disjoint cycles, then v is redundant. Unfortunately, their proof of the existence of l(g, k) is not constructive. In this paper, we give an explicit single exponential bound in g and k."},"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":"1309.7820","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-30T12:25:38Z","cross_cats_sorted":[],"title_canon_sha256":"b55f5278030686ec5c68e54505f0b706b19b6c4bc93cee6565a605a85a3a4c02","abstract_canon_sha256":"aeef560f75b3b2378d9803d4e29ae54546c86ef35b6f3afd66bfb32fb5d29de6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:11:48.117254Z","signature_b64":"cFN1cBQyXlMRz1v6NMVbQZsKxvQRFz+TDA3fVrEafk5kwkQitoMXlUVGlBtnX2IlrwIvrhJzV+hW/9FuJGJvAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"898d2d28692d2e5d1ae70e147a5ceef28da6f81512ad39bcfdecbb4229d22e22","last_reissued_at":"2026-05-18T03:11:48.116403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:11:48.116403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A single exponential bound for the redundant vertex Theorem on surfaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fr\\'ed\\'eric Mazoit (LaBRI)","submitted_at":"2013-09-30T12:25:38Z","abstract_excerpt":"Let s1, t1,. . . sk, tk be vertices in a graph G embedded on a surface \\sigma of genus g. A vertex v of G is \"redundant\" if there exist k vertex disjoint paths linking si and ti (1 \\lequal i \\lequal k) in G if and only if such paths also exist in G - v. Robertson and Seymour proved in Graph Minors VII that if v is \"far\" from the vertices si and tj and v is surrounded in a planar part of \\sigma by l(g, k) disjoint cycles, then v is redundant. Unfortunately, their proof of the existence of l(g, k) is not constructive. In this paper, we give an explicit single exponential bound in g and k."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7820","kind":"arxiv","version":1},"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":"1309.7820","created_at":"2026-05-18T03:11:48.116543+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7820v1","created_at":"2026-05-18T03:11:48.116543+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7820","created_at":"2026-05-18T03:11:48.116543+00:00"},{"alias_kind":"pith_short_12","alias_value":"RGGS2KDJFUXF","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"RGGS2KDJFUXF2GXH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"RGGS2KDJ","created_at":"2026-05-18T12:27:57.521954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1907.05940","citing_title":"Finding irrelevant vertices in linear time on bounded-genus graphs","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K","json":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K.json","graph_json":"https://pith.science/api/pith-number/RGGS2KDJFUXF2GXHBYKHUXHO6K/graph.json","events_json":"https://pith.science/api/pith-number/RGGS2KDJFUXF2GXHBYKHUXHO6K/events.json","paper":"https://pith.science/paper/RGGS2KDJ"},"agent_actions":{"view_html":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K","download_json":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K.json","view_paper":"https://pith.science/paper/RGGS2KDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7820&json=true","fetch_graph":"https://pith.science/api/pith-number/RGGS2KDJFUXF2GXHBYKHUXHO6K/graph.json","fetch_events":"https://pith.science/api/pith-number/RGGS2KDJFUXF2GXHBYKHUXHO6K/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K/action/storage_attestation","attest_author":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K/action/author_attestation","sign_citation":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K/action/citation_signature","submit_replication":"https://pith.science/pith/RGGS2KDJFUXF2GXHBYKHUXHO6K/action/replication_record"}},"created_at":"2026-05-18T03:11:48.116543+00:00","updated_at":"2026-05-18T03:11:48.116543+00:00"}