{"as_of":"2026-08-08T22:37:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:64f84ad96dbdd2ed67fd1468c9897bfd0cd391f40c940a7d11107b9e3a8c1c89","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":10,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":10,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-08T06:32:00.761636+00:00","state":"measured"},{"denominator":10,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":10,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-08T15:24:32.287673Z","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-02T01:26:24.483205Z","state":"measured"}],"external_citation_measurements":[],"inbound":[{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-08-07T15:12:22.678696Z","title":"Omnipredictors","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.16141","last_updated":"2025-05-22T02:35:38Z","snapshot_observed_at":"2026-08-08T15:42:18.786943Z","submitted_at":"2025-05-22T02:35:38Z","title":"Persuasive Prediction via Decision Calibration","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-07T15:12:22.678696Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2505.16141"},"observation_digest":"sha256:80ef420ca87d12b0763069e7367247162c2d21ada4023c652d29a39a7a59c985","observation_id":"8420301b-0414-450c-9896-a8087f67706f","resolution":{"observed_at":"2026-08-07T15:12:22.678696Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-08-07T14:56:04.858915Z","title":"T., Reingold, O., Sharan, V., and Wieder, U","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.17435","last_updated":"2025-05-23T03:29:58Z","snapshot_observed_at":"2026-08-08T20:27:49.892393Z","submitted_at":"2025-05-23T03:29:58Z","title":"Discretization-free Multicalibration through Loss Minimization over Tree Ensembles","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-07T14:56:04.858915Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2505.17435"},"observation_digest":"sha256:0766bdd737e2da7374dd3e1d56d089dd87f92c30bc8ee1b36df7fb12111bf5f2","observation_id":"de31c9b6-3d31-4bb5-85d0-b79c20743a60","resolution":{"observed_at":"2026-08-07T14:56:04.858915Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-08-07T13:43:39.076459Z","title":"Omnipredictors","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2505.21819","last_updated":"2025-05-27T23:02:54Z","snapshot_observed_at":"2026-08-07T13:20:29.152484Z","submitted_at":"2025-05-27T23:02:54Z","title":"Representative Language Generation","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-07T13:43:39.076459Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2505.21819"},"observation_digest":"sha256:46a759259df6e542d82b771a83f1495b5ff2c042268ad50e569ae83bb26621c6","observation_id":"db128fdb-d3a7-4e6f-9245-4368210bca16","resolution":{"observed_at":"2026-08-07T13:43:39.076459Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-08-05T11:50:42.962974Z","title":"[GKSZ22] Parikshit Gopalan, Michael P","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2509.02279","last_updated":"2025-09-02T13:01:43Z","snapshot_observed_at":"2026-08-08T15:16:41.316353Z","submitted_at":"2025-09-02T13:01:43Z","title":"Calibration through the Lens of Indistinguishability","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-05T11:50:42.962974Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2509.02279"},"observation_digest":"sha256:bfa341274d047d934cdf1e90e83530df6dc636a7d13bfec459e7ca3fbd230876","observation_id":"98f57756-d4b8-4289-8052-800371a2ead7","resolution":{"observed_at":"2026-08-05T11:50:42.962974Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":"2109.05389","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-07-02T01:26:24.483205Z","title":"Omnipredictors","venue":null,"work_id":"f762ac80-f3c5-4351-af51-aefe391caa18","year":2021},"citing_paper":{"arxiv_id":"2604.24957","last_updated":"2026-05-19T21:17:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-27T19:52:38Z","title":"Compute Aligned Training: Optimizing for Test Time Inference","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-08T04:12:53.868648Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2604.24957"},"observation_digest":"sha256:a16fdef2e506bf5f9b806c29e2a6a31b71d7a4e0d913088dac194b71de2cc5cf","observation_id":"a6e14aaa-afc3-487a-8167-bd9993613cb3","resolution":{"observed_at":"2026-05-11T21:51:11.761997Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":"2109.05389","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-07-02T01:26:24.483205Z","title":"Omnipredictors","venue":null,"work_id":"f762ac80-f3c5-4351-af51-aefe391caa18","year":2021},"citing_paper":{"arxiv_id":"2604.24957","last_updated":"2026-05-19T21:17:01Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-04-27T19:52:38Z","title":"Compute Aligned Training: Optimizing for Test Time Inference","version":2},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-05-21T08:41:49.623026Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2604.24957"},"observation_digest":"sha256:087b9d846ad0c7e9740eef76ee6bd2e9a5ef8722c6f1419e656d7437d180cf35","observation_id":"eecc9abb-540c-443a-9d42-f57306efe601","resolution":{"observed_at":"2026-05-21T08:44:04.606764Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":"2109.05389","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-07-02T01:26:24.483205Z","title":"Omnipredictors","venue":null,"work_id":"f762ac80-f3c5-4351-af51-aefe391caa18","year":2021},"citing_paper":{"arxiv_id":"2605.08964","last_updated":"2026-05-09T14:11:36Z","snapshot_observed_at":"2026-08-04T02:22:48.590517Z","submitted_at":"2026-05-09T14:11:36Z","title":"Trustworthy AI: Ensuring Reliability and Accountability from Models to Agents","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-05-12T02:21:12.882825Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2605.08964"},"observation_digest":"sha256:be96cb73fcbf0172b7fb6ef55c54c5e36ee2c8d1985373c00d5b474559a720bd","observation_id":"9aa0e1ff-bfa4-474f-980f-56ade05edcde","resolution":{"observed_at":"2026-05-12T02:21:16.276296Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":"2109.05389","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-07-02T01:26:24.483205Z","title":"Omnipredictors","venue":null,"work_id":"f762ac80-f3c5-4351-af51-aefe391caa18","year":2021},"citing_paper":{"arxiv_id":"2605.24364","last_updated":"2026-05-23T03:04:49Z","snapshot_observed_at":"2026-08-07T10:51:20.736366Z","submitted_at":"2026-05-23T03:04:49Z","title":"Multicalibration Boosting: Theory, Convergence, and Transferability","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-30T12:50:19.491058Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2605.24364"},"observation_digest":"sha256:a0cd0404863960eb09ebbae1da7a26b8b3d29d818ba4e21e175d49a361bfc49b","observation_id":"578ca237-a2a9-47ea-9b84-254cb90e7a17","resolution":{"observed_at":"2026-06-30T12:54:40.092935Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":"2109.05389","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-07-02T01:26:24.483205Z","title":"Omnipredictors","venue":null,"work_id":"f762ac80-f3c5-4351-af51-aefe391caa18","year":2021},"citing_paper":{"arxiv_id":"2606.02957","last_updated":"2026-06-03T21:28:02Z","snapshot_observed_at":"2026-08-08T13:16:33.230353Z","submitted_at":"2026-06-01T23:24:08Z","title":"The Fair Lending Model: How the Longest-Running Algorithmic Fairness Programs Work in Practice","version":2},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-06-28T12:04:09.267468Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2606.02957"},"observation_digest":"sha256:4cde3e773c949eb1935a5d2e499972405babb59bdf2ba9e805e5a52302ba1e42","observation_id":"e3fc62ca-0dcc-40ee-ac69-fbcad85c9e07","resolution":{"observed_at":"2026-07-02T01:26:24.484709Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2109.05389","snapshot_observed_at":"2026-08-08T15:24:32.287673Z","title":"Omnipredictors.arXiv preprint arXiv:2109.05389,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2608.05327","last_updated":"2026-08-05T18:34:19Z","snapshot_observed_at":"2026-08-08T22:15:37.117345Z","submitted_at":"2026-08-05T18:34:19Z","title":"Computationally Efficient Collaborative Communication Via Regularity-Based Coarsening","version":1},"reference_index":2024,"source":"pdf_text","source_observed_at":"2026-08-08T15:24:32.287673Z"},"links":{"cited_paper":"/paper/2109.05389","citing_paper":"/paper/2608.05327"},"observation_digest":"sha256:8451d8f666808186c0f9c9f1d1b844e180e0d20ca72ffea122660c84f047931c","observation_id":"9f695d6e-547b-4b1c-8600-fa71fded7f4d","resolution":{"observed_at":"2026-08-08T15:24:32.287673Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/2109.05389/citation-record","integrity":"/paper/2109.05389/integrity","json":"/paper/2109.05389/citation-record.json","paper":"/paper/2109.05389"},"outbound":[],"paper":{"arxiv_id":"2109.05389","last_updated":"2021-09-11T23:28:49Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T00:26:50.900339Z","submitted_at":"2021-09-11T23:28:49Z","title":"Omnipredictors"},"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-08T06:32:00.761636+00:00","source":"crossref"},{"observed_at":"2026-08-08T06:31:55.24221+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2109.05389."}