{"as_of":"2026-08-19T06:57:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cba6d8ad8121e694a251ab075f511d70480383a7892b00f4ef46e595ce1f2ab2","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":1,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":1,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-19T06:32:44.657259+00:00","state":"measured"},{"denominator":1,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":1,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-11T21:30:05.937822Z","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-08-11T21:30:06.279093Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2107.11695","last_updated":"2021-07-24T22:13:42Z","snapshot_observed_at":"2026-08-18T23:10:13.254900Z","submitted_at":"2021-07-24T22:13:42Z","title":"Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions","version":1},"cited_work":{"arxiv_id":"2107.11695","doi":null,"metadata_source":"pith","pith_arxiv_id":"2107.11695","snapshot_observed_at":"2026-08-11T21:30:06.279093Z","title":"Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions","venue":"math.OC","work_id":"129b42f4-dcfe-4eaa-a742-9eee437328e8","year":2021},"citing_paper":{"arxiv_id":"2412.04398","last_updated":"2025-04-28T14:21:23Z","snapshot_observed_at":"2026-08-18T15:47:11.601044Z","submitted_at":"2024-12-05T18:12:20Z","title":"Boosting quantum annealing performance through direct polynomial unconstrained binary optimization","version":3},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-11T21:30:05.937822Z"},"links":{"cited_paper":"/paper/2107.11695","citing_paper":"/paper/2412.04398"},"observation_digest":"sha256:62ffc49b6b2dcefbc36281a509344a3c773dd8d6fd59259578aa7850bb2e818d","observation_id":"50e32107-f797-42a5-b149-21c22daa8706","resolution":{"observed_at":"2026-08-11T21:30:06.289138Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-19T06:32:44.657259+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2107.11695/citation-record","integrity":"/paper/2107.11695/integrity","json":"/paper/2107.11695/citation-record.json","paper":"/paper/2107.11695"},"outbound":[],"paper":{"arxiv_id":"2107.11695","last_updated":"2021-07-24T22:13:42Z","latest_version":1,"primary_category":"math.OC","snapshot_observed_at":"2026-08-18T23:10:13.254900Z","submitted_at":"2021-07-24T22:13:42Z","title":"Efficient QUBO transformation for Higher Degree Pseudo Boolean Functions"},"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-19T06:32:44.657259+00:00","source":"crossref"},{"observed_at":"2026-08-19T06:32:39.956319+00:00","source":"retraction_watch"}],"thesis":"As of 19 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2107.11695."}