{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ISEEFO7TJ5W27QWIYWCZNWU4LN","short_pith_number":"pith:ISEEFO7T","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"},"canonical_sha256":"448842bbf34f6dafc2c8c58596da9c5b4198ec371baa518d4a221ceea22e9d67","source":{"kind":"arxiv","id":"1201.5030","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5030","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5030v4","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5030","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"ISEEFO7TJ5W2","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ISEEFO7TJ5W27QWI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ISEEFO7T","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ISEEFO7TJ5W27QWIYWCZNWU4LN","target":"record","payload":{"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"},"canonical_sha256":"448842bbf34f6dafc2c8c58596da9c5b4198ec371baa518d4a221ceea22e9d67","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"},"source_kind":"arxiv","source_id":"1201.5030","source_version":4,"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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ILzNBaL5DaCrDxmg9b4A+Vr4SwyvOXSidamikWhnQzPAt+WB75jBYWMff5LCQjM1Ld6qBlo7H779B74YYIDZAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:51:40.696224Z"},"content_sha256":"72407aa1a8fbb1af84fac74f8b7f2662f47b29cde9609458ea541555af2b5dc5","schema_version":"1.0","event_id":"sha256:72407aa1a8fbb1af84fac74f8b7f2662f47b29cde9609458ea541555af2b5dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ISEEFO7TJ5W27QWIYWCZNWU4LN","target":"graph","payload":{"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"},"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:57:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqW6+liJI12VB6sljuGRej76OrROM+v3O5oj55FktOCekEFCJlQHHfCwSXvKUOMZ9o67jQpxHwkDKOnXPy8uCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T04:51:40.696961Z"},"content_sha256":"3b7c57283b3d844b916c0900c0c48749aec1d45bc3642ca462718c527976bf54","schema_version":"1.0","event_id":"sha256:3b7c57283b3d844b916c0900c0c48749aec1d45bc3642ca462718c527976bf54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/bundle.json","state_url":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/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-10T04:51:40Z","links":{"resolver":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN","bundle":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/bundle.json","state":"https://pith.science/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ISEEFO7TJ5W27QWIYWCZNWU4LN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ISEEFO7TJ5W27QWIYWCZNWU4LN","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":"8be426e16b6b7e8c3453aea56a4ab4ae4ff08a7e30b803d3c781e2f0ad556ad0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-24T16:11:45Z","title_canon_sha256":"4920b05016aefb8aa3221f67471529d291dad61adb1c3492004405af60f17ba8"},"schema_version":"1.0","source":{"id":"1201.5030","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5030","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5030v4","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5030","created_at":"2026-05-18T03:57:24Z"},{"alias_kind":"pith_short_12","alias_value":"ISEEFO7TJ5W2","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ISEEFO7TJ5W27QWI","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ISEEFO7T","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:3b7c57283b3d844b916c0900c0c48749aec1d45bc3642ca462718c527976bf54","target":"graph","created_at":"2026-05-18T03:57:24Z","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":"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","authors_text":"Guy Even, Moti Medina","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-24T16:11:45Z","title":"Online Multi-Commodity Flow with High Demands"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5030","kind":"arxiv","version":4},"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:72407aa1a8fbb1af84fac74f8b7f2662f47b29cde9609458ea541555af2b5dc5","target":"record","created_at":"2026-05-18T03:57:24Z","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":"8be426e16b6b7e8c3453aea56a4ab4ae4ff08a7e30b803d3c781e2f0ad556ad0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-01-24T16:11:45Z","title_canon_sha256":"4920b05016aefb8aa3221f67471529d291dad61adb1c3492004405af60f17ba8"},"schema_version":"1.0","source":{"id":"1201.5030","kind":"arxiv","version":4}},"canonical_sha256":"448842bbf34f6dafc2c8c58596da9c5b4198ec371baa518d4a221ceea22e9d67","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"448842bbf34f6dafc2c8c58596da9c5b4198ec371baa518d4a221ceea22e9d67","first_computed_at":"2026-05-18T03:57:24.506893Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:57:24.506893Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7f3ZRK21xzTIvyxUjtvVN/1bUHo1gw8KNwLtUUD0d/QxJNYgPO4TxKIHS+bx5tziggkqpP+Dx/Tw5qZ777O6DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:57:24.507592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5030","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:72407aa1a8fbb1af84fac74f8b7f2662f47b29cde9609458ea541555af2b5dc5","sha256:3b7c57283b3d844b916c0900c0c48749aec1d45bc3642ca462718c527976bf54"],"state_sha256":"12e9ae8b183f96d0a425173cef8b6dacae28353ea4fc80a5285a5cc7d1032db1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AJwzYpokdBEEySiYBjOeOVhphDO8lNcAHIw/XL8swSSVgWBXPjPjsuQw83wmxC/pGnuz53Tt/lEhrpboOSgNAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T04:51:40.701355Z","bundle_sha256":"b97a5f916731848b97f687a0b3b44688215d9e57cdacc6e7e47428a07b9aebbc"}}