{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:UZ32J4HQG2ZQXDTSA2R63QGSUQ","short_pith_number":"pith:UZ32J4HQ","canonical_record":{"source":{"id":"1407.5298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-20T14:37:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ff873500d5304600b9be75a74894522b6691b03f6c83a658a12d4c098c97804","abstract_canon_sha256":"d211503a6a10e28e94deffe1580f373bb83247ddcf8cadb3bfc271fb8093cc69"},"schema_version":"1.0"},"canonical_sha256":"a677a4f0f036b30b8e7206a3edc0d2a412d94cf8ed40799f6021fc5c2a3c9ee1","source":{"kind":"arxiv","id":"1407.5298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5298","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5298v2","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5298","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"UZ32J4HQG2ZQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZ32J4HQG2ZQXDTS","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZ32J4HQ","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:UZ32J4HQG2ZQXDTSA2R63QGSUQ","target":"record","payload":{"canonical_record":{"source":{"id":"1407.5298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-20T14:37:32Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"4ff873500d5304600b9be75a74894522b6691b03f6c83a658a12d4c098c97804","abstract_canon_sha256":"d211503a6a10e28e94deffe1580f373bb83247ddcf8cadb3bfc271fb8093cc69"},"schema_version":"1.0"},"canonical_sha256":"a677a4f0f036b30b8e7206a3edc0d2a412d94cf8ed40799f6021fc5c2a3c9ee1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.556691Z","signature_b64":"s9TZ4phv59Vw2hSf9V+4W8s5l6NukjWKPHElHI8TUCtgMYXPRjLJojEMkk/phVqT5+pmR5fJIbYoLg2/TiS5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a677a4f0f036b30b8e7206a3edc0d2a412d94cf8ed40799f6021fc5c2a3c9ee1","last_reissued_at":"2026-05-18T01:25:56.556090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.556090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.5298","source_version":2,"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-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PECcc0avDipWHGmiWZDwmxIaJzGB6sGGXKb10voNyYexC0hYH3/axDUa4UsAaZY2+wn5RHl0sfxSASX+d9cQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:18:55.417250Z"},"content_sha256":"d8e6f30a24416e4e61be0663bee852c15f7e3e2065d404ac3ebddcc67a3bcf02","schema_version":"1.0","event_id":"sha256:d8e6f30a24416e4e61be0663bee852c15f7e3e2065d404ac3ebddcc67a3bcf02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:UZ32J4HQG2ZQXDTSA2R63QGSUQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How the Experts Algorithm Can Help Solve LPs Online","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Marco Molinaro","submitted_at":"2014-07-20T14:37:32Z","abstract_excerpt":"We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention and the main focus is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraints) to allow $(1+\\epsilon)$-approximations online. It is known that the right-hand sides have to be $\\Omega(\\epsilon^{-2} \\log m)$ times the left-hand sides, where $m$ is the number of constraints.\n  In this paper we give a primal-dual algorithm that achieve this bound "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5298","kind":"arxiv","version":2},"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-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGx4FLnQn+ZlgjKteHUuAsCJWny79a38SrpuPAqGGmTPBmDNHc8Cy9YSzN6GvE0FSLGMV8p57PeST9B3KoV3AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:18:55.417614Z"},"content_sha256":"60dbceb56178fbc8a3100b85c59d15adffc78423b7208b960a1318c8883f4107","schema_version":"1.0","event_id":"sha256:60dbceb56178fbc8a3100b85c59d15adffc78423b7208b960a1318c8883f4107"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ/bundle.json","state_url":"https://pith.science/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ/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-09T14:18:55Z","links":{"resolver":"https://pith.science/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ","bundle":"https://pith.science/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ/bundle.json","state":"https://pith.science/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZ32J4HQG2ZQXDTSA2R63QGSUQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:UZ32J4HQG2ZQXDTSA2R63QGSUQ","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":"d211503a6a10e28e94deffe1580f373bb83247ddcf8cadb3bfc271fb8093cc69","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-20T14:37:32Z","title_canon_sha256":"4ff873500d5304600b9be75a74894522b6691b03f6c83a658a12d4c098c97804"},"schema_version":"1.0","source":{"id":"1407.5298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.5298","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1407.5298v2","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.5298","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"UZ32J4HQG2ZQ","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"UZ32J4HQG2ZQXDTS","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"UZ32J4HQ","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:60dbceb56178fbc8a3100b85c59d15adffc78423b7208b960a1318c8883f4107","target":"graph","created_at":"2026-05-18T01:25:56Z","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":"We consider the problem of solving packing/covering LPs online, when the columns of the constraint matrix are presented in random order. This problem has received much attention and the main focus is to figure out how large the right-hand sides of the LPs have to be (compared to the entries on the left-hand side of the constraints) to allow $(1+\\epsilon)$-approximations online. It is known that the right-hand sides have to be $\\Omega(\\epsilon^{-2} \\log m)$ times the left-hand sides, where $m$ is the number of constraints.\n  In this paper we give a primal-dual algorithm that achieve this bound ","authors_text":"Anupam Gupta, Marco Molinaro","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-20T14:37:32Z","title":"How the Experts Algorithm Can Help Solve LPs Online"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.5298","kind":"arxiv","version":2},"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:d8e6f30a24416e4e61be0663bee852c15f7e3e2065d404ac3ebddcc67a3bcf02","target":"record","created_at":"2026-05-18T01:25:56Z","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":"d211503a6a10e28e94deffe1580f373bb83247ddcf8cadb3bfc271fb8093cc69","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-07-20T14:37:32Z","title_canon_sha256":"4ff873500d5304600b9be75a74894522b6691b03f6c83a658a12d4c098c97804"},"schema_version":"1.0","source":{"id":"1407.5298","kind":"arxiv","version":2}},"canonical_sha256":"a677a4f0f036b30b8e7206a3edc0d2a412d94cf8ed40799f6021fc5c2a3c9ee1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a677a4f0f036b30b8e7206a3edc0d2a412d94cf8ed40799f6021fc5c2a3c9ee1","first_computed_at":"2026-05-18T01:25:56.556090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:56.556090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s9TZ4phv59Vw2hSf9V+4W8s5l6NukjWKPHElHI8TUCtgMYXPRjLJojEMkk/phVqT5+pmR5fJIbYoLg2/TiS5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:56.556691Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.5298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d8e6f30a24416e4e61be0663bee852c15f7e3e2065d404ac3ebddcc67a3bcf02","sha256:60dbceb56178fbc8a3100b85c59d15adffc78423b7208b960a1318c8883f4107"],"state_sha256":"c823bf0968eb3dd15c3babeba324957007cf5ec266985818d2c8d6d8b9437aeb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QtBapVBoWRTDVtLjWQAJIdUetyyLbNsy9mggkeH5Dl+LXTeWdTuo3A+GrDd0IpA6lXhHqpEGwJWV9IkQ8eVLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:18:55.419553Z","bundle_sha256":"1218cff7f902b202f51d916c9f2c36bffc500021e1c4977b943471547e8fa739"}}