{"as_of":"2026-08-06T13:18:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:bb7599e44f437faf2e1458073171a0c7980819b5ce04a8348ffaf1cbc98e3f0c","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-06T06:34:29.942622+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-02T21:07:01.940356Z","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":"2207.01589","last_updated":"2022-07-04T17:17:06Z","snapshot_observed_at":"2026-08-05T16:19:37.125995Z","submitted_at":"2022-07-04T17:17:06Z","title":"Repeatedly Matching Items to Agents Fairly and Efficiently","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2207.01589","snapshot_observed_at":"2026-08-02T21:07:01.940356Z","title":"and Narang, S","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.21687","last_updated":"2026-07-22T13:15:16Z","snapshot_observed_at":"2026-08-02T21:06:42.514298Z","submitted_at":"2026-02-25T08:40:06Z","title":"Perpetually Fair Assignments Via Balanced Sequences of Permutations","version":3},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-02T21:07:01.940356Z"},"links":{"cited_paper":"/paper/2207.01589","citing_paper":"/paper/2602.21687"},"observation_digest":"sha256:792f03e1d1f1a8cac6ce2b7a86a8b2f5d0752175ae77d29831e656cd77751b8d","observation_id":"1797c118-fa79-4f4a-8d7d-c3cc8276e436","resolution":{"observed_at":"2026-08-02T21:07:01.940356Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2207.01589/citation-record","integrity":"/paper/2207.01589/integrity","json":"/paper/2207.01589/citation-record.json","paper":"/paper/2207.01589"},"outbound":[],"paper":{"arxiv_id":"2207.01589","last_updated":"2022-07-04T17:17:06Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-05T16:19:37.125995Z","submitted_at":"2022-07-04T17:17:06Z","title":"Repeatedly Matching Items to Agents Fairly and Efficiently"},"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-06T06:34:29.942622+00:00","source":"crossref"},{"observed_at":"2026-08-06T06:34:23.284952+00:00","source":"retraction_watch"}],"thesis":"As of 6 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2207.01589."}