{"as_of":"2026-08-09T03:15:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:21e6823c44066a9974f63aa76c3c3474b3c464cfa970fa734e2d26465332d06d","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-08T06:32:00.761636+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-01T16:07:50.817403Z","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":"1901.09527","last_updated":"2022-04-14T10:23:16Z","snapshot_observed_at":"2026-08-03T03:48:32.502776Z","submitted_at":"2019-01-28T06:03:25Z","title":"Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division","version":6},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1901.09527","snapshot_observed_at":"2026-08-01T16:07:50.817403Z","title":"Envy-free matchings in bipartite graphs and their applications to fair division.Information Sciences, 587:164–187, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18139","last_updated":"2026-07-20T16:32:37Z","snapshot_observed_at":"2026-08-01T16:07:50.288003Z","submitted_at":"2026-07-20T16:32:37Z","title":"1-out-of-5 Maximin-Share Allocations Always Exist for Four Agents","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-01T16:07:50.817403Z"},"links":{"cited_paper":"/paper/1901.09527","citing_paper":"/paper/2607.18139"},"observation_digest":"sha256:74f93852589f400f9677b17ea14fcaf1a25ff5d279dfdcf903add7397ffee253","observation_id":"8abb82e7-1768-4dd5-962e-1c244207fe41","resolution":{"observed_at":"2026-08-01T16:07:50.817403Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1901.09527/citation-record","integrity":"/paper/1901.09527/integrity","json":"/paper/1901.09527/citation-record.json","paper":"/paper/1901.09527"},"outbound":[],"paper":{"arxiv_id":"1901.09527","last_updated":"2022-04-14T10:23:16Z","latest_version":6,"primary_category":"cs.DS","snapshot_observed_at":"2026-08-03T03:48:32.502776Z","submitted_at":"2019-01-28T06:03:25Z","title":"Envy-free Matchings in Bipartite Graphs and their Applications to Fair Division"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 9 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:1901.09527."}