{"as_of":"2026-08-22T06:04:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:e34caf4c0aaf7b58637e4101eae23fd24e8fc8c78e26870725b29b271e1844ca","coverage":[{"denominator":86,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":86,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:30:06.043500Z","state":"measured"},{"denominator":86,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":86,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-21T06:32:19.484+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/2412.04398/citation-record","integrity":"/paper/2412.04398/integrity","json":"/paper/2412.04398/citation-record.json","paper":"/paper/2412.04398"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:30:05.734315Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.734315Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:f4d855a4f6b039782396a670056aef83075d712cd75e40f89e225830ba6eb78a","observation_id":"741307d4-c5bb-46ce-8401-148e7cdbee59","resolution":{"observed_at":"2026-08-11T21:30:05.734315Z","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-11T21:30:05.739178Z","title":"Thus, one needs to find an equiva- lent encoding as a QUBO problem to solve 3-SAT on such hardware","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.739178Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:6a9acab4dd11b45a6c560c9ae147de508cb6ba2af0cd9f5278178a0ecda56da0","observation_id":"6df62520-a834-4ea1-bb94-8aa98eef1825","resolution":{"observed_at":"2026-08-11T21:30:05.739178Z","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-11T21:30:05.743213Z","title":"In principle, it is desirable forJ to be as large as possible in order to speed up the absolute computing time","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.743213Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:6f7b6c0baeb99cfdce37ec8dc338d223a8aa4ee065dde1719785b57c95f7983c","observation_id":"e9c166aa-8c62-4ab5-a74d-03cf1e72101e","resolution":{"observed_at":"2026-08-11T21:30:05.743213Z","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-11T21:30:05.747330Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.747330Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:ee5ef2476e0d87effcc8b0e6b7f05693187b1cf5b066067d61acfa08d2d311f0","observation_id":"1d87defd-4e82-40e9-b0ce-07e678268376","resolution":{"observed_at":"2026-08-11T21:30:05.747330Z","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-11T21:30:05.750977Z","title":"Typical gap profiles of PUBO and QUBO formulations of randomly generated 3-SAT instances","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.750977Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:ac35baf1914cc8be844c21711998230902b8f292d3ac614ff9a45b053e2a2e45","observation_id":"8a5f34b9-668a-4ba5-9e09-56a273eb335b","resolution":{"observed_at":"2026-08-11T21:30:05.750977Z","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-11T21:30:05.755025Z","title":"Finding an optimal QUBO reduction for a given PUBO problem is in generalNP-hard","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.755025Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:1d20c52ecc70057c287d2a3f2904ec10b805cc7065f9e7c6aa5b23d680cf5a6f","observation_id":"35dd532c-829f-4a2a-a393-fc7a18a5e541","resolution":{"observed_at":"2026-08-11T21:30:05.755025Z","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-11T21:30:07.133486Z","title":null,"venue":null,"work_id":"40f107a6-92c9-45b8-ac1e-197e1e02d130","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.759264Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:d59b6e054d0c8b59dcadb0acb18fb0fcade923a7d93e646381076e25ba61e42c","observation_id":"551c0410-d362-4855-9e70-c0e24592c0d8","resolution":{"observed_at":"2026-08-11T21:30:07.137006Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.121895Z","title":"Figure 2 investigates the correlations between these two quantities for10 000random instances generated via toughSAT with N = 6 and M = round(4.24N) = 25","venue":null,"work_id":"4b67d2d6-3f41-4545-ba11-b54f8b1850eb","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.763480Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:189e6a26bbfa9b09c643165d3316842139b521d4191efe0ca32f7cb85107c3ec","observation_id":"6aa35bd9-aff6-452d-82cd-ffa80407c9cd","resolution":{"observed_at":"2026-08-11T21:30:07.126933Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.111907Z","title":null,"venue":null,"work_id":"b0da1949-613d-4fb8-814f-aae417bfafed","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.766725Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:fab872169b4037531991fa927ced44ea47bf7d17130fd4bbbb957c25e6e6ea4b","observation_id":"4eb28a28-fdcd-4a2c-a3fe-abc8fc87e535","resolution":{"observed_at":"2026-08-11T21:30:07.115686Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.100670Z","title":"In this section, we in- vestigate how varying this strength affects the minimum energy gap","venue":null,"work_id":"950c7991-b01a-440d-86f5-9895ad62449f","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.770283Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:d5ec12ce799863f7f600ef9904eee77c6347f4a95341d221a8235fb325d122bf","observation_id":"a862eb8a-baf7-4cde-8398-fe89fb3a436d","resolution":{"observed_at":"2026-08-11T21:30:07.105142Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.089422Z","title":"However, hx is actually a free parameter that can be tuned to optimize the annealing schedule","venue":null,"work_id":"effa455d-c289-4c74-8ae6-9fc6764b9305","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.773694Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:af85fcd01d3bcd4ad0fb71b11e52f844b2375804ba04bbbe4bbd0f3a89e7e2c8","observation_id":"4a92af42-cc9b-4eb7-b050-3d8cf1de8715","resolution":{"observed_at":"2026-08-11T21:30:07.094086Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.079091Z","title":"(b) Each CNOT gate can be further decomposed into one RZZ gate of fixed angle and multiple single-qubit rotations","venue":null,"work_id":"0f838e76-600f-451c-acfe-7a1db1d302ee","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.777680Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:32b6123a0d28eeb990fe007c32123fc23cd411a425ae388772baad2dcf1f004b","observation_id":"8e504656-2acb-4b70-bf17-0c6027a46c67","resolution":{"observed_at":"2026-08-11T21:30:07.082688Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.070740Z","title":null,"venue":null,"work_id":"118377c8-f860-4dc2-a15c-6f0bad99c2ca","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.780930Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:8bfa1543b0ab26d49492db5c6ccdb40942b278a03d20e44aed5544779d74b808","observation_id":"f7b4f8a6-b496-401d-b509-404f9d758874","resolution":{"observed_at":"2026-08-11T21:30:07.073468Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.060915Z","title":null,"venue":null,"work_id":"c990aba3-2017-430d-b026-0d902f584e96","year":2002},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.784775Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:b2a832398cfadf14a68b3bf2d9873d1894df2205cd60df1debb54a9e4626efe9","observation_id":"ac49635a-bbda-4de8-8b0c-7f5f42623d74","resolution":{"observed_at":"2026-08-11T21:30:07.064570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.049871Z","title":"Martoňák, G","venue":null,"work_id":"0ba9ab0f-7564-40ef-89f0-75cd449acaa5","year":2004},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.788195Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:e59cee3f3c125c8b39bd1835df9a0e801eb0c0f8d2142050dde40a1b2e49a969","observation_id":"c200ab9a-7f32-4795-9d25-693c63daff61","resolution":{"observed_at":"2026-08-11T21:30:07.053496Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.039628Z","title":"Hauke, H","venue":null,"work_id":"0a524fe0-38df-4a8d-b879-c398fc1d2537","year":2020},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.791611Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:dde8a959cb3710a938e9d4b4696237ad3a421d60e1390247da13c3f6ea924499","observation_id":"8352dd26-9c65-410d-b6d6-68ab7c258be9","resolution":{"observed_at":"2026-08-11T21:30:07.043261Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.028376Z","title":"Rajak, S","venue":null,"work_id":"a6952e59-6e0d-4c6d-9f63-e538e01f1640","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.795215Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:e52c192dd73ca6fb71db74a13d3ca6b68bfb5a8fb4ca687770f4bafa3c2a9789","observation_id":"935dfee0-33bf-4a05-a503-3862b8c5d903","resolution":{"observed_at":"2026-08-11T21:30:07.032964Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:07.016964Z","title":"Yarkoni, E","venue":null,"work_id":"af629737-96d4-4225-9e52-32567d5ed0b6","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.798948Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:eb950e237339ba67d822c0cff57c075a3baa0a987854eee462631fdc38f442a0","observation_id":"d5e745ad-d629-4f93-8b7c-baa71511cdcc","resolution":{"observed_at":"2026-08-11T21:30:07.020696Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.802923Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.802923Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:5e4470301c84277972284bec76a54da9f7b9dd0535a79399227c14d4c2f4a3e0","observation_id":"3c6e7b7c-d5b6-4a53-92a0-44b066983824","resolution":{"observed_at":"2026-08-11T21:30:05.802923Z","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-11T21:30:07.006957Z","title":null,"venue":null,"work_id":"efe07eda-7ae6-4acd-8e1f-2665b01ece88","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.807588Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:1080f6ff05097d477b904c8b413e934be977ad16ac13ed4a75edef5711ca4add","observation_id":"758a9c7a-8cc4-4c21-923d-1a637d605be7","resolution":{"observed_at":"2026-08-11T21:30:07.009923Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.810924Z","title":"Micheletti, P","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.810924Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:5c975958e6454116a9938774018d9dd90f157d397758e5a5964c55e56457d7c5","observation_id":"eb6f93f1-8ab7-40cb-9cdf-8b0823e3f938","resolution":{"observed_at":"2026-08-11T21:30:05.810924Z","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-11T21:30:06.991566Z","title":"Slongo, P","venue":null,"work_id":"a790e555-bb7e-4379-8654-a0868bbbf4c6","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.814298Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:f70d69ef5151bf038245f552cfee21731e1d6b6b83a96eab3a371a2dadfbd3e5","observation_id":"247e0fee-ec22-4cee-a0e0-7f1534c4faee","resolution":{"observed_at":"2026-08-11T21:30:06.994515Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.817923Z","title":"Outeiral, G","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.817923Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:6bc1d01bb746bc969f62df342340102136ea6f01ce579b8d9895e4a54dae7304","observation_id":"4ab5c79a-a1dc-4100-a815-a07b83bbf15c","resolution":{"observed_at":"2026-08-11T21:30:05.817923Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","snapshot_observed_at":"2026-08-21T16:04:44.793750Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13167","snapshot_observed_at":"2026-08-11T21:30:05.821205Z","title":null,"venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.821205Z"},"links":{"cited_paper":"/paper/2106.13167","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:94b733c2e9de0837728d6638216652ffc333a5e3e9c94db80a21a60309a7c208","observation_id":"854a2e8c-64f3-40f8-b00d-cf23cc84fe56","resolution":{"observed_at":"2026-08-11T21:30:05.821205Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2406.08889","last_updated":"2024-06-13T07:43:18Z","snapshot_observed_at":"2026-08-19T02:45:42.512535Z","submitted_at":"2024-06-13T07:43:18Z","title":"Polynomial Reduction Methods and their Impact on QAOA Circuits","version":1},"cited_work":{"arxiv_id":"2406.08889","doi":null,"metadata_source":"pith","pith_arxiv_id":"2406.08889","snapshot_observed_at":"2026-08-11T21:30:06.418247Z","title":"Polynomial Reduction Methods and their Impact on QAOA Circuits","venue":"quant-ph","work_id":"65be8b87-698d-4e2b-8e74-5bbfe39956de","year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.824729Z"},"links":{"cited_paper":"/paper/2406.08889","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:43f499db0b4b3e76459d4ca2fbef86fbe0f9f2f23dce45ffc9d3cd85a8c3820c","observation_id":"642bdb5d-9a94-4415-ab71-fa59849fde46","resolution":{"observed_at":"2026-08-11T21:30:06.422406Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.972783Z","title":null,"venue":null,"work_id":"db8c24d4-32d7-443e-bbe8-ae424691ec29","year":2008},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.828112Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:e790b01c8e152e29452ae3e0ece292c772bcb3a1e41190b1a3b10b8652370ee1","observation_id":"d9b5390b-25b1-42a4-8203-cdcb0e87ffab","resolution":{"observed_at":"2026-08-11T21:30:06.976780Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.962717Z","title":"Babbush, B","venue":null,"work_id":"f1551b80-8305-4075-8126-ad8934f0ad83","year":2013},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.831421Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:085f876bddb22b2c5b257f8c07edbf5614afeffce38a30e2dc2d61f207360e9b","observation_id":"e43a47d9-2251-420e-9e42-eb12a26795e4","resolution":{"observed_at":"2026-08-11T21:30:06.966042Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.952912Z","title":"Stein, F","venue":null,"work_id":"fd0c9572-b6d5-415d-aef2-3a40ea4415a5","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.834948Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:65bc2528d4c16056bdcef8cdeaaddca52217ac372200f458610b699d518949a0","observation_id":"4e176457-6092-4a1e-b90b-b9982f364f2d","resolution":{"observed_at":"2026-08-11T21:30:06.956305Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.942899Z","title":"Hsieh, R","venue":null,"work_id":"0cfc219f-b025-49a3-8854-56e2d3f2bb06","year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.837991Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:8fd39e5317c471817af8ef1b68e5cbd0f4a81669d2bbd3fa075209adc7a5b902","observation_id":"985339ec-3a63-4db1-b797-ec2cb37191b6","resolution":{"observed_at":"2026-08-11T21:30:06.946481Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.932051Z","title":null,"venue":null,"work_id":"d5c731bc-4c83-4a9f-866d-3006da392759","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.841948Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:84f6a9da43ec19d79886b112be51fc83a305c3ea5df93fc047a95733860f180d","observation_id":"3d098337-a896-4a38-8759-ffe307a8dce1","resolution":{"observed_at":"2026-08-11T21:30:06.935625Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.845314Z","title":"Glover, G","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.845314Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:3d7f81f2b0d9ed55850344c538f94240a2785732456c8c54e7ba216b52692594","observation_id":"5ffcbe10-281e-4247-814f-4e71718b5e49","resolution":{"observed_at":"2026-08-11T21:30:05.845314Z","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-11T21:30:06.915607Z","title":null,"venue":null,"work_id":"afb15feb-60d8-4071-b628-4279c8b64088","year":2025},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.849240Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:31910cdee1362104a4a4d64fbc271a9a1927b64eacbf7d3e2b6c147dfc550b03","observation_id":"80301441-7172-460e-9e08-06dcf2b27c65","resolution":{"observed_at":"2026-08-11T21:30:06.918964Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.852411Z","title":"Jansen, M.-B","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.852411Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:6598c2054eafdad09e9a4558ef16a941ce127865372a683b8138e166fde36609","observation_id":"da0a316b-98dd-4868-b972-52cf92d60adf","resolution":{"observed_at":"2026-08-11T21:30:05.852411Z","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-11T21:30:05.855573Z","title":null,"venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.855573Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:b7f9b6c7ab90ec9c0ea52193af7fb79b4a709811bec48153b8e2c78a3130de27","observation_id":"44ebf0bd-4447-4f2d-9127-21bc107a1c32","resolution":{"observed_at":"2026-08-11T21:30:05.855573Z","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-11T21:30:06.895176Z","title":null,"venue":null,"work_id":"578cf510-a25e-45d0-a715-bc69b8272577","year":2009},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.858587Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:c93a461694f3c3cf0e51923eb8a681ec9498056b95a7fe03d210f5806c4d954d","observation_id":"e813bf00-a388-4401-b4df-c676f0e2cbd9","resolution":{"observed_at":"2026-08-11T21:30:06.897719Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.885544Z","title":"Cheung, P","venue":null,"work_id":"b6a0e8f5-0f20-45f7-a113-7e546635b6ab","year":2011},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.861987Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:fdaa69f8b593717e66059ebbcdc4b14d169d2607e86c666b6becc4941ef54ba6","observation_id":"70562a7e-aebd-4274-9f76-1084190beb45","resolution":{"observed_at":"2026-08-11T21:30:06.889014Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.875257Z","title":"Čepait˙ e, A","venue":null,"work_id":"a94e9a09-4794-4e08-a22a-6d7c77152957","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.865375Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:a45e4f68e4e7904c2df6505df09092d496f1acc51817248c4d116a4d37303e1f","observation_id":"d5158142-d96a-4bd8-b8fa-4c4f87f7f0f2","resolution":{"observed_at":"2026-08-11T21:30:06.878960Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2410.14779","last_updated":"2024-10-18T18:00:07Z","snapshot_observed_at":"2026-08-16T13:07:56.221430Z","submitted_at":"2024-10-18T18:00:07Z","title":"Tighter Lower Bounds on Quantum Annealing Times","version":1},"cited_work":{"arxiv_id":"2410.14779","doi":null,"metadata_source":"pith","pith_arxiv_id":"2410.14779","snapshot_observed_at":"2026-08-11T21:30:06.399455Z","title":"Tighter Lower Bounds on Quantum Annealing Times","venue":"quant-ph","work_id":"c4d17312-99f9-47d7-aac2-91ab2680d9b2","year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.868689Z"},"links":{"cited_paper":"/paper/2410.14779","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:de1753c8511b60f3472d38cd62921abb3464d50d1f9e6e8fc495e2a0bc6be7ab","observation_id":"a29733fc-fefd-4e98-a14b-cd50d4fab8d6","resolution":{"observed_at":"2026-08-11T21:30:06.406428Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"2410.06710","doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:30:06.382241Z","title":"Bottarelli, M","venue":null,"work_id":"f0cc2581-5fbf-41d2-9d66-c09a0c34bc29","year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.872244Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:1161bcb3aca4bd23dcfd4ad6fcf1ef255cf8feaa63c878e7e958817ee804ffe4","observation_id":"4f9154fe-588e-4c03-afac-245576d59752","resolution":{"observed_at":"2026-08-11T21:30:06.387767Z","resolver_source":"raw_fallback","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.865102Z","title":"Altshuler, H","venue":null,"work_id":"e21d39d9-3121-4b39-81b9-c440a17f9ab0","year":2010},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.876035Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:9822f92a85170d19aa4affc55f80e9714f1fa2fb78528b6ab8582e55ab9949d4","observation_id":"3aac2c36-d167-49ff-b275-f4a7d6866390","resolution":{"observed_at":"2026-08-11T21:30:06.868565Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-08-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-11T21:30:05.879694Z","title":"Farhi, J","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.879694Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:b87381f9f1b448b0da9bfd840e3055e48bc6c9b0b89feb624127c4aa2ed03f8f","observation_id":"a11bde3b-d57c-45b4-8913-0ce42e1bc554","resolution":{"observed_at":"2026-08-11T21:30:05.879694Z","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-11T21:30:06.855031Z","title":null,"venue":null,"work_id":"2b83d22f-2992-47ae-9ae9-5b3b8c7d074a","year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.884070Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:6c403b31d6b4ab8f436ce47cc87f840b5ca6d06f9892c09b85037e958cb134ff","observation_id":"f58182e4-b236-4a76-a90c-5b2cb78ca760","resolution":{"observed_at":"2026-08-11T21:30:06.858313Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.844598Z","title":"Blanes, F","venue":null,"work_id":"5076d254-2f42-4004-aef2-fabd75b1f5db","year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.888287Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:0c1ff81e12cac9a7a548f1aea1f98f63aae8d2fa2767057913b55e086119e295","observation_id":"c4e51f48-0fd4-43bc-aeb3-0703853bbe83","resolution":{"observed_at":"2026-08-11T21:30:06.848073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.834746Z","title":"Boros and P","venue":null,"work_id":"eb3a1a9e-67c1-46d0-827e-6e74e69ac74a","year":2002},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.892066Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:77297b10e50d511c675ae65b03663d68828b4de5faefe73b67d5c5665dc05dca","observation_id":"fefb0d25-053d-4a76-9112-387b88103640","resolution":{"observed_at":"2026-08-11T21:30:06.838164Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2307.10379","last_updated":"2025-07-30T15:06:41Z","snapshot_observed_at":"2026-08-16T15:14:54.401727Z","submitted_at":"2023-07-19T18:00:05Z","title":"Alleviating the quantum Big-$M$ problem","version":4},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.10379","snapshot_observed_at":"2026-08-11T21:30:05.895411Z","title":"Alessandroni, S","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.895411Z"},"links":{"cited_paper":"/paper/2307.10379","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:737257ced4e26f8cb8e4f23a0d878cb5a3fe5031b5e46b497b7e0e262d8acdf9","observation_id":"e5fec0df-38f6-4d27-92c0-b4ffbf6655f8","resolution":{"observed_at":"2026-08-11T21:30:05.895411Z","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-11T21:30:06.825433Z","title":"Aspvall, M","venue":null,"work_id":"b3214995-5894-406d-95da-18ac56a89ac0","year":1982},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.899128Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:90c78d4f4472abcac1392130c48074ab27cdd4dfcb7d4df18654dc6adc20813b","observation_id":"ed248d76-1cac-4918-8dcc-03ecffde9205","resolution":{"observed_at":"2026-08-11T21:30:06.828414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.902514Z","title":null,"venue":null,"work_id":null,"year":1971},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.902514Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:e68315ee1a9e407cbefced9bc8187230a4190be2428e13836ef25bb1b708cb86","observation_id":"4d3c9a6a-cd18-4777-9fda-10224ebff3f4","resolution":{"observed_at":"2026-08-11T21:30:05.902514Z","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-11T21:30:06.810243Z","title":null,"venue":null,"work_id":"e98dfe18-2226-4ae6-bc8a-367ba96b23e9","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.906478Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:703629f6e6b06fc83ecbad472df4b9953d3ce6c849acbc54b7f494f9735dda58","observation_id":"c9ba4f88-a099-4648-acb8-716a7df054ea","resolution":{"observed_at":"2026-08-11T21:30:06.813980Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.801209Z","title":null,"venue":null,"work_id":"588373bd-5a58-4b9a-a3f4-aeade5e6233d","year":2010},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.910564Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:be3a439713a9fb620818b4adfd2c6896cfe3aad5b2a2687067fa1bd21ec1ff67","observation_id":"1e532db4-fc4f-4849-8eec-5e72afdc32ca","resolution":{"observed_at":"2026-08-11T21:30:06.804456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.792164Z","title":null,"venue":null,"work_id":"20f1add7-253f-4120-b7bb-9c784f0c5d50","year":2015},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.913885Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:a00748b6724e9e63ca5ba160d67a718677edeaaa5f9f6cda4c01f54e9a154fb3","observation_id":"c7fef985-af8e-4e1e-ad2b-a51c5b6acdeb","resolution":{"observed_at":"2026-08-11T21:30:06.795330Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.781895Z","title":"Albash and D","venue":null,"work_id":"a267cd85-7533-4f83-a3f5-93c8262f93fc","year":2018},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.917143Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:364d8905d5ddc317cf66cf4e4bec9b2d8406dd250f48bd861e3bc12380304d81","observation_id":"e9b00876-1ee0-4734-9fbf-9c46a2aebdf7","resolution":{"observed_at":"2026-08-11T21:30:06.785834Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.772691Z","title":"Willsch, M","venue":null,"work_id":"12a887bd-33bb-460e-a6d4-fef064093723","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.921190Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:6d353d4809f6b391bbcb6833b29df3fab6b5b64afb707629051cbd3436794583","observation_id":"6c8def43-49a2-4bc1-b6d1-61cc841565a1","resolution":{"observed_at":"2026-08-11T21:30:06.775896Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.763625Z","title":"Bernaschi, I","venue":null,"work_id":"e2b63fe2-17db-462f-9509-3b6b2713e975","year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.924431Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:e0beeb81387673a0ed8755f322b5564037c29b08abaa4765904a96b5604b900d","observation_id":"89918064-ffec-46d1-ab35-a30d82c23c57","resolution":{"observed_at":"2026-08-11T21:30:06.766273Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.755026Z","title":"Mézard, G","venue":null,"work_id":"960923e4-2dc4-44a5-86ab-d1e8534d351d","year":2002},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.927726Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:da9e24e6a15aa1ea5131c019a3569211915f412adbf6d2610ee25a28283a30d6","observation_id":"a9937ca4-5393-41c8-bf28-09376ec8c675","resolution":{"observed_at":"2026-08-11T21:30:06.758054Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.745889Z","title":"Žnidarič, Scaling of the running time of the quantum adiabatic algorithm for propositional satisfiability, Phys","venue":null,"work_id":"56b00d42-77fb-4c99-bb0f-7b60928b3b61","year":2005},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.931511Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:636f3bb2216901f69c6a89bbf9d1de280be0e639824d7db88a305b71b84b3d4c","observation_id":"e9ff00b9-6b5f-4844-8fd8-61b7b7b22023","resolution":{"observed_at":"2026-08-11T21:30:06.749366Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.735595Z","title":null,"venue":null,"work_id":"e4e127d3-7c44-4401-9db5-04e3372b7cc4","year":null},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.934732Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:8cc392cfd8a5b88d44f61130225e4119e51df26153c745fd65a4a25c367ff390","observation_id":"765f01bf-21d9-472a-af3b-240b48ed2ee0","resolution":{"observed_at":"2026-08-11T21:30:06.739170Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2107.11695","last_updated":"2021-07-24T22:13:42Z","snapshot_observed_at":"2026-08-18T23:10:13.254900Z","submitted_at":"2021-07-24T22:13:42Z","title":"Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions","version":1},"cited_work":{"arxiv_id":"2107.11695","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.11695","snapshot_observed_at":"2026-08-11T21:30:06.279093Z","title":"Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions","venue":"math.OC","work_id":"129b42f4-dcfe-4eaa-a742-9eee437328e8","year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.937822Z"},"links":{"cited_paper":"/paper/2107.11695","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:fe8e81a61ba03c15c719047cda48508bf9a8bead29d6253f935d604dfffe3a8b","observation_id":"50e32107-f797-42a5-b149-21c22daa8706","resolution":{"observed_at":"2026-08-11T21:30:06.289138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.723601Z","title":null,"venue":null,"work_id":"df054677-1e2b-4340-90a8-25e7c882f577","year":2019},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.941775Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:d0c35c3d1fcc3b9a296cdfedd079bd6e511edb2444f4d54a1a98667aa8d1c1e0","observation_id":"b69bf974-cdca-4587-97a3-10f1180e90f0","resolution":{"observed_at":"2026-08-11T21:30:06.727765Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.945178Z","title":"Bose, Exponential speed-up of quantum annealing via n-local catalysts (2024), arXiv:2409.13029 [quant-ph]","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.945178Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:a4efebaca26b4f8e804b60db01f10039dc53d9a246067206e943da7ef0bc13b2","observation_id":"14d7a344-dde4-4066-86fa-3046fdc852e8","resolution":{"observed_at":"2026-08-11T21:30:05.945178Z","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-11T21:30:06.713147Z","title":"Bermudez, D","venue":null,"work_id":"303ae428-49ff-425d-9ecf-3ee3a58ac9c7","year":2009},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.949189Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:f7cd6bc6f71b97c9b14a85754c956eff92f818f706829b35033631a89b136fd1","observation_id":"d3a3e1f0-71d0-4e3c-b5ad-593985c93c96","resolution":{"observed_at":"2026-08-11T21:30:06.716813Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.702690Z","title":null,"venue":null,"work_id":"21593ced-b610-433d-8b4c-aa347814b5f0","year":2016},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.952545Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:69e4f99b0da301b15a3f9a422c1a128c9350d4755daa5c7c13207f44b68b9f92","observation_id":"551ceccc-e06e-491f-9871-ea8042ce1b78","resolution":{"observed_at":"2026-08-11T21:30:06.706037Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.692742Z","title":"Andrade, Z","venue":null,"work_id":"113a24d7-84ce-44fc-9981-c21bf9898a9d","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.956111Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:75e573475167fb78e20b1aebbbd38f9c0254bb4882b5a8e2740d2c9ba36fd938","observation_id":"8db599f8-ab7d-40b0-98fc-5630fc21c1e1","resolution":{"observed_at":"2026-08-11T21:30:06.696233Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.683430Z","title":"Nagies, K","venue":null,"work_id":"daf0deee-f53b-4e8a-a616-ac5735755cc2","year":2025},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.959266Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:81f2268d21d992b68222d9b42fa413cc16438f0236ff678b7d4ee71ce727182b","observation_id":"d2a79f61-4453-44d1-a6a6-79eb93356b65","resolution":{"observed_at":"2026-08-11T21:30:06.686443Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.672540Z","title":null,"venue":null,"work_id":"d029d7ee-7540-4a39-8e18-438bed43898b","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.962411Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:986dcd1dca77af43e6bb268a95e39c5cf2b1682edc1c29adee657abbff8e1cfe","observation_id":"9a23f1f4-6baa-49c3-89c8-7a5652eeadf9","resolution":{"observed_at":"2026-08-11T21:30:06.676145Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.662165Z","title":"Decker, C","venue":null,"work_id":"1de89cc0-19e0-45df-af3a-9dc2c757e076","year":2020},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.966402Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:0e35200eb3443050b47697a147ebd43353427b35e09dadf74e998b8da7454e4a","observation_id":"0c3121ea-a81d-42af-9952-13bbfab64727","resolution":{"observed_at":"2026-08-11T21:30:06.666068Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-017-0022-6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:30:06.092923Z","title":"Chancellor, S","venue":null,"work_id":"5678a8c9-db96-43d8-a006-2e3e49bbca2a","year":2017},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.969945Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:9016d2c4fbc18e17242493a4e8d7b2c8396bd9963ad0c62b7568bb419efeb212","observation_id":"8c72ffa0-2286-4db1-a0c8-aa108e2f3e6e","resolution":{"observed_at":"2026-08-11T21:30:06.097215Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.651709Z","title":"Rakyta and Z","venue":null,"work_id":"c5e51508-d79c-4403-a7b8-8814aa916a3f","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.973118Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:c84a71aa135214d42c44ccc7f801d7ed05d0f158ff7cb252cb1d18994400625b","observation_id":"42b3545b-89e5-4a43-859d-e3db13cf3618","resolution":{"observed_at":"2026-08-11T21:30:06.655463Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3505181","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-11T21:30:06.079841Z","title":"Madden and A","venue":null,"work_id":"abea1183-36a6-4409-b7ad-d1ef71237988","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.976880Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:8cdc35061e52dc2d97f507d9b847f374b6c2fb045aa240436a2cb84818d87656","observation_id":"5044fa99-8832-457b-a7b8-04ac79d53dcb","resolution":{"observed_at":"2026-08-11T21:30:06.084849Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.640601Z","title":"Orús and J","venue":null,"work_id":"2c3908d9-0b22-4106-9b5c-7a27e061c44f","year":2004},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.980431Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:4e3b213510e19cb0769a06ab08ec7f5cd3741250070208970a057c61e7638e81","observation_id":"0204266b-1415-48fb-a7c4-68ca1e068265","resolution":{"observed_at":"2026-08-11T21:30:06.645165Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.630239Z","title":"Lanting, A","venue":null,"work_id":"36116a71-5aa4-429b-bdc8-fef473fdcc65","year":2014},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.984458Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:1537c9fca2b432f30b5e0d1a487788375524f952eefd1c6071a7929b5ff402f7","observation_id":"8a9fdb74-673f-4187-a2f9-525ea5609141","resolution":{"observed_at":"2026-08-11T21:30:06.633713Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:05.988582Z","title":"Hauke, L","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.988582Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:a94feb9107bbce7a046d61875eb0397cfd193edcd170b153632cff7d62b36ab5","observation_id":"18a462f3-76be-49cd-bee3-6b506e67e19f","resolution":{"observed_at":"2026-08-11T21:30:05.988582Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2411.08119","last_updated":"2025-02-21T18:14:32Z","snapshot_observed_at":"2026-08-18T20:33:24.374623Z","submitted_at":"2024-11-12T19:00:16Z","title":"Genuine Multipartite Entanglement in Quantum Optimization","version":2},"cited_work":{"arxiv_id":"2411.08119","doi":null,"metadata_source":"pith","pith_arxiv_id":"2411.08119","snapshot_observed_at":"2026-08-11T21:30:06.120031Z","title":"Genuine Multipartite Entanglement in Quantum Optimization","venue":"quant-ph","work_id":"d824ad18-2769-4b6e-a1bd-8a228523967b","year":2024},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.992776Z"},"links":{"cited_paper":"/paper/2411.08119","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:1bd6a945a36320cbfbe07bb8295231ea120c7c082680c5f9fc151ab049a42bf9","observation_id":"32366fe4-7714-47cc-893d-8f46708eca9a","resolution":{"observed_at":"2026-08-11T21:30:06.126657Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.619232Z","title":"Lipkin, N","venue":null,"work_id":"dc12c42c-446d-402e-b900-9def693f5cd0","year":1965},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.997277Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:e4e8c9adc2fb8b5dd04cfad90c18d528f4dbeac0439c96cfb55ed4690ad9a1f8","observation_id":"09c1bb7c-31b1-49d5-9e8e-5f289da287f2","resolution":{"observed_at":"2026-08-11T21:30:06.623067Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.610307Z","title":"Meshkov, A","venue":null,"work_id":"7da3977c-f271-45ba-adc4-c392b4ca6fac","year":1965},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.001189Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:b8afb495a6b12e3f9bee34e4ac9ac3015f015d6b961665f4977ffa173e5d8e7f","observation_id":"22a874ff-599d-4a00-80e1-190c9ce936dd","resolution":{"observed_at":"2026-08-11T21:30:06.613630Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.601379Z","title":"Glick, H","venue":null,"work_id":"5ad1a886-1758-4659-80d2-5b1299b9f6b6","year":1965},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.004548Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:b80b373b13e06b34e17effb62371acb77b33dd36ee6fa488d83de84d1344da06","observation_id":"004c7b10-770e-4813-a59a-d548002220ad","resolution":{"observed_at":"2026-08-11T21:30:06.604315Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.585726Z","title":null,"venue":null,"work_id":"763fa435-a28e-4da4-a276-63323a76a4f8","year":2010},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.008139Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:92dc268beb912d77c86659e1f78eec1a86575f3155af876ca93a72bcd892ddc8","observation_id":"8cdb98c6-bfd9-4d85-9d7f-d66f287fb83d","resolution":{"observed_at":"2026-08-11T21:30:06.594456Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.011837Z","title":"Ohzeki, Quantum Monte Carlo simulation of a par- ticular class of non-stoquastic Hamiltonians in quantum annealing, Sci","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.011837Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:ddf21cf25300e80f21fd3d1b8f5f63227d5a169a5305ff0f8c4ad4daa4b817e7","observation_id":"f418f75f-70cb-4d1d-b2ac-b8f6a6f12833","resolution":{"observed_at":"2026-08-11T21:30:06.011837Z","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-11T21:30:06.574636Z","title":"Seki and H","venue":null,"work_id":"7bb905aa-7f60-42ed-a52d-57cd7a79e416","year":2012},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.015507Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:3d6aad8e55ec3be3f92cceaedb731122fc8c40b1bf12acdacc609a4147da2e3b","observation_id":"6b5e4ebe-8c2c-4c13-9c6f-10328b69d8b5","resolution":{"observed_at":"2026-08-11T21:30:06.578414Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.563853Z","title":null,"venue":null,"work_id":"010aa02d-bd84-468e-a220-6fbc0896412f","year":2019},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.018993Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:a0cf558d0f5482e83e108bf761349d6c2239edd4fa350d18b473572f2f1f1cac","observation_id":"3dab9d0e-dd5b-4bf4-bcbf-613a386d400b","resolution":{"observed_at":"2026-08-11T21:30:06.567617Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.552909Z","title":null,"venue":null,"work_id":"ca945523-b698-4727-af18-0fb592d12db7","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.022444Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:039549e0dfcc0cad51bb03e90316acfa6753074e9994d1ff10aa0a1fdec737f1","observation_id":"c0dc8823-5663-4ab7-b6de-5f77be5f477c","resolution":{"observed_at":"2026-08-11T21:30:06.556612Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.541237Z","title":"Lucas, Ising formulations of many NP problems, Front","venue":null,"work_id":"5371d33d-5136-4711-a1a8-19c9e99034c7","year":2014},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.025746Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:d420871f4d0bc934c99709054424f37c61fa1da5d0e1d255291b2441271ebe88","observation_id":"8dbf14aa-0a12-4229-b4de-61d80463af69","resolution":{"observed_at":"2026-08-11T21:30:06.545671Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.530391Z","title":"Dominguez, J","venue":null,"work_id":"2d02984f-07fe-4ef6-8d65-e6f03f2350eb","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.029046Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:b4dbfba2fcffffb4f713048a610abe19fb50335af61f53ec2fdf25840f9c8349","observation_id":"897484ae-c84b-4a93-ac33-dce45bedb2c4","resolution":{"observed_at":"2026-08-11T21:30:06.534193Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.519501Z","title":null,"venue":null,"work_id":"9cd2c468-33bf-4c4a-9e04-33587e80221a","year":2023},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.032784Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:8d712c99e65340d61bc5e4b93ea51f51dfe8d9379d33297cfeb1eb5a6c139244","observation_id":"0911d5d3-4680-4985-abd4-f87b00746646","resolution":{"observed_at":"2026-08-11T21:30:06.523092Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+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-11T21:30:06.508770Z","title":"Glos, and J","venue":null,"work_id":"802d7d88-bbfd-46de-8ecc-0ffd328ad5ef","year":2022},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.036340Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:a629dfb4b744ae4f2bf28741a26a8acc2b2168386b98f4603c785685bf0e5215","observation_id":"6cdd7b57-e2dc-481e-9eca-e3b57ddbbb05","resolution":{"observed_at":"2026-08-11T21:30:06.512391Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1004.2226","last_updated":"2010-04-13T16:33:41Z","snapshot_observed_at":"2026-08-15T05:21:49.385142Z","submitted_at":"2010-04-13T16:33:41Z","title":"Adiabatic Quantum Algorithms for the NP-Complete Maximum-Weight Independent Set, Exact Cover and 3SAT Problems","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1004.2226","snapshot_observed_at":"2026-08-11T21:30:06.040006Z","title":"Choi, Adiabatic quantum algorithms for the np- complete maximum-weight independent set, exact cover and 3SAT problems (2010), arXiv:1004.2226 [quant-ph]","venue":null,"work_id":null,"year":2010},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.040006Z"},"links":{"cited_paper":"/paper/1004.2226","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:ac09784dd6a92a168e0f8d5bbecffe2b6b27ee10f1bdc8fff6a5a81a57e4485a","observation_id":"560addbc-64dc-4b9f-81cb-ed4d1e60b377","resolution":{"observed_at":"2026-08-11T21:30:06.040006Z","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-11T21:30:06.499502Z","title":"Herrman, L","venue":null,"work_id":"eb60938b-66d7-4be1-8584-50b32b192ced","year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:06.043500Z"},"links":{"citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:f4d521f4156d35c9200139682a3ef31651c952b044ba52d0604cdb878da09187","observation_id":"3d91d6c6-53b7-4e62-bba4-192510c01732","resolution":{"observed_at":"2026-08-11T21:30:06.502321Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-21T06:32:19.484+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","latest_version":3,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization"},"reference_resolution":{"displayed":86,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":41,"verified_exact":7,"verified_fuzzy":38},"total_outbound_references":86},"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-21T06:32:19.484+00:00","source":"crossref"},{"observed_at":"2026-08-21T06:32:16.066871+00:00","source":"retraction_watch"}],"thesis":"As of 22 August 2026, this Paper Citation Record lists 86 of 86 outbound references and 0 inbound Pith citation observations for arXiv:2412.04398."}