{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:Q4OMLCFHTXVR6SUEWXJFKY5F2R","short_pith_number":"pith:Q4OMLCFH","schema_version":"1.0","canonical_sha256":"871cc588a79deb1f4a84b5d25563a5d47430805a0061288a8584c1490906046b","source":{"kind":"arxiv","id":"2410.08111","version":1},"attestation_state":"computed","paper":{"title":"Active Fourier Auditor for Estimating Distributional Properties of ML Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ayoub Ajarra, Bishwamittra Ghosh, Debabrota Basu","submitted_at":"2024-10-10T16:57:01Z","abstract_excerpt":"With the pervasive deployment of Machine Learning (ML) models in real-world applications, verifying and auditing properties of ML models have become a central concern. In this work, we focus on three properties: robustness, individual fairness, and group fairness. We discuss two approaches for auditing ML model properties: estimation with and without reconstruction of the target model under audit. Though the first approach is studied in the literature, the second approach remains unexplored. For this purpose, we develop a new framework that quantifies different properties in terms of the Fouri"},"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":"2410.08111","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.LG","submitted_at":"2024-10-10T16:57:01Z","cross_cats_sorted":["cs.AI","cs.CY","stat.ML"],"title_canon_sha256":"75f189990c83f69acf3541372e0f3ea8091569f1c6e3324439db702f1e61b633","abstract_canon_sha256":"8f8458b43524317caa783cd358b12a68072d38f232e6d64dee4bda24c64ab241"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:18:48.718480Z","signature_b64":"/JmrCNNTBR6MEZFCqtYdOIWGUSKpfR7+K6aQkeM9vYYiIR4POuNNvxfsnp91ZW8FStzsmi0fpaBv8INNOHCvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"871cc588a79deb1f4a84b5d25563a5d47430805a0061288a8584c1490906046b","last_reissued_at":"2026-07-05T09:18:48.717943Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:18:48.717943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Active Fourier Auditor for Estimating Distributional Properties of ML Models","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.AI","cs.CY","stat.ML"],"primary_cat":"cs.LG","authors_text":"Ayoub Ajarra, Bishwamittra Ghosh, Debabrota Basu","submitted_at":"2024-10-10T16:57:01Z","abstract_excerpt":"With the pervasive deployment of Machine Learning (ML) models in real-world applications, verifying and auditing properties of ML models have become a central concern. In this work, we focus on three properties: robustness, individual fairness, and group fairness. We discuss two approaches for auditing ML model properties: estimation with and without reconstruction of the target model under audit. Though the first approach is studied in the literature, the second approach remains unexplored. For this purpose, we develop a new framework that quantifies different properties in terms of the Fouri"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.08111","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/2410.08111/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":"2410.08111","created_at":"2026-07-05T09:18:48.717999+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.08111v1","created_at":"2026-07-05T09:18:48.717999+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.08111","created_at":"2026-07-05T09:18:48.717999+00:00"},{"alias_kind":"pith_short_12","alias_value":"Q4OMLCFHTXVR","created_at":"2026-07-05T09:18:48.717999+00:00"},{"alias_kind":"pith_short_16","alias_value":"Q4OMLCFHTXVR6SUE","created_at":"2026-07-05T09:18:48.717999+00:00"},{"alias_kind":"pith_short_8","alias_value":"Q4OMLCFH","created_at":"2026-07-05T09:18:48.717999+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.06443","citing_title":"The Fair Game: Auditing & Debiasing AI Algorithms Over Time","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R","json":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R.json","graph_json":"https://pith.science/api/pith-number/Q4OMLCFHTXVR6SUEWXJFKY5F2R/graph.json","events_json":"https://pith.science/api/pith-number/Q4OMLCFHTXVR6SUEWXJFKY5F2R/events.json","paper":"https://pith.science/paper/Q4OMLCFH"},"agent_actions":{"view_html":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R","download_json":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R.json","view_paper":"https://pith.science/paper/Q4OMLCFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.08111&json=true","fetch_graph":"https://pith.science/api/pith-number/Q4OMLCFHTXVR6SUEWXJFKY5F2R/graph.json","fetch_events":"https://pith.science/api/pith-number/Q4OMLCFHTXVR6SUEWXJFKY5F2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R/action/storage_attestation","attest_author":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R/action/author_attestation","sign_citation":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R/action/citation_signature","submit_replication":"https://pith.science/pith/Q4OMLCFHTXVR6SUEWXJFKY5F2R/action/replication_record"}},"created_at":"2026-07-05T09:18:48.717999+00:00","updated_at":"2026-07-05T09:18:48.717999+00:00"}