{"as_of":"2026-08-09T10:51:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:f632c8bfb6150e56e3805f55b8242ce3ee0b4e5d99e745189c3fd7730d9565dd","coverage":[{"denominator":40,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":40,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T00:07:37.853313Z","state":"measured"},{"denominator":40,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":40,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+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/2607.26349/citation-record","integrity":"/paper/2607.26349/integrity","json":"/paper/2607.26349/citation-record.json","paper":"/paper/2607.26349"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T00:07:33.603888Z","title":"Leveraging quantum comput- ing for accelerated classical algorithms in power systems optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:33.603888Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:0154ee08718a19190dd8a1a113ebed3aa5fdfa9af7e0098b6607c8680db7d5af","observation_id":"421c7304-ed41-4d10-83cc-de586ace8d3c","resolution":{"observed_at":"2026-08-01T00:07:33.603888Z","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-01T00:07:33.799769Z","title":"Hybrid quantum-classical multi-cut Benders approach with a power system application,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:33.799769Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:d42ef9e267fde0f1bcd9dda636d1b0f27574628627c7cc407cf024ccde86c28e","observation_id":"af4862ba-45c3-49d7-9ed6-822eddc054a4","resolution":{"observed_at":"2026-08-01T00:07:33.799769Z","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-01T00:07:33.940499Z","title":"Portfolio optimisation using the D- Wave quantum annealer,","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:33.940499Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:bbc4133f002fcbdec2e80525b1b6b07df33945833e56b278fb2e104bf3191221","observation_id":"31d9fed2-8042-4fc5-bedd-dc0aaa517227","resolution":{"observed_at":"2026-08-01T00:07:33.940499Z","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-01T00:07:34.054959Z","title":"Traffic flow optimization using a quantum annealer,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.054959Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:1698bb905313fd5cd6a4fd6733eefbebd180b80949a2acce5eed68047b210ea2","observation_id":"658bb48f-7639-4064-af4a-1f5cdd5a0cf4","resolution":{"observed_at":"2026-08-01T00:07:34.054959Z","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-01T00:07:34.188521Z","title":"Hybrid quantum-classical multi-agent pathfinding,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.188521Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:27ec6d08a468ba5afa8496ebc352ad74d6d99e474324f274bad9dcf61617e939","observation_id":"d4926921-cef2-49c3-8638-441c540d3192","resolution":{"observed_at":"2026-08-01T00:07:34.188521Z","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-01T00:07:34.391370Z","title":"Ising formulations of many NP problems,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.391370Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:b5e22496938b6a1cf012853550292091922d7bf00edba6563cf2cb0cd9a6c4a5","observation_id":"8eb954c9-e34c-476c-9189-3e814b388ca8","resolution":{"observed_at":"2026-08-01T00:07:34.391370Z","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-01T00:07:34.543109Z","title":"Quantum bridge analytics I: a tutorial on formulating and using QUBO models,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.543109Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:1f5c81067b55ac44ecc7ff92a225a361285745bdfb915472a971f7eb9bfcc092","observation_id":"b0339706-d38c-4470-a112-eb6049bedceb","resolution":{"observed_at":"2026-08-01T00:07:34.543109Z","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-01T00:07:34.713842Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.713842Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:df0b7ab58f6697aec8ad2447ba3894b0bd0a096b3b5ad2d95a21099d6a993e12","observation_id":"26862f63-06ac-489e-88d9-14b0d124c6f1","resolution":{"observed_at":"2026-08-01T00:07:34.713842Z","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-01T00:07:34.783970Z","title":"On the equal-subset-sum problem,","venue":null,"work_id":null,"year":1992},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.783970Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:9cf103e85491985ec69154a224cf513a923ce7576d63798890cf17d22a1b7521","observation_id":"c276c1e2-3216-48ec-bd7a-ab9f440844a4","resolution":{"observed_at":"2026-08-01T00:07:34.783970Z","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-01T00:07:34.985577Z","title":"Quantum annealing in the transverse Ising model,","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:34.985577Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:a3fe15acab3f3dc3fa16740db45664f986eb7ffd878c8ca6d732d32e300f5fa5","observation_id":"9b101a4e-a7e6-4b73-85f2-f45514ff4e52","resolution":{"observed_at":"2026-08-01T00:07:34.985577Z","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-01T00:07:35.077889Z","title":"A quantum approximate optimization algorithm,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.077889Z"},"links":{"cited_paper":"/paper/1411.4028","citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:44d57fd1b605350f9b04090f5ea22468574e3953d4bc11dff86e50455132d53c","observation_id":"68888218-102c-465a-a480-eb2f0e956b00","resolution":{"observed_at":"2026-08-01T00:07:35.077889Z","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-01T00:07:35.247534Z","title":"From the quantum approximate optimization algorithm to a quantum alternating operator ansatz,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.247534Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:3061a57a139a9655881c99f3cea6a9edc266f42edfb800fe104f027b4eb74ce4","observation_id":"f7b4b100-0a8a-4bdd-bcd6-c4608c30f618","resolution":{"observed_at":"2026-08-01T00:07:35.247534Z","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-01T00:07:35.433640Z","title":"Evaluating Ising processing units with integer programming,","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.433640Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:e8bdef526f55a09039875013e10b817abcfb69d4fd77d756584ea602e296047b","observation_id":"8dd7ade3-35e5-45e7-844b-ef7915f7c7b6","resolution":{"observed_at":"2026-08-01T00:07:35.433640Z","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-01T00:07:35.533723Z","title":"Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimiza- tion algorithms,","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.533723Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:c8f192107dec06c0ffaeb79a346c697f9879d485f35f31b6951626edbca66ebf","observation_id":"84d8c24b-b8b0-4c48-911b-d7c16e498547","resolution":{"observed_at":"2026-08-01T00:07:35.533723Z","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-01T00:07:35.593412Z","title":"Embedding algorithms for quantum annealers with Chimera and Pegasus connection topologies,","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.593412Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:cb409f90e7e34d2120a2c6785e1740bef9e202860be36fa1bcc5180cda2b2e54","observation_id":"e8529dd5-fc08-4a7c-a365-dffb3ad5b6dd","resolution":{"observed_at":"2026-08-01T00:07:35.593412Z","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-01T00:07:35.672482Z","title":"Improving performance in combinatorial optimization problems with inequality constraints: An evaluation of the unbalanced penalization method on D-Wave Advantage,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.672482Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:c1ef2820e7cd603acaf5a400ae0045b58a7862d0ee4e890e982dc301de73d2bb","observation_id":"44ef6cb1-4fc7-4ea1-8a4e-718e51f5a38b","resolution":{"observed_at":"2026-08-01T00:07:35.672482Z","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-01T00:07:35.751880Z","title":"Sparse QUBO Formulation for Efficient Embedding via Network-Based Decomposition of Equality and Inequality Constraints,","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.751880Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:67febabc5a7592992e7a1d27d1680f367826c69763a42e534804c30c21c60d37","observation_id":"b8462d31-79c7-492c-90f9-e069ef3def66","resolution":{"observed_at":"2026-08-01T00:07:35.751880Z","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-01T00:07:35.831818Z","title":"Penalty-free approach to accelerating constrained quantum optimization,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.831818Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:f39eb4d56a4282dff8d2c9adbba59b89032e9ac6800df405e97ca5a2894511d0","observation_id":"1f534239-7351-4c76-a665-2602d99d34a7","resolution":{"observed_at":"2026-08-01T00:07:35.831818Z","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-01T00:07:35.937887Z","title":"Efficient QAOA architecture for solving multi-constrained optimization problems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:35.937887Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:a93c76a9e87284ff02ab5927bd3c150c39cb154bf9b5dd6c54f707789187ecd1","observation_id":"0803716a-0c66-40c3-834c-813a0f8797ee","resolution":{"observed_at":"2026-08-01T00:07:35.937887Z","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-01T00:07:36.021594Z","title":"Quantum tree generator improves QAOA state-of-the-art for the knap- sack problem,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.021594Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:5dc37af3a9df7cbb3238bb5220c32467a7220c5e0121ed6443e3cb9c7dd89fcb","observation_id":"de0dcc07-2549-495c-9508-787d1a7d2d9b","resolution":{"observed_at":"2026-08-01T00:07:36.021594Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2012.06119","last_updated":"2020-12-11T04:30:16Z","snapshot_observed_at":"2026-08-08T09:16:43.574946Z","submitted_at":"2020-12-11T04:30:16Z","title":"Solving Inequality-Constrained Binary Optimization Problems on Quantum Annealer","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2012.06119","snapshot_observed_at":"2026-08-01T00:07:36.084507Z","title":"Solving inequality- constrained binary optimization problems on quantum annealer,","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.084507Z"},"links":{"cited_paper":"/paper/2012.06119","citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:718613e071d6a651a51ef0f6f35b62ebc4ed90b3d721fd3d820a6ad18861b948","observation_id":"0a6849e3-d63d-469c-a5d8-866f241b045b","resolution":{"observed_at":"2026-08-01T00:07:36.084507Z","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-01T00:07:36.135550Z","title":"Efficient light source placement using quantum computing,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.135550Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:643483457c5c371bb01aa247ddb196fca8e819a28cac3e770bed55deb5e63ec7","observation_id":"e7d3cca0-7b33-42a1-8506-5b0e530e38b2","resolution":{"observed_at":"2026-08-01T00:07:36.135550Z","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-01T00:07:36.148987Z","title":"Quantum annealing with inequality constraints: the set cover problem,","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.148987Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:00bf13aa2669942c35b72b811f34645c3547813f374d9a07149df258c9357b11","observation_id":"f5ef072c-01b7-4382-94c7-de7031e001a0","resolution":{"observed_at":"2026-08-01T00:07:36.148987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2507.12159","last_updated":"2025-08-11T04:20:55Z","snapshot_observed_at":"2026-08-06T16:50:07.221590Z","submitted_at":"2025-07-16T11:39:47Z","title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2507.12159","snapshot_observed_at":"2026-08-01T00:07:36.161937Z","title":"Cutting Slack: Quantum Optimization with Slack-Free Methods for Combinatorial Benchmarks,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.161937Z"},"links":{"cited_paper":"/paper/2507.12159","citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:58ee182fbc0844e8f7f23e15b1e55f37d88a2f9a6a5e981847df5acc8fdcf80e","observation_id":"61f65b54-50be-451a-8ff7-41ffae339de6","resolution":{"observed_at":"2026-08-01T00:07:36.161937Z","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-01T00:07:36.324658Z","title":"Subgradient Method Using Quantum Annealing for Inequality-Constrained Binary Optimization Problems,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.324658Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:d3bfd35b643d8a26454bf3d7d019972017c92e80b8ba1a02bc845b91084d3288","observation_id":"7fb348c6-8ef3-420d-af9f-51162ae7fb71","resolution":{"observed_at":"2026-08-01T00:07:36.324658Z","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-01T00:07:36.484474Z","title":"Efficient Construction of Feasible Solutions in Column Generation Using Quantum Annealing,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.484474Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:f40db5c90136471d1de2922f3c02dac244e5b1c85dd64ac92f3ba699ab5b7e73","observation_id":"e9d48b87-6c18-4b7d-b12a-4ed55af11c16","resolution":{"observed_at":"2026-08-01T00:07:36.484474Z","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-01T00:07:36.652661Z","title":"Implementing Slack-Free Custom Penalty Function for QUBO on Gate-Based Quantum Computers,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.652661Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:f79635cdf20f38e26d0d047d3d69d1fde028fc3c3bc458897c31ff1edeeaa03b","observation_id":"856a2f3e-f4c9-4724-8c1a-e9be0255b594","resolution":{"observed_at":"2026-08-01T00:07:36.652661Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2003.00133","last_updated":"2020-02-29T00:20:30Z","snapshot_observed_at":"2026-08-04T06:48:47.174236Z","submitted_at":"2020-02-29T00:20:30Z","title":"Next-Generation Topology of D-Wave Quantum Processors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2003.00133","snapshot_observed_at":"2026-08-01T00:07:36.725944Z","title":"Next-generation topol- ogy of D-Wave quantum processors,","venue":null,"work_id":null,"year":2003},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.725944Z"},"links":{"cited_paper":"/paper/2003.00133","citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:bfaba61c21867827d293867723d7f32eaabb6cd6f49f546ccdc1567d85ac1f85","observation_id":"5af67406-399a-48bc-9537-f97f261e7585","resolution":{"observed_at":"2026-08-01T00:07:36.725944Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1406.2741","last_updated":"2014-06-10T23:07:30Z","snapshot_observed_at":"2026-07-06T03:46:02.568340Z","submitted_at":"2014-06-10T23:07:30Z","title":"A practical heuristic for finding graph minors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1406.2741","snapshot_observed_at":"2026-08-01T00:07:36.883317Z","title":"A practical heuristic for finding graph minors,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.883317Z"},"links":{"cited_paper":"/paper/1406.2741","citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:5893140195a9c1eb2030df35f3c4a1cad004ba51a9ae0f5fcfd890713b9ccac9","observation_id":"6053ad13-884c-41e7-b4ba-e230bc7b499b","resolution":{"observed_at":"2026-08-01T00:07:36.883317Z","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-01T00:07:36.998248Z","title":"A Closed Set of Normal Orthogonal Functions,","venue":null,"work_id":null,"year":1923},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:36.998248Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:e55a365abe995882b08dee4760f274740a2b7b10b6b06bde8c37aee43e57e826","observation_id":"c6af6bb6-3cd0-4a51-b378-64f7c761e650","resolution":{"observed_at":"2026-08-01T00:07:36.998248Z","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-01T00:07:37.104250Z","title":"On Walsh-Fourier series,","venue":null,"work_id":null,"year":1957},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.104250Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:bc5114b53c886af10822657cdc056356f113fd07fbccef05b8ce58475104c090","observation_id":"dd550fbc-0aba-461d-9cdd-46d686fb6ab0","resolution":{"observed_at":"2026-08-01T00:07:37.104250Z","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-01T00:07:37.193084Z","title":"O’Donnell,Analysis of Boolean Functions","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.193084Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:2eac802168fb7ca76692e56a2dbb89874393d9b14eefc33596ab77f727be8fe8","observation_id":"55f6fe6a-f2fd-444f-bc0d-bc452b6ca1a0","resolution":{"observed_at":"2026-08-01T00:07:37.193084Z","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-01T00:07:37.288682Z","title":"Rudin,Functional Analysis","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.288682Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:57788d8b3dbd931e2a3416f8243f660340e798e14500b5a88cce66dacfc86202","observation_id":"07eafd49-2745-4d0e-b282-24ccc6b361e9","resolution":{"observed_at":"2026-08-01T00:07:37.288682Z","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-01T00:07:37.355797Z","title":"Kreyszig,Introductory Functional Analysis with Applications","venue":null,"work_id":null,"year":1978},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.355797Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:11a7cb67310d92db412a820e72b87f3cfd4724566cd2f86bab49b0cc60b56994","observation_id":"e5880881-d9e8-4ec7-8a05-ec96cab0d2dd","resolution":{"observed_at":"2026-08-01T00:07:37.355797Z","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-01T00:07:37.425588Z","title":"Benchmark instances for the Multidimensional Knapsack Problem,","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.425588Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:e8acbf68217699c511956703725eecba796efc28e79c1dbea1905bf252ce1daf","observation_id":"591680e7-15c4-4a83-97c0-dee537de9d48","resolution":{"observed_at":"2026-08-01T00:07:37.425588Z","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-01T00:07:37.531906Z","title":"Boyd and L","venue":null,"work_id":null,"year":2004},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.531906Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:2e8bbd931906e07ba18b20a20823753e57a9e0499774085bf21d3d33648b3b2c","observation_id":"447e7220-9f23-41fe-b8a1-742275a45a18","resolution":{"observed_at":"2026-08-01T00:07:37.531906Z","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-01T00:07:37.605554Z","title":"Saddle point approximation for the distribu- tion of the sum of independent random variables,","venue":null,"work_id":null,"year":1980},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.605554Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:e1ab282456b7c7f0244d3b7f5ca2dec2171567d59bb44dfd3bb1d96b8f6f9002","observation_id":"d7630c95-c030-4b53-bab9-04ff34d36d49","resolution":{"observed_at":"2026-08-01T00:07:37.605554Z","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-01T00:07:37.677232Z","title":"Challenge Problems: Independent Sets in Graphs,","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.677232Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:626784cd57aa25ce398568c9421c595b4789317be7c3bc9020d47f3413d37dc2","observation_id":"1233ed4b-4736-4cea-aae9-b9609aa22ba8","resolution":{"observed_at":"2026-08-01T00:07:37.677232Z","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-01T00:07:37.743344Z","title":"Standardization of Multi- Objective QUBOs,","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.743344Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:1f46747bcde3774dc0281d6d263abe73679747ad4f2ca87c493b3613e129e00b","observation_id":"0b5ddb5e-6393-4ed7-ba1e-1f55aac61216","resolution":{"observed_at":"2026-08-01T00:07:37.743344Z","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-01T00:07:37.853313Z","title":"Defining and detecting quantum speedup,","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-01T00:07:37.853313Z"},"links":{"citing_paper":"/paper/2607.26349"},"observation_digest":"sha256:1d2c07be065c3fec7cc1c89926f05f9ba8ed2d170da8cf4f5ff09ea99bdaabad","observation_id":"157aae7d-8c4e-4c1b-b3c7-0459de02d093","resolution":{"observed_at":"2026-08-01T00:07:37.853313Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.26349","last_updated":"2026-07-28T23:45:18Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-06T05:00:43.251337Z","submitted_at":"2026-07-28T23:45:18Z","title":"Hardware-Aware QUBO Reformulation of Constrained Binary Optimization via the Walsh-Fourier Transform"},"reference_resolution":{"displayed":40,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":40,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":40},"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-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 40 of 40 outbound references and 0 inbound Pith citation observations for arXiv:2607.26349."}