{"as_of":"2026-08-08T01:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:c4b7e229394f72741eb84eaca70c7b21aa5efe6b6e40320111dedd6a04048709","coverage":[{"denominator":13,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":13,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:16:00.428229Z","state":"measured"},{"denominator":17,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":17,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+00:00","state":"measured"},{"denominator":4,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":4,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T17:15:59.496835Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"pith","source_observed_at":"2026-07-08T01:34:26.521621Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.11040","snapshot_observed_at":"2026-08-04T17:15:59.496835Z","title":"sufficiently","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.496835Z"},"links":{"cited_paper":"/paper/2509.11040","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:b8acd96a9ba79d087025181b9019fda99783979202dcdc501fa81aeec1aa0c62","observation_id":"7f068953-a2a1-4860-ad9e-59302af8ed09","resolution":{"observed_at":"2026-08-04T17:15:59.496835Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.11040","snapshot_observed_at":"2026-07-11T10:05:39.273788Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05014","last_updated":"2026-07-30T16:58:40Z","snapshot_observed_at":"2026-08-07T10:15:15.421919Z","submitted_at":"2026-07-06T12:56:11Z","title":"Geometric Characteristics of Subproblems in Ising-Machine-Assisted Large Neighborhood Search","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-11T10:05:39.273788Z"},"links":{"cited_paper":"/paper/2509.11040","citing_paper":"/paper/2607.05014"},"observation_digest":"sha256:98b54ad69fccce8f9468def6e5018f52d535aba10d14079b2947270df302f523","observation_id":"3ebb4bb4-612f-4bae-9f2b-2275a5a39e89","resolution":{"observed_at":"2026-07-11T10:05:39.273788Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.11040","snapshot_observed_at":"2026-08-02T08:35:11.005984Z","title":null,"venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.05014","last_updated":"2026-07-30T16:58:40Z","snapshot_observed_at":"2026-08-07T10:15:15.421919Z","submitted_at":"2026-07-06T12:56:11Z","title":"Geometric Characteristics of Subproblems in Ising-Machine-Assisted Large Neighborhood Search","version":2},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-02T08:35:11.005984Z"},"links":{"cited_paper":"/paper/2509.11040","citing_paper":"/paper/2607.05014"},"observation_digest":"sha256:7d9c07cfebbc104afdaf290d047751c601b32b868929750b1f5cc98db644bdd5","observation_id":"2b553ec8-f3b2-49fc-bf9b-680237944dd3","resolution":{"observed_at":"2026-08-02T08:35:11.005984Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"cited_work":{"arxiv_id":"2509.11040","doi":null,"metadata_source":"pith","pith_arxiv_id":"2509.11040","snapshot_observed_at":"2026-07-08T01:34:26.521621Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","venue":"math.OC","work_id":"1d1b360e-6fd7-4b6e-bd12-d9331e09bd14","year":2025},"citing_paper":{"arxiv_id":"2607.05169","last_updated":"2026-07-06T14:49:30Z","snapshot_observed_at":"2026-08-03T22:19:58.889598Z","submitted_at":"2026-07-06T14:49:30Z","title":"Ising-Machine-Assisted Large Neighborhood Search with Flexibly Tunable Subproblem Size","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-08T01:31:26.697516Z"},"links":{"cited_paper":"/paper/2509.11040","citing_paper":"/paper/2607.05169"},"observation_digest":"sha256:14c6fbced12c757fc114f81dad21845527a8490cff07af430fcbe0783293dc44","observation_id":"1d6d1509-4da3-4876-b276-4d14e1cd82c7","resolution":{"observed_at":"2026-07-08T01:34:26.523460Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2509.11040/citation-record","integrity":"/paper/2509.11040/integrity","json":"/paper/2509.11040/citation-record.json","paper":"/paper/2509.11040"},"outbound":[{"citation":{"cited_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2509.11040","snapshot_observed_at":"2026-08-04T17:15:59.496835Z","title":"sufficiently","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.496835Z"},"links":{"cited_paper":"/paper/2509.11040","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:b8acd96a9ba79d087025181b9019fda99783979202dcdc501fa81aeec1aa0c62","observation_id":"7f068953-a2a1-4860-ad9e-59302af8ed09","resolution":{"observed_at":"2026-08-04T17:15:59.496835Z","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-04T17:15:59.587677Z","title":"Invoking heuristic solvers at every node can be prohibitively expensive and may significantly in- crease the overall computation time","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.587677Z"},"links":{"citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:f450e00ed4fe242b766642d2409dcbeada06bd11216b3477f576f96d51d5525d","observation_id":"1e3d6fa9-66ba-414a-ab14-5e6276e20258","resolution":{"observed_at":"2026-08-04T17:15:59.587677Z","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-04T17:15:59.660359Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.660359Z"},"links":{"citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:d841506875cc361e69e1faaa00c1801082d612bef24141a79b3e5d0f569b314d","observation_id":"96181fa2-21fd-41f2-9b92-3357d2e43dce","resolution":{"observed_at":"2026-08-04T17:15:59.660359Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2504.15367","last_updated":"2025-04-21T18:19:19Z","snapshot_observed_at":"2026-08-07T16:00:28.628090Z","submitted_at":"2025-04-21T18:19:19Z","title":"Branch-and-bound digitized counterdiabatic quantum optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2504.15367","snapshot_observed_at":"2026-08-04T17:16:00.354409Z","title":"Branch- and-bound digitized counterdiabatic quantum optimization.arXiv preprint arXiv:2504.15367,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-04T17:16:00.354409Z"},"links":{"cited_paper":"/paper/2504.15367","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:93157a0d6c6216875bfda7ec811279a39a82d91a3f36aae56df767d2a4194163","observation_id":"17d9461e-8684-4ab4-abb7-6822b4446bdb","resolution":{"observed_at":"2026-08-04T17:16:00.354409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2307.02577","last_updated":"2026-07-27T21:57:18Z","snapshot_observed_at":"2026-08-07T05:13:27.411685Z","submitted_at":"2023-07-05T18:20:31Z","title":"QUBO.jl: A Julia Ecosystem for Quadratic Unconstrained Binary Optimization","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2307.02577","snapshot_observed_at":"2026-08-04T17:16:00.428229Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-04T17:16:00.428229Z"},"links":{"cited_paper":"/paper/2307.02577","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:31abc15acf55a45553d3ed9af6486dc4b63fb364da2175808a67f361bd202d9e","observation_id":"8aba4b33-4b3e-4178-84d8-bc72ce942d15","resolution":{"observed_at":"2026-08-04T17:16:00.428229Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2405.00935","last_updated":"2024-05-02T01:28:52Z","snapshot_observed_at":"2026-08-03T10:11:57.939167Z","submitted_at":"2024-05-02T01:28:52Z","title":"Efficient Internal Strategies in Quantum Relaxation based Branch-and-Bound","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2405.00935","snapshot_observed_at":"2026-08-04T17:16:00.090225Z","title":"Ef- ficient Internal Strategies in Quantum Re- laxation based Branch-and-Bound.arXiv preprint arXiv:2405.00935,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":1999,"source":"pdf_text","source_observed_at":"2026-08-04T17:16:00.090225Z"},"links":{"cited_paper":"/paper/2405.00935","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:c9b979a0c038febe52f41f647f40ccfc6edf652f64324627f6f2f10e3e2b6b8d","observation_id":"b4142933-13bd-48a5-a4d9-c422bd0d3516","resolution":{"observed_at":"2026-08-04T17:16:00.090225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2407.20185","last_updated":"2024-07-29T17:13:01Z","snapshot_observed_at":"2026-08-01T17:35:43.206370Z","submitted_at":"2024-07-29T17:13:01Z","title":"Solving QUBOs with a quantum-amenable branch and bound method","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2407.20185","snapshot_observed_at":"2026-08-04T17:15:59.926726Z","title":"Solv- ing QUBOs with a quantum-amenable branch and bound method.arXiv preprint arXiv:2407.20185,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2000,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.926726Z"},"links":{"cited_paper":"/paper/2407.20185","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:99f6109207b3ecf2061dbff30e02032adc851a1c1719ffabc0c02c3347f9bf63","observation_id":"870d55a4-8c19-4266-9443-ba63112f266e","resolution":{"observed_at":"2026-08-04T17:15:59.926726Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2008.07456","last_updated":"2020-08-17T16:29:34Z","snapshot_observed_at":"2026-07-06T09:47:51.330143Z","submitted_at":"2020-08-17T16:29:34Z","title":"Adiabatic Quantum Optimization Fails to Solve the Knapsack Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2008.07456","snapshot_observed_at":"2026-08-04T17:16:00.263091Z","title":"Adiabatic quantum optimization fails to solve the knapsack problem","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2004,"source":"pdf_text","source_observed_at":"2026-08-04T17:16:00.263091Z"},"links":{"cited_paper":"/paper/2008.07456","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:70dffc89f1a4a1221bb8a8547d1cde91b930d982e3fd6b816d4547bc778ebf3d","observation_id":"e4715bfc-0fb3-47f7-8e66-62e3205d1f02","resolution":{"observed_at":"2026-08-04T17:16:00.263091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1411.4028","last_updated":"2014-11-14T19:57:57Z","snapshot_observed_at":"2026-07-06T04:00:38.324755Z","submitted_at":"2014-11-14T19:57:57Z","title":"A Quantum Approximate Optimization Algorithm","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1411.4028","snapshot_observed_at":"2026-08-04T17:15:59.837337Z","title":"A quantum approximate optimization algorithm.arXiv preprint arXiv:1411.4028,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2005,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.837337Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:f1c6955df2bda1da88fb0c0e31ef46d17618d4daf9b27b9591a79d2c83638941","observation_id":"82de2768-5fc7-42a0-bca2-84d5f132a704","resolution":{"observed_at":"2026-08-04T17:15:59.837337Z","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-04T17:15:59.707271Z","title":"A brief history of linear and mixed-integer programming computa- tion.Documenta Mathematica, 2012:107– 121,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2006,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.707271Z"},"links":{"citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:0ec9603960c9e1c862a31c750db1dced8847d3da5cca624a03652a65a78cf305","observation_id":"16cabaaa-585e-45ba-903f-9d5b03c4e008","resolution":{"observed_at":"2026-08-04T17:15:59.707271Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2210.03210","last_updated":"2022-10-06T21:08:46Z","snapshot_observed_at":"2026-08-04T06:18:12.212580Z","submitted_at":"2022-10-06T21:08:46Z","title":"Universal Quantum Speedup for Branch-and-Bound, Branch-and-Cut, and Tree-Search Algorithms","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2210.03210","snapshot_observed_at":"2026-08-04T17:15:59.776369Z","title":"Universal quantum speedup for branch-and-bound, branch-and-cut, and tree-search algorithms.arXiv preprint arXiv:2210.03210,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2014,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.776369Z"},"links":{"cited_paper":"/paper/2210.03210","citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:91b223f292f3867ee59d55a0d633c87fa94393a4ef9c2b049a0f1ffdb5546c47","observation_id":"bc1ab194-de97-4122-9187-ea924600fcd2","resolution":{"observed_at":"2026-08-04T17:15:59.776369Z","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-04T17:15:59.997669Z","title":"Progress in mathematical programming solvers from 2001 to 2020.EURO Journal on Compu- tational Optimization, 10:100031,","venue":null,"work_id":null,"year":2001},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-04T17:15:59.997669Z"},"links":{"citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:9522710b7cfe672a1b86be0dbc29a2ce03f111a15047f8d89ebcbd2a1f642e11","observation_id":"0a248719-8d95-4236-a800-ea07fa9345bd","resolution":{"observed_at":"2026-08-04T17:15:59.997669Z","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-04T17:16:00.193637Z","title":"Improving solutions by em- bedding larger subproblems in a D-Wave quantum annealer.Scientific reports, 9(1):2098,","venue":null,"work_id":null,"year":2098},"citing_paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization","version":1},"reference_index":2020,"source":"pdf_text","source_observed_at":"2026-08-04T17:16:00.193637Z"},"links":{"citing_paper":"/paper/2509.11040"},"observation_digest":"sha256:f782ddc70017e132b980d5e60d2803ac54466c31fb86df8d3987f42255c20de8","observation_id":"d39fe585-1340-4aac-81ef-89a7c9d0f45d","resolution":{"observed_at":"2026-08-04T17:16:00.193637Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2509.11040","last_updated":"2025-09-14T02:10:16Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-07T08:54:05.699075Z","submitted_at":"2025-09-14T02:10:16Z","title":"Hybrid Quantum Branch-and-Bound Method for Quadratic Unconstrained Binary Optimization"},"reference_resolution":{"displayed":13,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":13,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":13},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 4 inbound Pith citation observations for arXiv:2509.11040."}