{"as_of":"2026-08-08T11:17:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c7d17eac8657a092997e00969c3485c092032ca60f1f802b2e60169277b5446d","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":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-08T06:32:00.761636+00:00","state":"measured"},{"denominator":12,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":12,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T04:10:24.990539Z","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-07-02T21:47:28.307382Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-07T04:10:24.990539Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.11612","last_updated":"2025-06-13T09:33:58Z","snapshot_observed_at":"2026-08-07T04:02:01.830610Z","submitted_at":"2025-06-13T09:33:58Z","title":"KEENHash: Hashing Programs into Function-Aware Embeddings for Large-Scale Binary Code Similarity Analysis","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T04:10:24.990539Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2506.11612"},"observation_digest":"sha256:92c206405422a18f870cbaa5d7b08f9b1f007acd6e79d61fbfef54546e08fc1f","observation_id":"340fa90d-62de-4e66-bd14-75fbab9c0fd4","resolution":{"observed_at":"2026-08-07T04:10:24.990539Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-06T23:41:59.202883Z","title":"and Liashchynskyi, P","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2506.16696","last_updated":"2025-06-20T02:37:52Z","snapshot_observed_at":"2026-08-08T07:12:41.518273Z","submitted_at":"2025-06-20T02:37:52Z","title":"Interpretable Low-Dimensional Modeling of Spatiotemporal Agent States for Decision Making in Football Tactics","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-06T23:41:59.202883Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2506.16696"},"observation_digest":"sha256:fdcd2b65e2fb9c71d6953ffb965ae7532cf4be6b9f5ae8eaebab02c50b9df3c8","observation_id":"16300df3-84c5-498e-83fc-59180af3a287","resolution":{"observed_at":"2026-08-06T23:41:59.202883Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-07T00:25:01.995512Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2507.00024","last_updated":"2025-06-17T08:17:44Z","snapshot_observed_at":"2026-08-07T00:15:33.645875Z","submitted_at":"2025-06-17T08:17:44Z","title":"AIMatDesign: Knowledge-Augmented Reinforcement Learning for Inverse Materials Design under Data Scarcity","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T00:25:01.995512Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2507.00024"},"observation_digest":"sha256:ff3849d742f306519f91981d3f5f82a6e4fe89705ba34d9a5ce01ba5d967572e","observation_id":"d1691c27-d87c-47b2-bfe7-571f3f42b1d9","resolution":{"observed_at":"2026-08-07T00:25:01.995512Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-06T17:42:14.776287Z","title":"2019, Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS, arXiv, 10.48550/ARXIV.1912.06059","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2507.10317","last_updated":"2025-07-14T14:25:17Z","snapshot_observed_at":"2026-08-08T09:35:50.049802Z","submitted_at":"2025-07-14T14:25:17Z","title":"Gaussian Process Methods for Very Large Astrometric Data Sets","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-06T17:42:14.776287Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2507.10317"},"observation_digest":"sha256:a75ef9f013c83930e432481287c6d20bb0df97e2c89b1b79f72d7d0c033c7915","observation_id":"65c9a57e-53f8-4c28-8b6f-cf1b90448088","resolution":{"observed_at":"2026-08-06T17:42:14.776287Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-06T10:29:06.357595Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2508.00053","last_updated":"2025-07-31T18:00:01Z","snapshot_observed_at":"2026-08-06T10:29:05.519494Z","submitted_at":"2025-07-31T18:00:01Z","title":"A Quality-Guided Mixture of Score-Fusion Experts Framework for Human Recognition","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-06T10:29:06.357595Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2508.00053"},"observation_digest":"sha256:bf13b5982bc01b25f7d2ba0ab14e0b84663bbdf70b5f26fdd8176437f2f6d937","observation_id":"b4dce845-b488-4e92-9a1e-e692c7ac2efb","resolution":{"observed_at":"2026-08-06T10:29:06.357595Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":"1912.06059","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-07-02T21:47:28.307382Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas","venue":null,"work_id":"6c71f199-ef85-42a3-ab43-bbb85d3b7968","year":1912},"citing_paper":{"arxiv_id":"2510.14235","last_updated":"2026-02-03T02:30:05Z","snapshot_observed_at":"2026-08-02T04:56:00.811950Z","submitted_at":"2025-10-16T02:27:07Z","title":"Spiking Neural Network Architecture Search: A Survey","version":2},"reference_index":115,"source":"pdf_text","source_observed_at":"2026-05-18T07:00:27.719109Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2510.14235"},"observation_digest":"sha256:28a24647a96447ea83fd245599551b5fff5e7f9bc7f38c51c1062303613b74da","observation_id":"bfce0af0-d7c8-47d4-af67-b76af838b832","resolution":{"observed_at":"2026-05-18T07:01:01.350060Z","resolver_source":"arxiv_id","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":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-03T12:18:25.170440Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas,","venue":null,"work_id":null,"year":1912},"citing_paper":{"arxiv_id":"2601.04266","last_updated":"2026-06-08T05:08:44Z","snapshot_observed_at":"2026-08-07T08:42:06.936507Z","submitted_at":"2026-01-07T08:54:31Z","title":"State Backdoor: Towards Stealthy Real-world Poisoning Attack on Vision-Language-Action Model in State Space","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-03T12:18:25.170440Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2601.04266"},"observation_digest":"sha256:c03c6a2610a0ec4f11e1ecc463ca4755b6a44c144497e049a3d4c978b9d2ff93","observation_id":"7fd030b9-94a9-40d5-b11b-df17bcd9fa95","resolution":{"observed_at":"2026-08-03T12:18:25.170440Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":"1912.06059","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-07-02T21:47:28.307382Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas","venue":null,"work_id":"6c71f199-ef85-42a3-ab43-bbb85d3b7968","year":1912},"citing_paper":{"arxiv_id":"2605.02043","last_updated":"2026-05-14T15:54:43Z","snapshot_observed_at":"2026-07-06T23:15:11.601042Z","submitted_at":"2026-05-03T20:24:24Z","title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-08T19:33:26.518245Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2605.02043"},"observation_digest":"sha256:d0c766c30bb283a0af72529db78bc1292ea0b0ee1c27f2b13e1d931fe3dc0f22","observation_id":"24047884-57f3-431a-8dfa-59a96b300a1b","resolution":{"observed_at":"2026-05-09T05:50:26.073360Z","resolver_source":"arxiv_id","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":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":"1912.06059","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-07-02T21:47:28.307382Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas","venue":null,"work_id":"6c71f199-ef85-42a3-ab43-bbb85d3b7968","year":1912},"citing_paper":{"arxiv_id":"2605.02043","last_updated":"2026-05-14T15:54:43Z","snapshot_observed_at":"2026-07-06T23:15:11.601042Z","submitted_at":"2026-05-03T20:24:24Z","title":"Bringing Order to Asynchronous SGD: Towards Optimality under Data-Dependent Delays with Momentum","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-15T06:48:32.212277Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2605.02043"},"observation_digest":"sha256:cea85b4f4bb0589d6592bea3e00d1dca4c2cf7711c67397f2810914c200aefb7","observation_id":"c926f1e5-6de9-4bd3-88aa-2e6b04ecc061","resolution":{"observed_at":"2026-05-15T06:49:49.243852Z","resolver_source":"arxiv_id","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":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":"1912.06059","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-07-02T21:47:28.307382Z","title":"Grid search, random search, genetic algorithm: a big comparison for nas","venue":null,"work_id":"6c71f199-ef85-42a3-ab43-bbb85d3b7968","year":1912},"citing_paper":{"arxiv_id":"2606.08311","last_updated":"2026-06-06T19:52:41Z","snapshot_observed_at":"2026-07-06T23:47:48.634024Z","submitted_at":"2026-06-06T19:52:41Z","title":"Curation of a Cardiology Interface Terminology for Highlighting Electronic Health Records using Machine Learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-06-27T19:26:11.516070Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2606.08311"},"observation_digest":"sha256:a01cba8cd6ccd0cc38c1f7e395f4d5f04cf4e1624321e0e52e10ebf5286c414c","observation_id":"8ce9810c-e546-4fa2-8bec-da60dfaec87e","resolution":{"observed_at":"2026-07-02T21:47:28.308975Z","resolver_source":"arxiv_id","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":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-07-11T16:08:01.254231Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.04630","last_updated":"2026-07-06T03:30:53Z","snapshot_observed_at":"2026-08-02T17:57:41.451674Z","submitted_at":"2026-07-06T03:30:53Z","title":"Exploiting Structural Properties for Efficient Constraint-Aware HNSW Hyperparameter Tuning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-11T16:08:01.254231Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2607.04630"},"observation_digest":"sha256:e974c96711780867f61e06093fd2e42419c1215888c30728fcdea474c66fc589","observation_id":"ed8f489c-947c-42da-a7bf-0ab6d48d3f2c","resolution":{"observed_at":"2026-07-11T16:08:01.254231Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1912.06059","snapshot_observed_at":"2026-08-01T07:18:28.781382Z","title":"Liashchynskyi, P","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.21496","last_updated":"2026-07-23T16:43:12Z","snapshot_observed_at":"2026-08-06T07:15:08.007377Z","submitted_at":"2026-07-23T16:43:12Z","title":"Toward Generalizable Cognitive Impairment Detection with Speech-Based Multimodal Large Language Models","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-01T07:18:28.781382Z"},"links":{"cited_paper":"/paper/1912.06059","citing_paper":"/paper/2607.21496"},"observation_digest":"sha256:5c77bf4f4f7cc8ea381adce73f0ace7c53f11431fa8eea61efaf11a19b71a1ff","observation_id":"fec8364f-e75b-47f5-8071-37e617302a08","resolution":{"observed_at":"2026-08-01T07:18:28.781382Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1912.06059/citation-record","integrity":"/paper/1912.06059/integrity","json":"/paper/1912.06059/citation-record.json","paper":"/paper/1912.06059"},"outbound":[],"paper":{"arxiv_id":"1912.06059","last_updated":"2019-12-12T16:07:20Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T08:44:06.481703Z","submitted_at":"2019-12-12T16:07:20Z","title":"Grid Search, Random Search, Genetic Algorithm: A Big Comparison for NAS"},"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 12 inbound Pith citation observations for arXiv:1912.06059."}