{"as_of":"2026-08-06T01:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:552a1296af260b26090922e744e93b9d81ec394026814161a5f52ee2f7005426","coverage":[{"denominator":28,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":28,"source":"paper_references, paper_reference_links","source_observed_at":"2026-05-18T14:09:42.267153Z","state":"measured"},{"denominator":28,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":28,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-05T06:32:48.257954+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/2509.21064/citation-record","integrity":"/paper/2509.21064/integrity","json":"/paper/2509.21064/citation-record.json","paper":"/paper/2509.21064"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Alleviating the quantum big-m problem","venue":null,"work_id":"87f50ff9-7234-4357-8ea0-c2c5c73b3bb6","year":2025},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:e83067c944d9b0d2eedc0a902a4889bbddc04ed7471c882fd5a8f44a7df6f25b","observation_id":"a4305de3-3400-45e2-86b4-e942f2501f08","resolution":{"observed_at":"2026-05-18T14:12:40.029589Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Maximum satisfiability","venue":null,"work_id":"7bd3688a-3b93-433f-b02d-991345124217","year":2021},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:565139b1f07b8251a5bed66fa48b1ed06c9d57db4730f03219db98d1c9a08cc3","observation_id":"200190b2-84bc-4a62-b530-a4941a90b61c","resolution":{"observed_at":"2026-05-18T14:12:40.001475Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Experiments in quadratic 0--1 programming","venue":null,"work_id":"556fc710-63d9-4b33-9f58-061c7f29785b","year":1989},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:aec4ae1033f39605082e4deed79f3d4167f31dde9ba8ff93640150ef5a67fb99","observation_id":"b42d9b3d-1b92-4579-bf56-927f53cd9e12","resolution":{"observed_at":"2026-05-18T14:12:40.024734Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"The hard-core model on random graphs revisited","venue":null,"work_id":"863d66d6-2035-4833-9472-08f423a99307","year":2013},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:0aaa786bfbb92e5a2770300beafb6af3c39589c9136a27be968474e06c28eb00","observation_id":"24c7edf9-a8ba-4f6c-913d-d275733185ac","resolution":{"observed_at":"2026-05-18T14:12:40.044541Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Simulated annealing","venue":null,"work_id":"b7f87985-760a-4d08-9906-ec6d841da630","year":1993},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:2e42bd9714bbc443d72e3674ae17a94d437eebb389acf6c447fa402765b59a7d","observation_id":"b1f2e071-67b6-4fb5-b22b-e00258e5cdf4","resolution":{"observed_at":"2026-05-18T14:12:40.038244Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"The mathematics of quantum-enabled applications on the d-wave quantum computer","venue":null,"work_id":"16f7b255-0c94-41ad-a207-cbe2857c87e4","year":2019},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:529b71caea13cc745f0f086faf5c9eb1886da058b082f87d57c1d2c8bf403d76","observation_id":"258b81c0-0ce9-498e-9e2b-f9d696490cff","resolution":{"observed_at":"2026-05-18T14:12:39.991983Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Convex optimization","venue":null,"work_id":"b8dafbdd-8998-4c29-85ea-b42f1a807e7f","year":2004},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:772ed934dffa2e26f1e392b892da1dd6aed79c26f786a9a52d8ed540f33ea275","observation_id":"2d372c52-5ff0-4f45-806e-7b56a47d496d","resolution":{"observed_at":"2026-05-18T14:12:40.027155Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"JAX : composable transformations of P ython+ N um P y programs","venue":null,"work_id":"32903ec8-f469-4ea6-865f-3d3d2af7a2f4","year":2025},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:f448d975a6d262097b904ffe99e3cbcb88e3f52c828bb31f3d243205d9a98302","observation_id":"bdfbb35a-0bc0-4c1f-8677-7936bce526ae","resolution":{"observed_at":"2026-05-18T14:12:40.021332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Controlling continuous relaxation for combinatorial optimization","venue":null,"work_id":"d00ead59-686d-4b4c-82fc-59b073298b8d","year":2024},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:cdfc4d9937fc6bad2c733a706591adb81f29f3f3ac19e39c185315389e180eec","observation_id":"f255dff3-147a-45ed-82f8-d1e3bffe25b9","resolution":{"observed_at":"2026-05-18T14:12:39.995073Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Erdos goes neural: an unsupervised learning framework for combinatorial optimization on graphs","venue":null,"work_id":"96d56b60-b50b-41d2-b74a-edeea8a7cda8","year":2020},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:258dfee8a3cbeb9a0e67474065cbc415003bc2a779c16525e7c104e9d55552e7","observation_id":"626fc09d-dbcc-4dce-8507-a11b262e8196","resolution":{"observed_at":"2026-05-18T14:12:40.041184Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Ising formulations of many np problems","venue":null,"work_id":"af1f8ced-5c56-499e-a208-9a7c89ca6753","year":2014},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:2b38e45e21b71970e4e239266b3c11b35b79b8a1cab39ec363a7bff4390bb5e1","observation_id":"4bae729c-30d9-4f5a-8be5-3a820f583326","resolution":{"observed_at":"2026-05-18T14:12:40.013183Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Genetic algorithms for binary quadratic programming","venue":null,"work_id":"01a36124-2882-4179-8b52-1aa1756d0c55","year":1999},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:39a7b21a541f3de3f086ad8bc3de1a7993c3f5a74dc89cc8f5eeccfe00f2ea17","observation_id":"6ff3063e-08b8-42e3-8602-f52b997f5a08","resolution":{"observed_at":"2026-05-18T14:12:40.032600Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Diverse adaptive bulk search: a framework for solving qubo problems on multiple gpus","venue":null,"work_id":"96e806c0-218c-4374-a0d3-f7f41fd89aea","year":2023},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:c96f646f0395f69b179a1da6365d85b97b1a43b1e975cccd22aebf0d22e5b907","observation_id":"6e91e7b9-48ae-4382-9541-d42bd0e92528","resolution":{"observed_at":"2026-05-18T14:12:40.007228Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Iterated tabu search for the unconstrained binary quadratic optimization problem","venue":null,"work_id":"c289bf85-35a2-48d6-ba9e-429adf2ae63a","year":2006},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:7f42ded1481e18cbc5ffbc81ab4577eaec280ec9c01d311eb5111fd74133c837","observation_id":"54aca4e3-7262-41e0-9d94-87e37c87a318","resolution":{"observed_at":"2026-05-18T14:12:40.016362Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Solving the max-cut problem using eigenvalues","venue":null,"work_id":"8854365d-ddb0-48b3-9216-755816a7e485","year":1995},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:43a2926bc3e8d1dd2342e4a72e41613e0e4fa2c184a07fab3d2215b135324520","observation_id":"ef55c17d-3cbe-4699-830f-2d3c002e2b12","resolution":{"observed_at":"2026-05-18T14:11:28.254394Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Ros: A gnn-based relax-optimize-and-sample framework for max- k -cut problems","venue":null,"work_id":"0b722e6e-41bb-44ec-8ede-b117e2fb60fe","year":2025},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:8cf3585dbf6a275590260f00c585d81e74b0d96cadf562c343002f729bdf17ae","observation_id":"28060af4-fa16-45e3-aea1-9b90f39cccbf","resolution":{"observed_at":"2026-05-18T14:11:28.252191Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Faster exact solution of sparse maxcut and qubo problems","venue":null,"work_id":"e746885c-f03a-4165-9cf0-33586952c02d","year":2023},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:d1c8a9fe5c38c404ccba57efbfa68e40fe57ebd6ce7c67660b58e77314b338bb","observation_id":"333a3be3-43dc-4fc8-ab3b-f163017acbdd","resolution":{"observed_at":"2026-05-18T14:11:28.249717Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Combinatorial optimization with physics-inspired graph neural networks","venue":null,"work_id":"b0e70cac-ad43-4e32-aa50-716f71ef0a9b","year":2022},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:499faec17dfe7a4db028feb08762fe343f322970b8b6fafc8a6930bbb35d835b","observation_id":"c3fced2a-ee25-4e90-9e18-d601f54a9d1e","resolution":{"observed_at":"2026-05-18T14:12:39.998279Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Free-energy machine for combinatorial optimization","venue":null,"work_id":"d817d1b7-0b7a-45f5-a255-da2088005da1","year":2025},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:c4787672c2c04931fd57d0b61208c3fbb162f7a569c9425560dfddcc35b4b686","observation_id":"09167c0c-73d0-4e58-b17c-f09a8669cd1f","resolution":{"observed_at":"2026-05-18T14:11:28.247376Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"One model, any csp: Graph neural networks as fast global search heuristics for constraint satisfaction","venue":null,"work_id":"af4191f0-4b6e-459c-a03b-8fa0d9278520","year":2023},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:897fc086062a59a54cce4d8884b85dc5a7c296a9f1c9b4b9e017742b8a8262f4","observation_id":"6bd2b50d-0b2a-4f10-97ca-bc05957ec2f4","resolution":{"observed_at":"2026-05-18T14:11:28.244898Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Unsupervised learning for combinatorial optimization with principled objective relaxation","venue":null,"work_id":"86171a42-f9fe-460a-9e81-1babc754e6bc","year":2022},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:d392109ecb0dd99edadba272a1957c09704d72d85a1f837a571edd74b5b16c3c","observation_id":"a2a9808a-35df-4c34-9180-b943618b212b","resolution":{"observed_at":"2026-05-18T14:11:28.242622Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Probabilistic grasp-tabu search algorithms for the ubqp problem","venue":null,"work_id":"604ff7b9-73cd-4d80-b8fb-9c95a693ae10","year":2013},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:52732ff22076d31688c5660434f2c1a5198940f5e99d6cff1df8d243d3d898cd","observation_id":"67970a7f-92d8-45ab-aa76-8ee4dd9160ea","resolution":{"observed_at":"2026-05-18T14:12:40.035450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"The gset dataset","venue":null,"work_id":"e0b41e1c-9c2d-40e4-b6ef-1fb287c9331e","year":2003},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:8357ea0ab7d8e4156d1580eff6b2543065a99d5a801d2d8f596498dab7c2d00a","observation_id":"ded25e92-912c-4d74-a62a-2d9119f4c55e","resolution":{"observed_at":"2026-05-18T14:12:40.004182Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":"Benchmarking hamiltonian noise in the d-wave quantum annealer","venue":null,"work_id":"c746a4dc-23ea-4e06-8676-7ed4de9bac4d","year":2021},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:c9a72fec2ffde57947af82ae43074dd5b871275c6318171939283c25c1d62ecc","observation_id":"706b0aaa-a61c-4580-b095-2e95f8195df6","resolution":{"observed_at":"2026-05-18T14:11:28.240173Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T00:05:48.311803Z","title":"write newline","venue":null,"work_id":"8e5fda61-e601-4df4-8204-015bee341570","year":null},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:50a9c933b7a97cc0a3f1b0f4269f573190a58b5c7f6f8c4025a2439f4f0ae4b1","observation_id":"66d4028b-ad14-412d-b0dc-e85ace0729fb","resolution":{"observed_at":"2026-05-18T14:11:28.237674Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-08T23:55:44.012295Z","title":"@esa (Ref","venue":null,"work_id":"b058608d-98d0-4821-a4ae-403d2b7cd411","year":null},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:3e688f502759d8e756f7cd8129c60055e2ea7bd756755ee498d1c9c68cec6047","observation_id":"811957ad-276c-437c-bf5f-339af0e01ab3","resolution":{"observed_at":"2026-05-18T14:11:28.234264Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-09T00:05:48.337191Z","title":null,"venue":null,"work_id":"ea79bfb8-d434-45e9-8607-416d3839ec5c","year":null},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:7c50780a9e0e863ee532590f829273e8c57efc8f214aee75323cf37e83d00992","observation_id":"a08d1e6a-9482-42c3-922d-1a918241b886","resolution":{"observed_at":"2026-05-18T14:11:28.231422Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+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-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"d051d6aa-efca-49eb-a66d-8ea01bf21294","year":null},"citing_paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective","version":2},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-05-18T14:09:42.267153Z"},"links":{"citing_paper":"/paper/2509.21064"},"observation_digest":"sha256:8a219fcaf7ca474ce5573f5c4113921c8adc84273e3cfd1d66b4f76b67714aca","observation_id":"4d6a7c4b-4c97-49d0-85ff-6c835fa1d46c","resolution":{"observed_at":"2026-05-18T14:11:28.228835Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-05T06:32:48.257954+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2509.21064","last_updated":"2026-05-09T07:08:18Z","latest_version":2,"primary_category":"math.OC","snapshot_observed_at":"2026-07-06T22:30:46.129271Z","submitted_at":"2025-09-25T12:14:14Z","title":"Smoothing Binary Optimization: A Primal-Dual Perspective"},"reference_resolution":{"displayed":28,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":2,"verified_exact":0,"verified_fuzzy":26},"total_outbound_references":28},"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-05T06:32:48.257954+00:00","source":"crossref"},{"observed_at":"2026-08-05T06:32:44.755628+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 28 of 28 outbound references and 0 inbound Pith citation observations for arXiv:2509.21064."}