{"as_of":"2026-08-17T07:28:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c3274aab7c0bcfe4faef93d79a4e7a9234edd2e1919096edf7dc4f328fe2638c","coverage":[{"denominator":30,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":30,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T23:10:03.028607Z","state":"measured"},{"denominator":30,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":30,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-17T06:30:58.91139+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/2412.20930/citation-record","integrity":"/paper/2412.20930/integrity","json":"/paper/2412.20930/citation-record.json","paper":"/paper/2412.20930"},"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-10T23:10:03.606989Z","title":"Recurrent models of visual attention,","venue":null,"work_id":"3ca8eaeb-8dd0-4be1-ad40-913f784c56dc","year":2014},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.862592Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:7f018ca830ce984a629f92130fa39660d253d50fcfc72d1bf80123b50c6759f7","observation_id":"750d4da6-64cd-4b71-8cda-fb71a2101ed9","resolution":{"observed_at":"2026-08-10T23:10:03.611609Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.592635Z","title":"Show, attend and tell: Neural image caption generation with visual attention,","venue":null,"work_id":"66704e81-3fe9-446a-9186-fcdb8a1cf7ae","year":2015},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.868197Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:9cfaefb5bf3a279d6aabc35a11363b38266c64b6623d5c118396c5a0b22d46c6","observation_id":"425a4d55-d077-4a5a-aa87-ad829ebacef0","resolution":{"observed_at":"2026-08-10T23:10:03.597765Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.578939Z","title":"Learning visual question answer- ing by bootstrapping hard attention,","venue":null,"work_id":"2f8d5f7e-9cdb-49a7-8059-dd1db22dfe7b","year":2018},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.874460Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:2caea9f2ee674937479c3e8f653764ff133967fa28b70141b197b41103012516","observation_id":"cfa20f35-5e29-4a50-8465-249829e6c2c3","resolution":{"observed_at":"2026-08-10T23:10:03.583986Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.566172Z","title":"Saccader: Improving accuracy of hard attention models for vision,","venue":null,"work_id":"d867d29f-6b38-4406-a5b2-2cffe2c220f4","year":2019},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.880107Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:7f39cfadf0fc6e2666ece1b29546b6f5bb8c11c8050e8db97c65411189292db2","observation_id":"ba52efb1-8f10-4a8d-bb80-4e76cab6a4b8","resolution":{"observed_at":"2026-08-10T23:10:03.570484Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.549756Z","title":"Hard attention net for automatic retinal vessel segmentation,","venue":null,"work_id":"ef037768-2e32-4a5d-bb05-17a77c5b35e8","year":2020},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.886104Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:5fe39c36b75302fd9806c4a85c0cc89323297f4c88cb5abc242b32fd982fd4b5","observation_id":"1a486394-5f80-442e-b21a-e54d6fe0c5ae","resolution":{"observed_at":"2026-08-10T23:10:03.554287Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.533479Z","title":"Look harder: A neural machine translation model with hard attention,","venue":null,"work_id":"5a9d761c-3d43-4cc6-bf0c-833242736951","year":2019},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.891933Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:222df385e15b58fbdcf7e197e94e9577960937a4b5d2ba5b3d6ba6683f9d7e64","observation_id":"eb6755fb-6b24-4875-bd08-957d5ee44fea","resolution":{"observed_at":"2026-08-10T23:10:03.539615Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.515801Z","title":"Deep learning-based hard spatial at- tention for driver in-vehicle action monitoring,","venue":null,"work_id":"5d64f3c1-4848-4024-9f9c-2a72c15a4a93","year":2023},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.897377Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:3153ffba16cfcc00b7d97ac9f7711ab7d5e130d5102f1853006f3fb62b8d56e8","observation_id":"57644bf6-e304-4f17-8bd9-93210dd0c4d6","resolution":{"observed_at":"2026-08-10T23:10:03.521652Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.497127Z","title":"A review on the attention mechanism of deep learning,","venue":null,"work_id":"6ae92e9e-da81-4997-b8b5-295d9b6aef83","year":2021},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.901683Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:4f2206d265e84e77f1a533bd914011d849e11fdbb336c4ae26f3108d3a61ef83","observation_id":"46907f11-5f54-48f7-99bf-4569c56d78c8","resolution":{"observed_at":"2026-08-10T23:10:03.502648Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.476397Z","title":"Overcoming catastrophic for- getting with hard attention to the task,","venue":null,"work_id":"6a0bfbc1-5356-4e1b-8f27-a9d74f454f83","year":2018},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.906650Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:d6b7fde6140b5b939fdae251820089d0389e67834d3eb2b2fbcbfc8191686de7","observation_id":"6ef5966c-de9d-408a-8dff-2f07076446cc","resolution":{"observed_at":"2026-08-10T23:10:03.481253Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.01840","last_updated":"2021-09-04T10:50:34Z","snapshot_observed_at":"2026-08-16T17:58:52.828833Z","submitted_at":"2021-09-04T10:50:34Z","title":"A review of Quantum Neural Networks: Methods, Models, Dilemma","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.01840","snapshot_observed_at":"2026-08-10T23:10:02.910936Z","title":"A review of quantum neural networks: Methods, models, dilemma,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.910936Z"},"links":{"cited_paper":"/paper/2109.01840","citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:53ef9738c9e934d874d3ba86a54017450bf3f2173048f89b722eca9b660fd65e","observation_id":"36e4c5af-a45b-4e5c-94b6-8c2101bb7fa6","resolution":{"observed_at":"2026-08-10T23:10:02.910936Z","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-10T23:10:03.454523Z","title":"QSAN: A near-term achievable quantum self-attention network,","venue":null,"work_id":"ca4cae86-4d4b-41fc-a74d-76165704d89f","year":2024},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.916001Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:23f216483e70b3a7b51eb73c9446fb7c3d964a6553222ff9b196053a1781959a","observation_id":"c3588303-7837-4229-b331-9580406e5f73","resolution":{"observed_at":"2026-08-10T23:10:03.463414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.434098Z","title":"QKSAN: A quantum kernel self- attention network,","venue":null,"work_id":"59590d2a-2fb3-44b3-9a22-a3585da5d2c0","year":2024},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.920297Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:9fe9203d6a11f96cb3e3ef23bb1ff6025b24b208f86b5cf6d1e0f29358983e92","observation_id":"6609b260-730b-4f57-8655-4ea554cb495d","resolution":{"observed_at":"2026-08-10T23:10:03.440577Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2401.14089","last_updated":"2024-01-25T11:11:16Z","snapshot_observed_at":"2026-08-16T14:24:36.759976Z","submitted_at":"2024-01-25T11:11:16Z","title":"GQHAN: A Grover-inspired Quantum Hard Attention Network","version":1},"cited_work":{"arxiv_id":"2401.14089","doi":null,"metadata_source":"pith","pith_arxiv_id":"2401.14089","snapshot_observed_at":"2026-08-10T23:10:03.126784Z","title":"GQHAN: A Grover-inspired Quantum Hard Attention Network","venue":"quant-ph","work_id":"9e02b724-830c-4df1-8df9-ac6d6f47d31f","year":2024},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.925578Z"},"links":{"cited_paper":"/paper/2401.14089","citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:c6d4a7d7c40df55c800b9209e3ef3c33054fd4c5e6f393fd40288dd6903f747f","observation_id":"652e3f68-81a6-4373-b008-ed9e3d043c4b","resolution":{"observed_at":"2026-08-10T23:10:03.133206Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2404.17378","last_updated":"2024-04-26T12:52:45Z","snapshot_observed_at":"2026-08-16T13:57:33.763149Z","submitted_at":"2024-04-26T12:52:45Z","title":"Quantum Adjoint Convolutional Layers for Effective Data Representation","version":1},"cited_work":{"arxiv_id":"2404.17378","doi":null,"metadata_source":"pith","pith_arxiv_id":"2404.17378","snapshot_observed_at":"2026-08-10T23:10:03.101355Z","title":"Quantum Adjoint Convolutional Layers for Effective Data Representation","venue":"quant-ph","work_id":"498a4c38-795a-4b35-90e5-0b239c00bd67","year":2024},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.930485Z"},"links":{"cited_paper":"/paper/2404.17378","citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:5105884145dbf21389f39d688e7b3a23af669ee09c7350e1a22ca9a4e6a21da9","observation_id":"69abd725-065b-4412-9159-df1d3b965eac","resolution":{"observed_at":"2026-08-10T23:10:03.108631Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.406078Z","title":"Wave mechanics and radioactive disintegration,","venue":null,"work_id":"77266337-2f09-426a-8198-d049d04243e3","year":1928},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.936772Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:eeecf1c09f82884e7a811f5047bfb1db3239e54a2bf21e1633d3dc4ece6bfc11","observation_id":"08875ea6-b971-4b3c-9d96-c081cc760dab","resolution":{"observed_at":"2026-08-10T23:10:03.416542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.373131Z","title":"Quantum annealing applied to de-conflicting optimal trajectories for air traffic manage- ment,","venue":null,"work_id":"617e20fd-4821-432d-8fb0-210cd4e194a7","year":2020},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.942001Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:729fb76bfca4c6b316ad2031389e4ba5664884f7868977d11d224a71a176f6b4","observation_id":"c112fa92-790c-4304-b4df-51e1195623c0","resolution":{"observed_at":"2026-08-10T23:10:03.379040Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.354028Z","title":"Benchmarking quantum annealing con- trols with portfolio optimization,","venue":null,"work_id":"485a903b-9209-4f57-8ffd-5506188f8637","year":2021},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.947155Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:80a399a59f6ad40653a2ca2417ef5c839ff264c604d2d2932185b25d14ab2a8a","observation_id":"f4954cbb-a090-4c32-ae33-15962b3b56d1","resolution":{"observed_at":"2026-08-10T23:10:03.359778Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.337263Z","title":"Quantum annealing in the transvers e Ising model,","venue":null,"work_id":"b444a65f-810b-491f-a2f1-7ff342b0ac54","year":1998},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.951814Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:0c7bc390f02de7080c9e56158ebf1894afead51f9150b23a46560ee7570c31f3","observation_id":"a5e62288-5c53-4730-8fdc-068ce7bb3f34","resolution":{"observed_at":"2026-08-10T23:10:03.342569Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.321183Z","title":"Quantum annealing with manu- factured spins,","venue":null,"work_id":"9487e488-2d64-4f65-a236-9a266636637a","year":2011},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.956377Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:66868d3b6e1e2ca1a0d30524df8f53af3c225e8b330cb50917fbe094fa88e465","observation_id":"9c2c0bb5-8237-45ca-82fa-7ab5f88f6986","resolution":{"observed_at":"2026-08-10T23:10:03.326558Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.289955Z","title":"Solving a Higgs optimization problem with quantum annealing for machine learning,","venue":null,"work_id":"c0c30edf-e6b5-4629-8ec2-c5a9264adab5","year":2017},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.964854Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:e3aeb149a87ec2605640b1f391b5753e459f669131c5290d66683de5d1e65665","observation_id":"d32f6bca-9b77-4f3f-84fb-da6a821c905f","resolution":{"observed_at":"2026-08-10T23:10:03.295659Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.273083Z","title":"A path towards quantum advantage in training deep generative models with quantum anneal- ers,","venue":null,"work_id":"1aaeb6f0-52c4-43ea-85b1-5b586eed1024","year":2020},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.970289Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:febdc80c49dafa7f3b385e87c4a955d4f5513d431076f436873b35f7bbe58602","observation_id":"f786ad93-1842-4445-8d35-aa3587dfb22b","resolution":{"observed_at":"2026-08-10T23:10:03.278228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.258151Z","title":"Analog-quantum feature mapping for machine-learning applications,","venue":null,"work_id":"e6d19d7d-15b2-4a2b-82d9-5a9e4588ca10","year":2020},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.974419Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:51ce844e3ef1bba4804b385b56faffd6de4fe2854fd1a160ff571c13c0ddb314","observation_id":"0b2aba4f-fc60-4215-8744-ada2c7b98294","resolution":{"observed_at":"2026-08-10T23:10:03.263151Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.241772Z","title":"Quantum annealing for single image super-resolution,","venue":null,"work_id":"ef907f9b-19b7-40b1-9bb3-7b3bfb6b68e3","year":2023},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.979787Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:10347aedb5f9a2b816ff7f45c8acbe1d70d72ec423d52dc36fae3eb056367fa1","observation_id":"28a6d81e-0ca8-45d1-a9e2-35e9160d17d1","resolution":{"observed_at":"2026-08-10T23:10:03.248713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.224362Z","title":"Reinforced self-attention network: A hybrid of hard and soft attention for sequence modeling,","venue":null,"work_id":"7697b443-eb92-4647-81b1-25398a48a480","year":2018},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.984164Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:a4c5eef390cce8594d1610636e7c01a1b345f40ced2e2eb405670608d05c813a","observation_id":"0de10ebd-5d9d-4612-a5be-143142c3c242","resolution":{"observed_at":"2026-08-10T23:10:03.230707Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.207766Z","title":"Short-depth QAOA circuits and quantum annealing on higher-order ising models,","venue":null,"work_id":"b060b332-c139-4fe7-9bd0-4396e9f75f6c","year":2024},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.989722Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:bdd4a6e1670f1d1cce4c2992fd399452ab9c3e95dc7c452247bd930117d7b5eb","observation_id":"d92767de-6fef-463e-b17e-2c037368e6e4","resolution":{"observed_at":"2026-08-10T23:10:03.212360Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.305453Z","title":"Benchmarking advantage and D-Wave 2000Q quantum annealers with exact cover problems,","venue":null,"work_id":"ac37ad31-12f4-4e36-b89e-3e142bfcc3b9","year":2022},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:02.995611Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:1996f7c8d31e7003309dca9a6fc656f425bbcaa8d8d50fd2c5e21a5d6f0d5303","observation_id":"6c74aa9f-0bf5-475e-93e9-bafece23c2fb","resolution":{"observed_at":"2026-08-10T23:10:03.311104Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.191322Z","title":"Pytorch: An imperative style, high- performance deep learning library,","venue":null,"work_id":"e908a109-ca90-4ba6-9e1c-dbffba01e365","year":2019},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:03.004244Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:6d6f9aa41ea51ca646d50706308cc47d7ec5d563e5fc3c330af368a11ceee85b","observation_id":"938c8fd3-a4c5-42b8-a4da-eeade6d4b95a","resolution":{"observed_at":"2026-08-10T23:10:03.196522Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+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-10T23:10:03.176202Z","title":"Gradient-based learning applied to document recognition,","venue":null,"work_id":"41d6422f-f69a-4a89-bcac-a88470fb1c80","year":1998},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:03.013731Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:5a4c5f7ca50a398e760c84f706d3c86e690b1ef617b4df8ab460dbe6b4fa716d","observation_id":"2fa8e8c8-b41b-461f-80f0-406c04fac677","resolution":{"observed_at":"2026-08-10T23:10:03.181597Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1806.00451","last_updated":"2018-06-01T17:16:56Z","snapshot_observed_at":"2026-08-16T06:32:06.888652Z","submitted_at":"2018-06-01T17:16:56Z","title":"Do CIFAR-10 Classifiers Generalize to CIFAR-10?","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.00451","snapshot_observed_at":"2026-08-10T23:10:03.022371Z","title":"Do CIFAR-10 classifiers generalize to CIFAR-10?,","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:03.022371Z"},"links":{"cited_paper":"/paper/1806.00451","citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:4d9d7097fbcaded032e77b5808b6d7520b524c307dda35fbabde6322483a3be5","observation_id":"ee83528c-1691-4e1c-9cec-7463e987cc25","resolution":{"observed_at":"2026-08-10T23:10:03.022371Z","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-10T23:10:03.160856Z","title":"ImageNet large scale visual recognition Challenge,","venue":null,"work_id":"87b7ea49-afa1-46f9-b176-621e0ee5fd59","year":2015},"citing_paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T23:10:03.028607Z"},"links":{"citing_paper":"/paper/2412.20930"},"observation_digest":"sha256:d8b8888f41dc44f3bf161d7eee802742f9cf5a91c46f2cd900e7d2d58dc4e62a","observation_id":"d8365dfd-45ea-43cd-9113-ff15a92b9191","resolution":{"observed_at":"2026-08-10T23:10:03.165897Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-17T06:30:58.91139+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.20930","last_updated":"2024-12-30T13:21:16Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-16T06:33:04.551454Z","submitted_at":"2024-12-30T13:21:16Z","title":"QAHAN: A Quantum Annealing Hard Attention Network"},"reference_resolution":{"displayed":30,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":2,"verified_fuzzy":26},"total_outbound_references":30},"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-17T06:30:58.91139+00:00","source":"crossref"},{"observed_at":"2026-08-17T06:30:54.323127+00:00","source":"retraction_watch"}],"thesis":"As of 17 August 2026, this Paper Citation Record lists 30 of 30 outbound references and 0 inbound Pith citation observations for arXiv:2412.20930."}