{"as_of":"2026-08-20T18:01:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b02febc7412961b3b53f4e4bc8ba4d209c7cfbf1184af38576e9bcbe4e999d9e","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-20T06:33:59.587034+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-05-19T08:30:41.230299Z","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-05-19T08:32:11.704058Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2106.03724","last_updated":"2021-06-07T15:39:18Z","snapshot_observed_at":"2026-08-16T18:19:02.666819Z","submitted_at":"2021-06-07T15:39:18Z","title":"Truthful allocation in graphs and hypergraphs","version":1},"cited_work":{"arxiv_id":"2106.03724","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.03724","snapshot_observed_at":"2026-06-05T21:23:00.469572Z","title":"Truthful allocation in graphs and hyper- graphs","venue":null,"work_id":"71325075-172e-4743-85b2-9aaa62f5f6a7","year":2021},"citing_paper":{"arxiv_id":"2506.20317","last_updated":"2026-05-07T08:13:29Z","snapshot_observed_at":"2026-07-06T21:47:25.325461Z","submitted_at":"2025-06-25T10:55:28Z","title":"Exact and approximate maximin share allocations in multi-graphs","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-05-19T08:30:41.230299Z"},"links":{"cited_paper":"/paper/2106.03724","citing_paper":"/paper/2506.20317"},"observation_digest":"sha256:ee443ac3d237fd030b076e9ea4f6029896e66731b9040f6a4d3e433328abf0f6","observation_id":"15fe5bba-69e1-4a17-8c52-e27a620a4093","resolution":{"observed_at":"2026-05-19T08:32:11.707375Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"state":"measured"}}],"links":{"evidence":"/evidence","html":"/paper/2106.03724/citation-record","integrity":"/paper/2106.03724/integrity","json":"/paper/2106.03724/citation-record.json","paper":"/paper/2106.03724"},"outbound":[],"paper":{"arxiv_id":"2106.03724","last_updated":"2021-06-07T15:39:18Z","latest_version":1,"primary_category":"cs.GT","snapshot_observed_at":"2026-08-16T18:19:02.666819Z","submitted_at":"2021-06-07T15:39:18Z","title":"Truthful allocation in graphs and hypergraphs"},"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-20T06:33:59.587034+00:00","source":"crossref"},{"observed_at":"2026-08-20T06:33:54.927442+00:00","source":"retraction_watch"}],"thesis":"As of 20 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2106.03724."}