{"as_of":"2026-08-14T08:45:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:026b059574ef9108de6ddf9f28e474080e0cbf0d7653f03e1c69c2bc378e3667","coverage":[{"denominator":59,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":59,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T22:41:15.572567Z","state":"measured"},{"denominator":59,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":59,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-14T06:32:32.682623+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/2501.01058/citation-record","integrity":"/paper/2501.01058/integrity","json":"/paper/2501.01058/citation-record.json","paper":"/paper/2501.01058"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.7717/peerj-cs.836","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:15.683589Z","title":"Graph coloring using the reduced quantum genetic algorithm","venue":null,"work_id":"f17d9264-0702-423a-baf5-8091eccd70d6","year":2022},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.369564Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:8fe4256c6c9ba95965a18f96dc71e8815a5790232327d1f1f5b1e3e24a2dc0f8","observation_id":"e1d85207-c43b-4a35-a8ef-352cae237090","resolution":{"observed_at":"2026-08-10T22:41:15.687385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1811.06128","last_updated":"2020-03-12T18:53:21Z","snapshot_observed_at":"2026-08-13T16:20:59.609884Z","submitted_at":"2018-11-15T00:40:32Z","title":"Machine Learning for Combinatorial Optimization: a Methodological Tour d'Horizon","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1811.06128","snapshot_observed_at":"2026-08-10T22:41:15.373663Z","title":"Machine Learning for Com- binatorial Optimization: A Methodological Tour d’Horizon","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.373663Z"},"links":{"cited_paper":"/paper/1811.06128","citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:4d4ff4553c1c88efec0773355c8790136beb9f2af3bff28cf63f99d225c62b56","observation_id":"2b79f95d-1c3b-49a3-bdc7-67f3f5228339","resolution":{"observed_at":"2026-08-10T22:41:15.373663Z","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-10T22:41:16.375130Z","title":"Quantum machine learning","venue":null,"work_id":"30215bad-2952-48ea-b075-ef361f23ddfa","year":2017},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.377881Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:57a056d79e48bcfb19594fe31f7f688f4642d214dd16dfb80582d615ffe28744","observation_id":"ad784734-8d4e-40ff-8b5a-07d9a8b9ff98","resolution":{"observed_at":"2026-08-10T22:41:16.378516Z","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":"2102.09544","last_updated":"2022-09-23T11:35:42Z","snapshot_observed_at":"2026-08-14T01:14:41.768161Z","submitted_at":"2021-02-18T18:47:20Z","title":"Combinatorial optimization and reasoning with graph neural networks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.09544","snapshot_observed_at":"2026-08-10T22:41:15.381618Z","title":"Combinatorial optimization and reasoning with graph neu- ral networks","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.381618Z"},"links":{"cited_paper":"/paper/2102.09544","citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:7cf2efdedaf4ee83620eb98db63e0344b6f65d70a536c3a20ac3453bf18ae302","observation_id":"7d83a4a9-77b5-4e13-acda-491a18a70b22","resolution":{"observed_at":"2026-08-10T22:41:15.381618Z","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-10T22:41:16.364695Z","title":"Cuccaro et al","venue":null,"work_id":"faa131cf-5d01-4241-9b07-6c7394e5aaba","year":2004},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.385500Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:13397a3b2f7376b3f9e7d66d5a49f99ef0c90adbabbdd09991986eeb5c0c9276","observation_id":"93955ebe-0a04-43e2-b31f-3c5218920a21","resolution":{"observed_at":"2026-08-10T22:41:16.368450Z","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-10T22:41:16.352854Z","title":"Rapid solution of problems by quantum com- putation","venue":null,"work_id":"1c850077-b28b-4475-bcd5-84d7f7d18280","year":1992},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.389273Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:47f9304d4d65eaa1b22abfd9937ebe992d68ef22f9acadd01d186796f19a97ba","observation_id":"b5ba5a1c-e3e0-4c70-ba34-7c24dd90b040","resolution":{"observed_at":"2026-08-10T22:41:16.357449Z","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":"10.4153/cjm-1973-048-x","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:15.671888Z","title":"Some extremal properties of bipartite subgraphs","venue":null,"work_id":"9728c1a5-8215-478c-814e-f73b949e765b","year":1973},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.392975Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:a9bb735f66a78ace533982917252ec758b7a8721e9c6733e70a058db3fa6cfd6","observation_id":"2439b3e1-39dd-437d-a6dc-85a90f5e98f8","resolution":{"observed_at":"2026-08-10T22:41:15.675780Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:15.396652Z","title":null,"venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.396652Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:4d71c39009f179dccd05c2c7f4201d43f444f9c08cc60739be32a49a6c8f5c8d","observation_id":"d9c05c97-50f6-4c28-b710-449f4425f166","resolution":{"observed_at":"2026-08-10T22:41:15.396652Z","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-10T22:41:16.342598Z","title":"A review on quantum search algo- rithms","venue":null,"work_id":"cc86c3ca-5ac6-4c6e-854e-cd422f62cb77","year":2017},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.400140Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:7e24ecea0f54e61ba9682222cf6b4b71913f2051ea3019d5b0078592ad143916","observation_id":"7da78a1c-039c-434d-9b0f-ebb8f4711167","resolution":{"observed_at":"2026-08-10T22:41:16.346155Z","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-10T22:41:16.332115Z","title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","venue":null,"work_id":"51e33c2b-4a99-40ed-8d0c-0eae022023a5","year":1995},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.403593Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:1087daccc894f0956985b81464ddbb1fc37b2a1085a0e228e3b639f1dcbcd71e","observation_id":"9f46e9c4-5b8c-4ccb-a91a-376ed03dcf76","resolution":{"observed_at":"2026-08-10T22:41:16.336017Z","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-10T22:41:16.320247Z","title":"879-approximation algorithms for MAX CUT and MAX 2SAT","venue":null,"work_id":"6e630bee-ead5-456a-a389-5ba3233ae91f","year":1994},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.407065Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:bfa1124ca9bb6e6e2494de595e89319e393137a766766791200c2b5f8f18da20","observation_id":"d522969f-f708-4148-88d2-43ecbb69860d","resolution":{"observed_at":"2026-08-10T22:41:16.325152Z","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-10T22:41:16.309756Z","title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","venue":null,"work_id":"b32466af-d58c-4e42-87a9-95045e958a29","year":1995},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.410447Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:621e5cb7da25524e8b72fa2196a831c01574510741fd33a182dd1770a9db17d6","observation_id":"8f1befe6-2076-44bf-9c65-9f7af2ee03df","resolution":{"observed_at":"2026-08-10T22:41:16.313499Z","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":"quant-ph/9808061","last_updated":"1998-08-30T02:25:44Z","snapshot_observed_at":"2026-08-14T05:07:11.516031Z","submitted_at":"1998-08-27T23:48:04Z","title":"Quantum Carry-Save Arithmetic","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9808061","snapshot_observed_at":"2026-08-10T22:41:15.414103Z","title":"Quantum carry-save arithmetic","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.414103Z"},"links":{"cited_paper":"/paper/quant-ph/9808061","citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:ba9b0f1f2e72c01fcac3071b1fbf6eb3339374a87c3ecf5abe739541d2fc22dc","observation_id":"d3fae9dd-f6aa-412d-97f7-89dce881cae3","resolution":{"observed_at":"2026-08-10T22:41:15.414103Z","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-10T22:41:16.298574Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":"9dced4ed-d41e-4768-9421-e00eb2575dee","year":1996},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.417732Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:37ba6213138c56f54ad7cedbb5d57487e24edef5647ed967fd89645e2281b235","observation_id":"078671e4-7b29-4afc-b4af-5e44ed33dc89","resolution":{"observed_at":"2026-08-10T22:41:16.302842Z","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-10T22:41:16.288043Z","title":"A fast quantum mechanical algorithm for database search","venue":null,"work_id":"adfa6f44-64b1-45c2-b947-c2c6b0c4a1bb","year":1996},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.421075Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:f0c4c04357d835c1c3b4843156b0ccf604c6b2c61c6c28b2f7f6cf9ebbae9c92","observation_id":"8cf33a87-b105-4a43-93dd-238f9979aac5","resolution":{"observed_at":"2026-08-10T22:41:16.291719Z","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-10T22:41:16.277871Z","title":"Qaoa for Max-cut requires hundreds of qubits for quantum speed-up","venue":null,"work_id":"32d28259-bf09-4adb-9d71-e3ee65eb3239","year":2019},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.424280Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:8f3adf68d761a4685daa2321f090fde56b435e6e9a74e2453b0cce49c1ed1686","observation_id":"485963e3-a2ed-43f0-a123-d4c692e7fe00","resolution":{"observed_at":"2026-08-10T22:41:16.281702Z","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-10T22:41:16.266833Z","title":"A more efficient deterministic annealing neu- ral network algorithm for the max-bisection problem","venue":null,"work_id":"c8a91fe2-80ce-42ba-902b-2d816d2eee90","year":2021},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.427286Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:8baf86a1ece2e6ab861a20f8fad9cd2300013db30736c227b017b8f704df7800","observation_id":"4a35e03e-ce07-4584-a03c-390efb958069","resolution":{"observed_at":"2026-08-10T22:41:16.270779Z","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-10T22:41:16.256695Z","title":"Local optimization and the Traveling Salesman Problem","venue":null,"work_id":"5676b482-b27b-4d4f-86e5-ef9de8062356","year":1990},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.430388Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:167a43d481a0c1e9a5e64e0d7b5320c9ef462f14c3ca20a3fff86bfb436996ec","observation_id":"57fdaafd-4bb9-41c2-89ae-c4ec9529ce39","resolution":{"observed_at":"2026-08-10T22:41:16.260401Z","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-10T22:41:16.245519Z","title":"On the role of entanglement in quantum-computational speed-up","venue":null,"work_id":"09a19c42-e296-421b-80ec-2703a04c15fb","year":2003},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.433428Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:da008657928b76926ea4d413328fe59c857319be22eeeea9c7f78e8d2c6d3fc6","observation_id":"b4d99a23-c0a3-44f5-9864-459a3ab396c0","resolution":{"observed_at":"2026-08-10T22:41:16.250325Z","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-10T22:41:16.233811Z","title":"Combinatorial Algorithms for Portfolio Optimization Problems – Case of Risk Moderate Investor","venue":null,"work_id":"d24b8cc2-4a31-40e2-90e6-6c43e6b1b8e4","year":2017},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.436784Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:4ce44f4a2597400ae9a2ff3c38b906c0e77a344e5c7895b3900f7cba20869ff2","observation_id":"12047814-b65b-42bf-a1d7-2b9503c34b3e","resolution":{"observed_at":"2026-08-10T22:41:16.237629Z","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-10T22:41:16.223275Z","title":"Chapter 4 The travel- ing salesman problem","venue":null,"work_id":"5992f576-9d85-43a4-945d-ce006832ab47","year":1995},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.439796Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:02ee5da3ac37c0a2e12ba3406ce2607b64699d4091d5036dd7482e3fc86418db","observation_id":"97d32990-8948-4a0e-a881-bdd3ccaf9d38","resolution":{"observed_at":"2026-08-10T22:41:16.226989Z","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-10T22:41:15.443133Z","title":"Reducibility among combinatorial problems","venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.443133Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:8733b12ede30ce28d09a3c52ee074cf7da0ef507c1c353a72df8329c5b438677","observation_id":"ded5cb24-aae6-49f4-8909-08d0f68bed26","resolution":{"observed_at":"2026-08-10T22:41:15.443133Z","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-10T22:41:16.211923Z","title":null,"venue":null,"work_id":"ab739cd8-2e58-42a9-8814-ff5bb8d63072","year":null},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.447341Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:314bff809a1d3adfdce539dd81b86aef599f96bb49e9bcfa245f354697166477","observation_id":"347f97a2-6f67-4b02-8753-a97b199bad33","resolution":{"observed_at":"2026-08-10T22:41:16.216283Z","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-10T22:41:16.199889Z","title":"A comparison study of harmony search and genetic algorithm for the max-cut problem","venue":null,"work_id":"fa2a825f-603b-466f-ba3d-6053136742ea","year":2019},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.454546Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:e7887f23dcf493143a10f0a5c3fa937030954f4a685a625954972389b27eb4d8","observation_id":"d9b126af-3941-47fe-957a-386733a3d4be","resolution":{"observed_at":"2026-08-10T22:41:16.203645Z","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-10T22:41:16.189338Z","title":"Optimization by Simulated An- nealing","venue":null,"work_id":"ad59ac24-5991-4abc-9b86-abf2f2688ca1","year":1983},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.458740Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:af757fca9706fc3743bb72a30a1c10303aea4741591bd8029527937bb67900d1","observation_id":"b7275fb8-9f55-46c0-9e95-4e1855d75f94","resolution":{"observed_at":"2026-08-10T22:41:16.192989Z","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-10T22:41:15.462505Z","title":"Kitaev, A","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.462505Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:eb702a7b0838b45c69f8fd0e98cc0653b6f6afe028cba465c117b4d2854c9c4b","observation_id":"4dc02721-a13b-40a6-b2f5-22acb8417fcd","resolution":{"observed_at":"2026-08-10T22:41:15.462505Z","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-10T22:41:16.178310Z","title":"Combinatorial Optimization: Theory and Algo- rithms","venue":null,"work_id":"6f922661-914a-4181-8b57-127d767e1b91","year":2006},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.466140Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:709cff094bce1bae30e5fe8c017d7746ea9ab1529f8a6d79e7bb7f8bf4ac73f8","observation_id":"6fd7a5c4-897e-45da-b586-740732b86356","resolution":{"observed_at":"2026-08-10T22:41:16.182151Z","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-10T22:41:16.167487Z","title":"Quantum genetic algorithms for computer scientists","venue":null,"work_id":"1e196637-09da-4c26-8209-2f786ed59732","year":2016},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.469761Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:44f05f20028c93d474cb7c2d373663e7dcb53b0a8b4e3ebfad462d378203523f","observation_id":"3472c9d0-7783-443a-aad8-4aaf8707a700","resolution":{"observed_at":"2026-08-10T22:41:16.171629Z","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-10T22:41:16.156046Z","title":"Quantum Algorithms for Combinatorial Optimization","venue":null,"work_id":"2b34cf46-3d85-4bec-bf78-fc84f84e664d","year":2022},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.473010Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:4d54cb8a862ba2ef67af34bb2b3325395e7d79cf5133b88f82bd6096a7faf837","observation_id":"39dea9fe-f6c4-4c00-a7ff-8f52677d09fc","resolution":{"observed_at":"2026-08-10T22:41:16.160222Z","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-10T22:41:16.144730Z","title":"Reinforcement learning for combinatorial optimization: A survey","venue":null,"work_id":"482410c8-1fdb-4f5f-bbb1-ae59ae504b19","year":2021},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.476537Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:7f73f9e97f88fd8ac8e1be83ea9f88c49966ea21239100ab34ba3148a15b22e8","observation_id":"6336dda8-6061-40fd-84c1-4355ea300b11","resolution":{"observed_at":"2026-08-10T22:41:16.148330Z","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":"10.1145/3609426","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:15.642541Z","title":"An experimental evaluation of semidefinite pro- gramming and spectral algorithms for Max Cut","venue":null,"work_id":"f316aff6-61fb-4550-9abb-5fcebeadd4a1","year":2023},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.480088Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:1ca0c535503dcef614add5e40762b2218e30820982c4acf2bd42a174235bdb9c","observation_id":"ee771e81-e2aa-46eb-a6ec-6432a8c2fd1a","resolution":{"observed_at":"2026-08-10T22:41:15.646385Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.62.052309","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:15.631481Z","title":"Multivalued logic gates for quantum compu- tation","venue":null,"work_id":"fa5cf1bf-b641-4e51-b9da-20d49368234f","year":2000},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.483577Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:ecc8850ecc911f0ce916d2258ae7a5f2fc522349eabb6151b905e7ccb3693b5f","observation_id":"7a79ef8b-572e-4744-ac81-77658f187aea","resolution":{"observed_at":"2026-08-10T22:41:15.635561Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:16.133485Z","title":null,"venue":null,"work_id":"87901cb7-e2e0-4779-b922-ade0252fef6d","year":null},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.486996Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:8af44c2bc3487d5d346a2087352061b8af433dd181bac3f4dd9970eff255d092","observation_id":"80956d96-913c-480e-88be-7a59046e0486","resolution":{"observed_at":"2026-08-10T22:41:16.137301Z","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-10T22:41:16.122695Z","title":"Quantum Computation and Quantum In- formation","venue":null,"work_id":"031dfb87-66cb-4fa4-9c31-1062a9c794a3","year":2000},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.494278Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:4136e3acb215e60612e3ee00a19e456fa9d9bd1a9e82e88f9e195c9bd78c1476","observation_id":"3981f778-57d7-430d-8d9d-a6aa780fa696","resolution":{"observed_at":"2026-08-10T22:41:16.126441Z","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-10T22:41:16.111534Z","title":"A practical architecture for reliable quantum computers","venue":null,"work_id":"42082eba-03e9-4864-b076-413100d066c0","year":2002},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.497960Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:d8ae8acdbfe1e51cb5c239af698bc06dc89c091ce8fc2b194ee76df7bc3f2c4c","observation_id":"70813ab0-e7dd-4b4d-ad16-24476f4dddf2","resolution":{"observed_at":"2026-08-10T22:41:16.115236Z","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-10T22:41:16.100773Z","title":null,"venue":null,"work_id":"1dc4125d-95a2-43a4-b0a9-a4716f5da580","year":2000},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.500842Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:c07a77b7fa815db7a5df36b1941674c51000d41541d20856c1f4a58b6d0539c6","observation_id":"92304cf5-37a3-4c68-937b-946204ef1088","resolution":{"observed_at":"2026-08-10T22:41:16.104071Z","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":"10.1007/11893318_21","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-12T11:03:20.376878Z","title":"Clustering pairwise distances with missing data: Maximum cuts versus normalized cuts","venue":"Lecture notes in computer science","work_id":"905c2872-b84c-4921-b165-cc7b6cefc370","year":2006},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.503707Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:9de484b9b30d67c182ec5df1612f8bfd1abbd0d52b86ebda3d756165527b5386","observation_id":"08bfc6f6-9865-43a0-ad9d-75c7db0ea5ed","resolution":{"observed_at":"2026-08-10T22:41:15.618114Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T22:41:16.089432Z","title":"Maximum cuts and large bipartite subgraphs","venue":null,"work_id":"eed61680-9329-4a78-b0ac-fb75551ca161","year":1995},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.506748Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:2a841ec4224d149d07157ec82c7f7e7ebde15a22be25a0e343c93e0850d1f008","observation_id":"ead555be-8df3-4c20-b069-30f302444134","resolution":{"observed_at":"2026-08-10T22:41:16.093824Z","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-10T22:41:16.077099Z","title":"Self-repairing embryonic memory ar- rays","venue":null,"work_id":"4af95fae-b6af-43f9-9f66-12ce635c7a74","year":2004},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.509677Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:13723aef87c423b8190a345ffce2a1097160b6eeb5f1536f7f6a134f9112460d","observation_id":"e355df48-d934-4678-814d-af171b225ada","resolution":{"observed_at":"2026-08-10T22:41:16.081532Z","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-10T22:41:16.065455Z","title":"Survivability of embryonic memories: Analysis and design principles","venue":null,"work_id":"7aa99ff8-e8eb-440e-b9bc-4d1ecfdf0b9e","year":2005},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.512883Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:c69f0cdf6b4fbf77b839c2aef092697977d773c9e18604a802190f5ed4bc7bab","observation_id":"d1c81af4-86c6-4092-a807-d87772f89e52","resolution":{"observed_at":"2026-08-10T22:41:16.070023Z","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-10T22:41:16.054677Z","title":"Traveling salesman problem heuristics: Leading methods, im- plementations and latest advances","venue":null,"work_id":"cfee697e-b237-4449-98a0-f4c20e52c4fc","year":2011},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.515972Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:9081caff76a34e18ddb2237d343454945e8080b3db6c22fbcd4ff211330f66f1","observation_id":"3c6e6712-dfd7-49b0-bc50-f4fea4322488","resolution":{"observed_at":"2026-08-10T22:41:16.058324Z","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-10T22:41:16.043731Z","title":"Computational complexity, genetic program- ming, and implications","venue":null,"work_id":"4526c6a4-45ec-4d11-ad91-11c930cc5ef5","year":2001},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.519506Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:ebde8c1c28bc809d0a15ec56fe12315b339dd1111c37995b65b279691e0215cc","observation_id":"253c924e-4775-46db-92f6-66ca6123132d","resolution":{"observed_at":"2026-08-10T22:41:16.047950Z","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-10T22:41:16.033310Z","title":"Quantum evolutionary programming","venue":null,"work_id":"9bbef4ad-ee0a-4e98-b242-1d035404dba7","year":2001},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.523042Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:9d1e9e5925fd783ba2f9fa6c28be6e75ccbb8ec08b94b67d50a315aa92d19be0","observation_id":"2531d060-ac11-42fb-b542-f6535c759290","resolution":{"observed_at":"2026-08-10T22:41:16.037021Z","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-10T22:41:16.023179Z","title":"Combinatorial optimization and Green Logistics","venue":null,"work_id":"19eb70ec-29e7-4da0-a527-8346f3457dcc","year":2007},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.526558Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:b86cd379a9dc744a27611cf3aaa179f15369ef5ba32610f0d9331d1db2da92c1","observation_id":"c5e1f793-9a3b-4f21-ae22-b7ed87d88e50","resolution":{"observed_at":"2026-08-10T22:41:16.026708Z","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-10T22:41:16.013188Z","title":"Algorithms for quantum computation: Discrete logarithms and factor- ing","venue":null,"work_id":"9971aa07-b15a-4b33-a78d-cf64cd8635b3","year":1994},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.530434Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:d9525ccddaa408a65af7370b0eb9bc7cd6f9ee638111f118f6d9ae57f1826821","observation_id":"80333551-9273-4912-a59a-b5a7779a725e","resolution":{"observed_at":"2026-08-10T22:41:16.016415Z","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-10T22:41:16.003240Z","title":"Algorithms for quantum computation: discrete logarithms and fac- toring","venue":null,"work_id":"28742e46-d243-4069-9a82-79f94147481b","year":1994},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.534184Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:34b252f84d583840b6a41c5f96e6f2d68d01a50246730c1c40ff46678dbcfaff","observation_id":"17fb6086-efb3-4293-912b-bda04176692f","resolution":{"observed_at":"2026-08-10T22:41:16.006635Z","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-10T22:41:15.992995Z","title":null,"venue":null,"work_id":"1f1584c0-31a0-4c03-95bf-585fe8cb9da5","year":2004},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.537539Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:1a32a1a2f894dc673dfc2a183197fba1e7058deaca76d76f5fb988a380ff1d0c","observation_id":"d35a94e6-5d9e-431e-8b0b-036adeb76585","resolution":{"observed_at":"2026-08-10T22:41:15.996550Z","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-10T22:41:15.981936Z","title":"Genetic programming for quantum computers","venue":null,"work_id":"cabe6398-c1f5-4079-9bdb-e3a129761e5f","year":1998},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.540925Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:858642123f9fc571c2ead74094eb766e5d09181a7d311acb0946c919043df6ee","observation_id":"1e529f37-89c6-423f-9a0b-a3b4ac2cbe38","resolution":{"observed_at":"2026-08-10T22:41:15.986433Z","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-10T22:41:15.970408Z","title":"Finding a better-than-classical quantum and/or algorithm using genetic programming","venue":null,"work_id":"f276998d-eb98-4440-91dd-ee541d2c939f","year":1999},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.544160Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:9d866d79bc1ddc9fdce4b1c3c1a929bc5ca885b7c3be1caee12d50dec2115b80","observation_id":"286813f5-3113-4160-b0c2-854dfd728b8f","resolution":{"observed_at":"2026-08-10T22:41:15.974750Z","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-10T22:41:15.958502Z","title":"Quantum computing applications of genetic programming","venue":null,"work_id":"22174e6c-4693-4603-b559-8e3f1a4748f4","year":1998},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.548471Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:727f1dcd09820d9cbc17b16bbe08da900005077461efd370401cdd9185f3f27f","observation_id":"53fca53d-ff61-45fb-994f-1de5c1a58afe","resolution":{"observed_at":"2026-08-10T22:41:15.962414Z","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-10T22:41:15.552463Z","title":"Implementing Quantum Genetic al- gorithms","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.552463Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:60436bc4e8957c986553969513daeadac5136e891c6f8b461ae786ce780ecc71","observation_id":"0d121b62-27f3-46f9-b0b8-f9a431ae2a37","resolution":{"observed_at":"2026-08-10T22:41:15.552463Z","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-10T22:41:15.946861Z","title":"Quantum Networks for elementary arith- metic operations","venue":null,"work_id":"95c47d96-8c7f-48fa-9c5e-570c39a41f13","year":1996},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.555856Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:bcfe007aca975c2c9dd82d2f3344de3e16d99835d011f1d8d0b129f1089e0576","observation_id":"c98c9cec-5f72-4cf2-92c7-37eaffe9544d","resolution":{"observed_at":"2026-08-10T22:41:15.951477Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"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-10T22:41:15.560063Z","title":"Improved quantum ripple-carry addition circuit","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.560063Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:f8c04009102e02c89bfe807159cc6f56bacf756ddf000b6c08034bf6bd87a547","observation_id":"75f1add1-a489-4663-8788-ba09f3f4b986","resolution":{"observed_at":"2026-08-10T22:41:15.560063Z","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-10T22:41:15.936147Z","title":"An improved discrete Hopfield neural network for Max-Cut prob- lems","venue":null,"work_id":"11a0f5e4-86d9-45f6-bc2a-43c233a53a75","year":2006},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.563809Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:2c28d1a21c237fc45bd6b58ce3a4f6186fa75f24d50457ace62f27593435f938","observation_id":"b373620b-26ca-454c-87e0-36109f76f920","resolution":{"observed_at":"2026-08-10T22:41:15.939882Z","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-10T22:41:15.566659Z","title":"Quantum-inspired evolutionary algorithms: A survey and empirical study","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.566659Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:f7ff394c528e8a3615cb7b56841eac43fae7cade8c0d898bc5101f4507cfb25d","observation_id":"8cd65700-8295-4c2b-b962-828fd2b496c2","resolution":{"observed_at":"2026-08-10T22:41:15.566659Z","resolver_source":null,"status":"malformed_identifier"},"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-10T22:41:15.926251Z","title":"Qaoa-in-QAOA: Solving large-scale MaxCut problems on small quantum machines","venue":null,"work_id":"8d222580-7e9b-4012-aa17-e39cbfd49119","year":2023},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.569759Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:e04f35ee42d79f6fb2d1e6546eeacc9cb35c526052491b419d6f2fd85ad6f6d7","observation_id":"3ca07cb4-1288-4e47-9118-c6b80ca7192c","resolution":{"observed_at":"2026-08-10T22:41:15.929485Z","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-10T22:41:15.915997Z","title":"Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer","venue":null,"work_id":"c9dee04b-adb6-4579-b830-5ee1bd2ed18e","year":2022},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.572567Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:c720f953f041de89e0de5d72638090ed40c34c9cf3f15947077aed51050636dd","observation_id":"19f5a22b-71c6-4981-9b67-ee0a2a11142c","resolution":{"observed_at":"2026-08-10T22:41:15.919517Z","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-10T22:41:15.450916Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.450916Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:9fbaa15117322a30bb13aa182121ec76015a0bd742c42abc00a40543f474189f","observation_id":"31d4f899-7c2f-46df-bc90-4c9b5c175b40","resolution":{"observed_at":"2026-08-10T22:41:15.450916Z","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-10T22:41:15.490529Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem","version":1},"reference_index":2012,"source":"pdf_text","source_observed_at":"2026-08-10T22:41:15.490529Z"},"links":{"citing_paper":"/paper/2501.01058"},"observation_digest":"sha256:feadfd699420bd79c512a2f588fe13b862f1177fe402d19abc57cbee3840ee36","observation_id":"d704635f-c755-41bc-8e94-50691a38c4a5","resolution":{"observed_at":"2026-08-10T22:41:15.490529Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2501.01058","last_updated":"2025-01-02T05:06:16Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-14T07:24:11.030304Z","submitted_at":"2025-01-02T05:06:16Z","title":"A Quantum Genetic Algorithm Framework for the MaxCut Problem"},"reference_resolution":{"displayed":59,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":14,"verified_exact":5,"verified_fuzzy":38},"total_outbound_references":59},"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 59 of 59 outbound references and 0 inbound Pith citation observations for arXiv:2501.01058."}