{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:AGC7EIJCHLWL4XMLJAJNWUCMZE","short_pith_number":"pith:AGC7EIJC","schema_version":"1.0","canonical_sha256":"0185f221223aecbe5d8b4812db504cc924fc17ca175db92020dc34ef9db842c3","source":{"kind":"arxiv","id":"cs/0205077","version":1},"attestation_state":"computed","paper":{"title":"Designing Multi-Commodity Flow Trees","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-30T12:34:24Z","abstract_excerpt":"The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a set of multi-commodity flow demands, find a network subject to certain constraints such that the commodities can be maximally routed.\n  This paper focuses on the case when the network is required to be a tree. The main result is an approximation algorithm for the case when the tree is required to be of constant degree. The algorithm reduces the problem to the"},"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":"cs/0205077","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.DS","submitted_at":"2002-05-30T12:34:24Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"d9d6d21aa45e8e94628d41ed807788d8e454877a0d63dbe0486ef0f9d7949daf","abstract_canon_sha256":"a642d990ced295b5f297fa71898cd8c64cb0aa19edcb60641607216f4616a977"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:53.868787Z","signature_b64":"gsAiU+jZGtuU3vWdj96uodTgtxeQgKCUZ77EvAOKizdOhenbpiCtylw+5E8kRG0gCCXf0CdnVOKTwhpHfNUwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0185f221223aecbe5d8b4812db504cc924fc17ca175db92020dc34ef9db842c3","last_reissued_at":"2026-05-18T01:59:53.868296Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:53.868296Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Designing Multi-Commodity Flow Trees","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Balaji Raghavachari, Neal E. Young, Samir Khuller","submitted_at":"2002-05-30T12:34:24Z","abstract_excerpt":"The traditional multi-commodity flow problem assumes a given flow network in which multiple commodities are to be maximally routed in response to given demands. This paper considers the multi-commodity flow network-design problem: given a set of multi-commodity flow demands, find a network subject to certain constraints such that the commodities can be maximally routed.\n  This paper focuses on the case when the network is required to be a tree. The main result is an approximation algorithm for the case when the tree is required to be of constant degree. The algorithm reduces the problem to the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0205077","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"cs/0205077","created_at":"2026-05-18T01:59:53.868382+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0205077v1","created_at":"2026-05-18T01:59:53.868382+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0205077","created_at":"2026-05-18T01:59:53.868382+00:00"},{"alias_kind":"pith_short_12","alias_value":"AGC7EIJCHLWL","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"AGC7EIJCHLWL4XML","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"AGC7EIJC","created_at":"2026-05-18T12:25:50.845339+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/AGC7EIJCHLWL4XMLJAJNWUCMZE","json":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE.json","graph_json":"https://pith.science/api/pith-number/AGC7EIJCHLWL4XMLJAJNWUCMZE/graph.json","events_json":"https://pith.science/api/pith-number/AGC7EIJCHLWL4XMLJAJNWUCMZE/events.json","paper":"https://pith.science/paper/AGC7EIJC"},"agent_actions":{"view_html":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE","download_json":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE.json","view_paper":"https://pith.science/paper/AGC7EIJC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0205077&json=true","fetch_graph":"https://pith.science/api/pith-number/AGC7EIJCHLWL4XMLJAJNWUCMZE/graph.json","fetch_events":"https://pith.science/api/pith-number/AGC7EIJCHLWL4XMLJAJNWUCMZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE/action/storage_attestation","attest_author":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE/action/author_attestation","sign_citation":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE/action/citation_signature","submit_replication":"https://pith.science/pith/AGC7EIJCHLWL4XMLJAJNWUCMZE/action/replication_record"}},"created_at":"2026-05-18T01:59:53.868382+00:00","updated_at":"2026-05-18T01:59:53.868382+00:00"}