{"as_of":"2026-08-12T03:42:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:807d87eb2269cf54ac942ba7eac65a1f82513ce07604d81f4f457ca006beca6a","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":6,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":6,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":6,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":6,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T16:18:17.491734Z","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-06-29T19:23:53.811105Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02141","snapshot_observed_at":"2026-08-10T16:18:17.491734Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.13394","last_updated":"2025-06-15T19:49:41Z","snapshot_observed_at":"2026-08-11T05:35:29.939153Z","submitted_at":"2025-01-23T05:37:33Z","title":"Concurrent Learning with Aggregated States via Randomized Least Squares Value Iteration","version":3},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-10T16:18:17.491734Z"},"links":{"cited_paper":"/paper/2010.02141","citing_paper":"/paper/2501.13394"},"observation_digest":"sha256:ef6c8a309c7db0c02f0e3cb0e004b3edc1c5b57d5d9a37900204a8b9a0c0c2b8","observation_id":"0d8d3c58-3fb5-442a-910e-1fbcf410a061","resolution":{"observed_at":"2026-08-10T16:18:17.491734Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02141","snapshot_observed_at":"2026-08-09T21:02:47.469258Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.19200","last_updated":"2025-05-28T12:26:27Z","snapshot_observed_at":"2026-08-10T13:37:47.421628Z","submitted_at":"2025-01-31T15:07:26Z","title":"A Variational Perspective on Generative Protein Fitness Optimization","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-09T21:02:47.469258Z"},"links":{"cited_paper":"/paper/2010.02141","citing_paper":"/paper/2501.19200"},"observation_digest":"sha256:4512e7a6cbac28d4532ad1f7357e377b787bdb4e64f8d7688fb5645b817a9374","observation_id":"1abddc36-be35-4b37-9b98-6a4090d0e501","resolution":{"observed_at":"2026-08-09T21:02:47.469258Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02141","snapshot_observed_at":"2026-08-07T13:56:04.373354Z","title":"Adalead: A simple and robust adaptive greedy search algorithm for sequence design","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2505.20578","last_updated":"2025-05-26T23:27:50Z","snapshot_observed_at":"2026-08-08T08:46:11.025239Z","submitted_at":"2025-05-26T23:27:50Z","title":"Ctrl-DNA: Controllable Cell-Type-Specific Regulatory DNA Design via Constrained RL","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T13:56:04.373354Z"},"links":{"cited_paper":"/paper/2010.02141","citing_paper":"/paper/2505.20578"},"observation_digest":"sha256:dc874f05e9a5681b637964eb920d291599be0600e86ea3aff373fa7de4a91f6e","observation_id":"03e10a01-b4fb-4ade-a561-cbecec42dd4a","resolution":{"observed_at":"2026-08-07T13:56:04.373354Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02141","snapshot_observed_at":"2026-08-06T21:10:12.092387Z","title":"Adalead: A simple and robust adaptive greedy search algorithm for sequence design","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2509.07983","last_updated":"2025-09-12T12:39:45Z","snapshot_observed_at":"2026-08-09T15:33:57.089805Z","submitted_at":"2025-07-01T16:03:55Z","title":"Steering Protein Language Models","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T21:10:12.092387Z"},"links":{"cited_paper":"/paper/2010.02141","citing_paper":"/paper/2509.07983"},"observation_digest":"sha256:eceb1b000f266b64d0e1aa33f01b8444f0b8dc797f6d9e0504791e96a6aa0917","observation_id":"074c02dd-335e-44a8-b6da-dc42131ca065","resolution":{"observed_at":"2026-08-06T21:10:12.092387Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2010.02141","snapshot_observed_at":"2026-08-04T10:09:45.652844Z","title":null,"venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2510.11711","last_updated":"2026-07-31T10:08:26Z","snapshot_observed_at":"2026-08-09T03:55:32.882835Z","submitted_at":"2025-10-13T17:59:11Z","title":"Reinforced sequential Monte Carlo for amortised sampling","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T10:09:45.652844Z"},"links":{"cited_paper":"/paper/2010.02141","citing_paper":"/paper/2510.11711"},"observation_digest":"sha256:de56ee95a2ea3d13cc9c67515c84c75b7b62128e6f05a3fd18f238b5719a2974","observation_id":"f69419c0-a320-4316-8307-0ab868695047","resolution":{"observed_at":"2026-08-04T10:09:45.652844Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence design","version":1},"cited_work":{"arxiv_id":"2010.02141","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2010.02141","snapshot_observed_at":"2026-06-29T19:23:53.811105Z","title":"Adalead: A simple and robust adaptive greedy search algorithm for sequence design.arXiv preprint arXiv:2010.02141, 2020","venue":null,"work_id":"f8ef706d-e820-4a37-bebb-a93fc0cf95c9","year":2010},"citing_paper":{"arxiv_id":"2605.26690","last_updated":"2026-05-26T08:29:36Z","snapshot_observed_at":"2026-08-08T09:09:25.824201Z","submitted_at":"2026-05-26T08:29:36Z","title":"Self-Improvement Imitation with Biologically Guided Search for Protein Design Under Oracle Budgets","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-06-29T19:21:13.698546Z"},"links":{"cited_paper":"/paper/2010.02141","citing_paper":"/paper/2605.26690"},"observation_digest":"sha256:bef13f47307e6c2ac55c2d87a55fb518b92c6f8fe59870506389725202808271","observation_id":"3f77623d-f9d5-445b-8d2f-346513fb3dcb","resolution":{"observed_at":"2026-06-29T19:23:53.812660Z","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"}}],"links":{"evidence":"/evidence","html":"/paper/2010.02141/citation-record","integrity":"/paper/2010.02141/integrity","json":"/paper/2010.02141/citation-record.json","paper":"/paper/2010.02141"},"outbound":[],"paper":{"arxiv_id":"2010.02141","last_updated":"2020-10-05T16:40:38Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-10T09:11:19.707395Z","submitted_at":"2020-10-05T16:40:38Z","title":"AdaLead: A simple and robust adaptive greedy search algorithm for sequence 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 12 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2010.02141."}