{"as_of":"2026-08-14T06:20:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:48d5e4f1714f5df0aebf88b4d645050b8b25383f77cbeb5608854af53a71b65b","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":3,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":3,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":3,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":3,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T13:24:15.352034Z","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-18T21:36:51.954063Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2207.07460","last_updated":"2022-07-15T13:09:12Z","snapshot_observed_at":"2026-08-13T15:03:32.813841Z","submitted_at":"2022-07-15T13:09:12Z","title":"Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem","version":1},"cited_work":{"arxiv_id":"2207.07460","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.07460","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Garcia-de Andoin, I","venue":null,"work_id":"66d3225b-2077-40da-8251-fd892f7629bc","year":2022},"citing_paper":{"arxiv_id":"2508.17896","last_updated":"2026-07-06T08:14:54Z","snapshot_observed_at":"2026-08-05T16:40:46.914824Z","submitted_at":"2025-08-25T11:07:47Z","title":"Steiner Traveling Salesman Problem with Time Windows and Pickup-Delivery: integrating classical and quantum optimization","version":3},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-05-18T21:35:45.836451Z"},"links":{"cited_paper":"/paper/2207.07460","citing_paper":"/paper/2508.17896"},"observation_digest":"sha256:f97e11b5aefda1ebf35acd06f1169be08fdcbd929487830a7593b6c7f7e80c98","observation_id":"a84f1643-e80a-499d-b36b-fb6592cc9edd","resolution":{"observed_at":"2026-05-18T21:36:51.957697Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.07460","last_updated":"2022-07-15T13:09:12Z","snapshot_observed_at":"2026-08-13T15:03:32.813841Z","submitted_at":"2022-07-15T13:09:12Z","title":"Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem","version":1},"cited_work":{"arxiv_id":"2207.07460","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.07460","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Garcia-de Andoin, I","venue":null,"work_id":"66d3225b-2077-40da-8251-fd892f7629bc","year":2022},"citing_paper":{"arxiv_id":"2604.20321","last_updated":"2026-04-22T08:20:17Z","snapshot_observed_at":"2026-07-06T23:06:49.210284Z","submitted_at":"2026-04-22T08:20:17Z","title":"Cutting-plane methodology via quantum optimization for solving the Traveling Salesman Problem","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-05-10T00:37:09.410002Z"},"links":{"cited_paper":"/paper/2207.07460","citing_paper":"/paper/2604.20321"},"observation_digest":"sha256:a7acc23cdbf544271a101a86a36e7a65be2e236cd539caebd5da0949aebefbd2","observation_id":"aa21826f-fea4-47a8-93e2-5e1bd80d584d","resolution":{"observed_at":"2026-05-11T13:46:04.624254Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2207.07460","last_updated":"2022-07-15T13:09:12Z","snapshot_observed_at":"2026-08-13T15:03:32.813841Z","submitted_at":"2022-07-15T13:09:12Z","title":"Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.07460","snapshot_observed_at":"2026-08-08T13:24:15.352034Z","title":"Garcia-de Andoin, I","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2608.05427","last_updated":"2026-08-05T21:42:17Z","snapshot_observed_at":"2026-08-13T21:23:19.607188Z","submitted_at":"2026-08-05T21:42:17Z","title":"School network reorganization under educational and spatial constraints using classical and quantum optimization","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-08T13:24:15.352034Z"},"links":{"cited_paper":"/paper/2207.07460","citing_paper":"/paper/2608.05427"},"observation_digest":"sha256:1d4a99774ff0066b27dd3c850b8f3cbcaca7cfb4e624d99f4983233c85ee781b","observation_id":"48370379-feed-48db-b9f1-56681cb9bfcd","resolution":{"observed_at":"2026-08-08T13:24:15.352034Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2207.07460/citation-record","integrity":"/paper/2207.07460/integrity","json":"/paper/2207.07460/citation-record.json","paper":"/paper/2207.07460"},"outbound":[],"paper":{"arxiv_id":"2207.07460","last_updated":"2022-07-15T13:09:12Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T15:03:32.813841Z","submitted_at":"2022-07-15T13:09:12Z","title":"Comparative Benchmark of a Quantum Algorithm for the Bin Packing Problem"},"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-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2207.07460."}