{"as_of":"2026-08-18T11:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:0e4c5706bc0fceba615b6b9ff5eb068c60580f00ef59b43bfbdc03bef40d08ee","coverage":[{"denominator":64,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":64,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-09T23:48:17.976983Z","state":"measured"},{"denominator":64,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":64,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-18T06:34:40.430872+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/2502.12012/citation-record","integrity":"/paper/2502.12012/integrity","json":"/paper/2502.12012/citation-record.json","paper":"/paper/2502.12012"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:48:17.762673Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.762673Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:c75682ea6b5a32e6e199f8b6eb37335605301d88e83b25ee3400a39be55a65d4","observation_id":"2525ac7f-b4ab-4bce-9247-7caad91fd1a7","resolution":{"observed_at":"2026-08-09T23:48:17.762673Z","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":"10.1007/s11128-024-04286-0","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Quantum Information Processing","work_id":"bfeee78b-df12-4e73-92fc-743763af1943","year":2024},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.767073Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:36c39fef2e0f4de54adaa2c5f94cf36d211ea7e36fa616ec33388e53924a6784","observation_id":"1d2178b4-e469-4ad3-9975-008aadf8a3c2","resolution":{"observed_at":"2026-08-09T23:48:33.175359Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:04.009962Z","title":null,"venue":null,"work_id":"e367a08a-82ef-48d8-a24c-3a4c9ea9ef32","year":2005},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.771476Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:d45af0306549d385574311510d00186b379b967e6805133550435ef15b81f7e5","observation_id":"bb8fde7d-c046-4829-833c-d99a72102f58","resolution":{"observed_at":"2026-08-09T23:50:04.013185Z","resolver_source":"raw_fallback","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.775297Z","title":null,"venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.775297Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:93372a1bc1c37b4452a7d1f19e4e5668d52865f9a02217559ce6b96c874bc130","observation_id":"5d0a131b-aa19-4f2e-8713-ff000101b5f1","resolution":{"observed_at":"2026-08-09T23:48:17.775297Z","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-09T23:50:03.995975Z","title":null,"venue":null,"work_id":"50a03c44-56d0-4871-900e-73953534381c","year":2022},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.779388Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:446e5a98dddc5cc4969af12d94c87f29125060c2bc9157354569fdf89b66040b","observation_id":"a8589062-f100-4110-8aa4-1a996409c433","resolution":{"observed_at":"2026-08-09T23:50:03.999298Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2007.03488","last_updated":"2020-12-16T22:36:27Z","snapshot_observed_at":"2026-08-14T13:08:22.170216Z","submitted_at":"2020-07-07T14:20:26Z","title":"Benchmarking in Optimization: Best Practice and Open Issues","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2007.03488","snapshot_observed_at":"2026-08-09T23:48:17.782842Z","title":"Malan, Jason H","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.782842Z"},"links":{"cited_paper":"/paper/2007.03488","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:35cab6dab1a8179c63f72e6d654a4ef528af6a873f7292dba85820893e86022e","observation_id":"6bab795b-5d7a-4aac-b1bf-15429b04ebec","resolution":{"observed_at":"2026-08-09T23:48:17.782842Z","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-09T23:50:03.987613Z","title":null,"venue":null,"work_id":"8b2e9224-b9bc-4e45-aef0-e263d36d03cf","year":2019},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.786898Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:2b8e35f29e8016e41b9a860d787193f140d59aad8d40fb253666a82476f9efaf","observation_id":"909837a0-f73d-47fa-9980-8e004300c570","resolution":{"observed_at":"2026-08-09T23:50:03.990563Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.979464Z","title":null,"venue":null,"work_id":"5516cc81-c228-480b-8d70-a779497b39e9","year":1999},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.790215Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:c50147a8424fdadff8c3695f9f35ef0b5949310df95d969fca488a0cd629a5ca","observation_id":"4b9fe7ac-5721-46e2-b100-5e9cd4c32113","resolution":{"observed_at":"2026-08-09T23:50:03.982397Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.971042Z","title":null,"venue":null,"work_id":"7b7fdca8-9da8-40a6-8305-668a026a211d","year":2023},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.793547Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:f94ad1879575f6fb6afae17c642b26dba42bd9a73b9ceff49f276126c70d9826","observation_id":"f2bb2dd2-61ba-4187-ab09-25a055b9b123","resolution":{"observed_at":"2026-08-09T23:50:03.974018Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"9904.33403","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:50:03.785356Z","title":null,"venue":null,"work_id":"cf2f609b-b394-46cd-b786-ca12e7e352d4","year":2019},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.796901Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:0d21c49db409d4dcc39d5ecdb069e1675c3433092243a4bc3fc616498dcac054","observation_id":"ada64936-6d1c-49e9-b04f-13ee9f09f710","resolution":{"observed_at":"2026-08-09T23:50:03.790310Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06963","last_updated":"2021-10-31T16:26:37Z","snapshot_observed_at":"2026-08-16T18:45:47.309539Z","submitted_at":"2021-02-13T17:25:41Z","title":"Classical algorithms for Forrelation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2102.06963","snapshot_observed_at":"2026-08-09T23:48:17.799926Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.799926Z"},"links":{"cited_paper":"/paper/2102.06963","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:bb8614028e09c39c5d7bdea7effc5c18fd4d6138084d2b25fd722a78f3050119","observation_id":"27928035-5f05-4bb7-a8a7-f7e991438d44","resolution":{"observed_at":"2026-08-09T23:48:17.799926Z","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-09T23:50:03.962329Z","title":null,"venue":null,"work_id":"419f0d5a-050b-4098-9033-dbb15271c2ef","year":2020},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.803867Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:0ce7ca6d531e9e181d541210891fd077c3f07c2e46026a19ee609b33f5d6cfbc","observation_id":"cc2573a1-6d64-4df3-a0d7-ea22d365833c","resolution":{"observed_at":"2026-08-09T23:50:03.965336Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.954094Z","title":null,"venue":null,"work_id":"9a42f770-7dfb-4e6f-8099-0e447568e82e","year":2022},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.806985Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:dd9bf06fdad68bcd2261fe95e930cb651d0c66ce3c775e0d06014f86c3a4a406","observation_id":"17250f06-d78b-442e-91e5-d383cd93fb87","resolution":{"observed_at":"2026-08-09T23:50:03.957073Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.813782Z","title":null,"venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.813782Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:d139acbcf710d721c3eb5ab226b0dba4fb5988919430f0a430435f5c4c7e3646","observation_id":"24429948-d746-4204-851d-056a4b9f2e6f","resolution":{"observed_at":"2026-08-09T23:48:17.813782Z","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-09T23:50:03.944806Z","title":null,"venue":null,"work_id":"2f990c2e-cadc-4cc0-887e-7ee91b67ca78","year":2001},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.816888Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:c701bb5333efe803933d97fcdef7683abfb98eef23a2bd6fa6349a82d39d7c78","observation_id":"2ca25144-8396-44ea-a9c7-653266356c54","resolution":{"observed_at":"2026-08-09T23:50:03.947975Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.819795Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.819795Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:cefa34a6ce4150481a8a0d1f50b52f484bb3febee94e53ada88d2c9866f6a6a0","observation_id":"8d9f9fd2-531a-4375-be88-31574ee36e8f","resolution":{"observed_at":"2026-08-09T23:48:17.819795Z","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-09T23:48:17.822784Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.822784Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:681c7b8125c615ba8688dbfd86effff08df3fe4dcb489c8ae34c16b3753a0bab","observation_id":"61a8390f-2e7d-4186-af92-d6235df90556","resolution":{"observed_at":"2026-08-09T23:48:17.822784Z","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-09T23:50:03.935947Z","title":null,"venue":null,"work_id":"df94c589-a54d-4a81-a9d0-7c453f92aaaf","year":1960},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.825898Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:d259c2b7357af3e35eaf90fc52d943919ba9de8c597d0243556d1b99d8a5b1be","observation_id":"6972f3d4-32eb-4f4e-b1ef-7680a147c977","resolution":{"observed_at":"2026-08-09T23:50:03.939072Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.926941Z","title":null,"venue":null,"work_id":"579121cc-1ba6-4ca9-a89a-a03b3cea28c2","year":1996},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.829188Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:2877f8aad20f73f91c31f1d51480bf7afef7431a790d3cc44b931123eb409174","observation_id":"3e8452bf-d2d8-4729-94d3-2284978f4182","resolution":{"observed_at":"2026-08-09T23:50:03.930323Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09002","last_updated":"2020-04-20T00:48:02Z","snapshot_observed_at":"2026-08-16T05:57:40.479175Z","submitted_at":"2020-04-20T00:48:02Z","title":"The Quantum Approximate Optimization Algorithm Needs to See the Whole Graph: A Typical Case","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2004.09002","snapshot_observed_at":"2026-08-09T23:48:17.832183Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.832183Z"},"links":{"cited_paper":"/paper/2004.09002","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:c8748b1dd2ded56e487fad2dda1cadfb052b3fdb71ab52b893b53409158cea1e","observation_id":"81c679cb-132e-4c28-9a78-86cb7dfc2ba4","resolution":{"observed_at":"2026-08-09T23:48:17.832183Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-16T20:17:55.570300Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-09T23:48:17.835506Z","title":null,"venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.835506Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:97a290440ed61ce2a14ff860470503e58f8593811b1aeb6e589ddb642ad0298b","observation_id":"a9521236-434d-42d7-85f9-411d782b56c1","resolution":{"observed_at":"2026-08-09T23:48:17.835506Z","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":"10.1162/evco_a_00274","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Evolutionary Computation","work_id":"bd9e6725-a9e9-434a-af7f-ae8ab0899732","year":2021},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.839291Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:4c5d2c977f19142d815e9e52800b64484e4002b01a18bb5c9a90c3146949e48a","observation_id":"1d2e2047-ddd8-402f-a4d9-564ce519c9f6","resolution":{"observed_at":"2026-08-09T23:48:33.148835Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.842678Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.842678Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:0844da59e8188980f3cc581ae5ef440ab629dec1d1034ad28d58cf54d0590c3d","observation_id":"ef674cca-24e1-428e-82c0-0e1d1f8dc2a5","resolution":{"observed_at":"2026-08-09T23:48:17.842678Z","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-09T23:48:17.846444Z","title":"Goemans and David P","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.846444Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:f4611710fbe81fe9a6bcc48d5e9e5b07835b4a2ab137b193f51b6a499d13b3f4","observation_id":"2cef9740-86e0-4693-9da8-97597d4d4bdd","resolution":{"observed_at":"2026-08-09T23:48:17.846444Z","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":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:48:17.849732Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.849732Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:4337bbc80e6fb56c199b90c077d478340d2d849fadda471c64c2c3dcbb95b5b6","observation_id":"2bbaf460-742d-46b8-a290-b23cab21a677","resolution":{"observed_at":"2026-08-09T23:48:17.849732Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1604.00772","last_updated":"2023-03-10T09:45:23Z","snapshot_observed_at":"2026-08-16T12:36:28.312560Z","submitted_at":"2016-04-04T08:16:12Z","title":"The CMA Evolution Strategy: A Tutorial","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.00772","snapshot_observed_at":"2026-08-09T23:48:17.853192Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.853192Z"},"links":{"cited_paper":"/paper/1604.00772","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:823aa08a35ab18958a590c209355a24339ad1aed43cd3497546efb332af54239","observation_id":"e91ee7a9-1468-46d8-aed1-acf11161c3ea","resolution":{"observed_at":"2026-08-09T23:48:17.853192Z","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-09T23:48:17.857345Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.857345Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:19c3a95061d14dfb09597847ed745707312d5031d3076fc13bd455c7b7dce75d","observation_id":"258bd508-1818-43a9-aea5-3cc8b3b0ab8b","resolution":{"observed_at":"2026-08-09T23:48:17.857345Z","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-09T23:48:17.860648Z","title":"Müller, and Petros Koumoutsakos","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.860648Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:3afd52df99fc1192610ea4f2d008ea2ae588f641780bf16617078cf7cc29fad0","observation_id":"39d8e19b-6b2b-4117-a9e9-481c8a546619","resolution":{"observed_at":"2026-08-09T23:48:17.860648Z","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":"2008.92442","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-09T23:49:18.642202Z","title":null,"venue":null,"work_id":"0f8b072c-ea16-4d07-95eb-5536673a5996","year":2009},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.863744Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:96a351bda9efa725efb3a6430ac01586d435f86e6e4f54a4396018fcabbcc6c0","observation_id":"d1157b50-1807-49b1-9352-fa77af5fe056","resolution":{"observed_at":"2026-08-09T23:49:18.646719Z","resolver_source":"raw_fallback","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.866713Z","title":null,"venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.866713Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:1d9177975c780b2c5bd89ab687c0d76b49d221fd1c6081dcb3f13f2b0b4b961d","observation_id":"6c51dc0f-a895-4614-89fb-aa4aaeabf794","resolution":{"observed_at":"2026-08-09T23:48:17.866713Z","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":"10.26421/qic19.13-14-3","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Hastings","venue":"Quantum Information and Computation","work_id":"f53b3f45-d6b5-400d-a16e-2d54fb6013ce","year":2019},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.869782Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:bafd2886370a53aab886f5ee8bded67797929ea03dbdff3b1af906dc2269d47e","observation_id":"88a9003c-3854-46cf-b507-f4ea5e474eeb","resolution":{"observed_at":"2026-08-09T23:48:33.110789Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/s1052623497328987","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"SIAM Journal on Optimization","work_id":"06ad2034-eaee-4d4c-9178-bddf76a479c0","year":2000},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.872850Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:9637b85d3e8b3e24fb82716fdeb37cc2fe7940e7e3a03fdb79d760bb8f4b1bca","observation_id":"9210f552-ed22-4a00-b133-0181503127e8","resolution":{"observed_at":"2026-08-09T23:48:33.099591Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.48550/arxiv.2403.04468","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Yu, and Ming Zhang","venue":"arXiv (Cornell University)","work_id":"5c1e10f2-ed76-47b8-bc27-7c053540dab3","year":2024},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.875848Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:6600418b7d7de8ac6cdcfcb0ec7e11d8e5d3fa29fe6620becbf8f94fe2d87740","observation_id":"e5c7487f-18c8-4e24-8b01-419de2ba4ccf","resolution":{"observed_at":"2026-08-09T23:48:33.089697Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1312.6114","last_updated":"2022-12-10T21:04:00Z","snapshot_observed_at":"2026-08-14T23:50:45.029465Z","submitted_at":"2013-12-20T20:58:10Z","title":"Auto-Encoding Variational Bayes","version":11},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1312.6114","snapshot_observed_at":"2026-08-09T23:48:17.879167Z","title":"Kingma and Max Welling","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.879167Z"},"links":{"cited_paper":"/paper/1312.6114","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:3e5d12378f2ed05b3799a0162edfbb2e96314c7dddc6d7b1c2c7315a8e269dd7","observation_id":"4bcac3e4-03a7-4f1b-bfc0-c5f9a7f95d9b","resolution":{"observed_at":"2026-08-09T23:48:17.879167Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.07308","last_updated":"2016-11-21T11:37:17Z","snapshot_observed_at":"2026-08-14T21:29:27.927932Z","submitted_at":"2016-11-21T11:37:17Z","title":"Variational Graph Auto-Encoders","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.07308","snapshot_observed_at":"2026-08-09T23:48:17.882976Z","title":"Kipf and Max Welling","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.882976Z"},"links":{"cited_paper":"/paper/1611.07308","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:beb2fa8434050e1c514bf7d01d7e6b0402e77d9609b12e643ea64a64d324e7f9","observation_id":"ff2e7ce1-ec11-4ab3-af85-4dffcc236c0d","resolution":{"observed_at":"2026-08-09T23:48:17.882976Z","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":"10.1007/3-540-16486-3_99","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":null,"venue":"Lecture notes in computer science","work_id":"d70b4c49-472c-40a7-8e9b-08e0c8f90335","year":1986},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.886434Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:842d8ee94c6984f32e0f1279ab03047dc7da63df7e1a8e3564a6f42adc7c42af","observation_id":"264aaf19-d9c8-476d-8ee7-3aca57db9668","resolution":{"observed_at":"2026-08-09T23:48:18.049451Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1604.07269","last_updated":"2016-04-25T14:17:08Z","snapshot_observed_at":"2026-08-14T22:00:14.996457Z","submitted_at":"2016-04-25T14:17:08Z","title":"CMA-ES for Hyperparameter Optimization of Deep Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1604.07269","snapshot_observed_at":"2026-08-09T23:48:17.889661Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.889661Z"},"links":{"cited_paper":"/paper/1604.07269","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:c9d7e840962769fdb60e38e8ed3169ffbac978dfcce93592790932584cd5df7a","observation_id":"2f529921-f641-4d95-a4ed-cb08c079384f","resolution":{"observed_at":"2026-08-09T23:48:17.889661Z","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-09T23:48:17.894013Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.894013Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:a898c19bb36ac61ce6fc44645c9f818e8733734598f07ed09798aa6a43e71f06","observation_id":"47d7ba7f-984a-4902-848b-20c41a5a2bbf","resolution":{"observed_at":"2026-08-09T23:48:17.894013Z","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-09T23:48:17.897363Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.897363Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:257161a778ef8b857e187e6dc5a3b8687da8ea76a59bfc0ef2e27264026b4c21","observation_id":"aaa2ef44-c70b-4591-ba26-51f74c1902d3","resolution":{"observed_at":"2026-08-09T23:48:17.897363Z","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-09T23:50:03.918585Z","title":null,"venue":null,"work_id":"47ff55b5-4cbb-410d-b902-2a9d1128ed9e","year":2019},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.900775Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:522ae6cb8e82aabfda769925acd71898c31ef58a51dafedc4fb66b6891aa1ff3","observation_id":"a38ff69b-63ab-4ac1-ab28-0cdd03e63f14","resolution":{"observed_at":"2026-08-09T23:50:03.921644Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.909614Z","title":null,"venue":null,"work_id":"0c40ecdf-71a5-4139-9514-baec61075ac9","year":2018},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.904081Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:a9b7e4e8c4db987d902188a02d2cb5e05e82886badb92b52048a78b15647b9f2","observation_id":"1c50e8e2-fd2d-4b29-9b27-bbf34f795da6","resolution":{"observed_at":"2026-08-09T23:50:03.912868Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1810.10538","last_updated":"2018-10-24T16:10:44Z","snapshot_observed_at":"2026-08-14T18:09:54.092197Z","submitted_at":"2018-10-24T16:10:44Z","title":"The dual-Barab\\'asi-Albert model","version":1},"cited_work":{"arxiv_id":"1810.10538","doi":null,"metadata_source":"pith","pith_arxiv_id":"1810.10538","snapshot_observed_at":"2026-08-09T23:49:18.325825Z","title":"The dual-Barab\\'asi-Albert model","venue":"physics.soc-ph","work_id":"af84f2a8-11e6-4daa-b1b5-7c63ff2fb7d6","year":2018},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.907167Z"},"links":{"cited_paper":"/paper/1810.10538","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:2ac087a5ac29e5c414b5845c2e70f959d05c1951c578d4c6ed0bde17be1353d5","observation_id":"fc1213b1-900b-4632-b778-745e3ce1ec76","resolution":{"observed_at":"2026-08-09T23:49:18.329777Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.900126Z","title":null,"venue":null,"work_id":"c9025d2b-9c10-491e-a877-a97daca79062","year":2020},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.911389Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:71c1b08ea275dcc525a06da65d693670b506c1c5326c7dcecd5bad589524799e","observation_id":"87b1381d-8945-48d2-9fff-8c3679799931","resolution":{"observed_at":"2026-08-09T23:50:03.903493Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.914641Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.914641Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:6896d01bd6fb339ca20a40dcb5c3c3502fd216cf141e5fb9a90eac1dff48ece5","observation_id":"06cc2c92-c685-4cd8-be85-a3e322ef397c","resolution":{"observed_at":"2026-08-09T23:48:17.914641Z","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-09T23:50:03.890538Z","title":null,"venue":null,"work_id":"4774e499-b237-41ce-8af8-6b2a2dd20f34","year":1999},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.917796Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:6964e09d0f3113444b2c9ba6780e1b2b6a0a91344c13dccdcb2e522da4873950","observation_id":"3a852508-682f-484d-8631-70056d8c6383","resolution":{"observed_at":"2026-08-09T23:50:03.893808Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.920844Z","title":"Olson, Nathan Bartley, Ryan J","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.920844Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:9c54578f860607228fd50f618c17704426e7d8f592f6303540c5ed311cd4a0de","observation_id":"d72c8d13-22d1-460b-bc47-b4283210867d","resolution":{"observed_at":"2026-08-09T23:48:17.920844Z","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":"10.5281/zenodo.14757739","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Patel, Aneta Neumann, Frank Neumann, Thomas Bäck, and Hao Wang","venue":"Zenodo (CERN European Organization for Nuclear Research)","work_id":"20670f12-7712-40d6-8080-7de469856c54","year":2025},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.923896Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:89c965a7ff3e13cfcb2a69e8a712a774e36122eb15cba0927aa8514e22634c5e","observation_id":"d4dbd549-f1eb-492b-a9c1-27fd0348e99e","resolution":{"observed_at":"2026-08-09T23:48:18.034270Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.927334Z","title":"Papadimitriou and Mihalis Yannakakis","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.927334Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:3199fefa5f7dcac5996e6a23f0891b3ad4c0c2a2b75d9b1546058326cff07425","observation_id":"3138da6a-7bb7-429f-8f93-e0ae5c09678c","resolution":{"observed_at":"2026-08-09T23:48:17.927334Z","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-09T23:50:03.881548Z","title":null,"venue":null,"work_id":"150df3c4-44d4-4c7c-9fbd-8abf924ae6a0","year":2024},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.930555Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:8598bddff6a138a209359961a31c054f176c6e98209d816ee01548792f9e4a16","observation_id":"383f6059-2d81-4dc6-a96e-75da3c7ea40f","resolution":{"observed_at":"2026-08-09T23:50:03.884841Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.933617Z","title":null,"venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.933617Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:752a5b6c2a37467f782a5fcb1fba2b0b156b69bd0eec895d320d07c9fc2c409c","observation_id":"89cee01b-140d-4b81-8cce-a9a2807f978f","resolution":{"observed_at":"2026-08-09T23:48:17.933617Z","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-09T23:48:17.936991Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.936991Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:6d314563e3fd8b5ef0cab409eae2d6ff86c0ff47325a6b08d23594fb3e729d20","observation_id":"1d86cdfa-9f94-451a-937b-69eab12af7f0","resolution":{"observed_at":"2026-08-09T23:48:17.936991Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1703.03864","last_updated":"2017-09-07T23:28:48Z","snapshot_observed_at":"2026-08-14T21:12:24.197125Z","submitted_at":"2017-03-10T23:02:19Z","title":"Evolution Strategies as a Scalable Alternative to Reinforcement Learning","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1703.03864","snapshot_observed_at":"2026-08-09T23:48:17.940099Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.940099Z"},"links":{"cited_paper":"/paper/1703.03864","citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:994fb0f855f86c6b5b1f7cee99673dd89f873a5d39fe7bb2c2493b5bb9e3e2a3","observation_id":"361b7e5e-ccdf-420c-922e-1ac9b64083a3","resolution":{"observed_at":"2026-08-09T23:48:17.940099Z","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-09T23:48:17.943425Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.943425Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:3c7b95845bd586ae807a738bda14539412209b3f0a1e91f3970db264a063fc59","observation_id":"14bf9d95-6302-4802-a68a-1fc0a898a57d","resolution":{"observed_at":"2026-08-09T23:48:17.943425Z","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-09T23:50:03.871470Z","title":"Sutherland, and Ali Kemal Sinop","venue":null,"work_id":"4a2234e9-753b-4cda-acce-719c186b1603","year":2023},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.946614Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:56250d4cc98ea95cb1eab8824c0798fa6a13e5a0b4e97f35d25d922fb92c20c1","observation_id":"0ec44a35-743a-44ab-8887-b72ed1a5d057","resolution":{"observed_at":"2026-08-09T23:50:03.875148Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.861487Z","title":null,"venue":null,"work_id":"fd2dea6e-8dcc-4729-90d4-348a23df96a2","year":2018},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.949896Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:88dc87f5760c30854563442e6067dfd7fdd8e5e7f2c2554962c1a67a9ae2ab84","observation_id":"bd81cccd-a3ef-442c-9fa1-bb0af9142581","resolution":{"observed_at":"2026-08-09T23:50:03.865067Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.851744Z","title":null,"venue":null,"work_id":"672fc90a-728e-49c7-b014-365b970442af","year":1999},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.957128Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:14c6d13ca43a4eab78873698a9d25be5b08846a166766ea834e4a22aef79e847","observation_id":"1c3e1259-5edf-41d9-84b9-71f46b8c5080","resolution":{"observed_at":"2026-08-09T23:50:03.855437Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.960647Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.960647Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:e26740518e9e71248dccc44e332d87694f3f130382e0c585bd00d5244f92a70d","observation_id":"4d103da0-f077-4e0d-bbc1-13d8f225f7d9","resolution":{"observed_at":"2026-08-09T23:48:17.960647Z","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-09T23:50:03.836593Z","title":null,"venue":null,"work_id":"8da9a204-cc3d-4144-a91c-12a2f4e8d3c7","year":2021},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.963812Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:628b558a404bd715ba49c54b8190c4119a3b7d499056bb7a8ae5a298f045c2f2","observation_id":"6b3ff369-a701-4c91-b27a-6d7163814984","resolution":{"observed_at":"2026-08-09T23:50:03.839876Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.969710Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.969710Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:429ff68a044090d27de1093ca603e26c2bb9934458899437ba5ce29e1ea487ca","observation_id":"fa035c62-937f-41fb-ad33-4a84dca8c9ca","resolution":{"observed_at":"2026-08-09T23:48:17.969710Z","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-09T23:50:03.814637Z","title":"Hamilton, and Jure Leskovec","venue":null,"work_id":"066f5360-4702-4c71-957c-41cdd6ba3673","year":2018},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.973977Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:b4785807e19b53ad39ef7fee1d1c1756e62a0a881954c980ff681a65975c66c2","observation_id":"02208002-2fad-4ae1-91dc-8b487e02783b","resolution":{"observed_at":"2026-08-09T23:50:03.817918Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:50:03.805396Z","title":null,"venue":null,"work_id":"124f451d-ce4a-471f-a214-9634380d949c","year":2022},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.976983Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:87855946b11607bf77ed581b1716b4e0dac1b26a6693c3f61cfbafbdc0ed7951","observation_id":"c6eaf774-0e3e-457c-9186-39663ed5eed7","resolution":{"observed_at":"2026-08-09T23:50:03.808698Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+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-09T23:48:17.952912Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":422,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.952912Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:e37e8b01ef1f439c62a799cda3d58c30c544a65cb7a97bf1b3dc77662221e847","observation_id":"4a27c1d6-217c-4d11-9fac-16d10c6965c0","resolution":{"observed_at":"2026-08-09T23:48:17.952912Z","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-09T23:48:17.810706Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":678,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.810706Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:61ea68886ff99db5ca74428b703fceba6c3b4c76b186a540eda3e40cbac1d90f","observation_id":"2ecd5376-d78f-425f-8114-3bbfeb552ea9","resolution":{"observed_at":"2026-08-09T23:48:17.810706Z","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-09T23:50:03.823975Z","title":"https://proceedings.neurips.cc/paper/2021/hash/ 4f3d7d38d24b740c95da2b03dc3a2333-Abstract.html","venue":null,"work_id":"c3ba3bc3-ab95-43b4-a6cd-26885d2d6f2b","year":2021},"citing_paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms","version":3},"reference_index":2021,"source":"pdf_text","source_observed_at":"2026-08-09T23:48:17.966818Z"},"links":{"citing_paper":"/paper/2502.12012"},"observation_digest":"sha256:b69607a59f2a9e4f1ff430e954c8f18864ab042a11be3b90529c5d8ad944c23b","observation_id":"a1d22432-4617-4c99-a5c9-9a2da067b8f7","resolution":{"observed_at":"2026-08-09T23:50:03.827405Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2502.12012","last_updated":"2025-06-03T10:03:19Z","latest_version":3,"primary_category":"cs.ET","snapshot_observed_at":"2026-08-18T07:39:13.049716Z","submitted_at":"2025-01-30T14:32:06Z","title":"Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms"},"reference_resolution":{"displayed":64,"state_counts":{"malformed_identifier":3,"metadata_mismatch":2,"parse_uncertain":0,"unresolved":48,"verified_exact":8,"verified_fuzzy":3},"total_outbound_references":64},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 64 of 64 outbound references and 0 inbound Pith citation observations for arXiv:2502.12012."}