{"as_of":"2026-08-18T20:09:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:eed36a7c8445885a4c8b8f6351c60d92a82b5eb2cc8b63156355e469cce746ca","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-18T06:34:40.430872+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-06T22:34:49.939085Z","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-04T07:49:39.244877Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2501.06506","last_updated":"2025-01-11T10:53:48Z","snapshot_observed_at":"2026-08-16T12:59:11.718151Z","submitted_at":"2025-01-11T10:53:48Z","title":"Resource Allocation under the Latin Square Constraint","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.06506","snapshot_observed_at":"2026-08-06T22:34:49.939085Z","title":"Resource allocation under the latin square constraint","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2506.21727","last_updated":"2025-06-26T19:27:22Z","snapshot_observed_at":"2026-08-09T06:02:09.653370Z","submitted_at":"2025-06-26T19:27:22Z","title":"Simultaneously Fair Allocation of Indivisible Items Across Multiple Dimensions","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-06T22:34:49.939085Z"},"links":{"cited_paper":"/paper/2501.06506","citing_paper":"/paper/2506.21727"},"observation_digest":"sha256:101df08ee1f56fdcc68d3d5dad2a48691696428f3505bbd3a56cc1ff0625809f","observation_id":"12fa6743-c29d-41ab-97be-5c31ac22dacf","resolution":{"observed_at":"2026-08-06T22:34:49.939085Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.06506","last_updated":"2025-01-11T10:53:48Z","snapshot_observed_at":"2026-08-16T12:59:11.718151Z","submitted_at":"2025-01-11T10:53:48Z","title":"Resource Allocation under the Latin Square Constraint","version":1},"cited_work":{"arxiv_id":"2501.06506","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2501.06506","snapshot_observed_at":"2026-07-04T07:49:39.244877Z","title":"arXiv preprint arXiv:2501.06506 , year=","venue":null,"work_id":"9315af37-480b-47c7-8c42-9e8edb17a792","year":null},"citing_paper":{"arxiv_id":"2606.21346","last_updated":"2026-06-19T11:42:27Z","snapshot_observed_at":"2026-08-15T08:22:37.430650Z","submitted_at":"2026-06-19T11:42:27Z","title":"Simultaneously Efficient Allocation of Indivisible Items Across Multiple Dimensions","version":1},"reference_index":159,"source":"arxiv_source","source_observed_at":"2026-06-26T12:48:01.794253Z"},"links":{"cited_paper":"/paper/2501.06506","citing_paper":"/paper/2606.21346"},"observation_digest":"sha256:0bb31c8cab675c32254261a0dacfe649e1cee80c276a0d9f8b28c3052be2abec","observation_id":"92301c3b-1a92-41fb-9f4c-37b9285b2fe8","resolution":{"observed_at":"2026-07-04T07:49:39.246322Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-18T06:34:40.430872+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2501.06506/citation-record","integrity":"/paper/2501.06506/integrity","json":"/paper/2501.06506/citation-record.json","paper":"/paper/2501.06506"},"outbound":[],"paper":{"arxiv_id":"2501.06506","last_updated":"2025-01-11T10:53:48Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T12:59:11.718151Z","submitted_at":"2025-01-11T10:53:48Z","title":"Resource Allocation under the Latin Square Constraint"},"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-18T06:34:40.430872+00:00","source":"crossref"},{"observed_at":"2026-08-18T06:34:34.496301+00:00","source":"retraction_watch"}],"thesis":"As of 18 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2501.06506."}