{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:B6EAYZYEA4USYJ7ZOMUJS5LQQG","short_pith_number":"pith:B6EAYZYE","schema_version":"1.0","canonical_sha256":"0f880c670407292c27f9732899757081b3528ae67c4c9947374844342f178b61","source":{"kind":"arxiv","id":"2411.07508","version":2},"attestation_state":"computed","paper":{"title":"Feature Interaction Fusion Self-Distillation Network For CTR Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Honghao Li, Lei Sang, Qian Cao, Qiuze Ru, Xindong Wu, Yiwen Zhang","submitted_at":"2024-11-12T03:05:03Z","abstract_excerpt":"Click-Through Rate (CTR) prediction plays a vital role in recommender systems, online advertising, and search engines. Most of the current approaches model feature interactions through stacked or parallel structures, with some employing knowledge distillation for model compression. However, we observe some limitations with these approaches: (1) In parallel structure models, the explicit and implicit components are executed independently and simultaneously, which leads to insufficient information sharing within the feature set. (2) The introduction of knowledge distillation technology brings ab"},"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":"2411.07508","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-11-12T03:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"836bb801d7e50f8f998a725341b203e19ac7ed30bcfd7739f5b1565e2e0874a7","abstract_canon_sha256":"d86fca338246217d09a7948a650640bed5f9553a03e791c117dd1b6e19845c48"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:34:40.137083Z","signature_b64":"oEYS/wUoex0UCowjvKNAO9Svu17GnsMK7BxlsQNDX3hCOuanD+cymdwfHjnCR5qVWqaSjmJyr2f/3ADxXJTDAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f880c670407292c27f9732899757081b3528ae67c4c9947374844342f178b61","last_reissued_at":"2026-07-05T09:34:40.136591Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:34:40.136591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Feature Interaction Fusion Self-Distillation Network For CTR Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Honghao Li, Lei Sang, Qian Cao, Qiuze Ru, Xindong Wu, Yiwen Zhang","submitted_at":"2024-11-12T03:05:03Z","abstract_excerpt":"Click-Through Rate (CTR) prediction plays a vital role in recommender systems, online advertising, and search engines. Most of the current approaches model feature interactions through stacked or parallel structures, with some employing knowledge distillation for model compression. However, we observe some limitations with these approaches: (1) In parallel structure models, the explicit and implicit components are executed independently and simultaneously, which leads to insufficient information sharing within the feature set. (2) The introduction of knowledge distillation technology brings ab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.07508","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/2411.07508/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":"2411.07508","created_at":"2026-07-05T09:34:40.136651+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.07508v2","created_at":"2026-07-05T09:34:40.136651+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.07508","created_at":"2026-07-05T09:34:40.136651+00:00"},{"alias_kind":"pith_short_12","alias_value":"B6EAYZYEA4US","created_at":"2026-07-05T09:34:40.136651+00:00"},{"alias_kind":"pith_short_16","alias_value":"B6EAYZYEA4USYJ7Z","created_at":"2026-07-05T09:34:40.136651+00:00"},{"alias_kind":"pith_short_8","alias_value":"B6EAYZYE","created_at":"2026-07-05T09:34:40.136651+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.19182","citing_title":"DLF: Enhancing Explicit-Implicit Interaction via Dynamic Low-Order-Aware Fusion for CTR Prediction","ref_index":41,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG","json":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG.json","graph_json":"https://pith.science/api/pith-number/B6EAYZYEA4USYJ7ZOMUJS5LQQG/graph.json","events_json":"https://pith.science/api/pith-number/B6EAYZYEA4USYJ7ZOMUJS5LQQG/events.json","paper":"https://pith.science/paper/B6EAYZYE"},"agent_actions":{"view_html":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG","download_json":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG.json","view_paper":"https://pith.science/paper/B6EAYZYE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.07508&json=true","fetch_graph":"https://pith.science/api/pith-number/B6EAYZYEA4USYJ7ZOMUJS5LQQG/graph.json","fetch_events":"https://pith.science/api/pith-number/B6EAYZYEA4USYJ7ZOMUJS5LQQG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG/action/storage_attestation","attest_author":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG/action/author_attestation","sign_citation":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG/action/citation_signature","submit_replication":"https://pith.science/pith/B6EAYZYEA4USYJ7ZOMUJS5LQQG/action/replication_record"}},"created_at":"2026-07-05T09:34:40.136651+00:00","updated_at":"2026-07-05T09:34:40.136651+00:00"}