{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:MGFYOTSSNGALCRDAUBFVQXKPAH","short_pith_number":"pith:MGFYOTSS","schema_version":"1.0","canonical_sha256":"618b874e526980b14460a04b585d4f01ef1450d837c02f8aae6ced5e6023885d","source":{"kind":"arxiv","id":"2305.16094","version":1},"attestation_state":"computed","paper":{"title":"On Influence Functions, Classification Influence, Relative Influence, Memorization and Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilqar Ramazanli, Michael Kounavis, Ousmane Dia","submitted_at":"2023-05-25T14:26:36Z","abstract_excerpt":"Machine learning systems such as large scale recommendation systems or natural language processing systems are usually trained on billions of training points and are associated with hundreds of billions or trillions of parameters. Improving the learning process in such a way that both the training load is reduced and the model accuracy improved is highly desired. In this paper we take a first step toward solving this problem, studying influence functions from the perspective of simplifying the computations they involve. We discuss assumptions, under which influence computations can be performe"},"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.16094","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-05-25T14:26:36Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"ad0a72247ec7f73fe4b1ccbe80a648efad3c84a21748831e1cb31a9d5cba22ed","abstract_canon_sha256":"700fb67a80eb6dfe6661f21c87b7a6239e7813870eddb22bc608c33f8b1b2586"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:13:59.440369Z","signature_b64":"s4u/ZnSFIDA8JjDmLKe7hTIKAP3M+JEHHKDnfHZh4vC2EOGm9yQ1qxTZr91SaM7h+FteS7yOHI4akFMQalsNAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"618b874e526980b14460a04b585d4f01ef1450d837c02f8aae6ced5e6023885d","last_reissued_at":"2026-07-05T06:13:59.439941Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:13:59.439941Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Influence Functions, Classification Influence, Relative Influence, Memorization and Generalization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Ilqar Ramazanli, Michael Kounavis, Ousmane Dia","submitted_at":"2023-05-25T14:26:36Z","abstract_excerpt":"Machine learning systems such as large scale recommendation systems or natural language processing systems are usually trained on billions of training points and are associated with hundreds of billions or trillions of parameters. Improving the learning process in such a way that both the training load is reduced and the model accuracy improved is highly desired. In this paper we take a first step toward solving this problem, studying influence functions from the perspective of simplifying the computations they involve. We discuss assumptions, under which influence computations can be performe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.16094","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/2305.16094/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.16094","created_at":"2026-07-05T06:13:59.439998+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.16094v1","created_at":"2026-07-05T06:13:59.439998+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.16094","created_at":"2026-07-05T06:13:59.439998+00:00"},{"alias_kind":"pith_short_12","alias_value":"MGFYOTSSNGAL","created_at":"2026-07-05T06:13:59.439998+00:00"},{"alias_kind":"pith_short_16","alias_value":"MGFYOTSSNGALCRDA","created_at":"2026-07-05T06:13:59.439998+00:00"},{"alias_kind":"pith_short_8","alias_value":"MGFYOTSS","created_at":"2026-07-05T06:13:59.439998+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.00198","citing_title":"Fairshare Data Pricing via Data Valuation for Large Language Models","ref_index":60,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH","json":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH.json","graph_json":"https://pith.science/api/pith-number/MGFYOTSSNGALCRDAUBFVQXKPAH/graph.json","events_json":"https://pith.science/api/pith-number/MGFYOTSSNGALCRDAUBFVQXKPAH/events.json","paper":"https://pith.science/paper/MGFYOTSS"},"agent_actions":{"view_html":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH","download_json":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH.json","view_paper":"https://pith.science/paper/MGFYOTSS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.16094&json=true","fetch_graph":"https://pith.science/api/pith-number/MGFYOTSSNGALCRDAUBFVQXKPAH/graph.json","fetch_events":"https://pith.science/api/pith-number/MGFYOTSSNGALCRDAUBFVQXKPAH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH/action/storage_attestation","attest_author":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH/action/author_attestation","sign_citation":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH/action/citation_signature","submit_replication":"https://pith.science/pith/MGFYOTSSNGALCRDAUBFVQXKPAH/action/replication_record"}},"created_at":"2026-07-05T06:13:59.439998+00:00","updated_at":"2026-07-05T06:13:59.439998+00:00"}