{"as_of":"2026-08-16T11:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5bc9a8d1f46cd44ce6d599c1370cc5a82ae1cb68a5ddfadec04346c26ec370f","coverage":[{"denominator":12,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T06:24:14.790317Z","state":"measured"},{"denominator":12,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":12,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-16T06:30:59.297886+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/1909.00171/citation-record","integrity":"/paper/1909.00171/integrity","json":"/paper/1909.00171/citation-record.json","paper":"/paper/1909.00171"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:14.974225Z","title":"The ellipsoid method and its consequences in combinatorial optimization","venue":null,"work_id":"c2d2f89c-6150-47f2-a2eb-1516db70e2c6","year":1981},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.758382Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:e8cd92b5b237ae9fbeed8699291d03303c5d7ddcb3ddd84381f2983c336be59c","observation_id":"c511572d-41e0-4942-9cd7-1d560929d394","resolution":{"observed_at":"2026-08-14T06:24:14.980913Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1809.05895","last_updated":"2019-05-12T16:22:31Z","snapshot_observed_at":"2026-08-14T18:27:50.050835Z","submitted_at":"2018-09-16T15:28:25Z","title":"Primal-dual accelerated gradient methods with small-dimensional relaxation oracle","version":3},"cited_work":{"arxiv_id":"1809.05895","doi":null,"metadata_source":"pith","pith_arxiv_id":"1809.05895","snapshot_observed_at":"2026-08-14T06:24:14.828528Z","title":"Primal-dual accelerated gradient methods with small-dimensional relaxation oracle","venue":"math.OC","work_id":"e2d7cb94-904a-47e3-a2d0-4608885eade7","year":2018},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.790317Z"},"links":{"cited_paper":"/paper/1809.05895","citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:5e6b121a1d8ccc7eeae8047e395b459c376e2ee6a1c10eea251adc1b01c8021d","observation_id":"8236d04d-14aa-495e-8c28-67fa67d27eee","resolution":{"observed_at":"2026-08-14T06:24:14.836151Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:15.012387Z","title":"Provable submodular minimization using wolfe’s algorithm","venue":null,"work_id":"0a98e70d-2116-41d9-a47e-63c4285f16ea","year":2014},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":1954,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.742967Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:e4b911be8c97b4596e91fd31ec00343363caf03d4be0948e94e5d1d28cc5fe63","observation_id":"4790b4d9-6cc1-49e2-8ce7-913d8cb8bde7","resolution":{"observed_at":"2026-08-14T06:24:15.018711Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:14.924627Z","title":"A faste r cutting plane method and its implications for combinatorial and convex optimization","venue":null,"work_id":"04a9324b-9ee4-4d25-bf4d-ecde578f4134","year":2015},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":1983,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.785341Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:fae23125e7552f4080cb0d98c6f85783419cc6f1eb275db4ff1a20a88875af87","observation_id":"818bfcfc-4652-4bc4-b070-920a83d90bc9","resolution":{"observed_at":"2026-08-14T06:24:14.929394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1611.00756","last_updated":"2017-02-02T18:56:35Z","snapshot_observed_at":"2026-08-14T21:32:15.012981Z","submitted_at":"2016-11-02T19:58:30Z","title":"Accelerated Methods for Non-Convex Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.00756","snapshot_observed_at":"2026-08-14T06:24:14.732455Z","title":"Duchi, Oliver Hinder, and Aaron Sidfor d","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.732455Z"},"links":{"cited_paper":"/paper/1611.00756","citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:d0941ae3fca80fffbeb92f348823c23b89f7256cc41eda917fbb61f99e9263c0","observation_id":"a67b4540-c1f3-40c3-8401-23948d68c05d","resolution":{"observed_at":"2026-08-14T06:24:14.732455Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1710.00797","last_updated":"2023-05-16T11:26:49Z","snapshot_observed_at":"2026-08-15T23:21:02.466065Z","submitted_at":"2017-10-02T17:10:43Z","title":"Accelerated Methods for $\\alpha$-Weakly-Quasi-Convex Problems","version":7},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.00797","snapshot_observed_at":"2026-08-14T06:24:14.747765Z","title":"Accelerated metho ds for α-weakly-quasi-convex prob- lems","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.747765Z"},"links":{"cited_paper":"/paper/1710.00797","citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:9074dfaa484c47a1182f35502ebe58dbaa49d5639e8b4ca16545d83fd9a132ff","observation_id":"0fb5db15-0aef-474c-b466-992e9fc7dca8","resolution":{"observed_at":"2026-08-14T06:24:14.747765Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:14.956794Z","title":null,"venue":null,"work_id":"140dc933-cb3e-479e-86b0-8a4a28085ca6","year":2011},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2009,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.775572Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:1d3a224f53f2f0b63d7a4c2d0a6e8a89da318dfc87928629f140079706b8b257","observation_id":"8f0da4f8-cc1e-416d-b548-6686f7c02dfe","resolution":{"observed_at":"2026-08-14T06:24:14.961708Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:14.940614Z","title":"On the global linear con vergence of frank-wolfe optimiza- tion variants","venue":null,"work_id":"38abd807-db95-47c3-93eb-c328b71491b4","year":2015},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2011,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.780490Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:03f3354119fc3218a42d22021ead169d1b5904306ad06041818defde7bc3d0ed","observation_id":"89485ee0-3df0-4842-8906-b2a909774c7f","resolution":{"observed_at":"2026-08-14T06:24:14.946035Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05378","last_updated":"2020-01-15T10:42:39Z","snapshot_observed_at":"2026-08-14T20:21:30.468898Z","submitted_at":"2019-07-11T16:54:20Z","title":"Quantum and Classical Algorithms for Approximate Submodular Function Minimization","version":2},"cited_work":{"arxiv_id":"1907.05378","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.05378","snapshot_observed_at":"2026-08-14T06:24:14.872669Z","title":"Quantum and Classical Algorithms for Approximate Submodular Function Minimization","venue":"cs.DS","work_id":"34076cf7-97c5-4e5a-8bc4-88a36fdb6387","year":2019},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.763678Z"},"links":{"cited_paper":"/paper/1907.05378","citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:be6c6b6e1e2a6a5728a6130bd70b21010d3c8e713814b06ba579e511cd04c516","observation_id":"3ca9ef61-b946-4692-9073-912b451251eb","resolution":{"observed_at":"2026-08-14T06:24:14.878958Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:15.030934Z","title":"Theory of capacities","venue":null,"work_id":"6fcef2b5-844a-4ba9-9cf4-c7979b33a256","year":1955},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2016,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.738194Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:59541b0ee12d3a026a1eab9df0af8a7b840eb8aabc577aabceba624c2f216642","observation_id":"770ee349-a3ae-4e45-88e8-e22053fcfc78","resolution":{"observed_at":"2026-08-14T06:24:15.036481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T06:24:14.993722Z","title":"Lee, and Tengyu Ma","venue":null,"work_id":"2824946c-bf61-4e6e-ba5d-87cf5a8afdad","year":2016},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.753390Z"},"links":{"citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:06f6b990c748075f80e30b93c7b31e898d69d55153484baed42ceaf4d559b433","observation_id":"5dee815d-22fc-46c2-95b2-d14c2f2ce6db","resolution":{"observed_at":"2026-08-14T06:24:14.998663Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.11985","last_updated":"2023-02-24T06:15:45Z","snapshot_observed_at":"2026-08-14T23:40:11.539702Z","submitted_at":"2019-06-27T22:39:35Z","title":"Near-Optimal Methods for Minimizing Star-Convex Functions and Beyond","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.11985","snapshot_observed_at":"2026-08-14T06:24:14.769109Z","title":"Near- optimal methods for minimizing star-convex functions and beyond","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-14T06:24:14.769109Z"},"links":{"cited_paper":"/paper/1906.11985","citing_paper":"/paper/1909.00171"},"observation_digest":"sha256:5a956f5930a087a83db5c9b9f9f8cb5635df516b5f795e35e5a3275e4ab8baea","observation_id":"c7fea472-db19-4b9c-b8f9-3a09204a6453","resolution":{"observed_at":"2026-08-14T06:24:14.769109Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1909.00171","last_updated":"2019-08-31T09:09:08Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-14T05:57:40.208303Z","submitted_at":"2019-08-31T09:09:08Z","title":"Near-optimal Approximate Discrete and Continuous Submodular Function Minimization"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":4,"verified_exact":2,"verified_fuzzy":6},"total_outbound_references":12},"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-16T06:30:59.297886+00:00","source":"crossref"},{"observed_at":"2026-08-16T06:30:54.164669+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 12 of 12 outbound references and 0 inbound Pith citation observations for arXiv:1909.00171."}