{"as_of":"2026-08-14T09:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a5d7ccc28f465bc17a3a2ec5f374ff2549de9ed27c461c2ead3247ebdbfdd380","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T13:54:53.206021Z","state":"measured"},{"denominator":29,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":29,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T13:07:35.755764Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-07-03T05:47:41.000698Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"cited_work":{"arxiv_id":"2412.12773","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2412.12773","snapshot_observed_at":"2026-07-03T05:47:41.000698Z","title":"Optimization of flight routes: Quantum approximate optimization algorithm for the tail assignment problem,","venue":null,"work_id":"c6049163-c7e3-4b68-b814-27d47e614765","year":2024},"citing_paper":{"arxiv_id":"2606.11383","last_updated":"2026-06-09T19:06:55Z","snapshot_observed_at":"2026-08-06T06:17:57.255664Z","submitted_at":"2026-06-09T19:06:55Z","title":"Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T13:07:35.755764Z"},"links":{"cited_paper":"/paper/2412.12773","citing_paper":"/paper/2606.11383"},"observation_digest":"sha256:786f1425077806c7e2c87f15547c8edb17936ece198973dc3b09e5924c9ca184","observation_id":"f82c2c1f-93bd-4214-9178-57b6ee17abfc","resolution":{"observed_at":"2026-07-03T05:47:41.002228Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2412.12773/citation-record","integrity":"/paper/2412.12773/integrity","json":"/paper/2412.12773/citation-record.json","paper":"/paper/2412.12773"},"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-11T13:54:53.510459Z","title":"Then, to apply a full layer in the circuit, the Trotter-Suzuki decomposition formula in Eq","venue":null,"work_id":"2c38796d-7edb-492d-8770-57daa8be2bb0","year":null},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.103906Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:b21db082c121b8d9bb30c0b5d1f80d3c58f094d31770a1cd6cd7fa5a5fc18af6","observation_id":"55b73c36-9758-4de3-9cfb-f13cb5d54b4b","resolution":{"observed_at":"2026-08-11T13:54:53.515575Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.497430Z","title":null,"venue":null,"work_id":"ead767f3-ff1c-4da8-a329-e120400c487f","year":null},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.108604Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:5c2a232145e3f0eaa044fc02c7f3ebe0f6c088ac1e36986ab39de7af01d08f98","observation_id":"9adbc5f5-33ee-4d77-a266-5f2b1cab3a2e","resolution":{"observed_at":"2026-08-11T13:54:53.502177Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.484077Z","title":"An effective qubit encoding scheme is essential to translate the binary decision vari- ables to quantum computation","venue":null,"work_id":"6deb9c4f-922f-4039-b6b1-7763aba56ef3","year":2024},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.112643Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:20a1840d1c89161d42569296d1832bc3114449ce70994d24d5e7bf7661dbbfef","observation_id":"80a94a07-bae9-4435-a699-f822fc37f89d","resolution":{"observed_at":"2026-08-11T13:54:53.488962Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.469644Z","title":"This is illustrated in Figure 3, where the INTERP strat- egy was applied to an instance of 6 routes and a low average valency of 0.66 in the route graph","venue":null,"work_id":"5edecdc9-e307-4f27-9367-69fcb6439d1a","year":null},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.116999Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:2ab436c864de192ef7734c37e9ff60cbc728ec573433d12c3b83a966d9ef000c","observation_id":"8ad1a28e-579f-4a74-9e20-2cb8817150da","resolution":{"observed_at":"2026-08-11T13:54:53.475301Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.458108Z","title":"The INTERP strategy was used for the results, executing each instance 5 times to achieve more reliable results","venue":null,"work_id":"55da5323-5712-4fa9-a79e-4139e93c2af3","year":null},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.120635Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:2eff4f1fe8747e5953828959ed688225075a43473a58b0ed04534e453c646ec9","observation_id":"58ee536f-1c17-4c92-9133-f43735aa20c2","resolution":{"observed_at":"2026-08-11T13:54:53.462337Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.443991Z","title":"Gr¨ onkvist,The Tail Assignment Problem, Phd thesis, Chalmers University of Technology and G¨ oteborg Uni- versity (2005)","venue":null,"work_id":"633f056c-8a87-4c5e-bd9c-4bddc964a4ad","year":2005},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.124785Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:b2d4970e0f39778f17c3143cf0cc81b2a8298f5632f08f311607fc445e441b1e","observation_id":"227cf772-20a1-4679-905b-365dcf206272","resolution":{"observed_at":"2026-08-11T13:54:53.449383Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.431113Z","title":"Ruther, N","venue":null,"work_id":"35b2f0d7-955c-4f3f-b5da-5408f23667e1","year":2017},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.128433Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:f8435204030da200d7e2916be32cc63ae35701fdc4a88c675fbcd4dc32ba6f40","observation_id":"02d3120e-5b25-4e9b-a8e2-8e2f6fd92b72","resolution":{"observed_at":"2026-08-11T13:54:53.435296Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.418112Z","title":"Montoito, Application of the Simulated Annealing with Adaptive Local Neighborhood Search to the Tail Assign- ment Problem The Case Study of TAP , Ph.D","venue":null,"work_id":"f216c8d3-08f1-4887-9913-2c35149724fc","year":2016},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.132146Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:e4c3545f4c2bf7680c8d17e9e21ece7ba0b1bcc71f66f69b8fac02bd214a8999","observation_id":"6a05b7da-7a43-4cdc-9c92-d40b93fd3ea8","resolution":{"observed_at":"2026-08-11T13:54:53.423579Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.406299Z","title":null,"venue":null,"work_id":"19026c24-5330-4bee-a96c-25e644cec295","year":2021},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.135881Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:ac9d7b1e3bcfadd9e91bf7e0fdc23c91669dfd5c8f4f780d2d2dc01f61f4cd06","observation_id":"ca330a8a-a5b0-41e3-b7a5-ee51ae0bc80b","resolution":{"observed_at":"2026-08-11T13:54:53.410294Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.394475Z","title":"Vikst ˚ al, M","venue":null,"work_id":"6a7bbe87-2c3e-43e3-a663-c89a092779c5","year":2020},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.140071Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:8319fc8187d2dafab64a2d5aeea9ca192dabc12ce907b363d28337c7d85e0a64","observation_id":"65b01dea-b4e0-4f22-9f1d-d5d82b6aca19","resolution":{"observed_at":"2026-08-11T13:54:53.398409Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-13T17:16:52.599300Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-11T13:54:53.144645Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.144645Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:6875d0d2b6a6796490dfbaa7da9692a274c4533b1d4b583a13fac2b0ece0a5e3","observation_id":"3e86ba41-d24f-45a3-a8e4-386ef21f1767","resolution":{"observed_at":"2026-08-11T13:54:53.144645Z","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-11T13:54:53.381745Z","title":"Zhou, S.-T","venue":null,"work_id":"abb16d1b-d5c7-41c7-9246-f6fc6841b2c2","year":2020},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.149207Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:79798ecf1c20cff26d1bc925ce6e5b45e4740c9c30d7274fd2fd56de034ff38e","observation_id":"b862b342-5778-434e-bbc7-b5f1fdc7be10","resolution":{"observed_at":"2026-08-11T13:54:53.385972Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1602.07674","last_updated":"2019-10-21T01:40:03Z","snapshot_observed_at":"2026-08-14T07:27:50.300264Z","submitted_at":"2016-02-24T20:57:50Z","title":"Quantum Supremacy through the Quantum Approximate Optimization Algorithm","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1602.07674","snapshot_observed_at":"2026-08-11T13:54:53.152715Z","title":"Farhi and A","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.152715Z"},"links":{"cited_paper":"/paper/1602.07674","citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:1ec7befc2f9a42227163ec474da7dd93f1729dd4526955b5020f17013d517a7c","observation_id":"1eb49561-9ec3-444f-91b1-1a834a292147","resolution":{"observed_at":"2026-08-11T13:54:53.152715Z","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-11T13:54:53.156566Z","title":"Willsch, D","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.156566Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:7ff070693146b5b88079d539971e86f2ab0c1d2b1246d4a55b17e9345fe6992e","observation_id":"4f9825b2-8e97-4d14-b815-0607dec9752a","resolution":{"observed_at":"2026-08-11T13:54:53.156566Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1811.08419","last_updated":"2018-11-20T18:51:07Z","snapshot_observed_at":"2026-08-10T14:54:06.478334Z","submitted_at":"2018-11-20T18:51:07Z","title":"Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.08419","snapshot_observed_at":"2026-08-11T13:54:53.159961Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.159961Z"},"links":{"cited_paper":"/paper/1811.08419","citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:333a80051853956fd3f446a0dd66147fc6ebf4f0e2aa72bc1ac613faacbcbcc9","observation_id":"3bfb1803-6907-463a-9d3b-a5c297b51088","resolution":{"observed_at":"2026-08-11T13:54:53.159961Z","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-11T13:54:53.362269Z","title":null,"venue":null,"work_id":"df7b9685-69f6-46c3-b2ae-e8b63778b77e","year":2015},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.163799Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:28f799ca9bed3a8603e5f479d980fdc3cd26091ecea2074a83457ff22e35d43a","observation_id":"3f6b143f-3ddf-4886-81aa-c72b43193581","resolution":{"observed_at":"2026-08-11T13:54:53.366866Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.167084Z","title":"Preskill, Quantum computing in the nisq era and be- yond, Quantum 2, 79 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.167084Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:8986643123298fcb1a9b026f35eec82e222ef94076d3a3a4f38185af8b78b8c4","observation_id":"c7ed53cf-747c-4936-a18d-6ab53d20e5b4","resolution":{"observed_at":"2026-08-11T13:54:53.167084Z","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-11T13:54:53.170567Z","title":"Hadfield, Z","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.170567Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:b9e204677c20773612ac06b659fcac612ddf3ae94969885b6a9f6606f3a51ac3","observation_id":"9d2d2c37-52c7-42da-a930-2f16d3c73404","resolution":{"observed_at":"2026-08-11T13:54:53.170567Z","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-11T13:54:53.173706Z","title":"Blekos, D","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.173706Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:8e01ecec689af5fe2243c3414c1cdec99d80fec583392d24b38018687574cb08","observation_id":"d49f1776-3dc2-407c-8dae-b3c54ecf0969","resolution":{"observed_at":"2026-08-11T13:54:53.173706Z","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-11T13:54:53.177475Z","title":null,"venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.177475Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:29f77adb1cd8ed3cc6c2520dc5df1d568b43ecf9f719279f0d6bd13cbb2f59a2","observation_id":"871e081e-31b4-490f-aeb5-4e7921dbd84e","resolution":{"observed_at":"2026-08-11T13:54:53.177475Z","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-11T13:54:53.325179Z","title":"aspx?gnoyr_VQ=FGJ&QO_fu146_anzr=b0-gvzr","venue":null,"work_id":"a1d42bc9-bcdf-466a-a804-cbbd255f9a4b","year":null},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.180653Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:d7ec8c4695bd3cce8aa0d1598166492ef6f40166d51eb0e6ec06c2b4514f2279","observation_id":"7d8cff40-d173-47ae-af1c-94a855f1fafe","resolution":{"observed_at":"2026-08-11T13:54:53.329863Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.313155Z","title":null,"venue":null,"work_id":"1ce6e107-df9c-4d31-96bb-c011f7132417","year":null},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.184490Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:a14254c5c28346d04eb80f04198384295bcbfd616fbfde3177d15bbe1b3efab4","observation_id":"570cd794-a23c-4cfb-aeda-f62937d281bf","resolution":{"observed_at":"2026-08-11T13:54:53.317124Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2405.07624","last_updated":"2024-05-13T10:35:23Z","snapshot_observed_at":"2026-08-13T00:09:02.994750Z","submitted_at":"2024-05-13T10:35:23Z","title":"Towards Robust Benchmarking of Quantum Optimization Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.07624","snapshot_observed_at":"2026-08-11T13:54:53.188384Z","title":"Bucher, N","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.188384Z"},"links":{"cited_paper":"/paper/2405.07624","citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:2a42ff038f4744243a9071d66c72818a1eecce77d2bb40b58e1734ad9af8f9f5","observation_id":"57910ef5-82a5-4bb4-8030-9ad42660ebde","resolution":{"observed_at":"2026-08-11T13:54:53.188384Z","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-11T13:54:53.300049Z","title":"Barnhart, E","venue":null,"work_id":"f9c1e079-a388-42ed-ad91-c9f9990bd4c6","year":1998},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.192309Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:53bd4f169d09d1934bd8a27cbbca457a9e3cd55a962f6d9e59bdcf7b96aa03c9","observation_id":"d079ff70-f530-40e8-b7ad-8d7510bf4600","resolution":{"observed_at":"2026-08-11T13:54:53.304947Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T13:54:53.195799Z","title":"Yarkoni, E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.195799Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:19a6408b14cd50b7b0d338a57a6886b0c3c445317bd4b6deaaa7a27a5f96ce8f","observation_id":"7f7f3cd2-5e47-4945-9aef-05eda25a9232","resolution":{"observed_at":"2026-08-11T13:54:53.195799Z","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-11T13:54:53.199258Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.199258Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:2d1314056651882f10d1db938725442421c7ba0d829edb70e6c758b86daab7ba","observation_id":"325175a8-7bad-42a1-a2b1-8ada1b8febfb","resolution":{"observed_at":"2026-08-11T13:54:53.199258Z","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-11T13:54:53.202567Z","title":"Shaydulin, I","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.202567Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:7a5246fbdd000cf78552633ffbb4b0a9e7fbba0ae7a4ad702320b13b8447be5d","observation_id":"20f6932b-3253-4347-852f-df0e2a23dfce","resolution":{"observed_at":"2026-08-11T13:54:53.202567Z","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-11T13:54:53.206021Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T13:54:53.206021Z"},"links":{"citing_paper":"/paper/2412.12773"},"observation_digest":"sha256:ab42e52d6fc588f35d0ca163299e8da7388bfe900fea632091a31af7fd8de709","observation_id":"7fcf10c6-036b-4199-969b-497bf962dda4","resolution":{"observed_at":"2026-08-11T13:54:53.206021Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2412.12773","last_updated":"2024-12-17T10:35:26Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T19:54:42.811368Z","submitted_at":"2024-12-17T10:35:26Z","title":"Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":17,"verified_exact":0,"verified_fuzzy":11},"total_outbound_references":28},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 1 inbound Pith citation observation for arXiv:2412.12773."}