{"as_of":"2026-08-11T08:49:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:ca52903fbcfa1342ca19fc5b8a6126cc75ca41cedd1ea297ba15900538452a90","coverage":[{"denominator":9,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":9,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:28:26.785507Z","state":"measured"},{"denominator":9,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":9,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2602.20578/citation-record","integrity":"/paper/2602.20578/integrity","json":"/paper/2602.20578/citation-record.json","paper":"/paper/2602.20578"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.785507Z","title":"17 As a special case, whenK=O(1), then we have RA′ α,Advo i (F,B)(KT ⋆ )[a,b] =O ( BT 1 2−η )","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.785507Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:2e6a4772f4581d2da20862cbc35b98ceda221b4674b93da74bb16683c43b9596","observation_id":"3b02b64c-bb66-4f40-afeb-fe18252c3563","resolution":{"observed_at":"2026-08-02T21:28:26.785507Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.315569Z","title":"As noted by Garber & Kretzu (2022), for the nuclear norm ball, the LOO is efficient while the SO is expensive","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.315569Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:7872c3157fecadcfd03e42c9457ff1e967f585632e4dfad120de46a854d71eb6","observation_id":"963c22b7-1ade-447d-b392-5c97140fb022","resolution":{"observed_at":"2026-08-02T21:28:26.315569Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.368349Z","title":"6:ify i /∈Kthen 7:Setg i to be the hyperplane returned by SOK (i.e.,∀x∈K,⟨y i−x,g i⟩>0)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.368349Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:9b39e4276623cd36a0b7f1c320e49f9a6519f70c8275c1f92ce6f74b1b90aa57","observation_id":"26adfbd5-c3b4-4b16-aaf1-301044b1155b","resolution":{"observed_at":"2026-08-02T21:28:26.368349Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.475530Z","title":"LetU⊆K T be a compact set and let ˆU = (1− δ r )U + δ r c","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.475530Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:1a68a481f07dd8e6cea9bc0e971fac696a9cfa2b206dab7ad04f2c2bc49f7cd9","observation_id":"d7c2e190-c3b9-4545-9254-09306e0c3365","resolution":{"observed_at":"2026-08-02T21:28:26.475530Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.610870Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.610870Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:9feacec7fa07a0f5c618c75e2ce5363be01d7edecb2d2974834257a9e7ac168c","observation_id":"4e43c517-bfd0-4b6c-8f6b-8419088b21be","resolution":{"observed_at":"2026-08-02T21:28:26.610870Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.672206Z","title":"D.4 Stochastic Full-information To Trivial query (SFTT) Algorithm 8Stochastic Full-information To Trivial query - SFTT(A) 1:Input:base algorithmA, horizonT, block sizeL>K","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.672206Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:0101ca73f21ca8440bab42d7af7a4577ec882994b5f28da82a41ece952a3b7d6","observation_id":"cccf26ae-92c9-48bd-9899-2257ebb7a6c8","resolution":{"observed_at":"2026-08-02T21:28:26.672206Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.249989Z","title":"Lemma 3(Lemma 2.1, Buchbinder & Feldman (2024)).Letf be a non-negative continuous DR-submodular function over[0,1] d","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":2003,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.249989Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:ec35fea4ca92dc03b8b7b36862df69e7f3a127a6acc39e810f95522b08f258e2","observation_id":"953c6668-c2b7-404b-a219-daf46f9f4f8d","resolution":{"observed_at":"2026-08-02T21:28:26.249989Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2401.08330","last_updated":"2024-07-24T08:13:26Z","snapshot_observed_at":"2026-08-11T00:47:29.811102Z","submitted_at":"2024-01-16T12:49:10Z","title":"Boosting Gradient Ascent for Continuous DR-submodular Maximization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2401.08330","snapshot_observed_at":"2026-08-02T21:28:26.156125Z","title":"Boosting gradient ascent for continuous dr-submodular maximization.arXiv preprint arXiv:2401.08330,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":2023,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.156125Z"},"links":{"cited_paper":"/paper/2401.08330","citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:aec999a124f5ae489d3b75c9fb106f0e161991edc99ce7a7178dad99b05d8923","observation_id":"df46b960-6def-4d4d-9815-7c29081efcb0","resolution":{"observed_at":"2026-08-02T21:28:26.156125Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:28:26.044941Z","title":"Online continuous submodular maximization","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets","version":2},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-02T21:28:26.044941Z"},"links":{"citing_paper":"/paper/2602.20578"},"observation_digest":"sha256:7b2a9364e175b5521aa6d5c5d93c977b75162850d782cbf94de3531fcd5028cd","observation_id":"0b6596fd-207d-4683-a02d-d94b95a830fc","resolution":{"observed_at":"2026-08-02T21:28:26.044941Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2602.20578","last_updated":"2026-07-10T17:38:26Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-09T17:28:02.084755Z","submitted_at":"2026-02-24T05:59:42Z","title":"Upper-Linearizability of Online Non-Monotone DR-Submodular Maximization over Down-Closed Convex Sets"},"reference_resolution":{"displayed":9,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":9,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":9},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 11 August 2026, this Paper Citation Record lists 9 of 9 outbound references and 0 inbound Pith citation observations for arXiv:2602.20578."}