{"as_of":"2026-08-21T14:43:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:9e371cb1426cc4a51c523a0bdbeef60cf6001b008d5be9b0d70232467a69eb83","coverage":[{"denominator":47,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":47,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-16T11:19:11.058076Z","state":"measured"},{"denominator":47,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":47,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2504.15990/citation-record","integrity":"/paper/2504.15990/integrity","json":"/paper/2504.15990/citation-record.json","paper":"/paper/2504.15990"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:11.825000Z","title":"Quantum logic gate synthesis as a markov decision process,","venue":null,"work_id":"0e626576-140a-4334-bc0f-18a61d9377bb","year":2023},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.880596Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:a91dca410dc3cf1e996366ecc7e6a8efbd83e21b0bf06e07ab94ef4f490e7f0e","observation_id":"7f4b88a8-65f6-495d-9f02-c3f8a219f7d4","resolution":{"observed_at":"2026-08-16T11:19:11.828640Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:10.885048Z","title":"Artificial intelligence for quantum computing,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.885048Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:8e41080a0fe2beed5c13b323339f6207f0a347df78b41034d64017de30f6b155","observation_id":"b288d69b-69cb-43c1-af4f-3fa8e088aa7f","resolution":{"observed_at":"2026-08-16T11:19:10.885048Z","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-16T11:19:10.888575Z","title":"Arqtic: A full-stack software package for simulating materials on quantum computers,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.888575Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:c026423ec18c1eabc5175c86aa4359b454fa2c024d132f3efe951f0e1a32af09","observation_id":"3a74b56d-3d21-4a26-adcc-9364942325ae","resolution":{"observed_at":"2026-08-16T11:19:10.888575Z","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-16T11:19:11.811907Z","title":"Learning high-accuracy error decoding for quantum processors,","venue":null,"work_id":"0cfec6be-06a7-412e-b33c-007cae0838c5","year":2024},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.892961Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:1eb1a9fd222f0691a5488b1dc90d1f000697534c1195bcfa8cda7e755eef2a14","observation_id":"390f3d49-5577-4069-8176-42ed851aad87","resolution":{"observed_at":"2026-08-16T11:19:11.816447Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.799774Z","title":"Bellman, Dynamic Programming , 1st ed","venue":null,"work_id":"428c8520-e9ae-408a-8af7-72138d194b1a","year":1957},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.897002Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:c45c6a99fd05d927c4e065cad5d6042216e9217820a466a6b6455c2dfaf5b5e2","observation_id":"bd46d940-a55d-41ab-bad8-7e2bf8bd442e","resolution":{"observed_at":"2026-08-16T11:19:11.803439Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1409.3552","last_updated":"2014-09-19T19:43:15Z","snapshot_observed_at":"2026-08-17T03:19:34.519710Z","submitted_at":"2014-09-11T19:39:44Z","title":"Efficient synthesis of probabilistic quantum circuits with fallback","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1409.3552","snapshot_observed_at":"2026-08-16T11:19:10.901010Z","title":"Efficient synthesis of probabilistic quantum circuits with fallback,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.901010Z"},"links":{"cited_paper":"/paper/1409.3552","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:bee5c2f9f877f51fb9bdebed7e0410dd1b0f638ca541a8c24e352f3a7fa53e3d","observation_id":"abee6171-eed7-43b6-83ca-b82ab514184d","resolution":{"observed_at":"2026-08-16T11:19:10.901010Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1404.5320","last_updated":"2014-09-19T20:29:25Z","snapshot_observed_at":"2026-08-17T03:19:33.888435Z","submitted_at":"2014-04-21T20:24:57Z","title":"Efficient synthesis of universal Repeat-Until-Success circuits","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1404.5320","snapshot_observed_at":"2026-08-16T11:19:10.905483Z","title":"Efficient synthesis of universal Repeat-Until-Success circuits,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.905483Z"},"links":{"cited_paper":"/paper/1404.5320","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:7adb7ee871cb523992bcc14199ca38db75a0ffec7b668f8bc16b767000caa881","observation_id":"acda1366-7573-476b-835f-5f373b810a3b","resolution":{"observed_at":"2026-08-16T11:19:10.905483Z","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-16T11:19:11.787792Z","title":"Efficient and practical quantum compiler towards multi-qubit systems with deep reinforcement learning,","venue":null,"work_id":"e59cc9d8-ecf7-4af6-aeeb-0b5665849272","year":2022},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.909365Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:940e77da7fa3635091aa9de01ae08ef3fa793299e2da42f59254c89f90da7fe5","observation_id":"8b2c06db-d4c6-48be-bf72-b1a24206c4fb","resolution":{"observed_at":"2026-08-16T11:19:11.791770Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:10.912979Z","title":"Program synthesis using deduction-guided reinforcement learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.912979Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:42004113a1be35b7c5a2ff181f25032cc9cc62d9ec2f0607d39cb2d1193b1c7e","observation_id":"1bb8f925-e781-46ba-a51d-d089f11dd196","resolution":{"observed_at":"2026-08-16T11:19:10.912979Z","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-16T11:19:11.773981Z","title":"Towards optimal topology aware quantum circuit synthesis,","venue":null,"work_id":"95e2ab30-8b42-4d4c-86f8-995cb3b903c5","year":2020},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.916646Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:e8f138abbe7f1e909ddc6080910442f1d53c8dbede831880ca26ce0b846f6e8b","observation_id":"af5133b1-7aeb-473a-8afc-79e9e03d6c2e","resolution":{"observed_at":"2026-08-16T11:19:11.778237Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T20:17:55.570300Z","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-16T11:19:10.919797Z","title":"A quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.919797Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:027cd3f84fc1cb882a074175238faacd476695f03bc3980bcfbb997ce30630ba","observation_id":"8f637ac6-59f0-4cf4-a226-2c32b49ec9ed","resolution":{"observed_at":"2026-08-16T11:19:10.919797Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1308.4134","last_updated":"2013-08-19T20:00:01Z","snapshot_observed_at":"2026-08-15T05:55:01.822222Z","submitted_at":"2013-08-19T20:00:01Z","title":"An algorithm for the T-count","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1308.4134","snapshot_observed_at":"2026-08-16T11:19:10.923515Z","title":"An algorithm for the T-count,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.923515Z"},"links":{"cited_paper":"/paper/1308.4134","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:b646f18a6a794817b5f7929f798afddd6edf19c2a14fee0022834cdc4ba270b3","observation_id":"63c2ee0f-fca2-4bb5-9344-5622658a093b","resolution":{"observed_at":"2026-08-16T11:19:10.923515Z","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-16T11:19:11.763320Z","title":"Quantum measurements and the abelian stabilizer problem,","venue":null,"work_id":"fa0d2f3d-308a-481b-9c7c-23246495978c","year":1995},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.927236Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:550d2b207cfc3825cb09f0f2763646394b10ef71c9807f8ab21bd0e766f2d79e","observation_id":"b6f8ccfa-999e-476e-ac35-f7c10d34bf71","resolution":{"observed_at":"2026-08-16T11:19:11.766822Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.751788Z","title":"Quantum computations: algorithms and error correction,","venue":null,"work_id":"4c975b53-3e18-4595-be4d-7ed781089621","year":1997},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.930412Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:4e634a42d3e206f6ad1b240a70ab091341a5c0864799a5d1b31bce3b9ab4f4d1","observation_id":"90a16ad7-1ca4-436f-a742-aac043925426","resolution":{"observed_at":"2026-08-16T11:19:11.755773Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1206.5236","last_updated":"2013-02-27T22:18:03Z","snapshot_observed_at":"2026-08-15T00:55:42.890303Z","submitted_at":"2012-06-22T19:46:24Z","title":"Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1206.5236","snapshot_observed_at":"2026-08-16T11:19:10.933481Z","title":"Fast and efficient exact synthesis of single qubit unitaries generated by Clifford and T gates,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.933481Z"},"links":{"cited_paper":"/paper/1206.5236","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:91f8d95c168a644aca4f618d32380381d80f3a872f82bc60d847cd7c79f4a1f7","observation_id":"ae034400-7077-4b64-a282-397cb6a2e999","resolution":{"observed_at":"2026-08-16T11:19:10.933481Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.09334","last_updated":"2017-09-08T20:31:10Z","snapshot_observed_at":"2026-08-14T20:58:07.279077Z","submitted_at":"2017-05-25T19:13:35Z","title":"Deep Neural Network Probabilistic Decoder for Stabilizer Codes","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.09334","snapshot_observed_at":"2026-08-16T11:19:10.936760Z","title":"Deep Neural Network Probabilistic Decoder for Stabilizer Codes,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.936760Z"},"links":{"cited_paper":"/paper/1705.09334","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:3ffcb5db9d6c3aef7b911c818e3af7ad2b142aab0e76a154194df3d64a51d538","observation_id":"4fb5aa67-50e8-42a2-9e85-5983136b8ea2","resolution":{"observed_at":"2026-08-16T11:19:10.936760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.21225","last_updated":"2024-07-30T22:30:15Z","snapshot_observed_at":"2026-08-21T07:54:40.085103Z","submitted_at":"2024-07-30T22:30:15Z","title":"AI methods for approximate compiling of unitaries","version":1},"cited_work":{"arxiv_id":"2407.21225","doi":null,"metadata_source":"pith","pith_arxiv_id":"2407.21225","snapshot_observed_at":"2026-08-16T11:19:11.424817Z","title":"AI methods for approximate compiling of unitaries","venue":"quant-ph","work_id":"0df9771a-c8ae-477c-83da-f1a7974a8c7a","year":2024},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.940285Z"},"links":{"cited_paper":"/paper/2407.21225","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:78111c70200d28dd0d09a35cdf3fab8dff7b65d38a4ea695c453fc96236cbe0c","observation_id":"e2fb3b06-8caa-4587-8cbc-51e6bcb8b331","resolution":{"observed_at":"2026-08-16T11:19:11.428949Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:10.943496Z","title":"Quarl: A learning-based quantum circuit optimizer,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.943496Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:7e3297b38edd610a9550e607400cff4adff780e41ea019bf535a65ab4979d4e1","observation_id":"04a8b752-624c-4637-99b5-2c736efffc34","resolution":{"observed_at":"2026-08-16T11:19:10.943496Z","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-16T11:19:10.946540Z","title":"Nerf: Representing scenes as neural radiance fields for view synthesis,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.946540Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:0dfc9db8125aea588785f9a817e7d6e3a357b2e3ecb95409fc266555841a97e2","observation_id":"8b224925-4963-47b5-896c-f3d2da7fe804","resolution":{"observed_at":"2026-08-16T11:19:10.946540Z","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-16T11:19:10.949949Z","title":"Playing atari with deep reinforcement learn- ing,","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.949949Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:f806ec72e865781cfc1fea452b96552d6f43051737fe755335cff47d74544657","observation_id":"db2320eb-2e5d-4def-87a1-172fb2fb2bf2","resolution":{"observed_at":"2026-08-16T11:19:10.949949Z","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-16T11:19:10.953099Z","title":"Quantum compiling by deep reinforcement learning,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.953099Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:d2e86ba2ea61db1832c84928d566d35edde10aae18f29a4c46d0ba18f0dd64be","observation_id":"5adf00dc-3ebf-4332-8b54-118a1878930b","resolution":{"observed_at":"2026-08-16T11:19:10.953099Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1607.04793","last_updated":"2016-09-30T14:43:52Z","snapshot_observed_at":"2026-08-15T03:47:12.359698Z","submitted_at":"2016-07-16T19:09:26Z","title":"Learning to Decode Linear Codes Using Deep Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1607.04793","snapshot_observed_at":"2026-08-16T11:19:10.956805Z","title":"Learning to Decode Linear Codes Using Deep Learning,","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.956805Z"},"links":{"cited_paper":"/paper/1607.04793","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:366b6d7a7611e56e02f3cc8d52cad977e2e044fa19fb642bc970c7f69a8dd5b0","observation_id":"2683f8e3-6e62-4de2-b17e-e652757bdde9","resolution":{"observed_at":"2026-08-16T11:19:10.956805Z","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-16T11:19:10.961616Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.961616Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:578eff43a73a49dc9d02bd39c62d392ec7a868a37ad5a7bf9a31d75c3a2213ef","observation_id":"0052682e-6ac8-4433-9ee2-2fcdca3c8a79","resolution":{"observed_at":"2026-08-16T11:19:10.961616Z","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-16T11:19:11.716536Z","title":"Synthetiq: Fast and versatile quantum circuit synthesis,","venue":null,"work_id":"62af9b67-71f3-4d2f-8149-bf5fdb1bd0fb","year":2024},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.965337Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:08fc84b911d026f04dc16795c8200af86407824c783c0f32959f484332ddd664","observation_id":"7ae62ea4-8814-4d5b-9544-fd54e182e4fb","resolution":{"observed_at":"2026-08-16T11:19:11.720766Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.704114Z","title":"A variational eigenvalue solver on a photonic quantum processor,","venue":null,"work_id":"667cc336-2e4a-41f0-80b7-1f884bec3826","year":2014},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.968896Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:6619db8c23266d6193d59c44c0011363bd0480692aba04e927ec81068e76192c","observation_id":"462a104f-6b53-4930-bfea-690423054fcd","resolution":{"observed_at":"2026-08-16T11:19:11.707928Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.692314Z","title":"Compiler Optimization for Quantum Computing Using Reinforcement Learning,","venue":null,"work_id":"d8100ff3-4647-4348-abea-b15fcf286a60","year":2022},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.972716Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:3eb559c2280bc913864930a2a2ca5a56fcdcbdbecb77fb4f32e06a9b4d4c6ed3","observation_id":"cbf7116a-44ae-494f-8425-6a158f7875e7","resolution":{"observed_at":"2026-08-16T11:19:11.696135Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.680256Z","title":"MQT Bench: Benchmark- ing Software and Design Automation Tools for Quantum Computing,","venue":null,"work_id":"25d2cee0-488e-4e95-bdce-b09bfd815d75","year":2023},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.976323Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:9632ff969f618078d401f840a770607dfdc49e7feade67b76e7ee0ce1b57fa1e","observation_id":"1d41fbe8-fc35-49b4-84bc-dac5103cff4d","resolution":{"observed_at":"2026-08-16T11:19:11.684218Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.669284Z","title":"On the spectral bias of neural networks,","venue":null,"work_id":"484441e6-ca5f-4ec1-8e12-6f3b49a37490","year":2019},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.982064Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:82bdb893ce69af4bddfc975c5a1dce8ad8018a1c9fa7a52799a1547e6a24dedd","observation_id":"dd82d9cb-5d71-4cde-a786-2dccafd0cc74","resolution":{"observed_at":"2026-08-16T11:19:11.673103Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.657253Z","title":"Unitary synthesis of clifford+t circuits with reinforcement learning,","venue":null,"work_id":"ef9a1c34-a9df-4372-af89-752cc332fdfa","year":2024},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.985838Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:a87931addacb401d4c0539a38d61e24d216fd32bf840c7ba670fc59dea9f3f4f","observation_id":"ce9cccfc-c1bc-4b1c-bb58-43ae16209752","resolution":{"observed_at":"2026-08-16T11:19:11.661426Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:10.990422Z","title":"The perceptron: A probabilistic model for information storage and organization in the brain,","venue":null,"work_id":null,"year":1958},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.990422Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:046591fcfbe89b70d43064c5cab461f63a92ed01b70f68568f4ef8604f070b6e","observation_id":"8cbc39d1-2f4e-4ba5-8e32-9881280df7db","resolution":{"observed_at":"2026-08-16T11:19:10.990422Z","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-16T11:19:11.638404Z","title":"Optimal ancilla-free clifford+t approxima- tion of z-rotations,","venue":null,"work_id":"41ed476c-9bd3-4acc-97a1-ad2568107138","year":2016},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.994418Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:aa4c30a7a0e91efdd7356859e7a86c14587797da5e7e3a436a0eb14cfec11d15","observation_id":"8de091e0-476e-4316-a2ad-a495fc69d5ff","resolution":{"observed_at":"2026-08-16T11:19:11.642163Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2210.14473","last_updated":"2022-10-26T04:47:18Z","snapshot_observed_at":"2026-08-16T16:21:05.580835Z","submitted_at":"2022-10-26T04:47:18Z","title":"Benchmarking Language Models for Code Syntax Understanding","version":1},"cited_work":{"arxiv_id":"2210.14473","doi":null,"metadata_source":"pith","pith_arxiv_id":"2210.14473","snapshot_observed_at":"2026-08-16T11:19:11.395827Z","title":"Benchmarking Language Models for Code Syntax Understanding","venue":"cs.CL","work_id":"fb68859a-1ea6-4bdf-b15c-f3beefc873c6","year":2022},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:10.998429Z"},"links":{"cited_paper":"/paper/2210.14473","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:505c73c484c5bb1f9723ecc5ebd85c2f984fc07e20ee0ed08296946afa609eca","observation_id":"30d57304-f6a1-48c0-be5d-edd8edf04dc5","resolution":{"observed_at":"2026-08-16T11:19:11.399541Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.627376Z","title":"Synthesis of quantum- logic circuits,","venue":null,"work_id":"7481a9e7-add5-4aae-babd-de0bae7837f7","year":2006},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.002443Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:3b1c1135f7853ab8b156e2993755d39cd272069361aef9da830e83169a7430a8","observation_id":"0471844b-ae02-4c5e-9b5c-03855ed2919b","resolution":{"observed_at":"2026-08-16T11:19:11.630992Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.006969Z","title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.006969Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:f7552e4764d6a418fa4e8c72d83ae0e14e00ec01df9ab446a351b65875a5d1c8","observation_id":"22503c74-b837-45c6-847e-8246d3d772ba","resolution":{"observed_at":"2026-08-16T11:19:11.006969Z","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-16T11:19:11.616424Z","title":"Co-domain symmetry for complex- valued deep learning,","venue":null,"work_id":"5bd44b34-367c-4583-b318-571e5b7e79dc","year":2021},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.010647Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:c516a1678e8a323b1c01d121cbfe0258df2afbb84db1208ea52ddd98a2f829dc","observation_id":"7568d9bc-98e9-4aac-a91a-489f1ca7c44d","resolution":{"observed_at":"2026-08-16T11:19:11.619864Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2211.11797","last_updated":"2022-11-21T19:01:53Z","snapshot_observed_at":"2026-08-16T16:14:24.882446Z","submitted_at":"2022-11-21T19:01:53Z","title":"Multi-Spectral Image Classification with Ultra-Lean Complex-Valued Models","version":1},"cited_work":{"arxiv_id":"2211.11797","doi":null,"metadata_source":"pith","pith_arxiv_id":"2211.11797","snapshot_observed_at":"2026-08-16T11:19:11.378744Z","title":"Multi-Spectral Image Classification with Ultra-Lean Complex-Valued Models","venue":"cs.CV","work_id":"8bca3a2e-8c78-48ea-8648-c3b037cc8792","year":2022},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.015009Z"},"links":{"cited_paper":"/paper/2211.11797","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:2fabb6e2bd3306e40715d92e519b667c3c3330f7b149d106b33b585a3ae1439e","observation_id":"bd25f8bd-d6eb-4ddb-9fa0-98f4ff8c8cd4","resolution":{"observed_at":"2026-08-16T11:19:11.383638Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.018503Z","title":"Leap: Scaling numerical optimization based synthesis using an incremental approach,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.018503Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:938eb4a3947b2a19675bd36f503a1bbfb6f0e004ffec63d530113a5e65986f6c","observation_id":"cd5658d5-f143-4456-9cb6-369fac821b01","resolution":{"observed_at":"2026-08-16T11:19:11.018503Z","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-16T11:19:11.021974Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.021974Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:40adc641f3b55404f608fc6ac5477286a436c995866a853c3364ea8f0b62b280","observation_id":"153d16da-9a6e-4697-8a05-e5358584995c","resolution":{"observed_at":"2026-08-16T11:19:11.021974Z","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-16T11:19:11.597285Z","title":"Complex-valued deep learning with applications to magnetic resonance image synthesis,","venue":null,"work_id":"5e91fc77-764f-4a6d-90c8-2b041ac03a17","year":2019},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.025470Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:ca4b6492c5797e627aa153b0ad2003b0e280b41bb6b58dcc1a8b1af6b4d775cc","observation_id":"4c9110a5-e9ae-4b6d-bbf4-bccbff05557c","resolution":{"observed_at":"2026-08-16T11:19:11.600921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.585169Z","title":"A trace inequality for unitary matrices,","venue":null,"work_id":"2f5f608a-3127-493c-8669-734643eec333","year":null},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.028823Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:10b82c3c3606f32e5a394b95dffb469fe62a719f5f56dd236d3be6946af02565","observation_id":"a3a96396-f2b4-434b-a4eb-32096bd477eb","resolution":{"observed_at":"2026-08-16T11:19:11.589127Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.035861Z","title":"Improving quantum circuit synthesis with machine learning,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.035861Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:06bf8fc61f9961a4268874faa93e26b4ba5f62a3b69e16ebceb3e9e321790355","observation_id":"7aec1806-c4e5-4bae-8971-d92e8d54cb8c","resolution":{"observed_at":"2026-08-16T11:19:11.035861Z","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-16T11:19:11.573055Z","title":"High- precision multi-qubit clifford+t synthesis by unitary diagonalization,","venue":null,"work_id":"eaa160d3-98ca-4b81-9c9d-30ecefa2641c","year":null},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.039441Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:1771ff6b605a3c6092ef7a1cdd6ce018ed190f2d8c5ba53cb92a567218544376","observation_id":"2b11f794-7ada-4c99-96e5-f2ae626a9253","resolution":{"observed_at":"2026-08-16T11:19:11.576736Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-16T11:19:11.050413Z","title":"Frequency principle: Fourier analysis sheds light on deep neural networks,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.050413Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:f2222e1783c3393ef5d86bc8004a984e999898c451a6040dd2995313fb260e91","observation_id":"09aae7e9-d1f4-4281-b7d0-455e3cf96be0","resolution":{"observed_at":"2026-08-16T11:19:11.050413Z","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-16T11:19:11.054466Z","title":"Berkeley quantum synthesis toolkit (bqskit) v1,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.054466Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:f96f04ea3947bb88936623777be228bc6c1f33b234c5294407890e95f7ee000e","observation_id":"2eb39a04-4cab-4a3a-a604-f7340d3a249f","resolution":{"observed_at":"2026-08-16T11:19:11.054466Z","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-16T11:19:11.058076Z","title":"Topological quantum compiling with reinforcement learning,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.058076Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:c09e90bc887128e671de82c029930b6a5b92823b819c35a6e270fc03ce2a63d4","observation_id":"e3895344-ac6f-4e5d-84e0-b61507f6b77f","resolution":{"observed_at":"2026-08-16T11:19:11.058076Z","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":"stable/2974909","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-16T11:19:11.354717Z","title":"Available: http://www.jstor.org/stable/2974909","venue":null,"work_id":"c1fe4d5d-36c8-48b2-ba4e-9101f726eb90","year":null},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":1994,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.032268Z"},"links":{"citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:8f1e15182b75ecaa41e3ad738b801eb02b764babd7d528158822a6cfdc00dd85","observation_id":"18d8ce97-e263-4db3-b24d-abf333a5e2f3","resolution":{"observed_at":"2026-08-16T11:19:11.364168Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2409.00433","last_updated":"2025-08-20T16:38:51Z","snapshot_observed_at":"2026-08-17T00:25:31.768482Z","submitted_at":"2024-08-31T12:10:32Z","title":"High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.00433","snapshot_observed_at":"2026-08-16T11:19:11.045093Z","title":"Available: https://arxiv.org/abs/2409.00433","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis","version":1},"reference_index":2025,"source":"pdf_text","source_observed_at":"2026-08-16T11:19:11.045093Z"},"links":{"cited_paper":"/paper/2409.00433","citing_paper":"/paper/2504.15990"},"observation_digest":"sha256:9014a9a4e9838aab52db3e54900e22dcd164bd5d0a448f0ecffbade7bc6f6c33","observation_id":"968c7ddf-ec12-4075-9434-6d60cf208721","resolution":{"observed_at":"2026-08-16T11:19:11.045093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2504.15990","last_updated":"2025-04-22T15:51:32Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-17T03:56:24.559643Z","submitted_at":"2025-04-22T15:51:32Z","title":"Making Neural Networks More Suitable for Approximate Clifford+T Circuit Synthesis"},"reference_resolution":{"displayed":47,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":23,"verified_exact":4,"verified_fuzzy":18},"total_outbound_references":47},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 21 August 2026, this Paper Citation Record lists 47 of 47 outbound references and 0 inbound Pith citation observations for arXiv:2504.15990."}