{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:UQEQHVH5FSWKLL6TML3OJO7FKH","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":"86a2457b16df4c756d9f34004c2f56c09e2bf873fc7e35998c8f7db857bcf263","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T13:41:59Z","title_canon_sha256":"2026fc77af8960ca4a43439f6eec013c482705a2e54ccdcb9afc2c3b54c741b8"},"schema_version":"1.0","source":{"id":"1508.04644","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.04644","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"arxiv_version","alias_value":"1508.04644v3","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.04644","created_at":"2026-05-18T01:11:41Z"},{"alias_kind":"pith_short_12","alias_value":"UQEQHVH5FSWK","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"UQEQHVH5FSWKLL6T","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"UQEQHVH5","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f0d7fa04b6b533845a8bd455e8f03848ad4e0e8b8210a15a6601ccbffe6124ca","target":"graph","created_at":"2026-05-18T01:11:41Z","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 max-flow min-cut theorem describes transport through certain idealized classical networks. We consider the quantum analog for tensor networks. By associating an integral capacity to each edge and a tensor to each vertex in a flow network, we can also interpret it as a tensor network, and more specifically, as a linear map from the input space to the output space. The quantum max flow is defined to be the maximal rank of this linear map over all choices of tensors. The quantum min cut is defined to be the minimum product of the capacities of edges over all cuts of the tensor netwo","authors_text":"Greg Minton, Michael H. Freedman, Or Sattath, Richard Stong, Shawn X. Cui","cross_cats":["cs.IT","math.IT","quant-ph"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T13:41:59Z","title":"Quantum Max-flow/Min-cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.04644","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:ce8c11730c26c28464116e5ce01d6bd1d2cdd0c7212d38373e0bfcfaec9d6808","target":"record","created_at":"2026-05-18T01:11:41Z","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":"86a2457b16df4c756d9f34004c2f56c09e2bf873fc7e35998c8f7db857bcf263","cross_cats_sorted":["cs.IT","math.IT","quant-ph"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-19T13:41:59Z","title_canon_sha256":"2026fc77af8960ca4a43439f6eec013c482705a2e54ccdcb9afc2c3b54c741b8"},"schema_version":"1.0","source":{"id":"1508.04644","kind":"arxiv","version":3}},"canonical_sha256":"a40903d4fd2caca5afd362f6e4bbe551f2d882f8163fdd3cfa151be47fe3d2ea","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a40903d4fd2caca5afd362f6e4bbe551f2d882f8163fdd3cfa151be47fe3d2ea","first_computed_at":"2026-05-18T01:11:41.347535Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:11:41.347535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u0Bqd9sVgcyC0SbHETFdBiYxxHukyBTgul25pto7KKOz8otwF3DzAQOZne2iq3KbMdy9JGxOKnFr6zd3zRz9DA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:11:41.347898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.04644","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ce8c11730c26c28464116e5ce01d6bd1d2cdd0c7212d38373e0bfcfaec9d6808","sha256:f0d7fa04b6b533845a8bd455e8f03848ad4e0e8b8210a15a6601ccbffe6124ca"],"state_sha256":"abfe0270e5c9630a96a45c246b4e2cf0b42c9fa71915d48ec6a67d2d6d52e970"}