{"as_of":"2026-08-12T05:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:cef6137d614a091ed0c86b9cbf1ab7b1983a72a6d547e06e4d75fbc394df1817","coverage":[{"denominator":24,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":24,"source":"paper_references, paper_reference_links","source_observed_at":"2026-06-27T09:55:35.961288Z","state":"measured"},{"denominator":24,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":24,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-11T06:34:44.6726+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2606.12615/citation-record","integrity":"/paper/2606.12615/integrity","json":"/paper/2606.12615/citation-record.json","paper":"/paper/2606.12615"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"Machine Bias","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:4b840d474d0c04aec32bcd404408d7f7df24be82e8c61d2cc25a67c7ae5dd122","observation_id":"6098d182-1f68-43ec-961f-bd75acdeb673","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1805.12317","last_updated":"2018-08-29T16:53:44Z","snapshot_observed_at":"2026-08-11T15:37:30.727015Z","submitted_at":"2018-05-31T04:51:08Z","title":"Multiaccuracy: Black-Box Post-Processing for Fairness in Classification","version":2},"cited_work":{"arxiv_id":"1805.12317","doi":null,"metadata_source":"pith","pith_arxiv_id":"1805.12317","snapshot_observed_at":"2026-07-03T10:37:56.837296Z","title":"Multiaccuracy: Black-Box Post-Processing for Fairness in Classification","venue":"cs.LG","work_id":"733a4e22-a68f-464c-9d9d-5b0b60ae4275","year":2018},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/1805.12317","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:980d31e9b2196477a3eff36dc1ba2f64de75de737e261232747117ed0e6cbd5a","observation_id":"8c63096f-f1c1-4d02-af33-57effe568278","resolution":{"observed_at":"2026-07-03T10:37:56.838722Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1908.08619","last_updated":"2020-03-29T06:05:56Z","snapshot_observed_at":"2026-08-09T21:57:07.776836Z","submitted_at":"2019-08-22T23:09:27Z","title":"Efficient Task-Specific Data Valuation for Nearest Neighbor Algorithms","version":4},"cited_work":{"arxiv_id":"1908.08619","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"1908.08619","snapshot_observed_at":"2026-07-04T02:39:25.529310Z","title":"arXiv preprint arXiv:1908.08619 , year=","venue":null,"work_id":"b3c1c96e-b637-4da4-9bd6-92618608721f","year":1908},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/1908.08619","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:d77e295083377a499f0da3976b92add7bd87d3748ca05e6fadc21fb700c45513","observation_id":"ccfe9aa9-5ef5-43bf-a631-4f397bf9f5ff","resolution":{"observed_at":"2026-07-03T10:37:56.835444Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1970.10544","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-03T10:37:56.839889Z","title":"On Optimum Recognition Error and Reject Tradeoff","venue":null,"work_id":"d6b791a5-1fc5-4ab6-be4d-ecd115d2f160","year":1970},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:5f8810757d8a4e8d0d2f79e9b6383bd1fffd9126af766a724b93b49c04f7f60a","observation_id":"4ae55e1e-c40c-4616-a982-4f28405b9f94","resolution":{"observed_at":"2026-07-03T10:37:56.841551Z","resolver_source":"arxiv_id","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"Amazon scraps secret AI recruiting tool that showed bias against women","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:684be29bc8542e8ff3ea0495540292e8a0bec1596654a9689a4201f18c899f6a","observation_id":"904c888d-6b57-4fff-b7e3-2344e75369e6","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2303.04379","last_updated":"2023-03-08T05:05:01Z","snapshot_observed_at":"2026-07-06T15:00:01.455874Z","submitted_at":"2023-03-08T05:05:01Z","title":"HappyMap: A Generalized Multi-calibration Method","version":1},"cited_work":{"arxiv_id":"2303.04379","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2303.04379","snapshot_observed_at":"2026-07-03T10:37:56.842879Z","title":"Happymap: A generalized multi-calibration method","venue":null,"work_id":"395a0250-5102-4e5d-8f31-e3726a65e3ea","year":2023},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/2303.04379","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:4f015f843c39a951a124ff1a7957156a3ee8621d339008cd8199d3b42d932084","observation_id":"7ef57865-36d7-48c3-8f67-5b7a004ee397","resolution":{"observed_at":"2026-07-03T10:37:56.844424Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1609/aaai.v33i01.33015099","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T10:00:49.085924Z","title":"Bayesian Fairness","venue":null,"work_id":"ce084504-10ab-407c-8d37-8164f5ed3800","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:41b9630a85b28a85818ab56bd72384a543277d34a07621663bcd9001b3753ce8","observation_id":"2061a67c-c82b-4e30-8701-fa3cfdfae336","resolution":{"observed_at":"2026-06-27T10:00:49.087627Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"On the foundations of noise-free selective classification","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:3a5a06fa26ea3e6aa4201e3f5c53f8d262d721b2762f6cddf6b826f07174295e","observation_id":"00875d34-aea6-402c-856a-2996e4d03504","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"https://eur-lex.europa.eu/eli/reg/2024/1689/oj","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:b6198253480cb42987bc732fdcaec12dbff4effa9fb9edbf65d0415087c29697","observation_id":"aa605d81-3597-40f4-b903-e010394393f1","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976236.43","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Bayesian Modelling of Intersectional Fairness: The Variance of Bias","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"ebb73b89-d054-4206-9e85-5ed7f16f3e45","year":2020},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:97489a29b8f0a875325c2bc8922d3a11b627cc7d29643500a930562b27f1be0b","observation_id":"46481d5d-4c6e-4c3f-b505-f94b2906cf30","resolution":{"observed_at":"2026-06-27T10:00:49.097168Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"Multicalibration: Calibration for the (computationally-identifiable) masses","venue":null,"work_id":null,"year":1939},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:5a09bb801c1250dc5a79d88436c26b9a3d94b03816071b0c9045f5c7a9f7c51b","observation_id":"b52a6dbf-3fa2-4a3f-8e79-69d03f9cff04","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1002/cjs.5550340410","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Canadian Journal of Statistics , author =","venue":"Canadian Journal of Statistics","work_id":"cd505d28-841a-40fc-abaa-72f337165d18","year":2006},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:b5e4d29d5bcdb4faacdedd5ab20a65315713902e833d37fbbd35f812806ed040","observation_id":"2ef68d2d-1261-40b6-b215-07800e43f719","resolution":{"observed_at":"2026-06-27T10:00:49.100054Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2306.13898","last_updated":"2023-06-24T08:13:19Z","snapshot_observed_at":"2026-07-06T15:46:13.880066Z","submitted_at":"2023-06-24T08:13:19Z","title":"An upper bound for the box dimension of the hyperbolic dynamics via unstable pressure","version":1},"cited_work":{"arxiv_id":"2306.13898","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2306.13898","snapshot_observed_at":"2026-07-03T10:37:56.845667Z","title":"Can I Trust My Fairness Metric? Assessing Fairness with Unlabeled Data and Bayesian Inference","venue":null,"work_id":"1712dfed-a122-41cb-bed9-d6d09df8cf1f","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/2306.13898","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:c038450a33f8bce72790f794cb9c62849052db8c2fe057e7b998126e83294a8f","observation_id":"1e375c1c-ea5b-4746-ada2-2b564c7332fa","resolution":{"observed_at":"2026-07-03T10:37:56.847287Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":"1459.1995","doi":"10.1080/01621459.1995","metadata_source":"arxiv_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-11T11:50:26.030339Z","title":"B ayes Factors","venue":null,"work_id":"64c3953a-07e7-4abf-9378-38ee17c45f72","year":1995},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:09bb889d999c9b32060c125d1c89777276e35886f5839ea9852725cbc9ce923d","observation_id":"64c2062f-4a1f-4d3a-88cd-c3729ae508ef","resolution":{"observed_at":"2026-06-27T10:00:49.091413Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2402.11392","last_updated":"2024-02-17T22:07:58Z","snapshot_observed_at":"2026-08-06T01:44:13.819292Z","submitted_at":"2024-02-17T22:07:58Z","title":"Direct Exfoliation of Nanoribbons from Bulk van der Waals Crystals","version":1},"cited_work":{"arxiv_id":"2402.11392","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2402.11392","snapshot_observed_at":"2026-07-03T10:37:56.843619Z","title":"Interpretable and Fair Mechanisms for Abstaining Classifiers","venue":null,"work_id":"40826b09-e471-4425-ae09-3e789a1068d5","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/2402.11392","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:0b9d765ec1265e606fd44eb54e75cd93b3b20cb9872122b93060effd8a8a7bdd","observation_id":"07a743d5-aaa2-433b-96a5-e889fff43dac","resolution":{"observed_at":"2026-07-03T10:37:56.845202Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1145/3457607","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"ACM Comput","venue":"ACM Computing Surveys","work_id":"9e82a077-a3c0-4e43-b962-c27937269427","year":2021},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:d8a7f3aac6c8f57a159143aab8fed157f0960064aee520f14eba54e637c950bd","observation_id":"35f8da03-9746-45f0-b2c1-073860125ea7","resolution":{"observed_at":"2026-06-27T10:00:49.094271Z","resolver_source":"doi","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-07-11T14:19:25.892193+00:00","source":"crossref_status_cache"},{"observed_at":"2026-07-11T14:19:25.892193+00:00","source":"openalex_status_cache"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2102.06959","last_updated":"2021-02-13T17:04:59Z","snapshot_observed_at":"2026-07-06T10:41:03.588448Z","submitted_at":"2021-02-13T17:04:59Z","title":"Euclidean Affine Functions and Applications to Calendar Algorithms","version":1},"cited_work":{"arxiv_id":"2102.06959","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2102.06959","snapshot_observed_at":"2026-07-03T10:37:56.830949Z","title":"Fair Bayesian Optimization","venue":null,"work_id":"808e00b6-e019-4211-8cee-710c0f1a6605","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/2102.06959","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:77366fd457dce78172bd946786985725c6be49ac8be13499ce1cb35d35daa1ef","observation_id":"7d097a05-8e93-41b2-9bbd-cd1ca89d74b2","resolution":{"observed_at":"2026-07-03T10:37:56.832486Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2106.08057","last_updated":"2021-06-16T10:30:49Z","snapshot_observed_at":"2026-08-03T17:23:56.348159Z","submitted_at":"2021-06-15T11:30:08Z","title":"The $(k,l)$-Euler theorem and the combinatorics of $(k,l)$-sequences","version":2},"cited_work":{"arxiv_id":"2106.08057","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2106.08057","snapshot_observed_at":"2026-07-03T10:37:56.825692Z","title":"Classification with abstention but without disparities","venue":null,"work_id":"db9497c6-9964-4ea2-b317-d32d51ec37a2","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/2106.08057","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:d9afd05af3e127c348b3976bfc7d5d926d08eb019e2a2fe92a7ec00b7556447c","observation_id":"838f8a33-a494-4c0b-98c4-56e9d0768948","resolution":{"observed_at":"2026-07-03T10:37:56.827445Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1613/jair.4439","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Agnostic Pointwise-Competitive Selective Classification","venue":"Journal of Artificial Intelligence Research","work_id":"054e852c-1c51-49bd-a0e2-cdfc48e7a268","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:96ee9829855f5f93b2b4d973afc86eea9d67a1af35b94efae4c6964654ecd061","observation_id":"24adfe39-3928-4405-85eb-855420e8ca73","resolution":{"observed_at":"2026-06-27T10:00:49.103326Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"Fair Classifiers that Abstain without Harm","venue":null,"work_id":null,"year":1989},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:4fb3e7196713fb46958532f241c9bdfefc38f84bb1afbaf63563243e6175bbf4","observation_id":"80dde5f0-5ba9-4621-b143-e4a4e3127833","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2207.08801","last_updated":"2023-06-06T20:57:51Z","snapshot_observed_at":"2026-07-06T13:32:38.285820Z","submitted_at":"2022-07-18T17:57:10Z","title":"Dynamics of certain Euler-Bernoulli rods and rings from a minimal coupling quantum isomorphism","version":2},"cited_work":{"arxiv_id":"2207.08801","doi":null,"metadata_source":"arxiv_reference","pith_arxiv_id":"2207.08801","snapshot_observed_at":"2026-07-03T10:37:56.822908Z","title":"A Pseudocode A.0.1 Data Preparation (Steps 1–5).The first step is to set the parameters of the algorithm: •𝛼 : Significance level","venue":null,"work_id":"5bf490ae-1e97-4be1-bcf4-7e3f5a089413","year":null},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"cited_paper":"/paper/2207.08801","citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:585b3d52461394a40d75731dc6540a951eca386fb0bd2772e59b6aa2ef981f1f","observation_id":"6173e951-de0a-4703-b852-6c8532d4c98a","resolution":{"observed_at":"2026-07-03T10:37:56.824496Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-11T06:34:44.6726+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"This lets us pick between pool members using the richer 𝑣 node evidence, which cannot be expressed as a linear MIP objective","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:f6b7014d0f3c37fa232ec79941a78f8fa969ee1265703639c5c75264089de342","observation_id":"313cc613-29d5-4808-b20a-42b91dc5cf28","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"Proportional Multi-Calibrator (PMC) The PMC post-processor is applied to a logistic regression base learner (LogisticRegression, 𝐶= 1.0,max_iter= 1000)","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:1730c81ea0def568caf38a335ffe86f8c8c91796d4eb46e46d0b38454f103dfd","observation_id":"036d0e24-9f41-4eb5-aba4-9f471748aadd","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-06-27T09:55:35.961288Z","title":"cherry-picked","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-06-27T09:55:35.961288Z"},"links":{"citing_paper":"/paper/2606.12615"},"observation_digest":"sha256:f16b3827d113fd1592d4c3f5f2463c3bc6649b7be6c12cf39fb6ca78e158cf1f","observation_id":"f39b5467-141d-46a3-99fe-cc6fe4ff9c1a","resolution":{"observed_at":"2026-06-27T09:55:35.961288Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2606.12615","last_updated":"2026-06-10T19:16:26Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-07T08:57:38.685069Z","submitted_at":"2026-06-10T19:16:26Z","title":"Towards Provably Fair Machine Learning: Bayesian Approaches For Consistent and Transparent Predictions"},"reference_resolution":{"displayed":24,"state_counts":{"malformed_identifier":1,"metadata_mismatch":3,"parse_uncertain":0,"unresolved":9,"verified_exact":11,"verified_fuzzy":0},"total_outbound_references":24},"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-11T06:34:44.6726+00:00","source":"crossref"},{"observed_at":"2026-08-11T06:34:36.301508+00:00","source":"retraction_watch"}],"thesis":"As of 12 August 2026, this Paper Citation Record lists 24 of 24 outbound references and 0 inbound Pith citation observations for arXiv:2606.12615."}