{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:UZZELOVWHILN3ILXBB45RLZIXG","short_pith_number":"pith:UZZELOVW","canonical_record":{"source":{"id":"1509.05612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T13:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"2e652816032fd89ed08ea0b9ba605d48579e5ce3aa51d3c71386d91373860863","abstract_canon_sha256":"b95f3f85fe3db18ce3faa844b45874c8a418be0dd2c57579a6df2ccfd3267ef9"},"schema_version":"1.0"},"canonical_sha256":"a67245bab63a16dda1770879d8af28b9b0c3dcd7d35b539a3596acbbb2cdcc10","source":{"kind":"arxiv","id":"1509.05612","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05612","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05612v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05612","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"UZZELOVWHILN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UZZELOVWHILN3ILX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UZZELOVW","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:UZZELOVWHILN3ILXBB45RLZIXG","target":"record","payload":{"canonical_record":{"source":{"id":"1509.05612","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T13:03:51Z","cross_cats_sorted":[],"title_canon_sha256":"2e652816032fd89ed08ea0b9ba605d48579e5ce3aa51d3c71386d91373860863","abstract_canon_sha256":"b95f3f85fe3db18ce3faa844b45874c8a418be0dd2c57579a6df2ccfd3267ef9"},"schema_version":"1.0"},"canonical_sha256":"a67245bab63a16dda1770879d8af28b9b0c3dcd7d35b539a3596acbbb2cdcc10","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:42.752355Z","signature_b64":"Y8Wc8xCHg82rpfbPBHfStPh9oQ7iEXA0A1pjVR9+WG8ztFf6U9LlTtan+Zr5DRON0C2xiz92vhjDOn0mZcEVBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a67245bab63a16dda1770879d8af28b9b0c3dcd7d35b539a3596acbbb2cdcc10","last_reissued_at":"2026-05-18T01:32:42.751927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:42.751927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.05612","source_version":1,"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:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1wxWD8ya7/E0Kz5HnBncorwhBB/gVdYHEGCjmJoCmUTXaLiK5N/QvFthaVssQiUAwHS5yzUtQNH5tRFs5Ad1CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:15:05.751577Z"},"content_sha256":"1be7ae7fe9b2d4cccfde1deb03cba112f56d591ad25d7237b82d92c4e9fadaef","schema_version":"1.0","event_id":"sha256:1be7ae7fe9b2d4cccfde1deb03cba112f56d591ad25d7237b82d92c4e9fadaef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:UZZELOVWHILN3ILXBB45RLZIXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Parameterized Algorithm for Mixed Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ashutosh Rai, M. S. Ramanujan, Saket Saurabh","submitted_at":"2015-09-18T13:03:51Z","abstract_excerpt":"The classical Menger's theorem states that in any undirected (or directed) graph $G$, given a pair of vertices $s$ and $t$, the maximum number of vertex (edge) disjoint paths is equal to the minimum number of vertices (edges) needed to disconnect from $s$ and $t$. This min-max result can be turned into a polynomial time algorithm to find the maximum number of vertex (edge) disjoint paths as well as the minimum number of vertices (edges) needed to disconnect $s$ from $t$. In this paper we study a mixed version of this problem, called Mixed-Cut, where we are given an undirected graph $G$, vertic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05612","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"},"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:32:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nfmenvuP+zQ/zfQ/cdiM1D2uQwzR3qWn0Qsm5nVnMnrmnn8CTxIDP0ZhHzX2Mu5R3dvH/qc8HxpXl1kk4MFJCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-21T13:15:05.751935Z"},"content_sha256":"5061f5e8557e98cf767f5e7179772b6df0b3d0894e8b44f231952fffb5a692a4","schema_version":"1.0","event_id":"sha256:5061f5e8557e98cf767f5e7179772b6df0b3d0894e8b44f231952fffb5a692a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZZELOVWHILN3ILXBB45RLZIXG/bundle.json","state_url":"https://pith.science/pith/UZZELOVWHILN3ILXBB45RLZIXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZZELOVWHILN3ILXBB45RLZIXG/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-05-21T13:15:05Z","links":{"resolver":"https://pith.science/pith/UZZELOVWHILN3ILXBB45RLZIXG","bundle":"https://pith.science/pith/UZZELOVWHILN3ILXBB45RLZIXG/bundle.json","state":"https://pith.science/pith/UZZELOVWHILN3ILXBB45RLZIXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZZELOVWHILN3ILXBB45RLZIXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UZZELOVWHILN3ILXBB45RLZIXG","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":"b95f3f85fe3db18ce3faa844b45874c8a418be0dd2c57579a6df2ccfd3267ef9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T13:03:51Z","title_canon_sha256":"2e652816032fd89ed08ea0b9ba605d48579e5ce3aa51d3c71386d91373860863"},"schema_version":"1.0","source":{"id":"1509.05612","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.05612","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"arxiv_version","alias_value":"1509.05612v1","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.05612","created_at":"2026-05-18T01:32:42Z"},{"alias_kind":"pith_short_12","alias_value":"UZZELOVWHILN","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UZZELOVWHILN3ILX","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UZZELOVW","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:5061f5e8557e98cf767f5e7179772b6df0b3d0894e8b44f231952fffb5a692a4","target":"graph","created_at":"2026-05-18T01:32:42Z","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":"The classical Menger's theorem states that in any undirected (or directed) graph $G$, given a pair of vertices $s$ and $t$, the maximum number of vertex (edge) disjoint paths is equal to the minimum number of vertices (edges) needed to disconnect from $s$ and $t$. This min-max result can be turned into a polynomial time algorithm to find the maximum number of vertex (edge) disjoint paths as well as the minimum number of vertices (edges) needed to disconnect $s$ from $t$. In this paper we study a mixed version of this problem, called Mixed-Cut, where we are given an undirected graph $G$, vertic","authors_text":"Ashutosh Rai, M. S. Ramanujan, Saket Saurabh","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T13:03:51Z","title":"A Parameterized Algorithm for Mixed Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.05612","kind":"arxiv","version":1},"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:1be7ae7fe9b2d4cccfde1deb03cba112f56d591ad25d7237b82d92c4e9fadaef","target":"record","created_at":"2026-05-18T01:32:42Z","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":"b95f3f85fe3db18ce3faa844b45874c8a418be0dd2c57579a6df2ccfd3267ef9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-18T13:03:51Z","title_canon_sha256":"2e652816032fd89ed08ea0b9ba605d48579e5ce3aa51d3c71386d91373860863"},"schema_version":"1.0","source":{"id":"1509.05612","kind":"arxiv","version":1}},"canonical_sha256":"a67245bab63a16dda1770879d8af28b9b0c3dcd7d35b539a3596acbbb2cdcc10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a67245bab63a16dda1770879d8af28b9b0c3dcd7d35b539a3596acbbb2cdcc10","first_computed_at":"2026-05-18T01:32:42.751927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:42.751927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Y8Wc8xCHg82rpfbPBHfStPh9oQ7iEXA0A1pjVR9+WG8ztFf6U9LlTtan+Zr5DRON0C2xiz92vhjDOn0mZcEVBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:42.752355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.05612","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1be7ae7fe9b2d4cccfde1deb03cba112f56d591ad25d7237b82d92c4e9fadaef","sha256:5061f5e8557e98cf767f5e7179772b6df0b3d0894e8b44f231952fffb5a692a4"],"state_sha256":"44e34d990572801caa6b1bdf0a4dfdb07ce690a86fd3943fc3b5e0f288ace9c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s45zZ/cmB8sFk3D9zXjCFgA4Y2xFUWRYsKSFKTXYzw3R2xeUg86ALdapOyvSZ3ew3Kc/RUY5dxBVoMuTv/p8Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-21T13:15:05.754067Z","bundle_sha256":"e39b75e57d052f6806604c2c30dc31b5f90a81ff7aed6b838b05e3b7044fabf7"}}