{"as_of":"2026-08-08T17:32:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c16ee1c729953175f9ee17848b625d6a866ca2bdb9fc31ab0fa2328ebcbeb2a2","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-08T06:32:00.761636+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-07T05:20:08.087898Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-04T13:09:51.263628Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1209.2434","last_updated":"2012-09-11T20:37:02Z","snapshot_observed_at":"2026-07-06T02:55:24.800852Z","submitted_at":"2012-09-11T20:37:02Z","title":"Query Complexity of Derivative-Free Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2434","snapshot_observed_at":"2026-08-07T05:20:08.087898Z","title":"G., Nowak, R","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2506.08558","last_updated":"2025-06-11T06:46:49Z","snapshot_observed_at":"2026-08-07T05:04:57.822407Z","submitted_at":"2025-06-10T08:27:01Z","title":"Optimization over Sparse Support-Preserving Sets: Two-Step Projection with Global Optimality Guarantees","version":2},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-07T05:20:08.087898Z"},"links":{"cited_paper":"/paper/1209.2434","citing_paper":"/paper/2506.08558"},"observation_digest":"sha256:ed3b851cdc63765e274867b35a8dcbe3e47ba226d89bc70d5c38a81b3346220a","observation_id":"822deb38-d06e-4884-94bc-dbf76009875e","resolution":{"observed_at":"2026-08-07T05:20:08.087898Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2434","last_updated":"2012-09-11T20:37:02Z","snapshot_observed_at":"2026-07-06T02:55:24.800852Z","submitted_at":"2012-09-11T20:37:02Z","title":"Query Complexity of Derivative-Free Optimization","version":1},"cited_work":{"arxiv_id":"1209.2434","doi":null,"metadata_source":"pith","pith_arxiv_id":"1209.2434","snapshot_observed_at":"2026-07-04T13:09:51.263628Z","title":"Query Complexity of Derivative-Free Optimization","venue":"stat.ML","work_id":"eafb95f2-6cd8-4a9c-bff0-a0b3c739cb1c","year":2012},"citing_paper":{"arxiv_id":"2606.27082","last_updated":"2026-06-25T14:20:03Z","snapshot_observed_at":"2026-08-07T21:42:58.159964Z","submitted_at":"2026-06-25T14:20:03Z","title":"Finding Stationary Points by Comparisons","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-26T05:26:07.720218Z"},"links":{"cited_paper":"/paper/1209.2434","citing_paper":"/paper/2606.27082"},"observation_digest":"sha256:e57f8fb5331bd3e23b8d1eb96b2e74334ebc05fb86f37989b3d37764b925cc54","observation_id":"0b18f4d6-d99e-47be-8760-247ae1104466","resolution":{"observed_at":"2026-07-04T13:09:51.264846Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1209.2434","last_updated":"2012-09-11T20:37:02Z","snapshot_observed_at":"2026-07-06T02:55:24.800852Z","submitted_at":"2012-09-11T20:37:02Z","title":"Query Complexity of Derivative-Free Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1209.2434","snapshot_observed_at":"2026-07-14T07:06:53.439022Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.11095","last_updated":"2026-07-13T05:03:41Z","snapshot_observed_at":"2026-08-07T17:02:56.305344Z","submitted_at":"2026-07-13T05:03:41Z","title":"When cheap gradients fail: the measurement cost of attacking quantum classifiers","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-14T07:06:53.439022Z"},"links":{"cited_paper":"/paper/1209.2434","citing_paper":"/paper/2607.11095"},"observation_digest":"sha256:db7dac1b28073800024014e7970df4e758169af6690191b8052cfde89fef9d17","observation_id":"1e664985-25bc-43d7-87ed-a8efdd13bca3","resolution":{"observed_at":"2026-07-14T07:06:53.439022Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1209.2434/citation-record","integrity":"/paper/1209.2434/integrity","json":"/paper/1209.2434/citation-record.json","paper":"/paper/1209.2434"},"outbound":[],"paper":{"arxiv_id":"1209.2434","last_updated":"2012-09-11T20:37:02Z","latest_version":1,"primary_category":"stat.ML","snapshot_observed_at":"2026-07-06T02:55:24.800852Z","submitted_at":"2012-09-11T20:37:02Z","title":"Query Complexity of Derivative-Free Optimization"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1209.2434."}