{"as_of":"2026-08-10T19:10:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:791320e58331029d07ae837724cc5a6a04f5627ad33d1cd2b305b7aac77ef542","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":2,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":2,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":2,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":2,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-04T01:18:14.555642Z","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":[{"citation":{"cited_paper":{"arxiv_id":"1705.09844","last_updated":"2017-05-27T17:09:56Z","snapshot_observed_at":"2026-08-09T06:16:52.025374Z","submitted_at":"2017-05-27T17:09:56Z","title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.09844","snapshot_observed_at":"2026-08-03T03:33:15.894187Z","title":"Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis,","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2602.07913","last_updated":"2026-06-29T16:00:14Z","snapshot_observed_at":"2026-08-05T01:45:59.564867Z","submitted_at":"2026-02-08T11:18:45Z","title":"Multi-Agent Route Planning as a QUBO Problem","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-03T03:33:15.894187Z"},"links":{"cited_paper":"/paper/1705.09844","citing_paper":"/paper/2602.07913"},"observation_digest":"sha256:d32f5f525574c6428f3b4c5e4edc4d76a1ae5fa58b960071a3436681984a1bc3","observation_id":"b0153e2b-558a-47d0-ade2-4e99422cede7","resolution":{"observed_at":"2026-08-03T03:33:15.894187Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1705.09844","last_updated":"2017-05-27T17:09:56Z","snapshot_observed_at":"2026-08-09T06:16:52.025374Z","submitted_at":"2017-05-27T17:09:56Z","title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1705.09844","snapshot_observed_at":"2026-08-04T01:18:14.555642Z","title":"Lewis and F","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2608.00160","last_updated":"2026-07-31T18:00:00Z","snapshot_observed_at":"2026-08-07T04:31:18.951799Z","submitted_at":"2026-07-31T18:00:00Z","title":"Optimal Decoding for Measurement-Based GHZ State Preparation: The Maximum-Utility Decoder","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-04T01:18:14.555642Z"},"links":{"cited_paper":"/paper/1705.09844","citing_paper":"/paper/2608.00160"},"observation_digest":"sha256:f089e10c3aeb2048ea715fea2e7c5259484251a98a358b5ad1d8465de169b3ab","observation_id":"b896eb1f-acf0-4799-94a5-c258de0aac29","resolution":{"observed_at":"2026-08-04T01:18:14.555642Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1705.09844/citation-record","integrity":"/paper/1705.09844/integrity","json":"/paper/1705.09844/citation-record.json","paper":"/paper/1705.09844"},"outbound":[],"paper":{"arxiv_id":"1705.09844","last_updated":"2017-05-27T17:09:56Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-09T06:16:52.025374Z","submitted_at":"2017-05-27T17:09:56Z","title":"Quadratic Unconstrained Binary Optimization Problem Preprocessing: Theory and Empirical Analysis"},"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-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 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1705.09844."}