{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GJIIORM73VPXO65BUIIOWDDPIY","short_pith_number":"pith:GJIIORM7","canonical_record":{"source":{"id":"1203.4041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-19T06:25:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"896deaae046956201f45ec9b8b4ff9ea9caa34cbb3e6ffd6898cf467608832b7","abstract_canon_sha256":"93f61d1d8c77e132951d00854c9e6292f3ce881d6df66572f834d5b591d1096c"},"schema_version":"1.0"},"canonical_sha256":"325087459fdd5f777ba1a210eb0c6f46045402c8a46d09d5bcd4981570059f49","source":{"kind":"arxiv","id":"1203.4041","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4041","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4041v1","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4041","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"GJIIORM73VPX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJIIORM73VPXO65B","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJIIORM7","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GJIIORM73VPXO65BUIIOWDDPIY","target":"record","payload":{"canonical_record":{"source":{"id":"1203.4041","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-19T06:25:33Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"896deaae046956201f45ec9b8b4ff9ea9caa34cbb3e6ffd6898cf467608832b7","abstract_canon_sha256":"93f61d1d8c77e132951d00854c9e6292f3ce881d6df66572f834d5b591d1096c"},"schema_version":"1.0"},"canonical_sha256":"325087459fdd5f777ba1a210eb0c6f46045402c8a46d09d5bcd4981570059f49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:59:48.433117Z","signature_b64":"3kHFilJs08+4yx3ULMtqUUAmcq1pyaehqQ9U+cUo2ea1NyR3vfP/yN+JqatJEvMvua4dnDz97x7kP/aXZYOnDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"325087459fdd5f777ba1a210eb0c6f46045402c8a46d09d5bcd4981570059f49","last_reissued_at":"2026-05-18T03:59:48.432742Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:59:48.432742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.4041","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-18T03:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B5b1FeJKIqeDtCP+eH3ABHK22+L/2v/VBmNKHXu4RYqj5ipNAUu/pAFFkn84KUVQZXCwr9nmho2cnpndJ9fkAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:36:31.075075Z"},"content_sha256":"158e295303d5d42c88f9d9b833d76fa11f66f1aa07467e3fa129ab8a14e4bfaa","schema_version":"1.0","event_id":"sha256:158e295303d5d42c88f9d9b833d76fa11f66f1aa07467e3fa129ab8a14e4bfaa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GJIIORM73VPXO65BUIIOWDDPIY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Amit Chakrabarti, Christophe Weibel, Lisa Fleischer","submitted_at":"2012-03-19T06:25:33Z","abstract_excerpt":"Let $G=(V,E)$ be a supply graph and $H=(V,F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is said to satisfy the \\emph{cut condition} if for any cut in the graph, the total demand crossing the cut is no more than the total capacity crossing it. The pair $(G,H)$ is called \\emph{cut-sufficient} if for any assignment of capacities and demands that satisfy the cut condition, there is a multiflow routing the demands defined on $H$ within the network with capacities defined on $G$. We prove a previous conjecture,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4041","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-18T03:59:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"do7yFF34yZyTNQQa5exVjdeEyfqnHz3rskf2sS3IbzeChk7LHJ7AWfooMUITh3LoGFUIglesJIEO6VFz9rFsCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T19:36:31.075888Z"},"content_sha256":"867b23376b35f08c7f72dcb77fbdc11ebf035afba58e38458bac14ffc1115594","schema_version":"1.0","event_id":"sha256:867b23376b35f08c7f72dcb77fbdc11ebf035afba58e38458bac14ffc1115594"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GJIIORM73VPXO65BUIIOWDDPIY/bundle.json","state_url":"https://pith.science/pith/GJIIORM73VPXO65BUIIOWDDPIY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GJIIORM73VPXO65BUIIOWDDPIY/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-11T19:36:31Z","links":{"resolver":"https://pith.science/pith/GJIIORM73VPXO65BUIIOWDDPIY","bundle":"https://pith.science/pith/GJIIORM73VPXO65BUIIOWDDPIY/bundle.json","state":"https://pith.science/pith/GJIIORM73VPXO65BUIIOWDDPIY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GJIIORM73VPXO65BUIIOWDDPIY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GJIIORM73VPXO65BUIIOWDDPIY","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":"93f61d1d8c77e132951d00854c9e6292f3ce881d6df66572f834d5b591d1096c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-19T06:25:33Z","title_canon_sha256":"896deaae046956201f45ec9b8b4ff9ea9caa34cbb3e6ffd6898cf467608832b7"},"schema_version":"1.0","source":{"id":"1203.4041","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.4041","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"arxiv_version","alias_value":"1203.4041v1","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.4041","created_at":"2026-05-18T03:59:48Z"},{"alias_kind":"pith_short_12","alias_value":"GJIIORM73VPX","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GJIIORM73VPXO65B","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GJIIORM7","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:867b23376b35f08c7f72dcb77fbdc11ebf035afba58e38458bac14ffc1115594","target":"graph","created_at":"2026-05-18T03:59:48Z","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 $G=(V,E)$ be a supply graph and $H=(V,F)$ a demand graph defined on the same set of vertices. An assignment of capacities to the edges of $G$ and demands to the edges of $H$ is said to satisfy the \\emph{cut condition} if for any cut in the graph, the total demand crossing the cut is no more than the total capacity crossing it. The pair $(G,H)$ is called \\emph{cut-sufficient} if for any assignment of capacities and demands that satisfy the cut condition, there is a multiflow routing the demands defined on $H$ within the network with capacities defined on $G$. We prove a previous conjecture,","authors_text":"Amit Chakrabarti, Christophe Weibel, Lisa Fleischer","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-19T06:25:33Z","title":"When the Cut Condition is Enough: A Complete Characterization for Multiflow Problems in Series-Parallel Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.4041","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:158e295303d5d42c88f9d9b833d76fa11f66f1aa07467e3fa129ab8a14e4bfaa","target":"record","created_at":"2026-05-18T03:59:48Z","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":"93f61d1d8c77e132951d00854c9e6292f3ce881d6df66572f834d5b591d1096c","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2012-03-19T06:25:33Z","title_canon_sha256":"896deaae046956201f45ec9b8b4ff9ea9caa34cbb3e6ffd6898cf467608832b7"},"schema_version":"1.0","source":{"id":"1203.4041","kind":"arxiv","version":1}},"canonical_sha256":"325087459fdd5f777ba1a210eb0c6f46045402c8a46d09d5bcd4981570059f49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"325087459fdd5f777ba1a210eb0c6f46045402c8a46d09d5bcd4981570059f49","first_computed_at":"2026-05-18T03:59:48.432742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:59:48.432742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3kHFilJs08+4yx3ULMtqUUAmcq1pyaehqQ9U+cUo2ea1NyR3vfP/yN+JqatJEvMvua4dnDz97x7kP/aXZYOnDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:59:48.433117Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.4041","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:158e295303d5d42c88f9d9b833d76fa11f66f1aa07467e3fa129ab8a14e4bfaa","sha256:867b23376b35f08c7f72dcb77fbdc11ebf035afba58e38458bac14ffc1115594"],"state_sha256":"7c7ce0c264489e0e23971a2a12966589f936ded35ed50426dec2b133de4d593a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/M7eVeDZEdSHcOaEaA33uvUfBjNwdnca7wH67fAiow7dX84W/erEZxPVYkmqIkg4qUtjiGWutg3W3iDSHv/JAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T19:36:31.079886Z","bundle_sha256":"d9c8cf8a576e126b8b6c17913acd7c7b001a7a57207ed21b1670cf6cbc3d970b"}}