{"as_of":"2026-08-23T22:44:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:fbc191fa4ee2363cc3dee5d1fadfe9eb25f4efc3a74df560be714977cbc201c2","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-23T06:30:58.430688+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-03T14:51:00.213292Z","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-07-03T05:47:40.997710Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.07212","last_updated":"2023-09-25T07:01:01Z","snapshot_observed_at":"2026-08-16T17:56:27.869203Z","submitted_at":"2021-09-15T11:00:53Z","title":"Optimising Rolling Stock Planning including Maintenance with Constraint Programming and Quantum Annealing","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.07212","snapshot_observed_at":"2026-08-03T14:51:00.213292Z","title":"Grozea, R","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2512.19340","last_updated":"2026-06-03T08:06:31Z","snapshot_observed_at":"2026-08-16T19:55:08.930601Z","submitted_at":"2025-12-22T12:36:20Z","title":"EMU circulation planning for Silesian Railways: case study and a quantum approach","version":3},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-03T14:51:00.213292Z"},"links":{"cited_paper":"/paper/2109.07212","citing_paper":"/paper/2512.19340"},"observation_digest":"sha256:190d9f33a20465fe3de4c279a8eea8151978bd13b04a0175b5227af3eb6eba89","observation_id":"fc2cca86-8964-4f5c-8fc2-9247a46036de","resolution":{"observed_at":"2026-08-03T14:51:00.213292Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.07212","last_updated":"2023-09-25T07:01:01Z","snapshot_observed_at":"2026-08-16T17:56:27.869203Z","submitted_at":"2021-09-15T11:00:53Z","title":"Optimising Rolling Stock Planning including Maintenance with Constraint Programming and Quantum Annealing","version":3},"cited_work":{"arxiv_id":"2109.07212","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.07212","snapshot_observed_at":"2026-07-03T05:47:40.997710Z","title":"Optimising rolling stock planning including maintenance with constraint programming and quantum annealing,","venue":null,"work_id":"b739d69d-d156-4171-84f1-82137d05478c","year":2023},"citing_paper":{"arxiv_id":"2606.11383","last_updated":"2026-06-09T19:06:55Z","snapshot_observed_at":"2026-08-06T06:17:57.255664Z","submitted_at":"2026-06-09T19:06:55Z","title":"Rolling Stock Planning Using the Quantum Approximate Optimization Algorithm","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T13:07:35.755764Z"},"links":{"cited_paper":"/paper/2109.07212","citing_paper":"/paper/2606.11383"},"observation_digest":"sha256:e165f46934c02c24e42a6e22f26f4403a24840be661011dc05cdebbbf8dd1e2b","observation_id":"10f309b8-2345-4e74-8733-e38d94a15cd6","resolution":{"observed_at":"2026-07-03T05:47:40.999380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2109.07212/citation-record","integrity":"/paper/2109.07212/integrity","json":"/paper/2109.07212/citation-record.json","paper":"/paper/2109.07212"},"outbound":[],"paper":{"arxiv_id":"2109.07212","last_updated":"2023-09-25T07:01:01Z","latest_version":3,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-16T17:56:27.869203Z","submitted_at":"2021-09-15T11:00:53Z","title":"Optimising Rolling Stock Planning including Maintenance with Constraint Programming and Quantum Annealing"},"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-23T06:30:58.430688+00:00","source":"crossref"},{"observed_at":"2026-08-23T06:30:53.778098+00:00","source":"retraction_watch"}],"thesis":"As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2109.07212."}