{"as_of":"2026-08-10T02:55:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:4906d6a930a182c6a9ca6eb246e1ae9d0be07921c748b1fae713e7140777bb16","coverage":[{"denominator":4,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-29T11:32:07.863880Z","state":"measured"},{"denominator":4,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":4,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2605.27814/citation-record","integrity":"/paper/2605.27814/integrity","json":"/paper/2605.27814/citation-record.json","paper":"/paper/2605.27814"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2503.20616","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:33:22.628572Z","title":null,"venue":null,"work_id":"eaa2c53d-161a-4933-ba72-85a4ff14fd7d","year":2019},"citing_paper":{"arxiv_id":"2605.27814","last_updated":"2026-05-27T01:09:17Z","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-27T01:09:17Z","title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-29T11:32:07.863880Z"},"links":{"citing_paper":"/paper/2605.27814"},"observation_digest":"sha256:fcc7a3f87a84800a92c9ddf77378df920346a2fd4d7e047fc1ee9e62246fa1a8","observation_id":"c9d22bd1-fcb9-4864-aee2-5d8b4661bd0f","resolution":{"observed_at":"2026-06-29T11:33:22.629870Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:32:07.863880Z","title":"Optim., 17 (2007), pp","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2605.27814","last_updated":"2026-05-27T01:09:17Z","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-27T01:09:17Z","title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-29T11:32:07.863880Z"},"links":{"citing_paper":"/paper/2605.27814"},"observation_digest":"sha256:0b25cae421d18ffc389caf811a239e27b5912a8378cc9b16f82904be7429b992","observation_id":"adfe60b7-4454-47e0-94c5-db06d4ad0cd2","resolution":{"observed_at":"2026-06-29T11:32:07.863880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2510.04473","last_updated":"2026-06-26T13:58:50Z","snapshot_observed_at":"2026-08-04T17:35:45.158149Z","submitted_at":"2025-10-06T04:12:45Z","title":"Introduction to Model-Based Derivative-Free Optimization","version":2},"cited_work":{"arxiv_id":"2510.04473","doi":null,"metadata_source":"pith","pith_arxiv_id":"2510.04473","snapshot_observed_at":"2026-06-29T11:33:22.631004Z","title":"Introduction to Model-Based Derivative-Free Optimization","venue":"math.OC","work_id":"5f290aab-9ab8-4bd4-9b41-274cea14ff56","year":2025},"citing_paper":{"arxiv_id":"2605.27814","last_updated":"2026-05-27T01:09:17Z","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-27T01:09:17Z","title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-29T11:32:07.863880Z"},"links":{"cited_paper":"/paper/2510.04473","citing_paper":"/paper/2605.27814"},"observation_digest":"sha256:3f24f72fdc34f267799e3f8afdd352f325e1464201938beeb010077be850755f","observation_id":"f785e332-d02c-444c-b25d-365ca1e6665e","resolution":{"observed_at":"2026-06-29T11:33:22.632160Z","resolver_source":"local_arxiv","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-09T06:31:02.800959+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-29T11:32:07.863880Z","title":"Op- tim., 35 (2025), pp","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2605.27814","last_updated":"2026-05-27T01:09:17Z","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-27T01:09:17Z","title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-29T11:32:07.863880Z"},"links":{"citing_paper":"/paper/2605.27814"},"observation_digest":"sha256:485198e21b148a955ab9d732055e78699cb9d2d8656daba76bd985225f480852","observation_id":"6415deb0-12a3-4a35-aa54-bdbcf161e43b","resolution":{"observed_at":"2026-06-29T11:32:07.863880Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2605.27814","last_updated":"2026-05-27T01:09:17Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T23:37:27.309837Z","submitted_at":"2026-05-27T01:09:17Z","title":"Polling Set Construction and Worst-Case Complexity for Direct Search under Polyhedral Convex Constraints"},"reference_resolution":{"displayed":4,"state_counts":{"malformed_identifier":0,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":4},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 4 of 4 outbound references and 0 inbound Pith citation observations for arXiv:2605.27814."}