{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:3DP3WKXRJURRV5QMNE73NEUCZP","short_pith_number":"pith:3DP3WKXR","canonical_record":{"source":{"id":"1604.01697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-06T17:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"37d50019de8689e83a2727149a118a9b91d558d63dd9cdac6ade655c0dff0dc0","abstract_canon_sha256":"c30b5fab7979e417c0d52fdcff3750b7c659ac87127c34c459b9e620bf994fd2"},"schema_version":"1.0"},"canonical_sha256":"d8dfbb2af14d231af60c693fb69282cbf3ccca2201aaf9b474785e6b9a5fa373","source":{"kind":"arxiv","id":"1604.01697","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01697","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01697v1","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01697","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"3DP3WKXRJURR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DP3WKXRJURRV5QM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DP3WKXR","created_at":"2026-05-18T12:29:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:3DP3WKXRJURRV5QMNE73NEUCZP","target":"record","payload":{"canonical_record":{"source":{"id":"1604.01697","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-06T17:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"37d50019de8689e83a2727149a118a9b91d558d63dd9cdac6ade655c0dff0dc0","abstract_canon_sha256":"c30b5fab7979e417c0d52fdcff3750b7c659ac87127c34c459b9e620bf994fd2"},"schema_version":"1.0"},"canonical_sha256":"d8dfbb2af14d231af60c693fb69282cbf3ccca2201aaf9b474785e6b9a5fa373","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:17:35.782482Z","signature_b64":"nloT57dXSp/GbCSyvaCWdrttYIM7y6OHYdUWkbVT1tnql0vvYYBLUwcHCoZG8ykomcDebCoD1K4Mi+5nIzEcDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8dfbb2af14d231af60c693fb69282cbf3ccca2201aaf9b474785e6b9a5fa373","last_reissued_at":"2026-05-18T01:17:35.781462Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:17:35.781462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1604.01697","source_version":1,"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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FrCzj79q/SZlwAS9YWyOSFfq4tpyN8+EsBY1UmgtcJHflZ3CTA91kmbQCb100KgdzoB2kIndWmdkyLIKjq3lAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:19:30.926114Z"},"content_sha256":"ee81b994cf5f53dab7d9e473eabbf4c63e4763b2906f0af926f58fdfcaff8677","schema_version":"1.0","event_id":"sha256:ee81b994cf5f53dab7d9e473eabbf4c63e4763b2906f0af926f58fdfcaff8677"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:3DP3WKXRJURRV5QMNE73NEUCZP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Lower Bounds via Duality","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alan Roytman, Ilan Reuven Cohen, Yossi Azar","submitted_at":"2016-04-06T17:24:51Z","abstract_excerpt":"In this paper, we exploit linear programming duality in the online setting (i.e., where input arrives on the fly) from the unique perspective of designing lower bounds on the competitive ratio. In particular, we provide a general technique for obtaining online deterministic and randomized lower bounds (i.e., hardness results) on the competitive ratio for a wide variety of problems. We show the usefulness of our approach by providing new, tight lower bounds for three diverse online problems. The three problems we show tight lower bounds for are the Vector Bin Packing problem, Ad-auctions (and v"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01697","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"},"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:17:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XMqPt6vCM3d/5ZIsu2zkMm/E25ylffcRm2LbHTWoLR33nK4Ba4jbINB2kaqX+Gtf10Y2z37CjXpJnmtmiMhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T00:19:30.926497Z"},"content_sha256":"938a79354d86df69cf57dbe2348b2569fe0e0d2bc8d68277110572e01f578319","schema_version":"1.0","event_id":"sha256:938a79354d86df69cf57dbe2348b2569fe0e0d2bc8d68277110572e01f578319"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3DP3WKXRJURRV5QMNE73NEUCZP/bundle.json","state_url":"https://pith.science/pith/3DP3WKXRJURRV5QMNE73NEUCZP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3DP3WKXRJURRV5QMNE73NEUCZP/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-05-28T00:19:30Z","links":{"resolver":"https://pith.science/pith/3DP3WKXRJURRV5QMNE73NEUCZP","bundle":"https://pith.science/pith/3DP3WKXRJURRV5QMNE73NEUCZP/bundle.json","state":"https://pith.science/pith/3DP3WKXRJURRV5QMNE73NEUCZP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3DP3WKXRJURRV5QMNE73NEUCZP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:3DP3WKXRJURRV5QMNE73NEUCZP","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":"c30b5fab7979e417c0d52fdcff3750b7c659ac87127c34c459b9e620bf994fd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-06T17:24:51Z","title_canon_sha256":"37d50019de8689e83a2727149a118a9b91d558d63dd9cdac6ade655c0dff0dc0"},"schema_version":"1.0","source":{"id":"1604.01697","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1604.01697","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"arxiv_version","alias_value":"1604.01697v1","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.01697","created_at":"2026-05-18T01:17:35Z"},{"alias_kind":"pith_short_12","alias_value":"3DP3WKXRJURR","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_16","alias_value":"3DP3WKXRJURRV5QM","created_at":"2026-05-18T12:29:55Z"},{"alias_kind":"pith_short_8","alias_value":"3DP3WKXR","created_at":"2026-05-18T12:29:55Z"}],"graph_snapshots":[{"event_id":"sha256:938a79354d86df69cf57dbe2348b2569fe0e0d2bc8d68277110572e01f578319","target":"graph","created_at":"2026-05-18T01:17:35Z","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":"In this paper, we exploit linear programming duality in the online setting (i.e., where input arrives on the fly) from the unique perspective of designing lower bounds on the competitive ratio. In particular, we provide a general technique for obtaining online deterministic and randomized lower bounds (i.e., hardness results) on the competitive ratio for a wide variety of problems. We show the usefulness of our approach by providing new, tight lower bounds for three diverse online problems. The three problems we show tight lower bounds for are the Vector Bin Packing problem, Ad-auctions (and v","authors_text":"Alan Roytman, Ilan Reuven Cohen, Yossi Azar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-06T17:24:51Z","title":"Online Lower Bounds via Duality"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.01697","kind":"arxiv","version":1},"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:ee81b994cf5f53dab7d9e473eabbf4c63e4763b2906f0af926f58fdfcaff8677","target":"record","created_at":"2026-05-18T01:17:35Z","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":"c30b5fab7979e417c0d52fdcff3750b7c659ac87127c34c459b9e620bf994fd2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-04-06T17:24:51Z","title_canon_sha256":"37d50019de8689e83a2727149a118a9b91d558d63dd9cdac6ade655c0dff0dc0"},"schema_version":"1.0","source":{"id":"1604.01697","kind":"arxiv","version":1}},"canonical_sha256":"d8dfbb2af14d231af60c693fb69282cbf3ccca2201aaf9b474785e6b9a5fa373","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d8dfbb2af14d231af60c693fb69282cbf3ccca2201aaf9b474785e6b9a5fa373","first_computed_at":"2026-05-18T01:17:35.781462Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:17:35.781462Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nloT57dXSp/GbCSyvaCWdrttYIM7y6OHYdUWkbVT1tnql0vvYYBLUwcHCoZG8ykomcDebCoD1K4Mi+5nIzEcDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:17:35.782482Z","signed_message":"canonical_sha256_bytes"},"source_id":"1604.01697","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ee81b994cf5f53dab7d9e473eabbf4c63e4763b2906f0af926f58fdfcaff8677","sha256:938a79354d86df69cf57dbe2348b2569fe0e0d2bc8d68277110572e01f578319"],"state_sha256":"661f590abd666b3372b0bc9a5daa3d674906f032d4e7839f0804b9f1dc574a5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"52BJaFZ5pl3F/Pvtxm/whkfv0mNcddyDLUiLOzGg2NcfBKBd83DCdSD7kZN5G2X9TEb7Td+dz0V0hzcmdJ3HAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T00:19:30.928443Z","bundle_sha256":"a3e088e26b50224048bd69fd289cb60a57497711f01bbfe67ae495da8df333c2"}}