{"as_of":"2026-08-16T05:39:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:23fee0957bd6d28b1593362ad93833c015e5c478289d8294795da667c7840aa4","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-15T06:32:42.880941+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-14T05:51:27.293464Z","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-11T12:05:58.201303Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"1908.00161","last_updated":"2019-08-01T00:58:13Z","snapshot_observed_at":"2026-08-14T15:59:05.933060Z","submitted_at":"2019-08-01T00:58:13Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00161","snapshot_observed_at":"2026-08-14T05:51:27.293464Z","title":"The con- strained round robin algorithm for fair and efficient allocation","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"1909.00740","last_updated":"2020-06-28T23:31:54Z","snapshot_observed_at":"2026-08-14T05:35:23.712730Z","submitted_at":"2019-09-02T14:41:15Z","title":"A polynomial-time algorithm for computing a Pareto optimal and almost proportional allocation","version":2},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-14T05:51:27.293464Z"},"links":{"cited_paper":"/paper/1908.00161","citing_paper":"/paper/1909.00740"},"observation_digest":"sha256:a7048b7927e2f839af1e21bd0d4e0a195d258174feb7403eb059e82d72bb8739","observation_id":"b16f7df3-9ef8-4020-8081-17b1cf77f84a","resolution":{"observed_at":"2026-08-14T05:51:27.293464Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00161","last_updated":"2019-08-01T00:58:13Z","snapshot_observed_at":"2026-08-14T15:59:05.933060Z","submitted_at":"2019-08-01T00:58:13Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation","version":1},"cited_work":{"arxiv_id":"1908.00161","doi":null,"metadata_source":"pith","pith_arxiv_id":"1908.00161","snapshot_observed_at":"2026-08-11T12:05:58.201303Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation","venue":"cs.GT","work_id":"57607f1c-a143-43a7-ac58-3df5dd266710","year":2019},"citing_paper":{"arxiv_id":"2412.14818","last_updated":"2024-12-19T13:10:34Z","snapshot_observed_at":"2026-08-11T11:51:04.812242Z","submitted_at":"2024-12-19T13:10:34Z","title":"Fair Division with Social Impact","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-11T12:05:58.069552Z"},"links":{"cited_paper":"/paper/1908.00161","citing_paper":"/paper/2412.14818"},"observation_digest":"sha256:cd2bbb855df11b7f7d4eeeba21f1f081f161cbf943e0c8a6dea0d3a9594f84f5","observation_id":"e0e1e8e9-bb76-436a-8f3a-5848f86f8ca5","resolution":{"observed_at":"2026-08-11T12:05:58.205915Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-15T06:32:42.880941+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.00161","last_updated":"2019-08-01T00:58:13Z","snapshot_observed_at":"2026-08-14T15:59:05.933060Z","submitted_at":"2019-08-01T00:58:13Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1908.00161","snapshot_observed_at":"2026-08-04T19:49:19.427101Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2509.09037","last_updated":"2025-09-10T22:13:13Z","snapshot_observed_at":"2026-08-13T19:18:52.794880Z","submitted_at":"2025-09-10T22:13:13Z","title":"Envy-Free but Still Unfair: Envy-Freeness Up To One Item (EF-1) in Personalized Recommendation","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T19:49:19.427101Z"},"links":{"cited_paper":"/paper/1908.00161","citing_paper":"/paper/2509.09037"},"observation_digest":"sha256:a27bf57ba9ea8e02b9dc7b29c09d981c23e41a82f11c55ec9292deecbebb4271","observation_id":"52b4203c-deb3-483a-b9b9-d5f39dddf6b5","resolution":{"observed_at":"2026-08-04T19:49:19.427101Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1908.00161/citation-record","integrity":"/paper/1908.00161/integrity","json":"/paper/1908.00161/citation-record.json","paper":"/paper/1908.00161"},"outbound":[],"paper":{"arxiv_id":"1908.00161","last_updated":"2019-08-01T00:58:13Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-14T15:59:05.933060Z","submitted_at":"2019-08-01T00:58:13Z","title":"The Constrained Round Robin Algorithm for Fair and Efficient Allocation"},"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-15T06:32:42.880941+00:00","source":"crossref"},{"observed_at":"2026-08-15T06:32:39.529945+00:00","source":"retraction_watch"}],"thesis":"As of 16 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:1908.00161."}