{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:XYCHJABMEAV5JZ5MDAZWD2RFKC","short_pith_number":"pith:XYCHJABM","schema_version":"1.0","canonical_sha256":"be0474802c202bd4e7ac183361ea255095ea85fd95be3b87e17160bdade3c28d","source":{"kind":"arxiv","id":"2005.08377","version":1},"attestation_state":"computed","paper":{"title":"The Role of Randomness and Noise in Strategic Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark Braverman, Sumegha Garg","submitted_at":"2020-05-17T21:49:41Z","abstract_excerpt":"We investigate the problem of designing optimal classifiers in the strategic classification setting, where the classification is part of a game in which players can modify their features to attain a favorable classification outcome (while incurring some cost). Previously, the problem has been considered from a learning-theoretic perspective and from the algorithmic fairness perspective. Our main contributions include 1. Showing that if the objective is to maximize the efficiency of the classification process (defined as the accuracy of the outcome minus the sunk cost of the qualified players m"},"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":"2005.08377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-17T21:49:41Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"99ae149eaa6cbcd6cfc77b79aca60d347170462acdb2d117ffb5610569c13f71","abstract_canon_sha256":"997e7fc08a35626c6c14b32ccca6d321140d26dc51f52e58e75865e63f8e49e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:03:30.977507Z","signature_b64":"Bvf4eIrTznS/G1xwTVRMxwL5ioK5/ISy5jz56HOeNHQZvGauQgZ+F+iqnv19l8ZkqxbA00osqAplHs9EIYheDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"be0474802c202bd4e7ac183361ea255095ea85fd95be3b87e17160bdade3c28d","last_reissued_at":"2026-07-05T01:03:30.977058Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:03:30.977058Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Role of Randomness and Noise in Strategic Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Mark Braverman, Sumegha Garg","submitted_at":"2020-05-17T21:49:41Z","abstract_excerpt":"We investigate the problem of designing optimal classifiers in the strategic classification setting, where the classification is part of a game in which players can modify their features to attain a favorable classification outcome (while incurring some cost). Previously, the problem has been considered from a learning-theoretic perspective and from the algorithmic fairness perspective. Our main contributions include 1. Showing that if the objective is to maximize the efficiency of the classification process (defined as the accuracy of the outcome minus the sunk cost of the qualified players m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.08377","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/2005.08377/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":"2005.08377","created_at":"2026-07-05T01:03:30.977113+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.08377v1","created_at":"2026-07-05T01:03:30.977113+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.08377","created_at":"2026-07-05T01:03:30.977113+00:00"},{"alias_kind":"pith_short_12","alias_value":"XYCHJABMEAV5","created_at":"2026-07-05T01:03:30.977113+00:00"},{"alias_kind":"pith_short_16","alias_value":"XYCHJABMEAV5JZ5M","created_at":"2026-07-05T01:03:30.977113+00:00"},{"alias_kind":"pith_short_8","alias_value":"XYCHJABM","created_at":"2026-07-05T01:03:30.977113+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28204","citing_title":"Non-Linear Strategic Classification Made Practical","ref_index":1,"is_internal_anchor":false},{"citing_arxiv_id":"2606.00826","citing_title":"Partial Fairness Awareness: Belief-Guided Strategic Mechanism for Strategic Agents","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2605.04202","citing_title":"Sequential Strategic Classification with Multi-Stage Selective Classifiers","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC","json":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC.json","graph_json":"https://pith.science/api/pith-number/XYCHJABMEAV5JZ5MDAZWD2RFKC/graph.json","events_json":"https://pith.science/api/pith-number/XYCHJABMEAV5JZ5MDAZWD2RFKC/events.json","paper":"https://pith.science/paper/XYCHJABM"},"agent_actions":{"view_html":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC","download_json":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC.json","view_paper":"https://pith.science/paper/XYCHJABM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.08377&json=true","fetch_graph":"https://pith.science/api/pith-number/XYCHJABMEAV5JZ5MDAZWD2RFKC/graph.json","fetch_events":"https://pith.science/api/pith-number/XYCHJABMEAV5JZ5MDAZWD2RFKC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC/action/storage_attestation","attest_author":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC/action/author_attestation","sign_citation":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC/action/citation_signature","submit_replication":"https://pith.science/pith/XYCHJABMEAV5JZ5MDAZWD2RFKC/action/replication_record"}},"created_at":"2026-07-05T01:03:30.977113+00:00","updated_at":"2026-07-05T01:03:30.977113+00:00"}