{"as_of":"2026-08-10T15:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2036502a8ec92270379c052ceaa7534e0b4f5469574a12bb3609e7e08169bdae","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-10T06:31:04.303077+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-08T04:33:23.624679Z","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-08T04:33:23.624679Z","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:fdb458135a10f6286c7bc36100facc72e562009ef7990306de47faf481400d22","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-08T04:33:23.624679Z","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-10T03:47:29.781293Z","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:fdbdb3154742e02037cf1d5e8f3783a905066aa0568bc2097373d88682b5a2b0","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-08T04:33:23.624679Z","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-10T03:47:29.781293Z","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:a2a82c739751a58ee8f2b45f29e6b7a5601846693946cdaa8e74b03d66112fea","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-08T04:33:23.624679Z","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:b1becd92ca1d1586ecfdfeb4f3ff98fcae636f289391ee3d0af9b0d271746c1f","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08T04:33:23.624679Z","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-08T04:33:23.624679Z","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:fdb458135a10f6286c7bc36100facc72e562009ef7990306de47faf481400d22","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-08T04:33:23.624679Z","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:d4adb765ce2ddcf06da0901b68f493eb59be500cd43a82681a9ef4613943caa0","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-08T04:33:23.624679Z","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:f2bbf7539437e0b034c653b48b0db39f628f4a6dda3ff78b6c3fa2b66e884da5","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-09T03:50:05.758847Z","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-08T04:33:23.624679Z","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:d3b7ea1a12c0390a12f8317ebd7176bf56d3589d602ba6ca8af5adee73d319ac","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-08T04:33:23.624679Z","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:3b906a927ac2bf8cb6330e212190d28cf26a6d20aa1ebb9c4c1f8e56345d3be2","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-08T16:24:45.497362Z","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-08T04:33:23.624679Z","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:73e7fe1159180dd3b0a608b281f5f74b31fbcf44e32efbc3da27e11effcb3fcf","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-09T09:16:07.328269Z","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-08T04:33:23.624679Z","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:484dc8073d78541651ef8dd1a9a4746751a977ea54d7a685aa80092366338833","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-08T04:33:23.624679Z","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:e483fa726aa0ffcc11268686f8e002afd57fecab4a3a1f37a08d10dfbdf619f7","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-08T04:33:23.624679Z","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:15bcf3098df25ae94c26da9af4ddb91f1011c4366a32c7f15eeb1edfe544dee2","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-08T04:33:23.624679Z","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:4634ea2b6fcb8d0a8d7f6515bf5ff848b6ad863bb116085bf5a47b98c0b4ab29","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-08T04:33:23.624679Z","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:3089aa7759f57500dcc266d230758dc042b30a6a4c1bd26b9093d29eb7115ede","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-08T04:33:23.624679Z","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:61439ea5b3838c55ae38f71510788bd3420710fcbd47e835cf5694de4ef8d6b0","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-08T04:33:23.624679Z","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:5e31aa3c315cad003515a4d5bcb3485b85bcd1c8a379a67bd3abfd3d543f1620","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-08T04:33:23.624679Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 13 of 13 outbound references and 4 inbound Pith citation observations for arXiv:2509.11040."}