{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ISEEFO7TJ5W27QWIYWCZNWU4LN","short_pith_number":"pith:ISEEFO7T","schema_version":"1.0","canonical_sha256":"448842bbf34f6dafc2c8c58596da9c5b4198ec371baa518d4a221ceea22e9d67","source":{"kind":"arxiv","id":"1201.5030","version":4},"attestation_state":"computed","paper":{"title":"Online Multi-Commodity Flow with High Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina","submitted_at":"2012-01-24T16:11:45Z","abstract_excerpt":"This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (\\ONMCF), where the flow demands may be bigger than the edge capacities of the network.\n  We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor.\n  The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow"},"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":"1201.5030","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-24T16:11:45Z","cross_cats_sorted":[],"title_canon_sha256":"4920b05016aefb8aa3221f67471529d291dad61adb1c3492004405af60f17ba8","abstract_canon_sha256":"8be426e16b6b7e8c3453aea56a4ab4ae4ff08a7e30b803d3c781e2f0ad556ad0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:57:24.507592Z","signature_b64":"7f3ZRK21xzTIvyxUjtvVN/1bUHo1gw8KNwLtUUD0d/QxJNYgPO4TxKIHS+bx5tziggkqpP+Dx/Tw5qZ777O6DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"448842bbf34f6dafc2c8c58596da9c5b4198ec371baa518d4a221ceea22e9d67","last_reissued_at":"2026-05-18T03:57:24.506893Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:57:24.506893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Multi-Commodity Flow with High Demands","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guy Even, Moti Medina","submitted_at":"2012-01-24T16:11:45Z","abstract_excerpt":"This paper deals with the problem of computing, in an online fashion, a maximum benefit multi-commodity flow (\\ONMCF), where the flow demands may be bigger than the edge capacities of the network.\n  We present an online, deterministic, centralized, all-or-nothing, bi-criteria algorithm. The competitive ratio of the algorithm is constant, and the algorithm augments the capacities by at most a logarithmic factor.\n  The algorithm can handle two types of flow requests: (i) low demand requests that must be routed along a path, and (ii) high demand requests that may be routed using a multi-path flow"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5030","kind":"arxiv","version":4},"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":"1201.5030","created_at":"2026-05-18T03:57:24.507010+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5030v4","created_at":"2026-05-18T03:57:24.507010+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5030","created_at":"2026-05-18T03:57:24.507010+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISEEFO7TJ5W2","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISEEFO7TJ5W27QWI","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISEEFO7T","created_at":"2026-05-18T12:27:09.501522+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/ISEEFO7TJ5W27QWIYWCZNWU4LN","json":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN.json","graph_json":"https://pith.science/api/pith-number/ISEEFO7TJ5W27QWIYWCZNWU4LN/graph.json","events_json":"https://pith.science/api/pith-number/ISEEFO7TJ5W27QWIYWCZNWU4LN/events.json","paper":"https://pith.science/paper/ISEEFO7T"},"agent_actions":{"view_html":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN","download_json":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN.json","view_paper":"https://pith.science/paper/ISEEFO7T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5030&json=true","fetch_graph":"https://pith.science/api/pith-number/ISEEFO7TJ5W27QWIYWCZNWU4LN/graph.json","fetch_events":"https://pith.science/api/pith-number/ISEEFO7TJ5W27QWIYWCZNWU4LN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/action/storage_attestation","attest_author":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/action/author_attestation","sign_citation":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/action/citation_signature","submit_replication":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/action/replication_record"}},"created_at":"2026-05-18T03:57:24.507010+00:00","updated_at":"2026-05-18T03:57:24.507010+00:00"}