{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:WRQY3MV3LZ5X24JJTCW66FTGVJ","short_pith_number":"pith:WRQY3MV3","schema_version":"1.0","canonical_sha256":"b4618db2bb5e7b7d712998adef1666aa490e06bf9d5b8d296c1abbf449537e9b","source":{"kind":"arxiv","id":"1806.03349","version":1},"attestation_state":"computed","paper":{"title":"An Optimal Algorithm for Online Unconstrained Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Joshua R. Wang, Tim Roughgarden","submitted_at":"2018-06-08T20:42:52Z","abstract_excerpt":"We consider a basic problem at the interface of two fundamental fields: submodular optimization and online learning. In the online unconstrained submodular maximization (online USM) problem, there is a universe $[n]=\\{1,2,...,n\\}$ and a sequence of $T$ nonnegative (not necessarily monotone) submodular functions arrive over time. The goal is to design a computationally efficient online algorithm, which chooses a subset of $[n]$ at each time step as a function only of the past, such that the accumulated value of the chosen subsets is as close as possible to the maximum total value of a fixed sub"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1806.03349","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T20:42:52Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"7c94fcd7543c7df968ea33db0942b8d822c6f9458ee9fe772f873a26a889fe19","abstract_canon_sha256":"22e849c3de1d915b996fc3587a6f853d244da57473e6005166a475113bdbb06e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:43.701294Z","signature_b64":"VMpbzZ1HhxfAhYvhIMe1JKwgM76G0k7/Bt/CsyzYFyrWAeCwSMvc1+etlyEckm6kljW9SvpbU8IHmEqnHAAMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4618db2bb5e7b7d712998adef1666aa490e06bf9d5b8d296c1abbf449537e9b","last_reissued_at":"2026-05-18T00:13:43.700612Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:43.700612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for Online Unconstrained Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Joshua R. Wang, Tim Roughgarden","submitted_at":"2018-06-08T20:42:52Z","abstract_excerpt":"We consider a basic problem at the interface of two fundamental fields: submodular optimization and online learning. In the online unconstrained submodular maximization (online USM) problem, there is a universe $[n]=\\{1,2,...,n\\}$ and a sequence of $T$ nonnegative (not necessarily monotone) submodular functions arrive over time. The goal is to design a computationally efficient online algorithm, which chooses a subset of $[n]$ at each time step as a function only of the past, such that the accumulated value of the chosen subsets is as close as possible to the maximum total value of a fixed sub"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03349","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1806.03349","created_at":"2026-05-18T00:13:43.700736+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.03349v1","created_at":"2026-05-18T00:13:43.700736+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03349","created_at":"2026-05-18T00:13:43.700736+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRQY3MV3LZ5X","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRQY3MV3LZ5X24JJ","created_at":"2026-05-18T12:33:01.666342+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRQY3MV3","created_at":"2026-05-18T12:33:01.666342+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ","json":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ.json","graph_json":"https://pith.science/api/pith-number/WRQY3MV3LZ5X24JJTCW66FTGVJ/graph.json","events_json":"https://pith.science/api/pith-number/WRQY3MV3LZ5X24JJTCW66FTGVJ/events.json","paper":"https://pith.science/paper/WRQY3MV3"},"agent_actions":{"view_html":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ","download_json":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ.json","view_paper":"https://pith.science/paper/WRQY3MV3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.03349&json=true","fetch_graph":"https://pith.science/api/pith-number/WRQY3MV3LZ5X24JJTCW66FTGVJ/graph.json","fetch_events":"https://pith.science/api/pith-number/WRQY3MV3LZ5X24JJTCW66FTGVJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/action/storage_attestation","attest_author":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/action/author_attestation","sign_citation":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/action/citation_signature","submit_replication":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/action/replication_record"}},"created_at":"2026-05-18T00:13:43.700736+00:00","updated_at":"2026-05-18T00:13:43.700736+00:00"}