{"as_of":"2026-08-10T15:11:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2f8a826c166312b0fc42f32925511d96b480bcee72349bdb52c8d2915abd467e","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-10T06:31:04.303077+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-07T23:38:11.604435Z","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-07T23:38:12.211497Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1807.05517","last_updated":"2018-07-15T09:12:08Z","snapshot_observed_at":"2026-08-10T00:49:29.339278Z","submitted_at":"2018-07-15T09:12:08Z","title":"Boosting Combinatorial Problem Modeling with Machine Learning","version":1},"cited_work":{"arxiv_id":"1807.05517","doi":null,"metadata_source":"pith","pith_arxiv_id":"1807.05517","snapshot_observed_at":"2026-08-07T23:38:12.211497Z","title":"Boosting Combinatorial Problem Modeling with Machine Learning","venue":"cs.AI","work_id":"a51d516c-e6c6-4914-a276-7e77f8237ffe","year":2018},"citing_paper":{"arxiv_id":"2502.08853","last_updated":"2025-04-24T12:27:59Z","snapshot_observed_at":"2026-08-10T00:48:36.180037Z","submitted_at":"2025-02-12T23:58:25Z","title":"A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits","version":4},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T23:38:11.604435Z"},"links":{"cited_paper":"/paper/1807.05517","citing_paper":"/paper/2502.08853"},"observation_digest":"sha256:5b52d3ff8b3780a0c5f3c41182511ef826bbb4977515d0b222f457e569138cda","observation_id":"95d9f4ec-4db7-451f-aae5-6de4c322e0a8","resolution":{"observed_at":"2026-08-07T23:38:12.216643Z","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/1807.05517/citation-record","integrity":"/paper/1807.05517/integrity","json":"/paper/1807.05517/citation-record.json","paper":"/paper/1807.05517"},"outbound":[],"paper":{"arxiv_id":"1807.05517","last_updated":"2018-07-15T09:12:08Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-10T00:49:29.339278Z","submitted_at":"2018-07-15T09:12:08Z","title":"Boosting Combinatorial Problem Modeling with Machine Learning"},"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 1 inbound Pith citation observation for arXiv:1807.05517."}