{"as_of":"2026-08-10T08:25:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:a6cc0221ce3e1aa7cc0d25da6314e80c17c44028a71c6d2685c0987399772698","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-10T06:31:04.303077+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-08-09T18:34:43.084364Z","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:5b7faded685357f5d041685ac54a0900e5538dbc24753443c6180b834c50e599","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-08-09T18:34:43.084364Z","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-09T19:20:26.518719Z","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:b57170e642cfa3f7d7e44e943d2e4fb7e186c1db8e608f7bf0f60d9efdc6d89c","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-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+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-08-09T18:34:43.084364Z","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:0db68a659a8de06798d4b3a39a150150b1fa6de2d52c34dcce656dbd61a2eac7","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-08-09T18:34:43.084364Z","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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 3 inbound Pith citation observations for arXiv:2408.12845."}