{"as_of":"2026-08-04T06:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:72cf522b49abc293e1c986027e860f034e7ec4e21590d0100abab039bab1e7bb","coverage":[{"denominator":22,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":22,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T13:04:02.083217Z","state":"measured"},{"denominator":22,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":22,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-03T06:30:56.289259+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/2607.08102/citation-record","integrity":"/paper/2607.08102/integrity","json":"/paper/2607.08102/citation-record.json","paper":"/paper/2607.08102"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-10T13:07:05.652990Z","title":"Optimal Satellite Constellation Config- uration Design:A Collection of Mixed Integer Linear Programs,","venue":null,"work_id":"c7225c4b-cfcb-419c-a211-2c3c625f888b","year":2026},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:aecbef01515675bd4d4f47a81fad9c5bf7148bb669a115dfd715e4733fc0d2a2","observation_id":"b151f210-e66c-406e-aacf-759eeb503ac2","resolution":{"observed_at":"2026-07-10T13:07:05.654259Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.642570Z","title":"THE MAXIMAL COV- ERING LOCATION PROBLEM,","venue":null,"work_id":"6d5629b1-0938-4a09-9fa1-d3461ee9b862","year":1974},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:49ec84a35a0111b53651d6b3412ec1d5a9cb874145e1573e00b770ea31e69ac6","observation_id":"ab48f506-a2b4-4e11-a64d-80782903d52e","resolution":{"observed_at":"2026-07-10T13:07:05.643938Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.656843Z","title":"Optimal constellation design based on satellite ground tracks for Earth observation missions,","venue":null,"work_id":"da39e3e7-1495-4dc8-8686-d111d288fdd6","year":2023},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:13824bc658fd95e5879500797b6e7f6381f5b7ddf7a93c716e5ee331a92bb722","observation_id":"16fab7fd-52e4-4fa8-afc7-2ff0e5466b02","resolution":{"observed_at":"2026-07-10T13:07:05.658139Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.650789Z","title":"Satellite Constellation Design for Minimum Worst-Case Revisit Time,","venue":null,"work_id":"a79ff33e-e199-48f8-8b98-59472fdd8a6d","year":2026},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:962ee477254078048e762293183b92f2168efafb7de81994288a3382072c5f39","observation_id":"3574b91b-ddfa-4b76-9004-ad6f6586740e","resolution":{"observed_at":"2026-07-10T13:07:05.652198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.623325Z","title":"Regional Constellation Re- configuration Problem: Integer Linear Programming Formulation and Lagrangian Heuristic Method,","venue":null,"work_id":"fd7d7c54-eee3-4422-822d-f473fcb2819c","year":2023},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:9195add00512b19be5d0f1cd3fd2d53bdb1c14f79e856ecdc3ee0d1003ec787a","observation_id":"f806c329-3772-49db-9adc-eda39aeac9b3","resolution":{"observed_at":"2026-07-10T13:07:05.624977Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.625544Z","title":"A decomposition approach for the prob- abilistic maximal covering location-allocation prob- lem,","venue":null,"work_id":"a32f3a34-11d7-485d-a81f-e8b7c3c24f8a","year":2009},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:dc39eea86f323f9a2a3be5ab6579691bebf6593cb08d6a35921b99ca10965787","observation_id":"5321170f-bf64-488e-96af-8ca885307103","resolution":{"observed_at":"2026-07-10T13:07:05.626970Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.627579Z","title":"A Review on Quantum Machine Learning in Applied Systems and Engineering,","venue":null,"work_id":"a1a6ee70-03f9-4475-b2ed-800560299d7b","year":2025},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:32a9e607338d89fcc880730e8ab090cf790acd80ac420912bf1b8772a8df1068","observation_id":"3f7fb973-b4dd-41b9-b5a1-c86536e8ed06","resolution":{"observed_at":"2026-07-10T13:07:05.629067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":"1411.4028","doi":"10.48550/arxiv.1411.4028","metadata_source":"pith","pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-07-10T19:27:32.382371Z","title":"A Quantum Approximate Optimization Algorithm","venue":"quant-ph","work_id":"5a33d9f3-407a-4c7e-a119-ff581c66b173","year":2014},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:7de3c056955ec460ff4c995c1af89d835a7c9084d9554f2034fdab9fbe173d61","observation_id":"c09af7af-d58b-42f7-9706-1ad424e5cd00","resolution":{"observed_at":"2026-07-10T13:07:05.472813Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T20:38:06.090448+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"crossref_status_cache"},{"observed_at":"2026-08-03T20:38:06.090448+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.629704Z","title":"Using quantum comput- ing to solve the maximal covering location problem,","venue":null,"work_id":"08dab460-4fb0-4abe-937f-92719d621fa2","year":2022},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:3efe952140edbe5c4f1156badcc3d30cb5b27fcb2e498a46e57cba76196363e7","observation_id":"8647c606-81b9-4195-99aa-3b9e4e9bfdb5","resolution":{"observed_at":"2026-07-10T13:07:05.631185Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.05383","last_updated":"2025-02-23T07:20:26Z","snapshot_observed_at":"2026-07-06T18:59:05.329809Z","submitted_at":"2024-08-09T23:38:28Z","title":"Two-Step QAOA: Enhancing Quantum Optimization by Decomposing K-hot Constraints in QUBO Formulations","version":2},"cited_work":{"arxiv_id":"2408.05383","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.05383","snapshot_observed_at":"2026-07-10T13:07:05.474513Z","title":"Two-step qaoa: Enhancing quantum optimization by decomposing one-hot constraints in qubo formulations","venue":"quant-ph","work_id":"0459ff2a-6cdb-4da8-a868-43e74a6c5590","year":2024},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"cited_paper":"/paper/2408.05383","citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:dde945023f71befcf0d8050dfb9a1b105caafdc77c59e09ad639a64599710097","observation_id":"9d878dbe-ba01-4267-a7ff-85066af0b3f0","resolution":{"observed_at":"2026-07-10T13:07:05.476157Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.634009Z","title":"Quantum Optimization for Closed-Loop Scheduling of Earth Observation Satellite Formation,","venue":null,"work_id":"de203401-da0f-438e-b38d-bda93676fc2f","year":2025},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:b227b1ac05fc67804da28d51cd270c224da4eca01bacafc9e1b329ac0d9defb5","observation_id":"b4415e63-73bc-42e5-bda6-9194415241a2","resolution":{"observed_at":"2026-07-10T13:07:05.635921Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.636535Z","title":"COMPARATIVE STUDY OF TWO DIVIDE AND CONQUER SORT- ING ALGORITHMS: QUICKSORT AND MERGE- SORT,","venue":null,"work_id":"74aea939-2e36-4b95-b09a-2334b0c8e50e","year":2020},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:92925d2ad7015f8018a935d5c57a498c00c966e3c327ff007c28debcd7474ab3","observation_id":"70846f8b-4eb2-4a66-9ea6-f354e5a2365e","resolution":{"observed_at":"2026-07-10T13:07:05.637851Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.646384Z","title":"Large-Scale Quantum Approximate Optimization via Divide-and-Conquer,","venue":null,"work_id":"ad7d104a-62b9-4319-a60c-98915b872c73","year":2023},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:f6d0da70432d0b5ae4105e9cfaecf55d30493f8bcfea66cd8974dc9e2a32f4f3","observation_id":"499da3ac-27ad-4438-b846-799bdbeb9136","resolution":{"observed_at":"2026-07-10T13:07:05.647875Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.618792Z","title":"QAOA-in- QAOA: Solving Large-Scale MaxCut Problems on 20 Small Quantum Machines,","venue":null,"work_id":"f9992457-9753-42b3-bd30-ec667d68cf5c","year":2023},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:8c1c8eb81d1d009d666921976f04e1dd6489d10e7342b745cba102e31334ae11","observation_id":"7e22ade9-ebbf-4562-9879-27351a6d011e","resolution":{"observed_at":"2026-07-10T13:07:05.620380Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.621116Z","title":"Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algo- rithms,","venue":null,"work_id":"19b30ed9-15a7-4994-9df0-32332a56c82a","year":2025},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:a033518595bb7619fcc4f93735edc529e7c4863e7d1f2ffe4952e48dc5c72350","observation_id":"539b419a-2028-4e17-9368-33a15336f2c0","resolution":{"observed_at":"2026-07-10T13:07:05.622593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2312.08940","last_updated":"2023-12-14T13:47:57Z","snapshot_observed_at":"2026-07-31T00:52:21.119325Z","submitted_at":"2023-12-14T13:47:57Z","title":"A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem","version":1},"cited_work":{"arxiv_id":"2312.08940","doi":null,"metadata_source":"pith","pith_arxiv_id":"2312.08940","snapshot_observed_at":"2026-07-10T13:07:05.477921Z","title":"A Decomposition Method for the Hybrid Quantum-Classical Solution of the Number Partitioning Problem","venue":"math.OC","work_id":"b455cd32-4e2b-408d-b595-b5835f2d72c1","year":2023},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"cited_paper":"/paper/2312.08940","citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:20912a2076a10530b67f3b017593f327b7a52e3f8c35b7bdbb14fb0bfa9ba809","observation_id":"6b3ab157-6438-47a9-9ce9-fa6468d6172b","resolution":{"observed_at":"2026-07-10T13:07:05.479545Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.640089Z","title":"TensorHyper-VQC: A tensor-train-guided hypernet- work for robust and scalable variational quantum com- puting,","venue":null,"work_id":"78826e00-10e1-4409-812e-3d3367d954e2","year":2026},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:03f1af42db7b1ee62f651180377eedad083ddb63a1ae7f706475cd9164e48265","observation_id":"5e10a5f0-2f0e-4ff2-8eb1-7e31a845be04","resolution":{"observed_at":"2026-07-10T13:07:05.641943Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.638480Z","title":"Algebraic connectivity of graphs,","venue":null,"work_id":"d2fd37db-036c-4c8f-b503-eada96fd96c4","year":1973},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:ff2069eb7db4d139f6c52901dd11440a9e3178ebf09f8f8a549e0ef1faf60e9e","observation_id":"d42c72f9-5ed2-4edb-b8a8-36dcafcddc81","resolution":{"observed_at":"2026-07-10T13:07:05.639593Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.644508Z","title":"A tutorial on spectral clustering,","venue":null,"work_id":"52539dc5-24cb-4db9-a725-1106b9f2a25d","year":2007},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:4eba0d70b9ff4d0b4570859555582d3dd1a99faad43a615e51b64d8a460ea1ad","observation_id":"62f2cd6c-f734-4d2e-844e-58fcdef7219c","resolution":{"observed_at":"2026-07-10T13:07:05.645744Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.631829Z","title":"Spectral par- titioning works: Planar graphs and finite element meshes,","venue":null,"work_id":"8344522d-04c4-46a8-a077-37f9ae5056ea","year":1996},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:a6b198a3e62fa8788f84f496ec5a81bd348951652f2435a8c6fb1f0f178b1c64","observation_id":"bce68cd6-6405-4351-8e69-d70a72f05b67","resolution":{"observed_at":"2026-07-10T13:07:05.633402Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.654870Z","title":"Ising formulations of many NP problems","venue":null,"work_id":"dd2d6c37-3445-4a98-b221-ee4fe6ea6b16","year":2014},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:1b1e6dbc6c354625911f013df81aef9be691f3798ae585a07be77b8b5d5b99ef","observation_id":"295df107-b2ee-4108-97e3-a100824e1328","resolution":{"observed_at":"2026-07-10T13:07:05.656115Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+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-07-10T13:07:05.648447Z","title":"From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz,","venue":null,"work_id":"12d62a22-d574-4b52-abab-79cda067831a","year":2019},"citing_paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-10T13:04:02.083217Z"},"links":{"citing_paper":"/paper/2607.08102"},"observation_digest":"sha256:e24bd4f5c0a1987b2b214cc9a8ea9e645ac280b1846e56a842252a2a102fb9b7","observation_id":"9f432f85-a2d2-4226-b9ed-b5f6c02fb96c","resolution":{"observed_at":"2026-07-10T13:07:05.650088Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-03T06:30:56.289259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2607.08102","last_updated":"2026-07-09T04:39:44Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-02T06:49:27.018936Z","submitted_at":"2026-07-09T04:39:44Z","title":"Decomposition-Based QAOA for Maximum Coverage Location Problem in Satellite Constellation Design"},"reference_resolution":{"displayed":22,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":3,"verified_fuzzy":19},"total_outbound_references":22},"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-03T06:30:56.289259+00:00","source":"crossref"},{"observed_at":"2026-08-03T06:30:50.922721+00:00","source":"retraction_watch"}],"thesis":"As of 4 August 2026, this Paper Citation Record lists 22 of 22 outbound references and 0 inbound Pith citation observations for arXiv:2607.08102."}