{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YEQGHSI6MAACCOVB2YG37SCZH5","short_pith_number":"pith:YEQGHSI6","canonical_record":{"source":{"id":"1412.3507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T00:35:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1cd7d2b1d972f2b2458800f3a68b7808c3a818d22929181e858681c7005d2b3e","abstract_canon_sha256":"83b10360651279c51931369edab1d196eb9f2f1130aa9542e7ee85d0dead2800"},"schema_version":"1.0"},"canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","source":{"kind":"arxiv","id":"1412.3507","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3507","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3507v1","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3507","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"YEQGHSI6MAAC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YEQGHSI6MAACCOVB","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YEQGHSI6","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YEQGHSI6MAACCOVB2YG37SCZH5","target":"record","payload":{"canonical_record":{"source":{"id":"1412.3507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T00:35:03Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"1cd7d2b1d972f2b2458800f3a68b7808c3a818d22929181e858681c7005d2b3e","abstract_canon_sha256":"83b10360651279c51931369edab1d196eb9f2f1130aa9542e7ee85d0dead2800"},"schema_version":"1.0"},"canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:36.410873Z","signature_b64":"hjFnq9JV+ETtffERcL8i9zgyGP6O/HPyPmLMgLI+2LCyjqz/nXaLaposOBPqJ2n7pmUbXeZHggfAldbkV9vlDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","last_reissued_at":"2026-05-18T02:31:36.410364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:36.410364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.3507","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-18T02:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eMiKa+cryulaXF0f4LJ19XDCVRBJ2PvMeqmp2TZvz3+6DIKFuGSoUWtcojHbDbh/x3XNlM9B54Oi/7xVCNJYCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:03.774553Z"},"content_sha256":"1d816bb87fe8b3e24a59180407f2eaf8a59db188e1dd2a4533cbe5be6dba5628","schema_version":"1.0","event_id":"sha256:1d816bb87fe8b3e24a59180407f2eaf8a59db188e1dd2a4533cbe5be6dba5628"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YEQGHSI6MAACCOVB2YG37SCZH5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Covering with Convex Objectives and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Debmalya Panigrahi, Ilan Reuven Cohen, Yossi Azar","submitted_at":"2014-12-11T00:35:03Z","abstract_excerpt":"We give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon {\\em et al.}, STOC 2003) and online covering with offline packing constraints (Azar {\\em et al.}, SODA 2013). To the best of our knowledge, this is the first result in online optimization for generic non-linear objectives; special cases of such objectives have previously been considered, particularly for energy minimization.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3507","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-18T02:31:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbYGJwFOwQzjvP6/fjFs0gaAy2azcomILh7+cE7hCF0xoRUN2sseHtzgCuZgQL8+T+GSISaIZm4AI/4pCKR4DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T23:20:03.775208Z"},"content_sha256":"a7f4881974647d19c645946979e3051402b2359bba65866aa97d4ac707970393","schema_version":"1.0","event_id":"sha256:a7f4881974647d19c645946979e3051402b2359bba65866aa97d4ac707970393"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/bundle.json","state_url":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YEQGHSI6MAACCOVB2YG37SCZH5/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-27T23:20:03Z","links":{"resolver":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5","bundle":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/bundle.json","state":"https://pith.science/pith/YEQGHSI6MAACCOVB2YG37SCZH5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YEQGHSI6MAACCOVB2YG37SCZH5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YEQGHSI6MAACCOVB2YG37SCZH5","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":"83b10360651279c51931369edab1d196eb9f2f1130aa9542e7ee85d0dead2800","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T00:35:03Z","title_canon_sha256":"1cd7d2b1d972f2b2458800f3a68b7808c3a818d22929181e858681c7005d2b3e"},"schema_version":"1.0","source":{"id":"1412.3507","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.3507","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"arxiv_version","alias_value":"1412.3507v1","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.3507","created_at":"2026-05-18T02:31:36Z"},{"alias_kind":"pith_short_12","alias_value":"YEQGHSI6MAAC","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YEQGHSI6MAACCOVB","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YEQGHSI6","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:a7f4881974647d19c645946979e3051402b2359bba65866aa97d4ac707970393","target":"graph","created_at":"2026-05-18T02:31:36Z","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 give an algorithmic framework for minimizing general convex objectives (that are differentiable and monotone non-decreasing) over a set of covering constraints that arrive online. This substantially extends previous work on online covering for linear objectives (Alon {\\em et al.}, STOC 2003) and online covering with offline packing constraints (Azar {\\em et al.}, SODA 2013). To the best of our knowledge, this is the first result in online optimization for generic non-linear objectives; special cases of such objectives have previously been considered, particularly for energy minimization.\n  ","authors_text":"Debmalya Panigrahi, Ilan Reuven Cohen, Yossi Azar","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T00:35:03Z","title":"Online Covering with Convex Objectives and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.3507","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:1d816bb87fe8b3e24a59180407f2eaf8a59db188e1dd2a4533cbe5be6dba5628","target":"record","created_at":"2026-05-18T02:31:36Z","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":"83b10360651279c51931369edab1d196eb9f2f1130aa9542e7ee85d0dead2800","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-12-11T00:35:03Z","title_canon_sha256":"1cd7d2b1d972f2b2458800f3a68b7808c3a818d22929181e858681c7005d2b3e"},"schema_version":"1.0","source":{"id":"1412.3507","kind":"arxiv","version":1}},"canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c12063c91e6000213aa1d60dbfc8593f7eb6495c303f1a4246104bd074ac177a","first_computed_at":"2026-05-18T02:31:36.410364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:36.410364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hjFnq9JV+ETtffERcL8i9zgyGP6O/HPyPmLMgLI+2LCyjqz/nXaLaposOBPqJ2n7pmUbXeZHggfAldbkV9vlDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:36.410873Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.3507","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d816bb87fe8b3e24a59180407f2eaf8a59db188e1dd2a4533cbe5be6dba5628","sha256:a7f4881974647d19c645946979e3051402b2359bba65866aa97d4ac707970393"],"state_sha256":"aae8d9fbf597d5acd5b84a4c925dd5df123ca8ae32c7dbe386fb47b59b4cfee7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SH4V2HQ5PoLlssF7OfLNvmOFI9m685kkoPVb8/I0LWfLqVz13D8BjSbDad3MATpVrB6QlOa10rOnFXb2fj81Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T23:20:03.778633Z","bundle_sha256":"25bf945a674ab7fa92d11c7334344da1844c613721352a527aaeeccad9b5241f"}}