{"as_of":"2026-08-11T16:46:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bd93025d86ac145a63dd9758ebbc643093111c95a48001a84368bdf7c4d7c551","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T01:57:54.967235Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-20T07:28:06.679074Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2011.07177","last_updated":"2020-11-14T00:51:57Z","snapshot_observed_at":"2026-08-07T10:15:16.236856Z","submitted_at":"2020-11-14T00:51:57Z","title":"Data-driven Algorithm Design","version":1},"cited_work":{"arxiv_id":"2011.07177","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.07177","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.07177 , year=","venue":null,"work_id":"564a6231-fe0b-4bbb-8691-c7313ff82c78","year":2011},"citing_paper":{"arxiv_id":"2605.07239","last_updated":"2026-05-08T04:52:59Z","snapshot_observed_at":"2026-07-06T23:19:35.885430Z","submitted_at":"2026-05-08T04:52:59Z","title":"Sample Complexity of Stochastic Optimization with Integer Variables","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-11T02:10:44.402412Z"},"links":{"cited_paper":"/paper/2011.07177","citing_paper":"/paper/2605.07239"},"observation_digest":"sha256:c2edfdec403938f74793217cbd6252fba2236a1e857f5dcbb6a1929acc05d194","observation_id":"39119c29-30cf-4892-a351-9baddecc2b03","resolution":{"observed_at":"2026-05-11T03:50:58.039154Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.07177","last_updated":"2020-11-14T00:51:57Z","snapshot_observed_at":"2026-08-07T10:15:16.236856Z","submitted_at":"2020-11-14T00:51:57Z","title":"Data-driven Algorithm Design","version":1},"cited_work":{"arxiv_id":"2011.07177","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2011.07177","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"arXiv preprint arXiv:2011.07177 , year=","venue":null,"work_id":"564a6231-fe0b-4bbb-8691-c7313ff82c78","year":2011},"citing_paper":{"arxiv_id":"2605.19052","last_updated":"2026-05-25T18:55:23Z","snapshot_observed_at":"2026-07-06T23:29:52.061489Z","submitted_at":"2026-05-18T19:16:42Z","title":"Provably Data-driven Lagrangian Relaxation for Mixed Integer Linear Programming","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-20T07:25:45.866972Z"},"links":{"cited_paper":"/paper/2011.07177","citing_paper":"/paper/2605.19052"},"observation_digest":"sha256:f020113f92c6fad13b2c172ba6c69f0bfecd1a62957389aff8fa4b2c383e7f05","observation_id":"0191b67f-d649-4be3-8b7d-459c84d84e7c","resolution":{"observed_at":"2026-05-20T07:28:06.680910Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"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"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2011.07177","last_updated":"2020-11-14T00:51:57Z","snapshot_observed_at":"2026-08-07T10:15:16.236856Z","submitted_at":"2020-11-14T00:51:57Z","title":"Data-driven Algorithm Design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2011.07177","snapshot_observed_at":"2026-08-02T01:57:54.967235Z","title":"Data-driven algorithm design","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.14545","last_updated":"2026-07-16T04:02:15Z","snapshot_observed_at":"2026-08-07T15:31:02.474301Z","submitted_at":"2026-07-16T04:02:15Z","title":"CASP: Learning-Augmented Offline Approximation with Verifiable Certificates and Bounded-Loss PAC Guarantees","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-02T01:57:54.967235Z"},"links":{"cited_paper":"/paper/2011.07177","citing_paper":"/paper/2607.14545"},"observation_digest":"sha256:11878b24b42d4baf61e73d882dca5dee8485fad16d5187c29d65e37921a43bfd","observation_id":"a5f89c91-ae2c-43d2-8375-bcee3ee21d29","resolution":{"observed_at":"2026-08-02T01:57:54.967235Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2011.07177/citation-record","integrity":"/paper/2011.07177/integrity","json":"/paper/2011.07177/citation-record.json","paper":"/paper/2011.07177"},"outbound":[],"paper":{"arxiv_id":"2011.07177","last_updated":"2020-11-14T00:51:57Z","latest_version":1,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-07T10:15:16.236856Z","submitted_at":"2020-11-14T00:51:57Z","title":"Data-driven Algorithm Design"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2011.07177."}