{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:4MSUO6I4Z7HTKTPBIDDWOWP3B7","short_pith_number":"pith:4MSUO6I4","schema_version":"1.0","canonical_sha256":"e32547791ccfcf354de140c76759fb0fcf197cfb71a9003c42172add19167f42","source":{"kind":"arxiv","id":"2305.12809","version":4},"attestation_state":"computed","paper":{"title":"Relabeling Minimal Training Subset to Flip a Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jinghan Yang, Lequan Yu, Linjie Xu","submitted_at":"2023-05-22T08:10:43Z","abstract_excerpt":"When facing an unsatisfactory prediction from a machine learning model, users can be interested in investigating the underlying reasons and exploring the potential for reversing the outcome. We ask: To flip the prediction on a test point $x_t$, how to identify the smallest training subset $\\mathcal{S}_t$ that we need to relabel? We propose an efficient algorithm to identify and relabel such a subset via an extended influence function for binary classification models with convex loss. We find that relabeling fewer than 2% of the training points can always flip a prediction. This mechanism can s"},"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.12809","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-22T08:10:43Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"79b6e4c053e47988625a7fd86a5c373812ee7709d53a6f52798740c82e45fb6c","abstract_canon_sha256":"89d4b66ad346ae682726848c9a97f45cc700c6ca0796c4bbb46eb84dc3c625d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:40:53.426627Z","signature_b64":"ao3yz/pJ35Lkbey9t6TUYI31JoHA4ToVN18FKl8HVqMUOszE4M2VT2KiT5fvSKZvjf/2ANn5l7+lb63WnPx9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e32547791ccfcf354de140c76759fb0fcf197cfb71a9003c42172add19167f42","last_reissued_at":"2026-07-05T07:40:53.426128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:40:53.426128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Relabeling Minimal Training Subset to Flip a Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jinghan Yang, Lequan Yu, Linjie Xu","submitted_at":"2023-05-22T08:10:43Z","abstract_excerpt":"When facing an unsatisfactory prediction from a machine learning model, users can be interested in investigating the underlying reasons and exploring the potential for reversing the outcome. We ask: To flip the prediction on a test point $x_t$, how to identify the smallest training subset $\\mathcal{S}_t$ that we need to relabel? We propose an efficient algorithm to identify and relabel such a subset via an extended influence function for binary classification models with convex loss. We find that relabeling fewer than 2% of the training points can always flip a prediction. This mechanism can s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.12809","kind":"arxiv","version":4},"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.12809/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.12809","created_at":"2026-07-05T07:40:53.426186+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.12809v4","created_at":"2026-07-05T07:40:53.426186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.12809","created_at":"2026-07-05T07:40:53.426186+00:00"},{"alias_kind":"pith_short_12","alias_value":"4MSUO6I4Z7HT","created_at":"2026-07-05T07:40:53.426186+00:00"},{"alias_kind":"pith_short_16","alias_value":"4MSUO6I4Z7HTKTPB","created_at":"2026-07-05T07:40:53.426186+00:00"},{"alias_kind":"pith_short_8","alias_value":"4MSUO6I4","created_at":"2026-07-05T07:40:53.426186+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19998","citing_title":"Tri-Info: Generalizable, Interpretable Failure Prediction for VLA Models via Information Theory","ref_index":284,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7","json":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7.json","graph_json":"https://pith.science/api/pith-number/4MSUO6I4Z7HTKTPBIDDWOWP3B7/graph.json","events_json":"https://pith.science/api/pith-number/4MSUO6I4Z7HTKTPBIDDWOWP3B7/events.json","paper":"https://pith.science/paper/4MSUO6I4"},"agent_actions":{"view_html":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7","download_json":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7.json","view_paper":"https://pith.science/paper/4MSUO6I4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.12809&json=true","fetch_graph":"https://pith.science/api/pith-number/4MSUO6I4Z7HTKTPBIDDWOWP3B7/graph.json","fetch_events":"https://pith.science/api/pith-number/4MSUO6I4Z7HTKTPBIDDWOWP3B7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7/action/storage_attestation","attest_author":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7/action/author_attestation","sign_citation":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7/action/citation_signature","submit_replication":"https://pith.science/pith/4MSUO6I4Z7HTKTPBIDDWOWP3B7/action/replication_record"}},"created_at":"2026-07-05T07:40:53.426186+00:00","updated_at":"2026-07-05T07:40:53.426186+00:00"}