{"as_of":"2026-08-22T05:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c671db168134d90496f99352c6787903f35bb39c500dfbcc4f293c9c7085082b","coverage":[{"denominator":8,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":8,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T00:28:36.688453Z","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-21T06:32:19.484+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T05:51:02.422512Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"pith","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":0,"observed_at":"2026-08-05T02:28:24.338817Z","source":"pith"}],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"cited_work":{"arxiv_id":"2511.02082","doi":"10.48550/arxiv.2511.02082","metadata_source":"pith","pith_arxiv_id":"2511.02082","snapshot_observed_at":"2026-08-05T02:49:54.815029Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","venue":"math.OC","work_id":"66bfff0b-ea8a-4de4-a7c8-8fe535ccbde8","year":2025},"citing_paper":{"arxiv_id":"2607.13335","last_updated":"2026-07-14T23:45:21Z","snapshot_observed_at":"2026-08-21T10:54:18.133225Z","submitted_at":"2026-07-14T23:45:21Z","title":"Closing the Oracle-Complexity Gap in Derivative-Free Convex Optimization: A Near-Quadratic Lower Bound from Exact Function Values","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T05:51:02.422512Z"},"links":{"cited_paper":"/paper/2511.02082","citing_paper":"/paper/2607.13335"},"observation_digest":"sha256:8388e50e407a46ce1d0f6acec9ae972dc238847f0743f4dc8c1fd95e1df68b31","observation_id":"23565f54-ecbc-444e-878a-09fc742b387c","resolution":{"observed_at":"2026-08-02T05:54:09.970584Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2511.02082/citation-record","integrity":"/paper/2511.02082/integrity","json":"/paper/2511.02082/citation-record.json","paper":"/paper/2511.02082"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-04T00:28:36.054623Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.054623Z"},"links":{"citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:c9574f38831a0d3cb2c42dc6aba3f187ef613adc613d1c675510308cd8f4d568","observation_id":"bf5839b2-da98-4e46-9ce1-752923e1b526","resolution":{"observed_at":"2026-08-04T00:28:36.054623Z","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-04T00:28:36.165566Z","title":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing (2024)","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.165566Z"},"links":{"citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:d7811f050966ff83716a108f5774f84d76eb800efe2c1e7cd70f61b03fa42910","observation_id":"3e680a9f-ba71-47a7-a10d-b72efc68211e","resolution":{"observed_at":"2026-08-04T00:28:36.165566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2203.15260","last_updated":"2024-07-24T11:21:47Z","snapshot_observed_at":"2026-08-16T17:11:04.761360Z","submitted_at":"2022-03-29T06:15:54Z","title":"Efficient Convex Optimization Requires Superlinear Memory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2203.15260","snapshot_observed_at":"2026-08-04T00:28:36.204967Z","title":"arXiv preprint arXiv:2203.15260 (2022)","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.204967Z"},"links":{"cited_paper":"/paper/2203.15260","citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:06a20a75ef4d17d53ef038a90ae37dcb739fbf0d30eb286c3f022fa309ade42b","observation_id":"3ceab218-3979-4081-99bc-30d42fcd87b7","resolution":{"observed_at":"2026-08-04T00:28:36.204967Z","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-04T00:28:36.293088Z","title":"Ekonomika i matem","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.293088Z"},"links":{"citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:e8b049f447b2d5a350a0f8c2ed0e35485c62184f4cdb1eb67644d7128dcc9595","observation_id":"59905b1f-496a-401b-8d3f-f91165695e4b","resolution":{"observed_at":"2026-08-04T00:28:36.293088Z","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-04T00:28:36.388225Z","title":"1986 25th IEEE Conference on Decision and Control pp","venue":null,"work_id":null,"year":1986},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.388225Z"},"links":{"citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:37bfecfd5ead6cf9fbc8ec44776aaf80072bbfdd9c8605f7058933f29eae16af","observation_id":"88eee298-47a9-40ce-99b1-ed04e938b54b","resolution":{"observed_at":"2026-08-04T00:28:36.388225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.05832","last_updated":"2019-10-31T03:46:29Z","snapshot_observed_at":"2026-08-14T16:16:00.194189Z","submitted_at":"2019-06-13T17:29:56Z","title":"The Communication Complexity of Optimization","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.05832","snapshot_observed_at":"2026-08-04T00:28:36.469338Z","title":"ArXiv abs/1906.05832 (2019)","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.469338Z"},"links":{"cited_paper":"/paper/1906.05832","citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:2d82401530cebfab3a3c98ead6f00dc1a6b3291aba246da9a79145c0f03bd3e4","observation_id":"ada52d6b-492b-4383-9278-f2b219ea4f83","resolution":{"observed_at":"2026-08-04T00:28:36.469338Z","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-04T00:28:36.580406Z","title":", \" * write output.state after.block = add.period write","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.580406Z"},"links":{"citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:4cb1518fea91fc8ba5eaf4c8aef3940660129acb4cc9c60c4899c02467e0fec2","observation_id":"450ad930-5d7f-4657-86f3-f920d833ced3","resolution":{"observed_at":"2026-08-04T00:28:36.580406Z","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-04T00:28:36.688453Z","title":"write newline","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-04T00:28:36.688453Z"},"links":{"citing_paper":"/paper/2511.02082"},"observation_digest":"sha256:306121065c540cd092853ccd2dd9a10da291a3351d9e381ddbfa759a2a50545e","observation_id":"34a83bd0-e323-4cd5-87f5-32dc3557f6a3","resolution":{"observed_at":"2026-08-04T00:28:36.688453Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2511.02082","last_updated":"2026-07-14T18:14:08Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-08-21T17:07:21.084747Z","submitted_at":"2025-11-03T21:42:30Z","title":"Tight Lower Bounds for Binary First-Order Oracles for Convex Optimization"},"reference_resolution":{"displayed":8,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":8,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":8},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 8 of 8 outbound references and 1 inbound Pith citation observation for arXiv:2511.02082."}