{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:SAYC6I2AFEK3RUHYIKCS4YOSS5","short_pith_number":"pith:SAYC6I2A","schema_version":"1.0","canonical_sha256":"90302f23402915b8d0f842852e61d2977542460144d94ccefa7795a8f6b35d0f","source":{"kind":"arxiv","id":"1502.00911","version":3},"attestation_state":"computed","paper":{"title":"Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"\\'Eric Colin de Verdi\\`ere","submitted_at":"2015-02-03T16:23:50Z","abstract_excerpt":"Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair belong to different connected components of the graph. Relying on topological techniques, we provide a polynomial-time algorithm for this problem in the case where G is embedded on a fixed surface of genus g (e.g., when G is planar) and has a fixed number t of terminals. The running time is a polynomial of degree O(sqrt{g^2+gt}) in the input size.\n  In the "},"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":"1502.00911","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T16:23:50Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"239448ce143e7656d6def14ba45bc7d3d215a4bf899e31b9dc9cf557a5235a95","abstract_canon_sha256":"70466932b4896c81393c0af764cdc3bdc5a42df7ebf6705f751cd0be16e0b1a5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:57:05.062205Z","signature_b64":"AVXw/jdXqg0Z1oXMX92mXM9PH263asuipGe/sSg9KWmhxfK9dM41UWSEz2Lj3OFFsr89vQ/Ne7R4e5utyJ8EAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90302f23402915b8d0f842852e61d2977542460144d94ccefa7795a8f6b35d0f","last_reissued_at":"2026-05-18T00:57:05.061619Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:57:05.061619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"\\'Eric Colin de Verdi\\`ere","submitted_at":"2015-02-03T16:23:50Z","abstract_excerpt":"Given an undirected, edge-weighted graph G together with pairs of vertices, called pairs of terminals, the minimum multicut problem asks for a minimum-weight set of edges such that, after deleting these edges, the two terminals of each pair belong to different connected components of the graph. Relying on topological techniques, we provide a polynomial-time algorithm for this problem in the case where G is embedded on a fixed surface of genus g (e.g., when G is planar) and has a fixed number t of terminals. The running time is a polynomial of degree O(sqrt{g^2+gt}) in the input size.\n  In the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00911","kind":"arxiv","version":3},"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":"1502.00911","created_at":"2026-05-18T00:57:05.061706+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.00911v3","created_at":"2026-05-18T00:57:05.061706+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00911","created_at":"2026-05-18T00:57:05.061706+00:00"},{"alias_kind":"pith_short_12","alias_value":"SAYC6I2AFEK3","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_16","alias_value":"SAYC6I2AFEK3RUHY","created_at":"2026-05-18T12:29:39.896362+00:00"},{"alias_kind":"pith_short_8","alias_value":"SAYC6I2A","created_at":"2026-05-18T12:29:39.896362+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5","json":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5.json","graph_json":"https://pith.science/api/pith-number/SAYC6I2AFEK3RUHYIKCS4YOSS5/graph.json","events_json":"https://pith.science/api/pith-number/SAYC6I2AFEK3RUHYIKCS4YOSS5/events.json","paper":"https://pith.science/paper/SAYC6I2A"},"agent_actions":{"view_html":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5","download_json":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5.json","view_paper":"https://pith.science/paper/SAYC6I2A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.00911&json=true","fetch_graph":"https://pith.science/api/pith-number/SAYC6I2AFEK3RUHYIKCS4YOSS5/graph.json","fetch_events":"https://pith.science/api/pith-number/SAYC6I2AFEK3RUHYIKCS4YOSS5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/action/storage_attestation","attest_author":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/action/author_attestation","sign_citation":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/action/citation_signature","submit_replication":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/action/replication_record"}},"created_at":"2026-05-18T00:57:05.061706+00:00","updated_at":"2026-05-18T00:57:05.061706+00:00"}