{"as_of":"2026-08-09T01:48:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:8552e16bd400eba11330f0f676eeb4824358936c574eaa61b7ab3b1b52df2ef1","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":5,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":5,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":5,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":5,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T10:55:25.088926Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"arxiv_reference","source_observed_at":"2026-05-14T19:07:50.928742Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","snapshot_observed_at":"2026-08-08T17:16:47.198972Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13167","snapshot_observed_at":"2026-08-07T10:55:25.088926Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2506.04223","last_updated":"2025-06-04T17:59:02Z","snapshot_observed_at":"2026-08-08T22:54:42.959437Z","submitted_at":"2025-06-04T17:59:02Z","title":"Bridging Quantum Chemistry and MaxCut: Classical Performance Guarantees and Quantum Algorithms for the Hartree-Fock Method","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T10:55:25.088926Z"},"links":{"cited_paper":"/paper/2106.13167","citing_paper":"/paper/2506.04223"},"observation_digest":"sha256:5f3f32a1de5dc74414ccee40a924d78464c425bed016fcadccd2cd913375b52f","observation_id":"9eb0acec-f726-4903-8221-f65401f31f05","resolution":{"observed_at":"2026-08-07T10:55:25.088926Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","snapshot_observed_at":"2026-08-08T17:16:47.198972Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13167","snapshot_observed_at":"2026-08-06T10:36:31.133774Z","title":"Polynomial uncon- strained binary optimisation inspired by opti- cal simulation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2507.23621","last_updated":"2025-07-31T15:02:25Z","snapshot_observed_at":"2026-08-06T10:36:26.200203Z","submitted_at":"2025-07-31T15:02:25Z","title":"How to Incorporate Higher-order Interactions in Analog Ising Machines","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-06T10:36:31.133774Z"},"links":{"cited_paper":"/paper/2106.13167","citing_paper":"/paper/2507.23621"},"observation_digest":"sha256:25e9539b2c8298342079c531fb69e0b6850b81d6233d3bda1101a61e93ea0c29","observation_id":"fef2b12d-a6c7-4ece-81e6-422cdcf9ac38","resolution":{"observed_at":"2026-08-06T10:36:31.133774Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","snapshot_observed_at":"2026-08-08T17:16:47.198972Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13167","snapshot_observed_at":"2026-08-04T07:54:15.943225Z","title":"Poly- nomial unconstrained binary optimisation inspired by optical simulation,","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2510.24237","last_updated":"2025-10-28T09:44:48Z","snapshot_observed_at":"2026-08-05T10:42:23.226723Z","submitted_at":"2025-10-28T09:44:48Z","title":"Evaluating the Performance of Direct Higher-Order Formulations in Combinatorial Optimization Problems","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-04T07:54:15.943225Z"},"links":{"cited_paper":"/paper/2106.13167","citing_paper":"/paper/2510.24237"},"observation_digest":"sha256:59bc6fa2fbc3badc28ec46ae07d8e9256d207a7f78586dca369a54e95deb5a99","observation_id":"1de87543-268c-4688-a593-bfc7a14ddd84","resolution":{"observed_at":"2026-08-04T07:54:15.943225Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","snapshot_observed_at":"2026-08-08T17:16:47.198972Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2106.13167","snapshot_observed_at":"2026-08-03T13:47:41.709814Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.23026","last_updated":"2026-06-03T10:51:34Z","snapshot_observed_at":"2026-08-04T02:07:59.757559Z","submitted_at":"2025-12-28T18:01:20Z","title":"Applying Grover-mixer quantum alternating operator ansatz algorithm to higher-order unconstrained binary optimization problems","version":3},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-03T13:47:41.709814Z"},"links":{"cited_paper":"/paper/2106.13167","citing_paper":"/paper/2512.23026"},"observation_digest":"sha256:fb4066afbec8b2369db4dc4ac898530dabcb9cefa4493b824750010066ac06de","observation_id":"1e8cddbf-b318-4625-96df-c639a23247d0","resolution":{"observed_at":"2026-08-03T13:47:41.709814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","snapshot_observed_at":"2026-08-08T17:16:47.198972Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation","version":2},"cited_work":{"arxiv_id":"2106.13167","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.13167","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":null,"venue":null,"work_id":"1b002afe-c4e3-4f5a-adf4-3b22a1fc77fa","year":2021},"citing_paper":{"arxiv_id":"2605.13082","last_updated":"2026-05-13T06:54:28Z","snapshot_observed_at":"2026-08-02T08:49:21.299600Z","submitted_at":"2026-05-13T06:54:28Z","title":"Feedback-based quantum optimization and its classical counterpart: quantum advantage and the power of classical algorithms","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-05-14T19:06:48.013768Z"},"links":{"cited_paper":"/paper/2106.13167","citing_paper":"/paper/2605.13082"},"observation_digest":"sha256:76999beeabd5ab7a56b4c9c6e3d843c5ae17f12be7c857215f71942559ffe95a","observation_id":"9a619a09-fd8a-4327-af2b-037435bce954","resolution":{"observed_at":"2026-05-14T19:07:50.931772Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.13167/citation-record","integrity":"/paper/2106.13167/integrity","json":"/paper/2106.13167/citation-record.json","paper":"/paper/2106.13167"},"outbound":[],"paper":{"arxiv_id":"2106.13167","last_updated":"2022-09-11T21:36:19Z","latest_version":2,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-08T17:16:47.198972Z","submitted_at":"2021-06-24T16:39:31Z","title":"Polynomial unconstrained binary optimisation inspired by optical simulation"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 5 inbound Pith citation observations for arXiv:2106.13167."}