{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JIOOH4IW4OWSWV7AZMZVGMQLX2","short_pith_number":"pith:JIOOH4IW","schema_version":"1.0","canonical_sha256":"4a1ce3f116e3ad2b57e0cb3353320bbea93326bcf67136ebe207f1c59bc4c582","source":{"kind":"arxiv","id":"1508.07065","version":3},"attestation_state":"computed","paper":{"title":"A dual descent algorithm for node-capacitated multiflow problems and its applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Hiroshi Hirai","submitted_at":"2015-08-28T01:05:23Z","abstract_excerpt":"In this paper, we develop an $O((m \\log k) {\\rm MSF} (n,m,1))$-time algorithm to find a half-integral node-capacitated multiflow of the maximum total flow-value in a network with $n$ nodes, $m$ edges, and $k$ terminals, where ${\\rm MSF} (n',m',\\gamma)$ denotes the time complexity of solving the maximum submodular flow problem in a network with $n'$ nodes, $m'$ edges, and the complexity $\\gamma$ of computing the exchange capacity of the submodular function describing the problem. By using Fujishige-Zhang algorithm for submodular flow, we can find a maximum half-integral multiflow in $O(m n^3 \\l"},"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":"1508.07065","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-28T01:05:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"49231b3d69fa6c64fd1a46496cde87c1cf7361233e9d339cc1cbd91afac05bc5","abstract_canon_sha256":"9f5713189f7ee73a97faec4f872a5c729ace9fda26a8814b34676a08b8b3e54f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:13.920525Z","signature_b64":"jgPtwE67ePIwamNtCcScEQ9qJ7owJylanIkq0hFCGFQ9kR/+OEwxX9hFzkVcRE7xVtP5+qvXKghDLblnN3nYBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a1ce3f116e3ad2b57e0cb3353320bbea93326bcf67136ebe207f1c59bc4c582","last_reissued_at":"2026-05-18T00:02:13.920025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:13.920025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A dual descent algorithm for node-capacitated multiflow problems and its applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Hiroshi Hirai","submitted_at":"2015-08-28T01:05:23Z","abstract_excerpt":"In this paper, we develop an $O((m \\log k) {\\rm MSF} (n,m,1))$-time algorithm to find a half-integral node-capacitated multiflow of the maximum total flow-value in a network with $n$ nodes, $m$ edges, and $k$ terminals, where ${\\rm MSF} (n',m',\\gamma)$ denotes the time complexity of solving the maximum submodular flow problem in a network with $n'$ nodes, $m'$ edges, and the complexity $\\gamma$ of computing the exchange capacity of the submodular function describing the problem. By using Fujishige-Zhang algorithm for submodular flow, we can find a maximum half-integral multiflow in $O(m n^3 \\l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.07065","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":"1508.07065","created_at":"2026-05-18T00:02:13.920108+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.07065v3","created_at":"2026-05-18T00:02:13.920108+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.07065","created_at":"2026-05-18T00:02:13.920108+00:00"},{"alias_kind":"pith_short_12","alias_value":"JIOOH4IW4OWS","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JIOOH4IW4OWSWV7A","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JIOOH4IW","created_at":"2026-05-18T12:29:27.538025+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/JIOOH4IW4OWSWV7AZMZVGMQLX2","json":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2.json","graph_json":"https://pith.science/api/pith-number/JIOOH4IW4OWSWV7AZMZVGMQLX2/graph.json","events_json":"https://pith.science/api/pith-number/JIOOH4IW4OWSWV7AZMZVGMQLX2/events.json","paper":"https://pith.science/paper/JIOOH4IW"},"agent_actions":{"view_html":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2","download_json":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2.json","view_paper":"https://pith.science/paper/JIOOH4IW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.07065&json=true","fetch_graph":"https://pith.science/api/pith-number/JIOOH4IW4OWSWV7AZMZVGMQLX2/graph.json","fetch_events":"https://pith.science/api/pith-number/JIOOH4IW4OWSWV7AZMZVGMQLX2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2/action/storage_attestation","attest_author":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2/action/author_attestation","sign_citation":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2/action/citation_signature","submit_replication":"https://pith.science/pith/JIOOH4IW4OWSWV7AZMZVGMQLX2/action/replication_record"}},"created_at":"2026-05-18T00:02:13.920108+00:00","updated_at":"2026-05-18T00:02:13.920108+00:00"}