{"as_of":"2026-08-16T11:36:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a61e1461ffa690cdce192f2e02c61bf2d3ad6bae8bf7a6a7906ab639dfdb4fdb","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-14T14:04:53.864210Z","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/1908.04091/citation-record","integrity":"/paper/1908.04091/integrity","json":"/paper/1908.04091/citation-record.json","paper":"/paper/1908.04091"},"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-14T14:04:54.058162Z","title":"Self-concordant analysis for logistic regression","venue":null,"work_id":"49c4ebeb-3c6f-42d0-8516-22441bae91b9","year":2010},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.708483Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:04ce83cfde5191eda0a43f1bd948e5b717ac817ed3fec65ea30f8ea44c77fee0","observation_id":"08254761-14c1-402a-8195-a8ee58129491","resolution":{"observed_at":"2026-08-14T14:04:54.061819Z","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":"1710.11606","last_updated":"2019-08-15T16:56:56Z","snapshot_observed_at":"2026-08-14T20:18:22.958722Z","submitted_at":"2017-10-31T17:37:07Z","title":"Lower Bounds for Finding Stationary Points I","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1710.11606","snapshot_observed_at":"2026-08-14T14:04:53.713259Z","title":"Lower bounds for finding stationary points I","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.713259Z"},"links":{"cited_paper":"/paper/1710.11606","citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:212aa4f98dfaf8d71839e9010e7e464bffea1c83cf419db825a0c0210f9b7f61","observation_id":"f94bed91-eb42-4bec-a144-ea493dfa2463","resolution":{"observed_at":"2026-08-14T14:04:53.713259Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1711.00841","last_updated":"2017-11-02T17:52:08Z","snapshot_observed_at":"2026-08-14T20:17:33.721227Z","submitted_at":"2017-11-02T17:52:08Z","title":"Lower Bounds for Finding Stationary Points II: First-Order Methods","version":1},"cited_work":{"arxiv_id":"1711.00841","doi":null,"metadata_source":"pith","pith_arxiv_id":"1711.00841","snapshot_observed_at":"2026-08-14T14:04:53.914270Z","title":"Lower Bounds for Finding Stationary Points II: First-Order Methods","venue":"math.OC","work_id":"fd2d0296-96e4-4809-8918-daa77d2e67db","year":2017},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.717822Z"},"links":{"cited_paper":"/paper/1711.00841","citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:7ddb73774d7828a8b39fd423345ee8cd3965c3fa203385bfbc45e5d7b3f73483","observation_id":"0de4b3de-b151-4cb0-a557-c83482a9e722","resolution":{"observed_at":"2026-08-14T14:04:53.918211Z","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":{"arxiv_id":"1811.01903","last_updated":"2019-06-19T21:41:52Z","snapshot_observed_at":"2026-08-14T18:03:59.272576Z","submitted_at":"2018-11-05T18:32:06Z","title":"Lower Bounds for Parallel and Randomized Convex Optimization","version":3},"cited_work":{"arxiv_id":"1811.01903","doi":null,"metadata_source":"pith","pith_arxiv_id":"1811.01903","snapshot_observed_at":"2026-08-14T14:04:53.895033Z","title":"Lower Bounds for Parallel and Randomized Convex Optimization","venue":"math.OC","work_id":"fe47941f-108f-4843-8ed5-55ddec17e334","year":2018},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.722318Z"},"links":{"cited_paper":"/paper/1811.01903","citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:3134bf54c8ae01c9bb078f5245e533576d9bbffd8b9c36c73cd97c2fa9805122","observation_id":"301519f5-f006-493e-a489-4bdccec33ac5","resolution":{"observed_at":"2026-08-14T14:04:53.900878Z","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-14T14:04:54.047106Z","title":"The exact information-based complexity of smooth convex minimization","venue":null,"work_id":"706cb6e0-0471-4e0d-98aa-9ce84b792100","year":2017},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.836511Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:0e3d857f1f8553ba00a109f4ef597e59ae0ed6e20c06d46c9807cd9abaa73d62","observation_id":"465a6d52-12fb-4076-8381-f8467411c197","resolution":{"observed_at":"2026-08-14T14:04:54.051140Z","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-14T14:04:54.033184Z","title":"On lower complexity bounds for large-scale smooth convex optimization","venue":null,"work_id":"9a35b048-9a92-4211-94f3-1c90551e9285","year":2015},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.840936Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:17a419813b106a8e82d6b710eec854978e8a4a02dfd12f9497b80f5240763c67","observation_id":"e768d0d8-2e77-4824-84d4-4878903fb942","resolution":{"observed_at":"2026-08-14T14:04:54.038451Z","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-14T14:04:54.014454Z","title":"Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization","venue":null,"work_id":"5a1de7e2-2585-4224-b1f6-61532e89caa4","year":2014},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.845150Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:233888dde629e49d09b5ff6e62c6677cfa65b9c11abd42f05b16a059805fb383","observation_id":"4bae55f0-8f83-4a74-96f8-373a493efb50","resolution":{"observed_at":"2026-08-14T14:04:54.019631Z","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-14T14:04:53.993147Z","title":"Nemirovski and D","venue":null,"work_id":"cd55c54f-1a6c-4d5e-a568-ce20476eab28","year":1983},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.848892Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:cf3e9220e87ce51beb7b1f509e4d396f610f2c6e4698800eb2d552b3a83867b4","observation_id":"9bbce199-24cc-4454-aef1-a4d27e72d260","resolution":{"observed_at":"2026-08-14T14:04:53.997276Z","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-14T14:04:53.980650Z","title":null,"venue":null,"work_id":"17756b38-1f62-4c68-b4bb-a1451cf5dbea","year":1992},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.852846Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:b772af8677cb46ef323da52c83f57bef08d28c9987c9e9dc41884575a7a91fc1","observation_id":"c7657362-0c76-4675-a4c1-793c5cffe261","resolution":{"observed_at":"2026-08-14T14:04:53.984799Z","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-14T14:04:53.966615Z","title":null,"venue":null,"work_id":"749da598-16b5-4971-915d-0f4012409ce3","year":2004},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.856823Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:acf9e5b75cd1e0ecaa75095e7b84ca152004a440fd90ccb858734cf29ee9fb87","observation_id":"b42b23c2-e168-45fd-9a69-d1873ee76b01","resolution":{"observed_at":"2026-08-14T14:04:53.971366Z","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-14T14:04:53.953464Z","title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems","venue":null,"work_id":"b4ae8293-9b7f-443a-868a-7111a37d5bc7","year":2019},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.860580Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:81a042f59b1d24c93809771bdb1b389c03feefee25cdb285cdfbc60e61f8228c","observation_id":"28d7c8f7-0cac-445e-b794-5a7769e3df5c","resolution":{"observed_at":"2026-08-14T14:04:53.958045Z","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-14T14:04:53.940190Z","title":"Tight complexity bounds for optimizing composite objectives","venue":null,"work_id":"30f6df5e-5496-4d24-8f57-3f95fc10e79d","year":2016},"citing_paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-14T14:04:53.864210Z"},"links":{"citing_paper":"/paper/1908.04091"},"observation_digest":"sha256:846e1bb2a4314fb3bad296e06499f4e6f3aeae4be8998e83e82f76e70b33a1cb","observation_id":"2700cec7-73a4-4d2b-8b24-e50cc7cb6171","resolution":{"observed_at":"2026-08-14T14:04:53.944443Z","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"}}],"paper":{"arxiv_id":"1908.04091","last_updated":"2019-08-12T11:17:45Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-16T05:46:14.558059Z","submitted_at":"2019-08-12T11:17:45Z","title":"Some Worst-Case Datasets of Deterministic First-Order Methods for Solving Binary Logistic Regression"},"reference_resolution":{"displayed":12,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":3,"verified_exact":2,"verified_fuzzy":7},"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:1908.04091."}