{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6NUFN3EPRVEDIZKKNN3U5ZLS4V","short_pith_number":"pith:6NUFN3EP","schema_version":"1.0","canonical_sha256":"f36856ec8f8d4834654a6b774ee572e56bef51e7adee75edc54064131dd59229","source":{"kind":"arxiv","id":"2502.01669","version":2},"attestation_state":"computed","paper":{"title":"Delayed Feedback Modeling with Influence Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Andrew Rabinovich, Chenlu Ding, Cunchun Li, Dingxian Wang, Frank Yang, Jiancan Wu, Xiang Wang, Yancheng Yuan","submitted_at":"2025-02-01T16:23:13Z","abstract_excerpt":"In online advertising under the cost-per-conversion (CPA) model, accurate conversion rate (CVR) prediction is crucial. A major challenge is delayed feedback, where conversions may occur long after user interactions, leading to incomplete recent data and biased model training. Existing solutions partially mitigate this issue but often rely on auxiliary models, making them computationally inefficient and less adaptive to user interest shifts. We propose IF-DFM, an \\underline{I}nfluence \\underline{F}unction-empowered for \\underline{D}elayed \\underline{F}eedback \\underline{M}odeling which estimate"},"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":"2502.01669","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-02-01T16:23:13Z","cross_cats_sorted":["cs.AI","cs.IR"],"title_canon_sha256":"6b287dc96b376985087ff78f184968a306113cb379a649eace791030e201e2ac","abstract_canon_sha256":"8480663c41a2915f3676f9c0556cc28a2a816cf14ec9c6d2f0d94d503b56f195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:53:43.908621Z","signature_b64":"D2otQhHzuDUnXflHPWo+2v68JOhnYYmnvuKvbHsPNTB0D3Ohefad7oEUM8c4Tp4zHXe5sx47cClsYFn1V9oPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f36856ec8f8d4834654a6b774ee572e56bef51e7adee75edc54064131dd59229","last_reissued_at":"2026-07-05T11:53:43.908180Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:53:43.908180Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Delayed Feedback Modeling with Influence Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.IR"],"primary_cat":"cs.LG","authors_text":"Andrew Rabinovich, Chenlu Ding, Cunchun Li, Dingxian Wang, Frank Yang, Jiancan Wu, Xiang Wang, Yancheng Yuan","submitted_at":"2025-02-01T16:23:13Z","abstract_excerpt":"In online advertising under the cost-per-conversion (CPA) model, accurate conversion rate (CVR) prediction is crucial. A major challenge is delayed feedback, where conversions may occur long after user interactions, leading to incomplete recent data and biased model training. Existing solutions partially mitigate this issue but often rely on auxiliary models, making them computationally inefficient and less adaptive to user interest shifts. We propose IF-DFM, an \\underline{I}nfluence \\underline{F}unction-empowered for \\underline{D}elayed \\underline{F}eedback \\underline{M}odeling which estimate"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2502.01669","kind":"arxiv","version":2},"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/2502.01669/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":"2502.01669","created_at":"2026-07-05T11:53:43.908244+00:00"},{"alias_kind":"arxiv_version","alias_value":"2502.01669v2","created_at":"2026-07-05T11:53:43.908244+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2502.01669","created_at":"2026-07-05T11:53:43.908244+00:00"},{"alias_kind":"pith_short_12","alias_value":"6NUFN3EPRVED","created_at":"2026-07-05T11:53:43.908244+00:00"},{"alias_kind":"pith_short_16","alias_value":"6NUFN3EPRVEDIZKK","created_at":"2026-07-05T11:53:43.908244+00:00"},{"alias_kind":"pith_short_8","alias_value":"6NUFN3EP","created_at":"2026-07-05T11:53:43.908244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.00383","citing_title":"Unified Parameter-Efficient Unlearning for LLMs","ref_index":23,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V","json":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V.json","graph_json":"https://pith.science/api/pith-number/6NUFN3EPRVEDIZKKNN3U5ZLS4V/graph.json","events_json":"https://pith.science/api/pith-number/6NUFN3EPRVEDIZKKNN3U5ZLS4V/events.json","paper":"https://pith.science/paper/6NUFN3EP"},"agent_actions":{"view_html":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V","download_json":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V.json","view_paper":"https://pith.science/paper/6NUFN3EP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2502.01669&json=true","fetch_graph":"https://pith.science/api/pith-number/6NUFN3EPRVEDIZKKNN3U5ZLS4V/graph.json","fetch_events":"https://pith.science/api/pith-number/6NUFN3EPRVEDIZKKNN3U5ZLS4V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V/action/storage_attestation","attest_author":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V/action/author_attestation","sign_citation":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V/action/citation_signature","submit_replication":"https://pith.science/pith/6NUFN3EPRVEDIZKKNN3U5ZLS4V/action/replication_record"}},"created_at":"2026-07-05T11:53:43.908244+00:00","updated_at":"2026-07-05T11:53:43.908244+00:00"}