{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CWDBOV4IHBIF6GSJQUDN2G5VRL","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":"1c22a10f09d4d9b3c407af7548bf7710ade8dd67517dd8feea06b10e45785ae9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-11T18:09:52Z","title_canon_sha256":"8420ecc16cc38ba43ce0d18f50d3f9d572fe52d98fc10672f65f5f09ceb16528"},"schema_version":"1.0","source":{"id":"1305.2532","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.2532","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"arxiv_version","alias_value":"1305.2532v1","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.2532","created_at":"2026-05-18T03:25:57Z"},{"alias_kind":"pith_short_12","alias_value":"CWDBOV4IHBIF","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CWDBOV4IHBIF6GSJ","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CWDBOV4I","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:9abe709f9949b2069ee293bba0637ad9fc76575ae9c39de48d9edc2e42fa6cbe","target":"graph","created_at":"2026-05-18T03:25:57Z","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":"Many prediction domains, such as ad placement, recommendation, trajectory prediction, and document summarization, require predicting a set or list of options. Such lists are often evaluated using submodular reward functions that measure both quality and diversity. We propose a simple, efficient, and provably near-optimal approach to optimizing such prediction problems based on no-regret learning. Our method leverages a surprising result from online submodular optimization: a single no-regret online learner can compete with an optimal sequence of predictions. Compared to previous work, which ei","authors_text":"Debadeepta Dey, J. Andrew Bagnell, Jiaji Zhou, Stephane Ross, Yisong Yue","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-11T18:09:52Z","title":"Learning Policies for Contextual Submodular Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.2532","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:2157d5a6ad9d63ced8afddc80a167e00032587437f5d155e41f5b99fcb150944","target":"record","created_at":"2026-05-18T03:25:57Z","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":"1c22a10f09d4d9b3c407af7548bf7710ade8dd67517dd8feea06b10e45785ae9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-05-11T18:09:52Z","title_canon_sha256":"8420ecc16cc38ba43ce0d18f50d3f9d572fe52d98fc10672f65f5f09ceb16528"},"schema_version":"1.0","source":{"id":"1305.2532","kind":"arxiv","version":1}},"canonical_sha256":"158617578838505f1a498506dd1bb58ae1006d93960ed0a2e8931e9606ddb352","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"158617578838505f1a498506dd1bb58ae1006d93960ed0a2e8931e9606ddb352","first_computed_at":"2026-05-18T03:25:57.661472Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:25:57.661472Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w5+ahSoawT/M6n7xWTFo0oN2ztVblm0UA3/5oVTKixG4KZfRWlCZjfJmEM1nIPIIuo9bH+Jt+PZ4DQ/PAebTCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:25:57.662263Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.2532","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2157d5a6ad9d63ced8afddc80a167e00032587437f5d155e41f5b99fcb150944","sha256:9abe709f9949b2069ee293bba0637ad9fc76575ae9c39de48d9edc2e42fa6cbe"],"state_sha256":"86d3c85f4098bb0d5642fb1bb2e80ca70505d2ddbe9f612c26cc628e37733fae"}