{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WRQY3MV3LZ5X24JJTCW66FTGVJ","short_pith_number":"pith:WRQY3MV3","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"},"canonical_sha256":"b4618db2bb5e7b7d712998adef1666aa490e06bf9d5b8d296c1abbf449537e9b","source":{"kind":"arxiv","id":"1806.03349","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03349","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03349v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03349","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"WRQY3MV3LZ5X","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRQY3MV3LZ5X24JJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRQY3MV3","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WRQY3MV3LZ5X24JJTCW66FTGVJ","target":"record","payload":{"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"},"canonical_sha256":"b4618db2bb5e7b7d712998adef1666aa490e06bf9d5b8d296c1abbf449537e9b","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"},"source_kind":"arxiv","source_id":"1806.03349","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-18T00:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZQmUujt8BHIhKT/FiNTNEqM7KD0eP9ogxW37939pzWUZuYEH15OYbeZ6qs3ruvwIIS1agGfd4IY+j9YqlaTBCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:03:20.102565Z"},"content_sha256":"69700b6b3185807ac7cca43b176690c1ec97034afd1699c67bfa11c9894b966a","schema_version":"1.0","event_id":"sha256:69700b6b3185807ac7cca43b176690c1ec97034afd1699c67bfa11c9894b966a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WRQY3MV3LZ5X24JJTCW66FTGVJ","target":"graph","payload":{"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"},"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:13:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f8qq/tNJu8LzGcMHzVPOqNe7YUKPYXZnNejV4+400+ETpuYd8ZjQICK/q/QpnR/SJYa0jCiC/LTAgdP0yZr0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:03:20.102945Z"},"content_sha256":"bca1c34f54198ca9d1f9338f3d90e639ef701551c8435a22b1c91a2974c658fe","schema_version":"1.0","event_id":"sha256:bca1c34f54198ca9d1f9338f3d90e639ef701551c8435a22b1c91a2974c658fe"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/bundle.json","state_url":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/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-25T20:03:20Z","links":{"resolver":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ","bundle":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/bundle.json","state":"https://pith.science/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRQY3MV3LZ5X24JJTCW66FTGVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WRQY3MV3LZ5X24JJTCW66FTGVJ","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":"22e849c3de1d915b996fc3587a6f853d244da57473e6005166a475113bdbb06e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T20:42:52Z","title_canon_sha256":"7c94fcd7543c7df968ea33db0942b8d822c6f9458ee9fe772f873a26a889fe19"},"schema_version":"1.0","source":{"id":"1806.03349","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.03349","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"arxiv_version","alias_value":"1806.03349v1","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.03349","created_at":"2026-05-18T00:13:43Z"},{"alias_kind":"pith_short_12","alias_value":"WRQY3MV3LZ5X","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRQY3MV3LZ5X24JJ","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRQY3MV3","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:bca1c34f54198ca9d1f9338f3d90e639ef701551c8435a22b1c91a2974c658fe","target":"graph","created_at":"2026-05-18T00:13:43Z","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 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","authors_text":"Joshua R. Wang, Tim Roughgarden","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T20:42:52Z","title":"An Optimal Algorithm for Online Unconstrained Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.03349","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:69700b6b3185807ac7cca43b176690c1ec97034afd1699c67bfa11c9894b966a","target":"record","created_at":"2026-05-18T00:13:43Z","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":"22e849c3de1d915b996fc3587a6f853d244da57473e6005166a475113bdbb06e","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-06-08T20:42:52Z","title_canon_sha256":"7c94fcd7543c7df968ea33db0942b8d822c6f9458ee9fe772f873a26a889fe19"},"schema_version":"1.0","source":{"id":"1806.03349","kind":"arxiv","version":1}},"canonical_sha256":"b4618db2bb5e7b7d712998adef1666aa490e06bf9d5b8d296c1abbf449537e9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4618db2bb5e7b7d712998adef1666aa490e06bf9d5b8d296c1abbf449537e9b","first_computed_at":"2026-05-18T00:13:43.700612Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:13:43.700612Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VMpbzZ1HhxfAhYvhIMe1JKwgM76G0k7/Bt/CsyzYFyrWAeCwSMvc1+etlyEckm6kljW9SvpbU8IHmEqnHAAMCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:13:43.701294Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.03349","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:69700b6b3185807ac7cca43b176690c1ec97034afd1699c67bfa11c9894b966a","sha256:bca1c34f54198ca9d1f9338f3d90e639ef701551c8435a22b1c91a2974c658fe"],"state_sha256":"bfa3c0fa5675af43e77f1d18fa06c0c2696a1a01cd90457fb29385de30181361"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6TeBhCTmdHex35EC0Z3fMpCjTrC7Do6Q9BzubxWMPFrKohTFZHWMZjD1UeO56sZFQ1qopapgorKITfmm31FjBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:03:20.105079Z","bundle_sha256":"32ff013d291b40dff4529cff65edeb9bf3b81c8a96d0eec92b5539779977c5b3"}}