{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:DHPN2GYZ6P6MA5IXTCPCHDSO4J","short_pith_number":"pith:DHPN2GYZ","schema_version":"1.0","canonical_sha256":"19dedd1b19f3fcc07517989e238e4ee241c8b91075a46087809c5baff43a8cd4","source":{"kind":"arxiv","id":"2507.14740","version":1},"attestation_state":"computed","paper":{"title":"Better Training Data Attribution via Better Inverse Hessian-Vector Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Wang, Elisa Nguyen, Juhan Bae, Roger Grosse, Runshi Yang, Sheila A. McIlraith","submitted_at":"2025-07-19T20:18:51Z","abstract_excerpt":"Training data attribution (TDA) provides insights into which training data is responsible for a learned model behavior. Gradient-based TDA methods such as influence functions and unrolled differentiation both involve a computation that resembles an inverse Hessian-vector product (iHVP), which is difficult to approximate efficiently. We introduce an algorithm (ASTRA) which uses the EKFAC-preconditioner on Neumann series iterations to arrive at an accurate iHVP approximation for TDA. ASTRA is easy to tune, requires fewer iterations than Neumann series iterations, and is more accurate than EKFAC-"},"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.14740","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-07-19T20:18:51Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"53cdafb77d682b3afc0523e0c08e9d2920f029b070e026dd4ac556cadebab351","abstract_canon_sha256":"549b3095c389b43befe4a706583546f4e849e61de585e7e4efe713be93152737"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:40:12.711578Z","signature_b64":"5ZW78vLJAIpmQpXvL11ODhqsbTIlHQMjBZ3TOtd7dCfmL38GuzuCg9qXZVqXzbmvgFGLnp6ymC2tm9vHW3PeBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"19dedd1b19f3fcc07517989e238e4ee241c8b91075a46087809c5baff43a8cd4","last_reissued_at":"2026-07-05T11:40:12.711064Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:40:12.711064Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Training Data Attribution via Better Inverse Hessian-Vector Products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Andrew Wang, Elisa Nguyen, Juhan Bae, Roger Grosse, Runshi Yang, Sheila A. McIlraith","submitted_at":"2025-07-19T20:18:51Z","abstract_excerpt":"Training data attribution (TDA) provides insights into which training data is responsible for a learned model behavior. Gradient-based TDA methods such as influence functions and unrolled differentiation both involve a computation that resembles an inverse Hessian-vector product (iHVP), which is difficult to approximate efficiently. We introduce an algorithm (ASTRA) which uses the EKFAC-preconditioner on Neumann series iterations to arrive at an accurate iHVP approximation for TDA. ASTRA is easy to tune, requires fewer iterations than Neumann series iterations, and is more accurate than EKFAC-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.14740","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.14740/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.14740","created_at":"2026-07-05T11:40:12.711130+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.14740v1","created_at":"2026-07-05T11:40:12.711130+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.14740","created_at":"2026-07-05T11:40:12.711130+00:00"},{"alias_kind":"pith_short_12","alias_value":"DHPN2GYZ6P6M","created_at":"2026-07-05T11:40:12.711130+00:00"},{"alias_kind":"pith_short_16","alias_value":"DHPN2GYZ6P6MA5IX","created_at":"2026-07-05T11:40:12.711130+00:00"},{"alias_kind":"pith_short_8","alias_value":"DHPN2GYZ","created_at":"2026-07-05T11:40:12.711130+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.15520","citing_title":"On the Fragility of Data Attribution When Learning Is Distributed","ref_index":26,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J","json":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J.json","graph_json":"https://pith.science/api/pith-number/DHPN2GYZ6P6MA5IXTCPCHDSO4J/graph.json","events_json":"https://pith.science/api/pith-number/DHPN2GYZ6P6MA5IXTCPCHDSO4J/events.json","paper":"https://pith.science/paper/DHPN2GYZ"},"agent_actions":{"view_html":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J","download_json":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J.json","view_paper":"https://pith.science/paper/DHPN2GYZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.14740&json=true","fetch_graph":"https://pith.science/api/pith-number/DHPN2GYZ6P6MA5IXTCPCHDSO4J/graph.json","fetch_events":"https://pith.science/api/pith-number/DHPN2GYZ6P6MA5IXTCPCHDSO4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J/action/storage_attestation","attest_author":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J/action/author_attestation","sign_citation":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J/action/citation_signature","submit_replication":"https://pith.science/pith/DHPN2GYZ6P6MA5IXTCPCHDSO4J/action/replication_record"}},"created_at":"2026-07-05T11:40:12.711130+00:00","updated_at":"2026-07-05T11:40:12.711130+00:00"}