{"as_of":"2026-08-15T06:30:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f231fedb60f363020c416592a60ea061510b1e2bbbe92d73515f82d9ed7e90ae","coverage":[{"denominator":84,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":84,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T14:26:55.867357Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-14T11:33:55.184837Z","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-08-14T11:33:55.425869Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"cited_work":{"arxiv_id":"1908.03185","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.03185","snapshot_observed_at":"2026-08-14T11:33:55.425869Z","title":"Optimizing quantum heuristics with meta-learning","venue":"quant-ph","work_id":"98be1a37-0bb3-41f1-88f7-6010deaed1b9","year":2019},"citing_paper":{"arxiv_id":"1908.08862","last_updated":"2019-08-23T15:10:51Z","snapshot_observed_at":"2026-08-15T04:08:54.957143Z","submitted_at":"2019-08-23T15:10:51Z","title":"Training the Quantum Approximate Optimization Algorithm without access to a Quantum Processing Unit","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T11:33:55.184837Z"},"links":{"cited_paper":"/paper/1908.03185","citing_paper":"/paper/1908.08862"},"observation_digest":"sha256:b53a2b6458257a79da7ab2f078a1acc2c5c645f3f8f6182bff80ad2653906f32","observation_id":"e5ecd2a3-7322-4d30-ad28-362e9d009e4c","resolution":{"observed_at":"2026-08-14T11:33:55.435917Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.03185","snapshot_observed_at":"2026-08-08T11:35:58.465826Z","title":"Wilson , author S","venue":null,"work_id":null,"year":1908},"citing_paper":{"arxiv_id":"2502.07889","last_updated":"2025-02-11T19:00:05Z","snapshot_observed_at":"2026-08-11T03:14:09.348416Z","submitted_at":"2025-02-11T19:00:05Z","title":"A unifying account of warm start guarantees for patches of quantum landscapes","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-08T11:35:58.465826Z"},"links":{"cited_paper":"/paper/1908.03185","citing_paper":"/paper/2502.07889"},"observation_digest":"sha256:fbbfe9e3dd4ba08080fe89298f2cddc815a68eadcc8085326126c4a682875fde","observation_id":"3ce2e216-5cb2-41b8-96b9-60e2bd3ba69c","resolution":{"observed_at":"2026-08-08T11:35:58.465826Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1908.03185/citation-record","integrity":"/paper/1908.03185/integrity","json":"/paper/1908.03185/citation-record.json","paper":"/paper/1908.03185"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:55.412283Z","title":"Local optimizers have a notion of location in the solution space","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.412283Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:ead6e5a1f99175abfdccf7d801be21be408d8b4769df281b8f5dba877ac4d702","observation_id":"5b639ca7-428f-4d88-8abf-f41a38433102","resolution":{"observed_at":"2026-08-14T14:26:55.412283Z","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-14T14:26:55.417981Z","title":"An important class of global black-box optimizers we consider are Bayesian optimizers","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.417981Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:f7aa5f99a4295eb8cafe8272efd281d50fa37336ee645841b8865f7b549155e3","observation_id":"6c4bb7dd-03fb-4aed-9656-dd3d53075d03","resolution":{"observed_at":"2026-08-14T14:26:55.417981Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.503753Z","title":"The best classical efficient al- gorithm known for this problem provably yields only a log-factor worst-case approximation ratio [73]","venue":null,"work_id":"02eed1eb-8880-489c-81e4-39271a6256d1","year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.443773Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:acdc6e4101b3a88a391aae2229a72c90db9605d632de069ce777be74336bd09c","observation_id":"a9553886-5282-49dd-aa2d-d5da2ac6311b","resolution":{"observed_at":"2026-08-14T14:26:57.509413Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T14:26:55.424506Z","title":"Unrolling is the process of iteratively updating the inputs, x, cell state and hidden state, referred to together as s, of the LSTM","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.424506Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:3a731cc1dd46f12961cbe504e2962d124433f691836a89f343f00635b90a28cb","observation_id":"66550d20-8c25-4ca6-8709-0ec50621e767","resolution":{"observed_at":"2026-08-14T14:26:55.424506Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.542931Z","title":"In this model there is a hopping termt, a many body interaction term U and an onsite chemical potential term µ","venue":null,"work_id":"9bc6eff0-0112-4e8a-8732-522cacb8207a","year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.430962Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:81821862a19dd405753c8e128e5520958aac36cdecba535c48448acbde3b9d5a","observation_id":"528ee019-c193-4dfa-a393-8ea9105c88d4","resolution":{"observed_at":"2026-08-14T14:26:57.548737Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.522406Z","title":"the AND of a number of disjunc- tive two-variable OR clauses), MAX-SAT is the NP-hard problem of determining the maximum number of clauses which may be simultaneously satisfied","venue":null,"work_id":"e76bffef-4e29-4240-8772-031b7448c400","year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.437135Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:0a158c0badb49b14e7edb2c5d493c2b6fc5db530a395ff69dc8bea7d3738dd10","observation_id":"6bfdebb5-e339-4a52-8fc2-078718b10213","resolution":{"observed_at":"2026-08-14T14:26:57.528190Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.356365Z","title":"A perspective view and survey of meta-learning,","venue":null,"work_id":"8d155b4c-7252-4147-8f94-ea645a680b75","year":2002},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.487734Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:c64b8cd3b3fd1b7053ca173aa16b9efda252c3ad2cafaba750e67e3d5268357d","observation_id":"486f20c4-2754-4ef4-b131-bf9032f7eab7","resolution":{"observed_at":"2026-08-14T14:26:57.361758Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.338538Z","title":"Metalearning: a survey of trends and technologies,","venue":null,"work_id":"075dc0ef-9e7c-45c0-8a05-fb4fbf971f40","year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.493022Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:35b46ca51ebc6849275462a33ad145898a0b663e1ca28fa54ce9d47d973cc5e2","observation_id":"43b14657-55f7-469d-b6b4-bf909761c869","resolution":{"observed_at":"2026-08-14T14:26:57.344191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.468591Z","title":"Deepsd: Generating high res- olution climate change projections through single image super-resolution,","venue":null,"work_id":"30ff5a2c-d5e6-4f10-807d-af4569591a88","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.455356Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:fb014a97fefed1c80c0655efc3c5a79537836c0e8068d138c5c215296a75ac6e","observation_id":"952e969a-dc37-4aa3-aa58-ae0be904e84c","resolution":{"observed_at":"2026-08-14T14:26:57.474570Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.445775Z","title":"Machine learning applications in genetics and genomics,","venue":null,"work_id":"2b8ffb33-47e0-4358-a09f-420e4f808d88","year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.460845Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:78227338c0bc0e5cfb7939eda4eb32f880877deaf2460f6eee6cbb6d12bd72e7","observation_id":"a9897ef0-3475-4ba7-a5fa-2b74caa7a45e","resolution":{"observed_at":"2026-08-14T14:26:57.454505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.423477Z","title":"Towards energy-aware scheduling in data centers using machine learning,","venue":null,"work_id":"2ebd5f41-626e-445a-b4a2-d0f1787c628f","year":2010},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.466229Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:90294f1bca4186642ac521d128ca5e0371fdc1d3e27a0c37bfc78a7f7fa83e01","observation_id":"3522826a-590c-453b-a560-88a103a7a4ac","resolution":{"observed_at":"2026-08-14T14:26:57.430491Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T14:26:55.471460Z","title":"Machine learning: Trends, perspectives, and prospects,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.471460Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:98de9a08efa6bc5c29ae2db2918c0cbc6bcc0d304d60b3c201ba1c189eb6d07d","observation_id":"9a8bbaf3-29f8-4a63-a829-11e893d00f53","resolution":{"observed_at":"2026-08-14T14:26:55.471460Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.387293Z","title":"A high-bias, low- variance introduction to machine learning for physicists,","venue":null,"work_id":"b9b584e8-39c5-4211-a458-589876f5dc51","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.476818Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:fbc759fbe08b18a5c4a0d221eb5adc166c1c98445a015631897c9ad82dbdf66e","observation_id":"6d314024-938f-4a47-b8ab-905431e3e46c","resolution":{"observed_at":"2026-08-14T14:26:57.393140Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T14:26:55.482027Z","title":"Deep learning,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.482027Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:e1aa3c9efeefa404c5f217f90cc51fe0819c84f81a431b0a0e4a2688971128b8","observation_id":"c9040f8e-72c8-4a24-a3a0-19e5502358cd","resolution":{"observed_at":"2026-08-14T14:26:55.482027Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.232162Z","title":"Meta-learning with memory-augmented neural networks,","venue":null,"work_id":"c0ac9786-1c0f-4512-8607-be2c8e9a38d6","year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.530173Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:7407faa9dea737a7beefab04536bf787138dff22a9650045b8564a93726cd6a3","observation_id":"1191fbfd-f3ae-4338-acb9-2ae295240170","resolution":{"observed_at":"2026-08-14T14:26:57.237644Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1803.02999","last_updated":"2018-10-22T16:11:14Z","snapshot_observed_at":"2026-08-14T19:38:16.450214Z","submitted_at":"2018-03-08T08:29:38Z","title":"On First-Order Meta-Learning Algorithms","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.02999","snapshot_observed_at":"2026-08-14T14:26:55.535282Z","title":"On first-order meta-learning algorithms,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.535282Z"},"links":{"cited_paper":"/paper/1803.02999","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:8d1c7eb01ca7a252436fd39441524e8e163cd0af12a4e7eab84d8cb7f090650c","observation_id":"56ce8d1d-a074-438b-a4e6-27474174b6c7","resolution":{"observed_at":"2026-08-14T14:26:55.535282Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.319742Z","title":"Learning to learn by gradient descent by gradient de- scent,","venue":null,"work_id":"324bb53b-3cd4-4a76-9301-ee20042465cf","year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.498186Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:5915a17902a1771bf723e318f6494787464c0ea712cc3c67fd5c16206188d99a","observation_id":"07fcd912-2eae-4c27-aeae-a1892b52ef91","resolution":{"observed_at":"2026-08-14T14:26:57.326212Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1606.01885","last_updated":"2016-06-06T19:50:47Z","snapshot_observed_at":"2026-08-14T21:53:58.122705Z","submitted_at":"2016-06-06T19:50:47Z","title":"Learning to Optimize","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1606.01885","snapshot_observed_at":"2026-08-14T14:26:55.503509Z","title":"Learning to optimize,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.503509Z"},"links":{"cited_paper":"/paper/1606.01885","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:798c6124484ca8459bbb59031c1264c8d64dffc22c8e9a4d78aad298256e3ab8","observation_id":"e479c97a-149d-48d0-8700-99a8f61c2548","resolution":{"observed_at":"2026-08-14T14:26:55.503509Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.301337Z","title":"Optimization as a model for few-shot learning,","venue":null,"work_id":"c158911f-18f0-40a9-8a26-97f70d7f0eba","year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.509099Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:f1c89b005e738da80b16c69cf50f728fc114710973e3e552610cfc7a47930a8d","observation_id":"4b0343d1-acbd-4fcb-ae72-066495d5fa47","resolution":{"observed_at":"2026-08-14T14:26:57.307365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.283526Z","title":"Learning to learn without gradient descent by gradient descent,","venue":null,"work_id":"c107fea8-642c-48c4-ac7d-235faac16edb","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.514289Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:19208955290e88d94d961673cd3e9a54adc189f5fb05b6db14ab470a90c323e1","observation_id":"ee936312-1eb6-4f4d-bcc2-60061f728689","resolution":{"observed_at":"2026-08-14T14:26:57.289061Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.266374Z","title":"Efficient and robust automated machine learning,","venue":null,"work_id":"a5b9295b-2a54-4b20-84db-880bd9910fb4","year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.520162Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:ec93b5c1d94e1864c0ba5cf9e21e272b68d704a86d24e136e829a0f03d6c9a2d","observation_id":"2a9975ff-35c2-460c-8eed-fd9c87222817","resolution":{"observed_at":"2026-08-14T14:26:57.271963Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.249597Z","title":"Meta networks,","venue":null,"work_id":"2eb939a4-db2d-4b59-9efc-ad8aed6919ed","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.525194Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:894e3a6d92396c614c5731a12cea663844c9c55a04760fed50a7cf5fc1ba596d","observation_id":"4b06e1cc-d8fc-44df-a76a-586c61ab5c1e","resolution":{"observed_at":"2026-08-14T14:26:57.254861Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.02860","last_updated":"2019-05-09T17:47:14Z","snapshot_observed_at":"2026-08-14T16:35:45.075550Z","submitted_at":"2019-05-08T01:26:08Z","title":"From Ans\\\"atze to Z-gates: a NASA View of Quantum Computing","version":2},"cited_work":{"arxiv_id":"1905.02860","doi":null,"metadata_source":"pith","pith_arxiv_id":"1905.02860","snapshot_observed_at":"2026-08-14T14:26:56.317331Z","title":"From Ans\\\"atze to Z-gates: a NASA View of Quantum Computing","venue":"quant-ph","work_id":"ad8c4568-4d89-4a61-acc0-9ef1bb29e6df","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.573118Z"},"links":{"cited_paper":"/paper/1905.02860","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:6597221d204f2b3aa00c69315a6e95f2903d24e17dce09b29b45185d9153b591","observation_id":"a6862613-b250-48d2-88e8-009ad903c4d7","resolution":{"observed_at":"2026-08-14T14:26:56.324370Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1905.12134","last_updated":"2019-05-28T23:29:38Z","snapshot_observed_at":"2026-08-14T16:24:50.631855Z","submitted_at":"2019-05-28T23:29:38Z","title":"Optimizing QAOA: Success Probability and Runtime Dependence on Circuit Depth","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1905.12134","snapshot_observed_at":"2026-08-14T14:26:55.578749Z","title":"Optimizing QAOA: Success probability and runtime dependence on circuit depth,","venue":null,"work_id":null,"year":1905},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.578749Z"},"links":{"cited_paper":"/paper/1905.12134","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:9ce5ce07540c915cedf18c60d0a7c83ea3cec5a898e9c99f6539ed31ff71cb08","observation_id":"29dc1dec-3364-4f37-bfdc-35e731b5b5c7","resolution":{"observed_at":"2026-08-14T14:26:55.578749Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.213928Z","title":"Commercialize quantum technologies in five years,","venue":null,"work_id":"3f1c4d30-8ab3-4bac-a072-772488a07ead","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.540944Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:c6856d4cc9728a74e5b6e5ac50d9952f9a44b5356237f70ed1543b6b28025b99","observation_id":"1a9881cf-fcb9-4af3-98bb-1d5901463f99","resolution":{"observed_at":"2026-08-14T14:26:57.219380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T14:26:55.546117Z","title":"Quantum computing in the nisq era and be- yond,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.546117Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:011e62a16885ceeae4b4cea49777d9ab9f430483950c65d57dcc2de5e3f7d944","observation_id":"412f2aab-9f41-4249-b199-865c3c31f698","resolution":{"observed_at":"2026-08-14T14:26:55.546117Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.183005Z","title":"A variational eigenvalue solver on a photonic quantum processor,","venue":null,"work_id":"f391103f-fca5-4bab-bb34-14ac7d85b3d9","year":2014},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.551408Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:cf52155e5632c5570e5e70cab9aac5091d3cbeabb1934a1284d227495c6001d4","observation_id":"5ba9c2f5-7f12-46e1-9a1b-c4f4dd69955f","resolution":{"observed_at":"2026-08-14T14:26:57.188445Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-13T17:16:52.599300Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-14T14:26:55.556571Z","title":"A quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.556571Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:834abf2f0ea996b03b117c2bd845fd5f4a43c5b16a437c677f89fec438ca86d8","observation_id":"5344fb54-0939-42f3-abc0-f92c2abe6819","resolution":{"observed_at":"2026-08-14T14:26:55.556571Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.165538Z","title":"From the quantum ap- proximate optimization algorithm to a quantum alter- nating operator ansatz,","venue":null,"work_id":"bf1dcb0e-5b35-4dd9-aa0b-8e6ec2210567","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.562939Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:feeff6dc5eee2ec1180a6a7a04227601dbfa2c65c6f6c0d73bfe7ffa01efd183","observation_id":"47c4bcd9-2635-4ab9-b0c7-ffdeb52b4ac0","resolution":{"observed_at":"2026-08-14T14:26:57.170990Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.147707Z","title":"QAOA for Max- Cut requires hundreds of qubits for quantum speed-up,","venue":null,"work_id":"f85805de-3355-49da-9ef4-c8415adbaccf","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.568081Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:adaa38be0180f9a1058af6b1a28ff469a7bfb71f155b2255ec8ce42cc74cf914","observation_id":"95f9d54c-3e99-48de-9ec7-e03eafdfa36e","resolution":{"observed_at":"2026-08-14T14:26:57.153154Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.059824Z","title":"Performance of hybrid quantum-classical variational heuristics for combinatorial optimization,","venue":null,"work_id":"b30c78d0-d768-4901-89af-15d7b42fe58e","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.619725Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:45808c764049f289f3c922efc43324627d20e71438d2f4adc2d9ea40c142896d","observation_id":"1a01a135-5c18-4082-9aa4-d212b9462cca","resolution":{"observed_at":"2026-08-14T14:26:57.065761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.042185Z","title":"Optimal quan- tum measurements of expectation values of observables,","venue":null,"work_id":"59ef4ee8-f7ca-4666-b4bc-ca7d3f4f8fff","year":2007},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.625060Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:26ac2a59204bd520da47f2a5965aa6815c9ee634354f8492287e12d98ca1da56","observation_id":"1e69101e-efb5-46ca-8998-49805300c7f9","resolution":{"observed_at":"2026-08-14T14:26:57.047765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.129060Z","title":"Quantum chemistry calculations on a trapped-ion quantum simulator,","venue":null,"work_id":"fb5a6b94-23d9-406c-bf61-345ea7c46de6","year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.585225Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:f65bffd150be67b85f58985bbe2f0be5cabeb36af8b34ffe0d34d534344521a7","observation_id":"cd2ade86-c6ad-436e-a0a8-6ad620f56752","resolution":{"observed_at":"2026-08-14T14:26:57.135394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.110605Z","title":"Scalable quantum simula- tion of molecular energies,","venue":null,"work_id":"4cb424b3-3b1c-4812-bb1b-49ed4e0c407a","year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.590200Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:cf17b86253db8c6f09b4f600446ceac6acca7eaae22769f66b14b76a36848dbf","observation_id":"ac8268a4-fead-4776-aba7-00231b63a64e","resolution":{"observed_at":"2026-08-14T14:26:57.116722Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1610.06910","last_updated":"2016-10-24T03:38:02Z","snapshot_observed_at":"2026-08-14T21:34:06.762043Z","submitted_at":"2016-10-21T19:48:39Z","title":"A Hybrid Classical/Quantum Approach for Large-Scale Studies of Quantum Systems with Density Matrix Embedding Theory","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1610.06910","snapshot_observed_at":"2026-08-14T14:26:55.596310Z","title":"A hybrid classical/quantum approach for large-scale studies of quantum systems with density ma- trix embedding theory,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.596310Z"},"links":{"cited_paper":"/paper/1610.06910","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:05d522413b82ece85f2ac0ab9fa73891b4de795631be4eab86286fb2c05a0e1b","observation_id":"7d9df10f-df49-4df3-8652-248906a51f12","resolution":{"observed_at":"2026-08-14T14:26:55.596310Z","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-14T14:26:55.602458Z","title":"Training a quantum optimizer,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.602458Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:3572ce7585715cc3dcdf70e8c349adbd627a350db956a3df3262c5180786cc9c","observation_id":"6a9a7f0d-03da-4f5d-830d-688e83a22305","resolution":{"observed_at":"2026-08-14T14:26:55.602458Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.077523Z","title":"Progress to- wards practical quantum variational algorithms,","venue":null,"work_id":"b0ce9032-ce2f-4838-b246-184f393c6057","year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.608277Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:25de537e0bfa60cc73cff37ced4804b18e47737668c9fd605e38c5bb533cd9cd","observation_id":"af686cfe-0b50-47dd-8bb8-c14277452bcb","resolution":{"observed_at":"2026-08-14T14:26:57.083471Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-14T14:26:55.405071Z","title":"Whilst in the production of this FIG","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.405071Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:1a617c031cce47ef4efa5f109085f6d1335aac1ceea419d99636156c6f1b8d93","observation_id":"33cb6027-796b-40fa-9570-e6b24e1e14a8","resolution":{"observed_at":"2026-08-14T14:26:55.405071Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.486362Z","title":"In that preprint, the authors consider only gradient-free implementations of meta- learners","venue":null,"work_id":"de6c053d-a08d-4172-9efd-c391649cae51","year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.449736Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:bfe19115ff6585dfc655ae7d43f9f22c3ed8135e5174f754f85e7a8f94dcde09","observation_id":"80bf3f16-ed81-4f1c-baef-403bb35c2519","resolution":{"observed_at":"2026-08-14T14:26:57.491624Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1701.01450","last_updated":"2017-01-05T19:04:19Z","snapshot_observed_at":"2026-08-14T21:22:23.375812Z","submitted_at":"2017-01-05T19:04:19Z","title":"Practical optimization for hybrid quantum-classical algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1701.01450","snapshot_observed_at":"2026-08-14T14:26:55.613772Z","title":"Practical op- timization for hybrid quantum-classical algorithms,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.613772Z"},"links":{"cited_paper":"/paper/1701.01450","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:d703960b06ea2aa71ddcfc998d9a7bcaa8941d42a7a18bf8dc22cdfbc1dbebe3","observation_id":"da2df455-4c5c-4527-9e7c-db6c7dd718f8","resolution":{"observed_at":"2026-08-14T14:26:55.613772Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.023656Z","title":"Barren plateaus in quantum neural network training landscapes,","venue":null,"work_id":"5f9075d6-fc52-4448-bba7-5b5478773e81","year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.630027Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:56b2dda5cf0175f442e913e7b58224f6207716cabfefa002064829336ecbb364","observation_id":"72cacdb0-b34c-49b1-a9a5-0061e59d6d91","resolution":{"observed_at":"2026-08-14T14:26:57.029747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:57.005148Z","title":"A limited memory algorithm for bound constrained optimization,","venue":null,"work_id":"c9d072de-e63d-4755-bb0e-22b543be006e","year":1995},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.635344Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:389a544fd99639036cf7573089da8ce6d3dc326b551761d0281a9884849347d9","observation_id":"b2569d9a-ece8-42f3-8c23-2366d6c05367","resolution":{"observed_at":"2026-08-14T14:26:57.010948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.987245Z","title":"A simplex method for func- tion minimization,","venue":null,"work_id":"22cca555-4e36-4e36-9aa8-ab33342fb5ad","year":1965},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.640499Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:df6f19e7a5369ab202b5efb0a10bb4a11fc43236750109893c98a27ad85c01ff","observation_id":"c21d1205-a736-495b-bf92-0204fc3cd66c","resolution":{"observed_at":"2026-08-14T14:26:56.993098Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.970085Z","title":"A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise,","venue":null,"work_id":"e312a9be-c5e3-4f89-a18b-98e277ed170f","year":1964},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.646448Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:993c91dd5649e743ebbc7ddf420b04c61f826cfea3603399947010039ca65ea7","observation_id":"03319705-2c46-4b29-a0a8-088e85f6f449","resolution":{"observed_at":"2026-08-14T14:26:56.975584Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.953284Z","title":"Evolution strategies as a scalable alternative to rein- forcement learning,","venue":null,"work_id":"ada996ea-e0ac-4430-a4a8-8366b62d600a","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.652222Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:53a89851a2ed5f4490f1140a802476b3df6b79dafcf468f3c706da1217e253ba","observation_id":"c702cbf1-3832-4889-90d7-d6eb3938ef7b","resolution":{"observed_at":"2026-08-14T14:26:56.958504Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.936823Z","title":"Long short-term memory,","venue":null,"work_id":"8d3ebae9-7531-4dc0-a49a-82b211c5cde9","year":1997},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.657305Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:1971352bf8814309120775acdadf71b9936b5071bcf3f8ad5ad804d9ee0284a9","observation_id":"31209820-46ce-41b2-9638-db92c0f6dab3","resolution":{"observed_at":"2026-08-14T14:26:56.941948Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.05415","last_updated":"2019-07-11T17:57:56Z","snapshot_observed_at":"2026-07-06T08:07:12.362127Z","submitted_at":"2019-07-11T17:57:56Z","title":"Learning to learn with quantum neural networks via classical neural networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1907.05415","snapshot_observed_at":"2026-08-14T14:26:55.662498Z","title":"Learning to learn with quantum neural networks via classical neural networks,","venue":null,"work_id":null,"year":1907},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.662498Z"},"links":{"cited_paper":"/paper/1907.05415","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:f44140d2b2a5a33d52dd94cdc08f679887e5c1c8ced960469444e829a8c7b4b2","observation_id":"55d393d9-6e4a-41fd-80c8-7ccbd018a51c","resolution":{"observed_at":"2026-08-14T14:26:55.662498Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.920030Z","title":"Multivariate stochastic approximation using a simultaneous perturbation gradient approxima- tion,","venue":null,"work_id":"e18c4321-b84c-410b-bf54-2e29adb9a8ed","year":1992},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.668684Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:a8d78fd6f1b4a058b82fc42ec84747b9720ee4db0d60402318c489243e867380","observation_id":"bb547d49-6cda-4f09-8743-21331b07d63e","resolution":{"observed_at":"2026-08-14T14:26:56.925405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.903261Z","title":"Theoreti- cal framework for comparing several stochastic optimiza- tion approaches,","venue":null,"work_id":"d90882eb-56be-4bec-b395-31d994de8bd7","year":2006},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.673653Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:3d8e6f9cca17bdc8f1a09aa24a8bdbfc64f9a652ffaac1d9a1dd77891748df47","observation_id":"bce393c8-1746-47a6-8928-5f268411416f","resolution":{"observed_at":"2026-08-14T14:26:56.908714Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.884290Z","title":"Quantum optimization using variational algorithms on near-term quantum devices,","venue":null,"work_id":"6574f3c2-166b-4c0d-ad66-beeca03b946e","year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.679378Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:75d82c1d91dca527adffc53a2585ed40b934d036b12cc9b67096533c1390c27e","observation_id":"223f1793-e9d7-4dcc-9e17-589e8bb75da8","resolution":{"observed_at":"2026-08-14T14:26:56.890494Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.867696Z","title":"Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets,","venue":null,"work_id":"cffac256-f0dd-44c3-af4e-2aec7f99fac3","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.684654Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:a2a06a3317e2f472d63f57edf07dc3551de438509a08696719fae01a64c3838b","observation_id":"5318b6b2-a6e4-4150-b187-44a09b3b3fda","resolution":{"observed_at":"2026-08-14T14:26:56.872854Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.851641Z","title":"Papadimitriou, Computational complexity","venue":null,"work_id":"a84ffc29-755d-4f84-bb3a-d8ef8cf041de","year":1994},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.692028Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:377b4916b3bab8cefd2c5347a850d4166f5d90b94f74b96e2bd725e898ed6cb0","observation_id":"cdba6b47-0c5c-43c8-80f2-95a4c82ea3e7","resolution":{"observed_at":"2026-08-14T14:26:56.856888Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.835346Z","title":"Electron correlations in narrow energy bands,","venue":null,"work_id":"d4eaefdf-69e7-44eb-b453-8d05eba01bc3","year":1963},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.697358Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:66e5fd3dd17781376e676d99cfe13848751561684de2e5ee3519502448bf1cbb","observation_id":"bcf56d00-7453-49e8-b70a-a5aa573ff85f","resolution":{"observed_at":"2026-08-14T14:26:56.840625Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.818312Z","title":"Quantum approximate op- timization with hard and soft constraints,","venue":null,"work_id":"3129feda-1aae-40f9-bbd0-0d610e36bd56","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.702812Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:11570ecb80da5d0c6d02db88827aa762d7b7b94bb3369e35fd0d5f534f9d9b21","observation_id":"ef6aefc5-5df6-4029-934d-1f2fe415117f","resolution":{"observed_at":"2026-08-14T14:26:56.823762Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.800935Z","title":"Quan- tum approximate optimization algorithm for MaxCut: A fermionic view,","venue":null,"work_id":"4fe34671-bb0f-4e78-be98-9e3efca7782e","year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.708362Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:4f2e2b89378abad01b3528eeb1c4463a2ab36cb3799b0e4153ab5e71035bad76","observation_id":"46078195-00aa-4f25-9442-922609e3a1da","resolution":{"observed_at":"2026-08-14T14:26:56.806360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.782588Z","title":"Ausiello, P","venue":null,"work_id":"400925ec-5642-4476-b9c2-6e1ee3004de2","year":2012},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.713724Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:9c9b9e1e678e5c64059401a129a483b0c5c756ffa90e36d4f4f029f150523f2a","observation_id":"3f20e9b5-caf2-47d2-99ef-51cba9f67b49","resolution":{"observed_at":"2026-08-14T14:26:56.788891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1904.09314","last_updated":"2020-05-21T19:00:37Z","snapshot_observed_at":"2026-08-14T16:43:52.126008Z","submitted_at":"2019-04-19T18:55:10Z","title":"$XY$-mixers: analytical and numerical results for QAOA","version":2},"cited_work":{"arxiv_id":"1904.09314","doi":null,"metadata_source":"pith","pith_arxiv_id":"1904.09314","snapshot_observed_at":"2026-08-14T14:26:56.219410Z","title":"$XY$-mixers: analytical and numerical results for QAOA","venue":"quant-ph","work_id":"fb41a40f-520e-48e1-93ce-e85fa8c0d834","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.719412Z"},"links":{"cited_paper":"/paper/1904.09314","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:523d41fb39c499ded14326203ad46996c057d762b7450ecb0b73cf12b5ff4045","observation_id":"6904243e-924b-49d9-b4dd-cd8c11d26e16","resolution":{"observed_at":"2026-08-14T14:26:56.225360Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.765142Z","title":"Strategies for quantum computing molecular energies using the unitary coupled cluster ansatz,","venue":null,"work_id":"e0b144a5-981e-4596-abaf-3f7459e4f3ef","year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.725275Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:876eab2968ee1183fdaa37b0873297336e398da6af796de6913fed7d515dfb6b","observation_id":"4ef5cc82-dad9-42a7-99fd-7ea9a1b6e501","resolution":{"observed_at":"2026-08-14T14:26:56.770466Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.746993Z","title":"Bayesian optimisation for variational quantum eigensolvers,","venue":null,"work_id":"8cbd2078-9b26-419f-99d9-67b96d5d8bab","year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.730263Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:bb9c613553a2f536b77ce310a9fdaa73767198a62a0e748900a9f9f1dbe7cce2","observation_id":"3c708c25-95d0-46cb-a79a-6b04666cbde4","resolution":{"observed_at":"2026-08-14T14:26:56.753042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.729732Z","title":"Bengio, S","venue":null,"work_id":"1dc48117-e4fc-4b13-88ab-27912e06eb52","year":1990},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.735725Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:396482ad1f06f1d0ec8530880ca2dd81931ddf910ccca98504348e1f4d99d61b","observation_id":"a5162fcb-bd73-4a83-a40e-40b87f768884","resolution":{"observed_at":"2026-08-14T14:26:56.735239Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.710380Z","title":"Neural optimizer search with reinforcement learning,","venue":null,"work_id":"e513744a-5de5-4a15-8b49-b1dc0eec1b8d","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.741833Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:863adc41f3b708ea57dbde6947b097a4d7d8d03bf9aa12df320f9a1e45007712","observation_id":"ef4bd5c0-d43f-4e1d-8c07-d1ae036aa0f0","resolution":{"observed_at":"2026-08-14T14:26:56.716210Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.693888Z","title":"Learned optimizers that scale and general- ize,","venue":null,"work_id":"ceb18c70-7709-471a-ac30-f918fb507e22","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.747708Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:7d8e1c7e0992d39837bd4ead50c4744ea23f284a73a2ed8d2287ca549a537bee","observation_id":"93869d04-d445-459a-9b7f-88c69917bb09","resolution":{"observed_at":"2026-08-14T14:26:56.699165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.677049Z","title":"Learning long- term dependencies with gradient descent is difficult,","venue":null,"work_id":"0b3cccb5-6ae6-4039-9c6e-27b07e2d30b9","year":1994},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.753989Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:6a70494544b4ef61a954c6242014e8cd7e6a423c59020c4f8ae8f7fcf976d7e7","observation_id":"4532ce41-e0fb-4caa-8587-fd133792c0d2","resolution":{"observed_at":"2026-08-14T14:26:56.682786Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.659679Z","title":"The vanishing gradient problem dur- ing learning recurrent neural nets and problem solu- tions,","venue":null,"work_id":"f8cff9c9-bb0f-46e3-b0b6-fd330afc3ef2","year":1998},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.758933Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:c12ac8a4e226f7be68f28ff36cb8424810e6608427b6cedc883b3a0a5438d8e0","observation_id":"25d89e48-0a5a-4e53-9002-9aeac42f0887","resolution":{"observed_at":"2026-08-14T14:26:56.665799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1712.05304","last_updated":"2019-08-10T11:39:15Z","snapshot_observed_at":"2026-08-14T20:03:38.023291Z","submitted_at":"2017-12-14T15:57:56Z","title":"A quantum algorithm to train neural networks using low-depth circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1712.05304","snapshot_observed_at":"2026-08-14T14:26:55.763903Z","title":"A quan- tum algorithm to train neural networks using low-depth circuits,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.763903Z"},"links":{"cited_paper":"/paper/1712.05304","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:83cf6f33945a124cf6c19d77d5f46a2162d89aed7b6cfbd271f15c44fc907c1d","observation_id":"08474f0f-b5cb-46de-885c-c8cd753c53c9","resolution":{"observed_at":"2026-08-14T14:26:55.763903Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.642481Z","title":"A quantum engineer’s guide to superconducting qubits,","venue":null,"work_id":"185433fb-14e6-4364-8f8c-5d7952578fe0","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.769041Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:0d576ad9c9ddeda639c71b06e866c0da54f5c6fdeee169e87bf95f221e194c3d","observation_id":"0dc6fec0-27ec-4f4d-90b1-41d8dbd2eae3","resolution":{"observed_at":"2026-08-14T14:26:56.648435Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.625991Z","title":"Forest SDK","venue":null,"work_id":"87480b55-c387-4628-b4b9-9cf8546a01c3","year":null},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.774125Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:77e40ee4d06da692ab05ed810118cb64dfe9336c9e12a7d1bb4e528453a1e79c","observation_id":"fa97cbd6-4566-4d73-80ca-90b93d815344","resolution":{"observed_at":"2026-08-14T14:26:56.631234Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.607713Z","title":"Taking the human out of the loop: A re- view of bayesian optimization,","venue":null,"work_id":"7078ccd6-eec0-44d5-8f9a-1e08caad100f","year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.779662Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:d121ea8863463713c9ee1244897e17ebe8eef472a914d5be5879cf9916882411","observation_id":"1e8d5607-561c-4a56-bbcf-94b078599b41","resolution":{"observed_at":"2026-08-14T14:26:56.614166Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.591006Z","title":"Evolution strategies for deep neural network models design,","venue":null,"work_id":"31aa0d0d-9a29-43fb-95b3-8a7d4b469826","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.786057Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:5b3514424a67de36f66e23e21dafabfe51bc492f225fc0c782957c7dc36510e1","observation_id":"8c50777f-b766-4909-90e8-9525e52b893f","resolution":{"observed_at":"2026-08-14T14:26:56.596457Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.573057Z","title":"An overview of genetic algorithms: Part 1, fundamentals,","venue":null,"work_id":"bea60d13-5aa3-46b9-a02c-d00f692b8cb2","year":1993},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.791527Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:9373fecfbbb3f1fcf7cad3de25f987b3e450a593eefbc136708de5c017bbf672","observation_id":"042d84b2-d099-4d07-80e4-94fda4ea794e","resolution":{"observed_at":"2026-08-14T14:26:56.578822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.555674Z","title":"An introduction to genetic algorithms for numerical optimization,","venue":null,"work_id":"b29bd7bd-6e47-4d8f-8ed8-27af8b741135","year":2002},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.797456Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:d2888a8a216a426f25cc20c197436f99c3b5e2efcd8f9ec5774e5cd9fea1ea83","observation_id":"89c16ae6-c155-465d-8187-74972d1d8bfa","resolution":{"observed_at":"2026-08-14T14:26:56.560902Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1903.05076","last_updated":"2019-11-27T12:00:01Z","snapshot_observed_at":"2026-08-14T17:03:24.298205Z","submitted_at":"2019-03-12T17:50:53Z","title":"An initialization strategy for addressing barren plateaus in parametrized quantum circuits","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1903.05076","snapshot_observed_at":"2026-08-14T14:26:55.803167Z","title":"An initialization strategy for addressing barren plateaus in parametrized quantum circuits,","venue":null,"work_id":null,"year":1903},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.803167Z"},"links":{"cited_paper":"/paper/1903.05076","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:e9f41947ee0b8921fe088c326f27f9a06909c826fe11ab0ec79ff461293484be","observation_id":"ae97916c-e0b1-45a6-85d0-3ad30ce66c47","resolution":{"observed_at":"2026-08-14T14:26:55.803167Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.537252Z","title":"Evaluating analytic gradients on quantum hard- ware,","venue":null,"work_id":"ba609b95-6621-44c7-97e5-d0305108fd77","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.808420Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:38a1f410dd99ad0b13f397829c969be51c91dde3f7bc25a67e4e47c6d3bfe5af","observation_id":"f043c4a6-2632-4461-9796-e22310f8d40d","resolution":{"observed_at":"2026-08-14T14:26:56.542899Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.519674Z","title":"Solutions of the two-dimensional hubbard model: benchmarks and results from a wide range of numerical algorithms,","venue":null,"work_id":"c8fd82eb-9feb-400d-8281-251ee87c5f18","year":2015},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.814439Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:5e5830a4ed7f44d87017a47e5417d3d3c1df920790d00c048ff3ad2f48869043","observation_id":"c18880d4-8575-4dcf-94da-1ab26f8cf025","resolution":{"observed_at":"2026-08-14T14:26:56.524935Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"mat/9302006","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.153978Z","title":"Interacting fermions in one dimen- sion: from weak to strong correlation,","venue":null,"work_id":"cc4e8919-828d-4cc5-b136-57fa7813db37","year":1993},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.819435Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:20da74fb9bb8b34ed435bb8a5272faace705b2800c422fe57707f5f6c3a52a7c","observation_id":"20a0e5c8-d5b7-43ca-b35b-c564c4d2eaf2","resolution":{"observed_at":"2026-08-14T14:26:56.164805Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.501790Z","title":"Numerical evi- dence of fluctuating stripes in the normal state of high-tc cuprate superconductors,","venue":null,"work_id":"495f9d6f-9b71-4d76-8dc9-b4e6e128e81f","year":2017},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.824508Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:c1a6bd4c68a5361141aca22e2137bfde953c68c2ab2b3b075ed9cb41afc70ea3","observation_id":"a0852ee5-738a-4f6f-826d-c5f76e6d20c9","resolution":{"observed_at":"2026-08-14T14:26:56.507637Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.481919Z","title":"¨ uber das Paulische ¨ aquivalenzverbot,","venue":null,"work_id":"04589dd1-7a0e-41e7-930e-3305a7d909c5","year":1928},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.829640Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:bc018ef402005a8633cd7ef5b925ab4027b4823e9afd4be5e91e0cc248ccec0b","observation_id":"b8058a17-f135-43a8-83c2-ed730c615e19","resolution":{"observed_at":"2026-08-14T14:26:56.488285Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.463040Z","title":"Entanglement in quantum-classical vari- ational algorithms,","venue":null,"work_id":"e13a487d-5684-4410-8545-b33727209512","year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.834884Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:2f2bb3e8f4843f8d6bc7f04dbb1c00042da294bdda47fc507fa51d8726fc2a30","observation_id":"d7e4fbcb-c28d-4dc4-b27d-8127eba5e7c1","resolution":{"observed_at":"2026-08-14T14:26:56.468378Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.444040Z","title":"Entanglement re- quirements for hybrid quantum-classical algorithms,","venue":null,"work_id":"47a85a0f-56be-44ba-bb7f-4bce5cf2587f","year":2019},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.840060Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:05f76dd639729e53a884939752e79608db5abba73fdcbc6e78a492682961b222","observation_id":"a7aa8695-758f-4496-bcf7-6e0d3962b5c5","resolution":{"observed_at":"2026-08-14T14:26:56.450911Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1804.09130","last_updated":"2021-12-29T06:13:32Z","snapshot_observed_at":"2026-08-14T19:22:28.109321Z","submitted_at":"2018-04-24T16:45:37Z","title":"On the representation of Boolean and real functions as Hamiltonians for quantum computing","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1804.09130","snapshot_observed_at":"2026-08-14T14:26:55.845008Z","title":"On the representation of Boolean and real functions as Hamiltonians for quantum computing,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.845008Z"},"links":{"cited_paper":"/paper/1804.09130","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:b3b274a4c3589f212e7ab8d98f791a2150f89d5fce606686d805aea2d365d8fb","observation_id":"a5d19494-6fbe-4e35-aa2d-7f6bfd8d4a81","resolution":{"observed_at":"2026-08-14T14:26:55.845008Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.425083Z","title":"A polylogarithmic ap- proximation of the minimum bisection,","venue":null,"work_id":"5e1dcd9f-31c9-4c1f-8223-5038a0104038","year":2006},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.850444Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:f69836d22c3c0f551d1187237198f35ff58dfe979d5ec836acaf0a514dcd5123","observation_id":"23112804-4a8c-43e8-9295-f30983c3c975","resolution":{"observed_at":"2026-08-14T14:26:56.431799Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.407764Z","title":"SciPy: Open source scientific tools for Python,","venue":null,"work_id":"3d0ba8ad-f50a-4ff4-a2ca-0ea747667ea1","year":2001},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.856689Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:d5162045ce4304c77d0f48ba0de3e2faeba35aa8aa37257073bb01a1386d9e6a","observation_id":"2402d00f-bf95-464d-aa3a-3276cbd6039d","resolution":{"observed_at":"2026-08-14T14:26:56.413354Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-14T14:26:56.390535Z","title":"GPyOpt: A bayesian optimiza- tion framework in python","venue":null,"work_id":"f2ded674-5a5a-4774-a2ce-c8160a076287","year":2016},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.862151Z"},"links":{"citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:4f071c473f10ed8957d4ebdf181e6a680fe6b3742e7729444ad4af25a8cba592","observation_id":"49590ee6-dbc7-47b8-b6ec-ea1c1f729407","resolution":{"observed_at":"2026-08-14T14:26:56.395891Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1412.6980","last_updated":"2017-01-30T01:27:54Z","snapshot_observed_at":"2026-08-14T18:51:16.666127Z","submitted_at":"2014-12-22T13:54:29Z","title":"Adam: A Method for Stochastic Optimization","version":9},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1412.6980","snapshot_observed_at":"2026-08-14T14:26:55.867357Z","title":"Adam: A method for stochas- tic optimization,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-14T14:26:55.867357Z"},"links":{"cited_paper":"/paper/1412.6980","citing_paper":"/paper/1908.03185"},"observation_digest":"sha256:650cd51bf6abeccfb436b4597228518b5c5b2b20f71464d7e10720a1a7ef5918","observation_id":"35c5fea6-3f40-4c34-864a-415b17d6bd7b","resolution":{"observed_at":"2026-08-14T14:26:55.867357Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"1908.03185","last_updated":"2019-08-08T17:31:28Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-15T01:26:49.782308Z","submitted_at":"2019-08-08T17:31:28Z","title":"Optimizing quantum heuristics with meta-learning"},"reference_resolution":{"displayed":84,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":19,"verified_exact":3,"verified_fuzzy":62},"total_outbound_references":84},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 84 of 84 outbound references and 2 inbound Pith citation observations for arXiv:1908.03185."}