{"as_of":"2026-08-14T19:52:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:d01276a98d0488f6fcfacac56f04357f71fa99a8e1109d2a1662218bd989c210","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-14T06:32:32.682623+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-11T19:27:05.625958Z","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-11T19:27:06.113565Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2111.10994","last_updated":"2021-11-22T05:20:10Z","snapshot_observed_at":"2026-08-13T17:29:58.378811Z","submitted_at":"2021-11-22T05:20:10Z","title":"Entanglement Swapping for Repeater Chains with Finite Memory Sizes","version":1},"cited_work":{"arxiv_id":"2111.10994","doi":null,"metadata_source":"pith","pith_arxiv_id":"2111.10994","snapshot_observed_at":"2026-08-11T19:27:06.113565Z","title":"Entanglement Swapping for Repeater Chains with Finite Memory Sizes","venue":"quant-ph","work_id":"24a9d08b-8b73-4510-be7c-44b61da519d6","year":2021},"citing_paper":{"arxiv_id":"2412.06938","last_updated":"2024-12-09T19:26:49Z","snapshot_observed_at":"2026-08-12T18:41:53.352365Z","submitted_at":"2024-12-09T19:26:49Z","title":"Optimising entanglement distribution policies under classical communication constraints assisted by reinforcement learning","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-11T19:27:05.625958Z"},"links":{"cited_paper":"/paper/2111.10994","citing_paper":"/paper/2412.06938"},"observation_digest":"sha256:2fdfdf6bb7e9172e3377771f0bdb0780b1618096c6a6237cf8f1a05d9fd2d49a","observation_id":"1f1da076-9edc-42af-99b8-4ce02aa6f17c","resolution":{"observed_at":"2026-08-11T19:27:06.119148Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2111.10994/citation-record","integrity":"/paper/2111.10994/integrity","json":"/paper/2111.10994/citation-record.json","paper":"/paper/2111.10994"},"outbound":[],"paper":{"arxiv_id":"2111.10994","last_updated":"2021-11-22T05:20:10Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-13T17:29:58.378811Z","submitted_at":"2021-11-22T05:20:10Z","title":"Entanglement Swapping for Repeater Chains with Finite Memory Sizes"},"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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2111.10994."}