{"as_of":"2026-08-12T12:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5c353769ec6da8722e02caee6afd630c6ddd6eb6d15b2d34afeee04df5ef9418","coverage":[{"denominator":83,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":83,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-02T21:01:18.401282Z","state":"measured"},{"denominator":84,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":84,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-12T06:34:41.77262+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-10T12:29:52.721186Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-10T12:37:04.282118Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"cited_work":{"arxiv_id":"2602.21689","doi":null,"metadata_source":"pith","pith_arxiv_id":"2602.21689","snapshot_observed_at":"2026-07-10T12:37:04.282118Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","venue":"quant-ph","work_id":"0b105162-cbfa-44cd-a025-5d02da6d71bd","year":2026},"citing_paper":{"arxiv_id":"2607.08138","last_updated":"2026-07-09T06:19:12Z","snapshot_observed_at":"2026-08-06T11:18:04.150190Z","submitted_at":"2026-07-09T06:19:12Z","title":"Adaptive Qubit Freezing Enables Robust Graph Partitioning for Divide-and-Conquer QAOA","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-10T12:29:52.721186Z"},"links":{"cited_paper":"/paper/2602.21689","citing_paper":"/paper/2607.08138"},"observation_digest":"sha256:0480418afa705d42478872933147c89c628a7b9c3cc0eac91300b5fd0e7b21e1","observation_id":"8c99de3e-3679-4461-95ed-585ceb66f6e4","resolution":{"observed_at":"2026-07-10T12:37:04.283752Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2602.21689/citation-record","integrity":"/paper/2602.21689/integrity","json":"/paper/2602.21689/citation-record.json","paper":"/paper/2602.21689"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-02T21:01:09.744511Z","title":"The objective is typically encoded in a cost HamiltonianH C, which is diagonal in the computational basis","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:09.744511Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c6d965e38822c21b111b262208569eec54d94112d091f5897fcddec56ae2258a","observation_id":"a664f197-5a72-44ef-b38b-0fdb127aaefc","resolution":{"observed_at":"2026-08-02T21:01:09.744511Z","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-02T21:01:09.830733Z","title":"As shown in Fig","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:09.830733Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:64fe6e67652f4cb3107477499f78767759ef16fc8066a4ff11d79b3882c58e0f","observation_id":"9b7ce61f-e26b-4378-b862-34a92cfdc25c","resolution":{"observed_at":"2026-08-02T21:01:09.830733Z","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-02T21:01:09.960885Z","title":"hotspot” nodes with high degree centrality (Fig. 9(a)). By “freezing","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:09.960885Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:7c5c7e52fdad212e9ed25ff7dca8ef0a8e1ed56eb0f02428624d46e5643f27bd","observation_id":"842b758b-ebf2-43cf-a545-a513d8c6fa6c","resolution":{"observed_at":"2026-08-02T21:01:09.960885Z","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-02T21:01:11.708864Z","title":"Parisi, Infinite number of order parameters for spin- glasses, Physical Review Letters43, 1754 (1979)","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.708864Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:2d1f1256f456a7f6a9cc4c57bf337a8d0ae8007726828207d910b2235a49650b","observation_id":"e9120e5b-6940-41b6-b991-d0d6fafe98f2","resolution":{"observed_at":"2026-08-02T21:01:11.708864Z","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-02T21:01:10.232452Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.232452Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c83bcbfe54c8dbdc8ce7708cd87e4cb988359b3f310ac0f8330835c72b5902f9","observation_id":"49c62751-d754-4c3a-9ca1-b874e1bcd04f","resolution":{"observed_at":"2026-08-02T21:01:10.232452Z","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-02T21:01:10.354865Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.354865Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:94702902c5da7d3d5264c18be8332ff338b41f12d009eba66b936b879ddd8170","observation_id":"cc4bfb82-1bad-46f2-a52a-51d0b99c4291","resolution":{"observed_at":"2026-08-02T21:01:10.354865Z","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-02T21:01:10.444935Z","title":"The bound simplifies to: Deviation≤2 X i∈N(k) |Jki|,(B3) whereN(k)are the neighbors of qubitk","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.444935Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c502d5528b00326d6df3e004db44b7b6010da5caa99e8496ad1b8005f5057b12","observation_id":"6ee4998a-cdd0-4a07-acc1-5fcd4845b89c","resolution":{"observed_at":"2026-08-02T21:01:10.444935Z","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-02T21:01:10.580050Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.580050Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:8cb7d71e859c48e20f6fbe1e83f68d5e6cc987eeace5ed370ab8d5bfa30b31ff","observation_id":"3355bb75-731c-4637-a022-00b2cff0dc84","resolution":{"observed_at":"2026-08-02T21:01:10.580050Z","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-02T21:01:10.669912Z","title":"This justifies theO(1)transfer of optimal parameters(γ ∗, β∗)","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.669912Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:b3ad60fc674599cf983b0f7e7f6cc8ee7555f39942ddf1bc9c0e1b5f9e7cb1ed","observation_id":"7094c8ca-801b-4fcc-b532-5fa0c66bcb5e","resolution":{"observed_at":"2026-08-02T21:01:10.669912Z","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-02T21:01:10.746279Z","title":"The experiments were conducted usinganoisemodelderivedfromtheFakeBrisbaneback- end to simulate realistic NISQ conditions [55]","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.746279Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:f1985734e5f26b89dbcc01a126df03c6acf67b5a3dbf6dd55c4c567c074fb5c4","observation_id":"12ba61dd-0920-4eb2-9717-f571af4c7420","resolution":{"observed_at":"2026-08-02T21:01:10.746279Z","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-02T21:01:10.147744Z","title":"Existing methods treat these as2m unrelated optimization problems, requiring2 m independent train- ing loops","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.147744Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:ebc6570265973001b5d859f3793fee7a2a493775a0bf552ea1ae7f0610013475","observation_id":"b5208f50-1324-4a3f-8fff-153f22815adf","resolution":{"observed_at":"2026-08-02T21:01:10.147744Z","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-02T21:01:10.853430Z","title":"Shortcut","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.853430Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:dfe8c7eec001979b3f3cb036b052a800490b1e54b7eb9b2d5c5091568e78d496","observation_id":"fc630ea8-9ee6-4596-a898-02a154719109","resolution":{"observed_at":"2026-08-02T21:01:10.853430Z","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-02T21:01:10.938697Z","title":"noise floor","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:10.938697Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c760247fc5ce397ff92418d74771aedfb96eb723835ae7288d2455f7e2a1d132","observation_id":"25019d8e-e58f-4623-9bf6-7112e77f6a30","resolution":{"observed_at":"2026-08-02T21:01:10.938697Z","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-02T21:01:11.056273Z","title":"Instead, the increased gate count and circuitdepthintroduceadditionalnoisechannelsthatcan degrade solution quality and hinder convergence","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.056273Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:26e135966164b1a8413eed64bc28ba27f6ce01789221b324101257a568c98756","observation_id":"c339c97c-0810-4c7f-a402-8f6e3248cd32","resolution":{"observed_at":"2026-08-02T21:01:11.056273Z","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-02T21:01:11.142663Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.142663Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:d85c2a09d4548e775c99f64ef5954f5143afae1aaeac9f8f3ce96a56b3e5e549","observation_id":"eada92e3-2eb7-4009-b400-90aa1a0f876e","resolution":{"observed_at":"2026-08-02T21:01:11.142663Z","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-02T21:01:11.250840Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.250840Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:1a2468cf94627708d0cbd145de462e241b0b00fb661e89a0833125d6ed6c505d","observation_id":"d5432d5b-7535-4ed6-8437-7555a0a2264e","resolution":{"observed_at":"2026-08-02T21:01:11.250840Z","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-02T21:01:11.344387Z","title":"Kandala, A","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.344387Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:8535f9d0a45164729cc8cd6820f1b92fcdc3e096f52cc600836ee725e9f2c3f2","observation_id":"5ee274d4-294c-44e2-bb67-cee013c6be9e","resolution":{"observed_at":"2026-08-02T21:01:11.344387Z","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-02T21:01:11.471292Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.471292Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:3ade4de13119aaede63d1748cde9d8842a3574fbfcc9830b68edcd501c48fe8b","observation_id":"3c855b39-8ebf-43ea-bbbf-c05fb1708da7","resolution":{"observed_at":"2026-08-02T21:01:11.471292Z","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-02T21:01:11.639350Z","title":"Ayanzadeh, N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.639350Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:b2c08df06b8c23e217878f69116056f3c8d1b4fc1e7476b17226cd00ce61caf4","observation_id":"646bbce0-ce3b-429c-a26a-f593f9b26142","resolution":{"observed_at":"2026-08-02T21:01:11.639350Z","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-02T21:01:11.832215Z","title":"Kirkpatrick, C","venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.832215Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:e5f82c0d79705cfe667f3a7e4cfe6bed39b565312a3b713bdd8f278b07d4e2b4","observation_id":"81b66f8f-d60a-4c10-95e2-e69fd82df5a5","resolution":{"observed_at":"2026-08-02T21:01:11.832215Z","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-02T21:01:11.949739Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:11.949739Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:01d93fea0300b8ad58e77540481f331f86e8d1dd2ded075ae9cf79289f05441a","observation_id":"d288790c-9b1a-40ce-9cd8-e383ca80926c","resolution":{"observed_at":"2026-08-02T21:01:11.949739Z","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-02T21:01:12.065572Z","title":"Bengio, Identifying and attacking the saddle 20 point problem in high-dimensional non-convex optimiza- tion, Advances in neural information processing systems 27(2014)","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.065572Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:551eef186ca16bedb8e9c36099d0db76d1fc17e515e674fed0c7072b3453702a","observation_id":"bef919ea-ccab-4500-b2d7-7c17ef11639c","resolution":{"observed_at":"2026-08-02T21:01:12.065572Z","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-02T21:01:12.189141Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.189141Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c4699bbb2989aebe829def7e200da616b482feabbd38f76bebcd596b4db8bbe1","observation_id":"4711d0f0-dd63-4f6e-a45f-6db4b014c16e","resolution":{"observed_at":"2026-08-02T21:01:12.189141Z","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-02T21:01:12.316928Z","title":"Larocca, N","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.316928Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:b4db18717e9b38abd3ef62a59a7ae354d23e72e9bbd81aa84546fc8bd05cddbc","observation_id":"53574541-8e94-44e4-9c44-713dc37bddd4","resolution":{"observed_at":"2026-08-02T21:01:12.316928Z","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-02T21:01:12.418030Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.418030Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:adbff3b453c7ae703692c3fad3a38214d2d72eab1bbbe891ac243d0c1a0230bf","observation_id":"cb947e0d-f7b7-4dd1-b8bd-1897dfcdb538","resolution":{"observed_at":"2026-08-02T21:01:12.418030Z","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-02T21:01:12.546688Z","title":"Galda, X","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.546688Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:e4283d1ee8ebf84f3d42ccdb3343ad414a67b93b3e54d620511866053de9b119","observation_id":"2bdad843-8fd8-4ee0-adde-ae7c1abb517d","resolution":{"observed_at":"2026-08-02T21:01:12.546688Z","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-02T21:01:12.660721Z","title":"Shaydulin, P","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.660721Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:5059aeca28a6844da0b1f87063294bfee7c2fd8837307656578730fa8654306d","observation_id":"8dfbbc81-55cd-4285-b957-1b3481af4a37","resolution":{"observed_at":"2026-08-02T21:01:12.660721Z","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-02T21:01:12.722988Z","title":"Wurtz and D","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.722988Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:53d4212abffd02a1ed7b19009be369ccf31be445288d4fafaba6a19d20393c87","observation_id":"1eb5f5c3-890a-4899-b0a9-875e98e40ed5","resolution":{"observed_at":"2026-08-02T21:01:12.722988Z","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-07-06T04:00:38.324755Z","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-02T21:01:12.790085Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.790085Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:853a1fcf036d6a35625475ca437a21846067e6de7a014f7422356eb3295d8ffd","observation_id":"d8cb61fc-d8fd-45b5-9bc3-113e37a8a0c0","resolution":{"observed_at":"2026-08-02T21:01:12.790085Z","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-02T21:01:12.856533Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.856533Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:f5efedca687054c30de22b318019bcafdde673aa4602bd34601b4b9268d57999","observation_id":"f0a31b41-0511-4f8f-a049-e32b1c5e2190","resolution":{"observed_at":"2026-08-02T21:01:12.856533Z","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-02T21:01:12.928258Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:12.928258Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:98d4c634ca3f3b2c2bbe043dac84e7ceb470e0ed08a1b952295f4d170a23ee7a","observation_id":"88a6a8c1-82a2-4cfc-92f0-1f74b41c153c","resolution":{"observed_at":"2026-08-02T21:01:12.928258Z","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-02T21:01:13.038716Z","title":"Preskill, Quantum Computing in the NISQ era and beyond, Quantum2, 79 (2018)","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.038716Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:148f880a9384aee7027df7cedb25f72d10ce5cc8e819144c2bb78ce6dfbebb4f","observation_id":"749138ab-774b-48d6-accb-7deafb8c421f","resolution":{"observed_at":"2026-08-02T21:01:13.038716Z","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-02T21:01:13.135749Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.135749Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:07b4bb03bf11c324ceb1c452f8928cdd5c069833ea61436586728963aebd7380","observation_id":"8aca7a55-6c56-46c7-82c7-47690a8a40cf","resolution":{"observed_at":"2026-08-02T21:01:13.135749Z","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-02T21:01:13.238409Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.238409Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:5934a90129008ebba96c82dfb69482017fe88459ec5917dbec7668cd8594a767","observation_id":"b59cf083-cc6f-42b0-9f09-9ebadfa9c63f","resolution":{"observed_at":"2026-08-02T21:01:13.238409Z","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-02T21:01:13.345885Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.345885Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:d9cf46d383786c0e2e114dbbe323f34000b17847371dc66fda17b843a1425551","observation_id":"6f13bf11-9c55-413e-b845-084da0af8898","resolution":{"observed_at":"2026-08-02T21:01:13.345885Z","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-02T21:01:13.494538Z","title":"Mézard, G","venue":null,"work_id":null,"year":1987},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.494538Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:4a8719eb3f9b0972db0b71fadf988caf623ce781f48b4f94081e1e1c4a46fd39","observation_id":"fa259ec3-44b8-4a38-a785-37efb65fb64a","resolution":{"observed_at":"2026-08-02T21:01:13.494538Z","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-02T21:01:13.577966Z","title":"Carmona and Y","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.577966Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:75ecc246ac0be3e3a80e6f7db787271474839cc4a462069e8cc7294f63ea1cff","observation_id":"2c3ef5fc-9e08-46d9-b845-120d0cba2899","resolution":{"observed_at":"2026-08-02T21:01:13.577966Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1812.04170","last_updated":"2018-12-11T01:03:58Z","snapshot_observed_at":"2026-08-03T15:33:14.715290Z","submitted_at":"2018-12-11T01:03:58Z","title":"For Fixed Control Parameters the Quantum Approximate Optimization Algorithm's Objective Function Value Concentrates for Typical Instances","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1812.04170","snapshot_observed_at":"2026-08-02T21:01:13.674551Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.674551Z"},"links":{"cited_paper":"/paper/1812.04170","citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:5882b184807b461789ae1b0ac9a0772dd272950b7df12e6d0c6d1f8da79ebfbd","observation_id":"098f742c-37af-4d59-80a4-3b9befe02901","resolution":{"observed_at":"2026-08-02T21:01:13.674551Z","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-02T21:01:13.757777Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.757777Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:3527ceb05714aff75c783002f5831cd90d431c15e4bc47793cd7905f1a6313c6","observation_id":"b13052a9-fe12-4140-bd0f-14db43a3fd35","resolution":{"observed_at":"2026-08-02T21:01:13.757777Z","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-02T21:01:13.847189Z","title":"Bravyi, M","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.847189Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:3d360ff51f1a9f4dd7a74e89606080988b32cc469fc9c92647853278ac4ac8c8","observation_id":"62aa725e-f014-475a-8fd9-c7310ce7ac1f","resolution":{"observed_at":"2026-08-02T21:01:13.847189Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2004.09002","last_updated":"2020-04-20T00:48:02Z","snapshot_observed_at":"2026-08-10T16:52:45.931674Z","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-02T21:01:13.962153Z","title":"Farhi, D","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:13.962153Z"},"links":{"cited_paper":"/paper/2004.09002","citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:677fb723b33400b5cf55fc477754f9fcaa5433c39c7e8bd40297d1f7ad4f96c4","observation_id":"a44f9f78-beb5-4cfe-8aee-c2de1e6a1ef3","resolution":{"observed_at":"2026-08-02T21:01:13.962153Z","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-02T21:01:14.048959Z","title":null,"venue":null,"work_id":null,"year":1972},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.048959Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:4649c64178e89471713c8fbc92674fa108a83efbe4e390ceaa4f5d47e2cc7cc9","observation_id":"8c937f7d-ae9d-4c6c-8644-3373d10ab893","resolution":{"observed_at":"2026-08-02T21:01:14.048959Z","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-02T21:01:14.139647Z","title":null,"venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.139647Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:be4fff200a42c3dd3c5c33dabff57932a321809a8a802f6d1f83374a5c21b83a","observation_id":"58b2a38e-31fb-4daa-b9c3-55b9bdce18ab","resolution":{"observed_at":"2026-08-02T21:01:14.139647Z","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-02T21:01:14.247468Z","title":null,"venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.247468Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c37b51a1c8b48a656cbbc4ad6112d0b3276acacdca4b8acfbc2cbca5dfd0c017","observation_id":"2f0e4508-b62d-4b50-b9c7-8e1cf3ecbf1f","resolution":{"observed_at":"2026-08-02T21:01:14.247468Z","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-02T21:01:14.337834Z","title":"Clauset, E","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.337834Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:e09cdf05fde908458938c19dea3d64be92ae9ce3628a75017bcc96d865987dfb","observation_id":"e9c2d9c0-6d9b-490a-901c-501202ac98df","resolution":{"observed_at":"2026-08-02T21:01:14.337834Z","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-02T21:01:14.438994Z","title":null,"venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.438994Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:b080228c08bf90e9af87e3ff5f0252ea1fe52a066af510ca30f32f3f36c985b5","observation_id":"4bb5b9ab-bb2a-49e7-931b-765451978e20","resolution":{"observed_at":"2026-08-02T21:01:14.438994Z","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-02T21:01:14.531977Z","title":"House, J","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.531977Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:8f7568b33129bbdc1152974832308a94dd9c14ef9b440143498fee745ab76137","observation_id":"cca3a966-d66d-47be-a1da-9ebe874f5ab1","resolution":{"observed_at":"2026-08-02T21:01:14.531977Z","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-02T21:01:14.615612Z","title":"Mislove, M","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.615612Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:2e73d7d27cfa65a3b9f028a83eb8cecdd96de2ce981cf84a407d569f227a322c","observation_id":"2078d6d7-b5dc-4d7d-8636-f315d02797c5","resolution":{"observed_at":"2026-08-02T21:01:14.615612Z","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-02T21:01:14.703771Z","title":"Pastor-Satorras, C","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.703771Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:b0555b916dbfff2bd6e5e76010f96c67fc5ee463d601543590be58a0b8ad5014","observation_id":"90103d9c-de32-41f2-ad11-f89cea28e0bc","resolution":{"observed_at":"2026-08-02T21:01:14.703771Z","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-02T21:01:14.785684Z","title":"Meghanathan, Complex network analysis of the con- tiguous united states graph., Comput","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.785684Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c0d7f253f50e7cea20ee8781cf68423fd2d4e99af955578efbc4acfa185e0cc1","observation_id":"8673dba7-a409-44ac-a18a-363d328c4641","resolution":{"observed_at":"2026-08-02T21:01:14.785684Z","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-02T21:01:14.863426Z","title":"Gamermann, J","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.863426Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:e87fe3d0d891c96b95bc42ce1624ce16c9050215de46d696d944561e51140dea","observation_id":"f2b13ab9-fe58-49bb-a9df-de64e26e81ac","resolution":{"observed_at":"2026-08-02T21:01:14.863426Z","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-02T21:01:14.931050Z","title":"Barabási and R","venue":null,"work_id":null,"year":1999},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:14.931050Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:e9fc45f6c5d402f6353b6eb366ab3a87e44da4c58dab89403170e7672a817feb","observation_id":"fa8e5102-dc4a-4975-adef-da3453a1417d","resolution":{"observed_at":"2026-08-02T21:01:14.931050Z","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-02T21:01:15.044098Z","title":"Basso, E","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.044098Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:28371e8d8d607f3f33a5504a3769d259fdc073db18a22453b3a96ee2467505da","observation_id":"bffad46c-b645-4694-ac9e-52a4f059e56e","resolution":{"observed_at":"2026-08-02T21:01:15.044098Z","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-02T21:01:15.163230Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.163230Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:12127b902023a1c039a724d542186eb8381fe07c1b524aa64ca00771d159ad1e","observation_id":"85855ad2-aa30-4a6c-807b-b992f2ce0b21","resolution":{"observed_at":"2026-08-02T21:01:15.163230Z","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-02T21:01:15.269024Z","title":"Sherrington and S","venue":null,"work_id":null,"year":1975},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.269024Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:18c3d5267a72a8869052583b2a668e5406cc6d89be5dc590d381e7e94b886961","observation_id":"ec547af2-3bb7-4d4d-b849-d8f0b4e8bfbe","resolution":{"observed_at":"2026-08-02T21:01:15.269024Z","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-02T21:01:15.356213Z","title":"Riesen and H","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.356213Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:4985b625ea0c0c14daca2df7d12bfd093d3e04734680986b037b8f5508551b78","observation_id":"0e35fbbb-d97c-4bf2-b1d3-c977a523c102","resolution":{"observed_at":"2026-08-02T21:01:15.356213Z","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-02T21:01:15.428770Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.428770Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:7961377c4dbb7d3952cc54624483fcd783ba9a2ac686ba45c99b896f91d4de6e","observation_id":"87f8d94d-cc89-4209-a657-7f2307a7d691","resolution":{"observed_at":"2026-08-02T21:01:15.428770Z","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-02T21:01:15.483712Z","title":"Yanardag and S","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.483712Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:4a27af7d640e3a8e18b3cddec2b7b2f072c751b927fd7bb0fdc3bba14b74a5f1","observation_id":"9f924f96-a57e-4ad0-8d97-a9ade38cc90f","resolution":{"observed_at":"2026-08-02T21:01:15.483712Z","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.3390/app10207116","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Applied Sciences","work_id":"0216b677-8957-4c0b-bf95-5f155c1265e8","year":2020},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.552256Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:7ff1f0a8f12d3fe81db31a667c41c4b0d1907ec0603527ae241d3e0ad96bf4cd","observation_id":"5eb32753-de7b-49be-ba98-86fe8a7d8bec","resolution":{"observed_at":"2026-08-02T21:03:22.798925Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+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-02T21:01:15.660797Z","title":"Dalyac, L","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.660797Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:ca32292447408d095a8ca34340bac94bdd387d0808de6fd46c9e5306a0b2d73e","observation_id":"a43fddbb-a32f-429e-954a-07d637e8162a","resolution":{"observed_at":"2026-08-02T21:01:15.660797Z","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-02T21:01:15.723914Z","title":"Kotil, E","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.723914Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:827f0d15fbbb464a8b484041e9d010c1e3f1f710f86cb9bbc4f0890f2d10bfa9","observation_id":"b0637e13-3cec-43c9-bd8a-f7dbe92bb6c2","resolution":{"observed_at":"2026-08-02T21:01:15.723914Z","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-02T21:01:15.778242Z","title":null,"venue":null,"work_id":null,"year":1983},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.778242Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:bc5234d26038cb7a458dcafabccbcc2c872045a52c411fa004f0040e3f209434","observation_id":"55d65b38-ec1e-4505-b99d-5a0a97ae6fd0","resolution":{"observed_at":"2026-08-02T21:01:15.778242Z","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-02T21:01:15.835052Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.835052Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:1f9362530524d0eff9151b3d4bce02422a4fa5ffebff11998b98eac558d6f039","observation_id":"e67527ba-0472-43c4-8f0b-de4e1d635c36","resolution":{"observed_at":"2026-08-02T21:01:15.835052Z","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-02T21:01:15.892981Z","title":"Benjamini and N","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:15.892981Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:86c064c840b105f2d7ed6e145d97382f7ce23fdd9194d3caa127ff6cfa078229","observation_id":"09ca7599-f6a7-42ef-b7ea-03233960ff3e","resolution":{"observed_at":"2026-08-02T21:01:15.892981Z","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-02T21:01:16.058875Z","title":"Coppersmith, D","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.058875Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:518ed32386e094e4e85af5571f1d7bd1a6f2f332c3e8deb3ecd06159ce0ff1ae","observation_id":"13825f42-3703-4fca-82be-1b20db147527","resolution":{"observed_at":"2026-08-02T21:01:16.058875Z","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-02T21:01:16.176101Z","title":"Erdős, A","venue":null,"work_id":null,"year":1960},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.176101Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:a5c69081fdcafc576c42e39ad7ef2533422c1794f12f113741d8f040be8d9abd","observation_id":"4f927d54-f272-4fd1-9cd1-8afa6471f097","resolution":{"observed_at":"2026-08-02T21:01:16.176101Z","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-02T21:01:16.356387Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.356387Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:2613b077dd60cdf68164748fb9afa8bcf3b05a4ec8aca5c6211289d0150629f8","observation_id":"3f388024-4c43-4923-bd43-0ff753b78c38","resolution":{"observed_at":"2026-08-02T21:01:16.356387Z","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-02T21:01:16.613316Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.613316Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:c86b315300dde6d27dc77f4862324740e412afde44a853f316bf720dd7d17ced","observation_id":"b4f813f8-cee2-46f5-bc79-82dee8c9b373","resolution":{"observed_at":"2026-08-02T21:01:16.613316Z","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-02T21:01:16.689630Z","title":"Herrman, P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.689630Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:3e9052e2acf1290e5bad132d450928142b432d876d91c74d9cffc178218ff1dc","observation_id":"8c33633f-97ca-4ccb-8480-59691c68313a","resolution":{"observed_at":"2026-08-02T21:01:16.689630Z","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-02T21:01:16.813756Z","title":"cloud.ibm.com/docs/en/api/qiskit-ibm-runtime/ fake-provider, accessed: 2025-12-15","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.813756Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:806d4c77eed067b8f2f036115ec1d0491881ef30c490eb931f2f689bdfb78973","observation_id":"74f91da4-e1bd-4b8d-b735-0ed1355bc0f8","resolution":{"observed_at":"2026-08-02T21:01:16.813756Z","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-02T21:01:16.986313Z","title":"Wurtz and P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:16.986313Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:76336518788afd8559c28194c3217b5be7edae9f9d354d19ab13a053d99c3496","observation_id":"6f324556-c170-47f5-ae8f-89a38aa3c045","resolution":{"observed_at":"2026-08-02T21:01:16.986313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05555","last_updated":"2021-11-03T21:31:08Z","snapshot_observed_at":"2026-08-11T01:47:22.970650Z","submitted_at":"2021-10-11T18:49:13Z","title":"QAOAKit: A Toolkit for Reproducible Study, Application, and Verification of the QAOA","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.05555","snapshot_observed_at":"2026-08-02T21:01:17.093715Z","title":"Shaydulin, K","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.093715Z"},"links":{"cited_paper":"/paper/2110.05555","citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:ba898a89b90f233a9f715d74660dd5c117c6120550bff98ed55703e00248019c","observation_id":"1b6b8805-6976-41f2-a6e6-596621394b8a","resolution":{"observed_at":"2026-08-02T21:01:17.093715Z","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-02T21:01:17.253425Z","title":"Albert, Scale-free networks in cell biology, Journal of cell science118, 4947 (2005)","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.253425Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:bf1b2e1a5dc89f594d0ccb663f92600d757f9a0779df779fef4cd819eec7b475","observation_id":"8494f671-bf91-49fb-a100-05da252aaddc","resolution":{"observed_at":"2026-08-02T21:01:17.253425Z","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-02T21:01:17.361363Z","title":"Barabási, R","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.361363Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:ab1ffba4b45feb06da8a4b712419aceb2cee610985c23d4969e9747e3eb3ae74","observation_id":"cf677aa6-5b74-437b-b1af-ac3ee47c92c1","resolution":{"observed_at":"2026-08-02T21:01:17.361363Z","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-02T21:01:17.515041Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.515041Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:d095e50f04304efbf2bd927ed58f75b319b77452d79388ffe617a6bfe46cdff3","observation_id":"05cdf935-f782-4774-91e7-fce5def12cc7","resolution":{"observed_at":"2026-08-02T21:01:17.515041Z","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-02T21:01:17.689049Z","title":"Kim, Y.-M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.689049Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:569b826163f0356862cd4848b2390afcea09f291db50d467cb1670c05dec5a9a","observation_id":"07ac6f33-11ed-4904-a0b8-ea85603948f9","resolution":{"observed_at":"2026-08-02T21:01:17.689049Z","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-02T21:01:17.814703Z","title":"Wang, Complex web-api network construction based on barabasi-albert model and popularity-similarity op- timization model, Auckland University of Technology (2019)","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.814703Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:15edee9e47baec358c13f45fe19748b7f18e0f7c75ff98517402e30d88c23047","observation_id":"2ab19e4b-46cb-42fe-afe4-caacb9a26ebb","resolution":{"observed_at":"2026-08-02T21:01:17.814703Z","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-02T21:01:17.904828Z","title":null,"venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:17.904828Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:24dc48b6ed39a837f98aa030fa0b6b190fc872f45e8d8566d59ce0e13f49288c","observation_id":"97005c4a-08d2-490f-87f3-9f267c276077","resolution":{"observed_at":"2026-08-02T21:01:17.904828Z","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-02T21:01:18.004571Z","title":"Zbinden, A","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:18.004571Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:be6ea2afb4c45d82b27d604485db5ea6e8aa580c396d54943883fc742cd24ec2","observation_id":"a0b7e2f4-02f4-42ab-99a1-c0404742d88b","resolution":{"observed_at":"2026-08-02T21:01:18.004571Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.06469","last_updated":"2024-08-12T19:54:43Z","snapshot_observed_at":"2026-08-08T05:01:39.039852Z","submitted_at":"2024-08-12T19:54:43Z","title":"Design and architecture of the IBM Quantum Engine Compiler","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.06469","snapshot_observed_at":"2026-08-02T21:01:18.091602Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:18.091602Z"},"links":{"cited_paper":"/paper/2408.06469","citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:28fea1c6a81f9e8bc748aabfb91cda180934ace72c1fcd5d7c047f6551b77b4f","observation_id":"bea0f6a1-67ea-4a03-862f-46f44ad7f078","resolution":{"observed_at":"2026-08-02T21:01:18.091602Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1809.03452","last_updated":"2018-09-10T16:50:48Z","snapshot_observed_at":"2026-07-06T07:00:14.832375Z","submitted_at":"2018-09-10T16:50:48Z","title":"Qiskit Backend Specifications for OpenQASM and OpenPulse Experiments","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1809.03452","snapshot_observed_at":"2026-08-02T21:01:18.184101Z","title":null,"venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:18.184101Z"},"links":{"cited_paper":"/paper/1809.03452","citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:8b1517a4b4739cb4601490035037f075b601ffcf95beda2f036944e147838a4a","observation_id":"27739630-2525-4c24-8eec-1e2964e0ce4c","resolution":{"observed_at":"2026-08-02T21:01:18.184101Z","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-02T21:01:18.280834Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:18.280834Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:4c9dc807e8e1d90b1c1ba797412f061e5d334c93a9673d9a77d4280d09637ccc","observation_id":"d1de1213-962f-42bf-9eb1-c5ea25759a53","resolution":{"observed_at":"2026-08-02T21:01:18.280834Z","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.3390/quantum7010002","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Karuppasamy, V","venue":"Quantum Reports","work_id":"5d031824-5e8a-4ced-9a13-13f0eaca7d44","year":2025},"citing_paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA","version":2},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-02T21:01:18.401282Z"},"links":{"citing_paper":"/paper/2602.21689"},"observation_digest":"sha256:1dd66c070ca456c3d81823bd00996303991197b2ec1b03f2144831c66cf203d2","observation_id":"d904def3-73ef-4fae-a232-2b25596d5af0","resolution":{"observed_at":"2026-08-02T21:03:22.564233Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-12T06:34:41.77262+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2602.21689","last_updated":"2026-05-28T06:50:23Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-04T01:27:00.278943Z","submitted_at":"2026-02-25T08:46:05Z","title":"Landscape-Similarity-Guided Optimization in Divide-and-Conquer QAOA"},"reference_resolution":{"displayed":83,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":81,"verified_exact":2,"verified_fuzzy":0},"total_outbound_references":83},"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-12T06:34:41.77262+00:00","source":"crossref"},{"observed_at":"2026-08-12T06:34:36.333875+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 83 of 83 outbound references and 1 inbound Pith citation observation for arXiv:2602.21689."}