{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:SAYC6I2AFEK3RUHYIKCS4YOSS5","short_pith_number":"pith:SAYC6I2A","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"},"canonical_sha256":"90302f23402915b8d0f842852e61d2977542460144d94ccefa7795a8f6b35d0f","source":{"kind":"arxiv","id":"1502.00911","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00911","created_at":"2026-05-18T00:57:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00911v3","created_at":"2026-05-18T00:57:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00911","created_at":"2026-05-18T00:57:05Z"},{"alias_kind":"pith_short_12","alias_value":"SAYC6I2AFEK3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SAYC6I2AFEK3RUHY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SAYC6I2A","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:SAYC6I2AFEK3RUHYIKCS4YOSS5","target":"record","payload":{"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"},"canonical_sha256":"90302f23402915b8d0f842852e61d2977542460144d94ccefa7795a8f6b35d0f","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"},"source_kind":"arxiv","source_id":"1502.00911","source_version":3,"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-18T00:57:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TzYEcneMs4VQAT77yaq2r4ec6sGO5hPl9upLtJ7YH1fd6MXKMP5DhQFf5+lblqm2K8suQFFVApQbFCSJRHf7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:17:30.646854Z"},"content_sha256":"3c3b02ac157c2a717a0fa930d82d65465ed658c82391b1144a912860828654a3","schema_version":"1.0","event_id":"sha256:3c3b02ac157c2a717a0fa930d82d65465ed658c82391b1144a912860828654a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:SAYC6I2AFEK3RUHYIKCS4YOSS5","target":"graph","payload":{"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"},"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-18T00:57:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CmEHmTyioVvelpoFvzMzFiXh5OP/o9TDPC1nMgGVkwbbYLKOeSQu/38OOAaMjq1C7UF96hElHZnIGGRIoJAbCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T12:17:30.647192Z"},"content_sha256":"f49e28c637ac7ed49671552beb34f1eead4a7466a0085b2761966b42588cd191","schema_version":"1.0","event_id":"sha256:f49e28c637ac7ed49671552beb34f1eead4a7466a0085b2761966b42588cd191"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/bundle.json","state_url":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/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-20T12:17:30Z","links":{"resolver":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5","bundle":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/bundle.json","state":"https://pith.science/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SAYC6I2AFEK3RUHYIKCS4YOSS5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:SAYC6I2AFEK3RUHYIKCS4YOSS5","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":"70466932b4896c81393c0af764cdc3bdc5a42df7ebf6705f751cd0be16e0b1a5","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T16:23:50Z","title_canon_sha256":"239448ce143e7656d6def14ba45bc7d3d215a4bf899e31b9dc9cf557a5235a95"},"schema_version":"1.0","source":{"id":"1502.00911","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.00911","created_at":"2026-05-18T00:57:05Z"},{"alias_kind":"arxiv_version","alias_value":"1502.00911v3","created_at":"2026-05-18T00:57:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.00911","created_at":"2026-05-18T00:57:05Z"},{"alias_kind":"pith_short_12","alias_value":"SAYC6I2AFEK3","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"SAYC6I2AFEK3RUHY","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"SAYC6I2A","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:f49e28c637ac7ed49671552beb34f1eead4a7466a0085b2761966b42588cd191","target":"graph","created_at":"2026-05-18T00:57:05Z","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":"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 ","authors_text":"\\'Eric Colin de Verdi\\`ere","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T16:23:50Z","title":"Multicuts in Planar and Bounded-Genus Graphs with Bounded Number of Terminals"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00911","kind":"arxiv","version":3},"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:3c3b02ac157c2a717a0fa930d82d65465ed658c82391b1144a912860828654a3","target":"record","created_at":"2026-05-18T00:57:05Z","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":"70466932b4896c81393c0af764cdc3bdc5a42df7ebf6705f751cd0be16e0b1a5","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-02-03T16:23:50Z","title_canon_sha256":"239448ce143e7656d6def14ba45bc7d3d215a4bf899e31b9dc9cf557a5235a95"},"schema_version":"1.0","source":{"id":"1502.00911","kind":"arxiv","version":3}},"canonical_sha256":"90302f23402915b8d0f842852e61d2977542460144d94ccefa7795a8f6b35d0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90302f23402915b8d0f842852e61d2977542460144d94ccefa7795a8f6b35d0f","first_computed_at":"2026-05-18T00:57:05.061619Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:05.061619Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AVXw/jdXqg0Z1oXMX92mXM9PH263asuipGe/sSg9KWmhxfK9dM41UWSEz2Lj3OFFsr89vQ/Ne7R4e5utyJ8EAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:05.062205Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.00911","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c3b02ac157c2a717a0fa930d82d65465ed658c82391b1144a912860828654a3","sha256:f49e28c637ac7ed49671552beb34f1eead4a7466a0085b2761966b42588cd191"],"state_sha256":"2859e4782ae30aebc34219a45b0d6a7438f66c41496a4f0ae689be6abaa37c4b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pABWfhZ5hNCYtdmwruhyi9wkK/pxAuiv60KVDMIB76tPLoO2zXXcMD94UKBzubwPaokeA7qziaWmMm/vshOaAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T12:17:30.649139Z","bundle_sha256":"45552bc51777e720431045caabfc8eb3a4b80cbba69877c5691c60b9a0c8f571"}}