{"as_of":"2026-08-08T03:06:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:5b434e3a7a82cfa7c0a807340a2798d389588a69cf63bb014098d486a3d337fd","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-07T06:34:17.273281+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-07T12:44:24.919288Z","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-07T12:40:53.671134Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2408.12845","last_updated":"2025-05-29T17:56:45Z","snapshot_observed_at":"2026-07-06T19:04:57.203125Z","submitted_at":"2024-08-23T05:25:58Z","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12845","snapshot_observed_at":"2026-08-07T12:44:24.919288Z","title":"Keep everyone happy: Online fair division of numerous items with few copies","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.23720","last_updated":"2025-05-29T17:53:12Z","snapshot_observed_at":"2026-08-07T12:36:43.977251Z","submitted_at":"2025-05-29T17:53:12Z","title":"COBRA: Contextual Bandit Algorithm for Ensuring Truthful Strategic Agents","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-07T12:44:24.919288Z"},"links":{"cited_paper":"/paper/2408.12845","citing_paper":"/paper/2505.23720"},"observation_digest":"sha256:5413128498dfb4e7ca645026b9064a38f4f88f4c05706f090e396c1cbc8cf401","observation_id":"d583af98-3051-4996-8bc5-dd20a55e6bf2","resolution":{"observed_at":"2026-08-07T12:44:24.919288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12845","last_updated":"2025-05-29T17:56:45Z","snapshot_observed_at":"2026-07-06T19:04:57.203125Z","submitted_at":"2024-08-23T05:25:58Z","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","version":2},"cited_work":{"arxiv_id":"2408.12845","doi":null,"metadata_source":"pith","pith_arxiv_id":"2408.12845","snapshot_observed_at":"2026-08-07T12:40:53.671134Z","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","venue":"cs.LG","work_id":"5d88b4d2-b60d-4ad9-8abc-947d97107e97","year":2024},"citing_paper":{"arxiv_id":"2505.24503","last_updated":"2026-05-28T08:22:09Z","snapshot_observed_at":"2026-08-07T12:17:57.910083Z","submitted_at":"2025-05-30T12:06:16Z","title":"Online Fair Division with Additional Information","version":3},"reference_index":94,"source":"arxiv_source","source_observed_at":"2026-08-07T12:40:53.061841Z"},"links":{"cited_paper":"/paper/2408.12845","citing_paper":"/paper/2505.24503"},"observation_digest":"sha256:f2940748bbdfdef1bd50255e095ce675a3714a0152818e314cb85a78e4c41b11","observation_id":"debc7a0e-a5c5-47e8-96fe-d129b24f043d","resolution":{"observed_at":"2026-08-07T12:40:53.731661Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2408.12845","last_updated":"2025-05-29T17:56:45Z","snapshot_observed_at":"2026-07-06T19:04:57.203125Z","submitted_at":"2024-08-23T05:25:58Z","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2408.12845","snapshot_observed_at":"2026-08-03T04:02:53.922865Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2602.06361","last_updated":"2026-05-28T10:02:53Z","snapshot_observed_at":"2026-08-03T04:02:49.046066Z","submitted_at":"2026-02-06T03:44:40Z","title":"Envy-Free Allocation of Indivisible Goods via Noisy Queries","version":2},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-03T04:02:53.922865Z"},"links":{"cited_paper":"/paper/2408.12845","citing_paper":"/paper/2602.06361"},"observation_digest":"sha256:3f51f9de0d960823e194d1e57334e4847e54a5950128f68de50182e956872195","observation_id":"98130093-70f4-41b1-8751-9682f23d8be3","resolution":{"observed_at":"2026-08-03T04:02:53.922865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2408.12845/citation-record","integrity":"/paper/2408.12845/integrity","json":"/paper/2408.12845/citation-record.json","paper":"/paper/2408.12845"},"outbound":[],"paper":{"arxiv_id":"2408.12845","last_updated":"2025-05-29T17:56:45Z","latest_version":2,"primary_category":"cs.LG","snapshot_observed_at":"2026-07-06T19:04:57.203125Z","submitted_at":"2024-08-23T05:25:58Z","title":"Keep Everyone Happy: Online Fair Division of Numerous Items with Few Copies"},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.12845."}