{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:IPND5C7SVRYMKIYVPE5TRA3EPT","short_pith_number":"pith:IPND5C7S","schema_version":"1.0","canonical_sha256":"43da3e8bf2ac70c52315793b3883647cdd2b975e9d3db2fadb2220ad86c086d0","source":{"kind":"arxiv","id":"2305.15979","version":1},"attestation_state":"computed","paper":{"title":"Monitoring Algorithmic Fairness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CY","authors_text":"Kaushik Mallik, Konstantin Kueffner, Mahyar Karimi, Thomas A. Henzinger","submitted_at":"2023-05-25T12:17:59Z","abstract_excerpt":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, af"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2305.15979","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CY","submitted_at":"2023-05-25T12:17:59Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ba5df097e2a43959223bd7a72dc91c912366aaf720c6ec22dac9419fb652a952","abstract_canon_sha256":"ef28996ff70e5e891f3e986f0a3bf19e76a78909e4edadbb18ba444ccc77925c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:58.264147Z","signature_b64":"cPkYV6BNA7FxkvRpJN0TzNOxinzrLKWdHXajpCpi1ymH38QxOM0j9SpCPFeeFxZzoqFAPk0ptzX4HSpSKmX2CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43da3e8bf2ac70c52315793b3883647cdd2b975e9d3db2fadb2220ad86c086d0","last_reissued_at":"2026-07-05T06:13:58.263808Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:58.263808Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monitoring Algorithmic Fairness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.CY","authors_text":"Kaushik Mallik, Konstantin Kueffner, Mahyar Karimi, Thomas A. Henzinger","submitted_at":"2023-05-25T12:17:59Z","abstract_excerpt":"Machine-learned systems are in widespread use for making decisions about humans, and it is important that they are fair, i.e., not biased against individuals based on sensitive attributes. We present runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure. We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden. We build monitors that observe a long sequence of events as generated by a given system, and output, af"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.15979","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.15979/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2305.15979","created_at":"2026-07-05T06:13:58.263869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.15979v1","created_at":"2026-07-05T06:13:58.263869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.15979","created_at":"2026-07-05T06:13:58.263869+00:00"},{"alias_kind":"pith_short_12","alias_value":"IPND5C7SVRYM","created_at":"2026-07-05T06:13:58.263869+00:00"},{"alias_kind":"pith_short_16","alias_value":"IPND5C7SVRYMKIYV","created_at":"2026-07-05T06:13:58.263869+00:00"},{"alias_kind":"pith_short_8","alias_value":"IPND5C7S","created_at":"2026-07-05T06:13:58.263869+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.01065","citing_title":"Lookahead Counterfactual Fairness","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT","json":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT.json","graph_json":"https://pith.science/api/pith-number/IPND5C7SVRYMKIYVPE5TRA3EPT/graph.json","events_json":"https://pith.science/api/pith-number/IPND5C7SVRYMKIYVPE5TRA3EPT/events.json","paper":"https://pith.science/paper/IPND5C7S"},"agent_actions":{"view_html":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT","download_json":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT.json","view_paper":"https://pith.science/paper/IPND5C7S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.15979&json=true","fetch_graph":"https://pith.science/api/pith-number/IPND5C7SVRYMKIYVPE5TRA3EPT/graph.json","fetch_events":"https://pith.science/api/pith-number/IPND5C7SVRYMKIYVPE5TRA3EPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT/action/storage_attestation","attest_author":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT/action/author_attestation","sign_citation":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT/action/citation_signature","submit_replication":"https://pith.science/pith/IPND5C7SVRYMKIYVPE5TRA3EPT/action/replication_record"}},"created_at":"2026-07-05T06:13:58.263869+00:00","updated_at":"2026-07-05T06:13:58.263869+00:00"}