{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:U7KGZFJEGCEBWM44NENH34CJBB","short_pith_number":"pith:U7KGZFJE","canonical_record":{"source":{"id":"1509.03600","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-11T18:27:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1bc9feca5c263cb3ad735adc1794ae5d585662f364d2f0fef215720a439ceb7a","abstract_canon_sha256":"da16f6fddcea35cc76c03246fe3734e1a30881847e789faa5ba6aeb33a39c092"},"schema_version":"1.0"},"canonical_sha256":"a7d46c952430881b339c691a7df049085b2b7c5e8af033d78f6ae874b6864557","source":{"kind":"arxiv","id":"1509.03600","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03600","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03600v3","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03600","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"U7KGZFJEGCEB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U7KGZFJEGCEBWM44","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U7KGZFJE","created_at":"2026-05-18T12:29:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:U7KGZFJEGCEBWM44NENH34CJBB","target":"record","payload":{"canonical_record":{"source":{"id":"1509.03600","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-11T18:27:42Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1bc9feca5c263cb3ad735adc1794ae5d585662f364d2f0fef215720a439ceb7a","abstract_canon_sha256":"da16f6fddcea35cc76c03246fe3734e1a30881847e789faa5ba6aeb33a39c092"},"schema_version":"1.0"},"canonical_sha256":"a7d46c952430881b339c691a7df049085b2b7c5e8af033d78f6ae874b6864557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:41.407600Z","signature_b64":"U6k2y1W//ADG4/wZQGeB8GjK+DXHY7ob7NpiL1wh40Pqp88fwwU/kvATBkpHVEKdp6ZCS/y+8Sw03U2BojA9CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7d46c952430881b339c691a7df049085b2b7c5e8af033d78f6ae874b6864557","last_reissued_at":"2026-05-18T00:54:41.406997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:41.406997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.03600","source_version":3,"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-18T00:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfaThirYq98Pp1B2TnYSbVFYq/Op8lghGWjGRpKxqG3CbAZMXUvWcOQesCJ3J4Sb2mtBQpyOmAHszlStWtpqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:53:12.575449Z"},"content_sha256":"e59467ba452df14f20df76e22863367e5a7e72b37673a2ebaac2b9373294bbfa","schema_version":"1.0","event_id":"sha256:e59467ba452df14f20df76e22863367e5a7e72b37673a2ebaac2b9373294bbfa"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:U7KGZFJEGCEBWM44NENH34CJBB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hardness of Online Sleeping Combinatorial Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Chansoo Lee, D\\'avid P\\'al, Satyen Kale","submitted_at":"2015-09-11T18:27:42Z","abstract_excerpt":"We show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of actions becomes unavailable in each round. Specifically, we show that the sleeping versions of these problems are at least as hard as PAC learning DNF expressions, a long standing open problem. We show hardness for the sleeping versions of Online Shortest Paths, Online Minimum Spanning Tree, Online $k$-Subsets, Online $k$-Truncated Permutations, Online Minimum Cut, and Online Bipartite Matching. The hardness result for t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03600","kind":"arxiv","version":3},"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-18T00:54:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H/EEf8IQ5bGE7LbC8kcCG5Ldd/LkvrvumhASM1meVtvv1s0nomH2IamCc775mv8MLu+CUl4RlYB8PveOGW2cBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T15:53:12.575800Z"},"content_sha256":"f2286326e9f14c6dd0685a0445de8dd0af9d7caaa65bc0d86f8a3eddc6a3023f","schema_version":"1.0","event_id":"sha256:f2286326e9f14c6dd0685a0445de8dd0af9d7caaa65bc0d86f8a3eddc6a3023f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7KGZFJEGCEBWM44NENH34CJBB/bundle.json","state_url":"https://pith.science/pith/U7KGZFJEGCEBWM44NENH34CJBB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7KGZFJEGCEBWM44NENH34CJBB/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-02T15:53:12Z","links":{"resolver":"https://pith.science/pith/U7KGZFJEGCEBWM44NENH34CJBB","bundle":"https://pith.science/pith/U7KGZFJEGCEBWM44NENH34CJBB/bundle.json","state":"https://pith.science/pith/U7KGZFJEGCEBWM44NENH34CJBB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7KGZFJEGCEBWM44NENH34CJBB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:U7KGZFJEGCEBWM44NENH34CJBB","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":"da16f6fddcea35cc76c03246fe3734e1a30881847e789faa5ba6aeb33a39c092","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-11T18:27:42Z","title_canon_sha256":"1bc9feca5c263cb3ad735adc1794ae5d585662f364d2f0fef215720a439ceb7a"},"schema_version":"1.0","source":{"id":"1509.03600","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.03600","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"arxiv_version","alias_value":"1509.03600v3","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.03600","created_at":"2026-05-18T00:54:41Z"},{"alias_kind":"pith_short_12","alias_value":"U7KGZFJEGCEB","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_16","alias_value":"U7KGZFJEGCEBWM44","created_at":"2026-05-18T12:29:44Z"},{"alias_kind":"pith_short_8","alias_value":"U7KGZFJE","created_at":"2026-05-18T12:29:44Z"}],"graph_snapshots":[{"event_id":"sha256:f2286326e9f14c6dd0685a0445de8dd0af9d7caaa65bc0d86f8a3eddc6a3023f","target":"graph","created_at":"2026-05-18T00:54:41Z","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 show that several online combinatorial optimization problems that admit efficient no-regret algorithms become computationally hard in the sleeping setting where a subset of actions becomes unavailable in each round. Specifically, we show that the sleeping versions of these problems are at least as hard as PAC learning DNF expressions, a long standing open problem. We show hardness for the sleeping versions of Online Shortest Paths, Online Minimum Spanning Tree, Online $k$-Subsets, Online $k$-Truncated Permutations, Online Minimum Cut, and Online Bipartite Matching. The hardness result for t","authors_text":"Chansoo Lee, D\\'avid P\\'al, Satyen Kale","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-11T18:27:42Z","title":"Hardness of Online Sleeping Combinatorial Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.03600","kind":"arxiv","version":3},"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:e59467ba452df14f20df76e22863367e5a7e72b37673a2ebaac2b9373294bbfa","target":"record","created_at":"2026-05-18T00:54:41Z","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":"da16f6fddcea35cc76c03246fe3734e1a30881847e789faa5ba6aeb33a39c092","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2015-09-11T18:27:42Z","title_canon_sha256":"1bc9feca5c263cb3ad735adc1794ae5d585662f364d2f0fef215720a439ceb7a"},"schema_version":"1.0","source":{"id":"1509.03600","kind":"arxiv","version":3}},"canonical_sha256":"a7d46c952430881b339c691a7df049085b2b7c5e8af033d78f6ae874b6864557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7d46c952430881b339c691a7df049085b2b7c5e8af033d78f6ae874b6864557","first_computed_at":"2026-05-18T00:54:41.406997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:41.406997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U6k2y1W//ADG4/wZQGeB8GjK+DXHY7ob7NpiL1wh40Pqp88fwwU/kvATBkpHVEKdp6ZCS/y+8Sw03U2BojA9CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:41.407600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.03600","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e59467ba452df14f20df76e22863367e5a7e72b37673a2ebaac2b9373294bbfa","sha256:f2286326e9f14c6dd0685a0445de8dd0af9d7caaa65bc0d86f8a3eddc6a3023f"],"state_sha256":"738f6301ead4b38390e86eed864fb6636cb1e29d8b1febcf1259a41b0f43ed9a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b2UgdGXHQBj3QMFKALGO1OmFE9N47HRmba/v9wdefNYH1rDh5a1GXpPbVFgUeFWCTtX/UcV+BfbsbqlSX43JDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T15:53:12.577714Z","bundle_sha256":"00e64156f3d31fe68972ccd86ac332cc89288891462d464d4111e0b4a03151c5"}}