{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:YIRXZPQ7GON526ICVJB2E34FHZ","short_pith_number":"pith:YIRXZPQ7","schema_version":"1.0","canonical_sha256":"c2237cbe1f339bdd7902aa43a26f853e47fe64091310f0dac61c983f3f80091e","source":{"kind":"arxiv","id":"2507.03048","version":1},"attestation_state":"computed","paper":{"title":"Monitoring of Static Fairness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Kaushik Mallik, Konstantin Kueffner, Mahyar Karimi, Thomas A. Henzinger","submitted_at":"2025-07-03T10:20:04Z","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.\n  We present a general framework of runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure, with or without full observation of the state space.\n  We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden.\n  We build monitors tha"},"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":"2507.03048","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-07-03T10:20:04Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"ec50d2f5b880548f0457f490f44d6578ef1d3e422c171aed713a6f21f92d9dac","abstract_canon_sha256":"f2f89486cb3b0de95ab0df89a6307196152f2793246cf0d636ff4725e4228479"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:31:51.472750Z","signature_b64":"3QBGoow3zqTSLPbyPtYKff4BOyse2Ni1E3Zlqa3FMgtMipszaj2i7v+B3abkvnBUDwim//mQq1XSXQ6XJm01Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2237cbe1f339bdd7902aa43a26f853e47fe64091310f0dac61c983f3f80091e","last_reissued_at":"2026-07-05T11:31:51.472082Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:31:51.472082Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Monitoring of Static Fairness","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Kaushik Mallik, Konstantin Kueffner, Mahyar Karimi, Thomas A. Henzinger","submitted_at":"2025-07-03T10:20:04Z","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.\n  We present a general framework of runtime verification of algorithmic fairness for systems whose models are unknown, but are assumed to have a Markov chain structure, with or without full observation of the state space.\n  We introduce a specification language that can model many common algorithmic fairness properties, such as demographic parity, equal opportunity, and social burden.\n  We build monitors tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.03048","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/2507.03048/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":"2507.03048","created_at":"2026-07-05T11:31:51.472158+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.03048v1","created_at":"2026-07-05T11:31:51.472158+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.03048","created_at":"2026-07-05T11:31:51.472158+00:00"},{"alias_kind":"pith_short_12","alias_value":"YIRXZPQ7GON5","created_at":"2026-07-05T11:31:51.472158+00:00"},{"alias_kind":"pith_short_16","alias_value":"YIRXZPQ7GON526IC","created_at":"2026-07-05T11:31:51.472158+00:00"},{"alias_kind":"pith_short_8","alias_value":"YIRXZPQ7","created_at":"2026-07-05T11:31:51.472158+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ","json":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ.json","graph_json":"https://pith.science/api/pith-number/YIRXZPQ7GON526ICVJB2E34FHZ/graph.json","events_json":"https://pith.science/api/pith-number/YIRXZPQ7GON526ICVJB2E34FHZ/events.json","paper":"https://pith.science/paper/YIRXZPQ7"},"agent_actions":{"view_html":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ","download_json":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ.json","view_paper":"https://pith.science/paper/YIRXZPQ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.03048&json=true","fetch_graph":"https://pith.science/api/pith-number/YIRXZPQ7GON526ICVJB2E34FHZ/graph.json","fetch_events":"https://pith.science/api/pith-number/YIRXZPQ7GON526ICVJB2E34FHZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ/action/storage_attestation","attest_author":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ/action/author_attestation","sign_citation":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ/action/citation_signature","submit_replication":"https://pith.science/pith/YIRXZPQ7GON526ICVJB2E34FHZ/action/replication_record"}},"created_at":"2026-07-05T11:31:51.472158+00:00","updated_at":"2026-07-05T11:31:51.472158+00:00"}