{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:GTIOOHKJ3UCFP3JZPQL2CNIOHU","short_pith_number":"pith:GTIOOHKJ","schema_version":"1.0","canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","source":{"kind":"arxiv","id":"2304.10711","version":3},"attestation_state":"computed","paper":{"title":"EulerNet: Adaptive Feature Interaction Learning via Euler's Formula for CTR Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ji-Rong Wen, Ting Bai, Wayne Xin Zhao, Zhao Cao, Zhen Tian","submitted_at":"2023-04-21T02:48:29Z","abstract_excerpt":"Learning effective high-order feature interactions is very crucial in the CTR prediction task. However, it is very time-consuming to calculate high-order feature interactions with massive features in online e-commerce platforms. Most existing methods manually design a maximal order and further filter out the useless interactions from them. Although they reduce the high computational costs caused by the exponential growth of high-order feature combinations, they still suffer from the degradation of model capability due to the suboptimal learning of the restricted feature orders. The solution to"},"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":"2304.10711","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.IR","submitted_at":"2023-04-21T02:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"6e789f086945897cf99622394493830f519fc7981066a9304a1e3873cec62bea","abstract_canon_sha256":"54adcbff23b69e1ad50bd23d28cbfd1189032734988a65399c75856ae7e0328e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:49:42.352779Z","signature_b64":"y8EonZk1qW6O37qwQeBlyc0bJz+b8EV2VGRhA4Zq2dFNOR6GYrxoJD1iT4e4zpZizo2zx2cykunWdL2pMuEIAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34d0e71d49dd0457ed397c17a1350e3d080928b4d68c579a0d7c1e3095c95d3a","last_reissued_at":"2026-07-05T06:49:42.352337Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:49:42.352337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"EulerNet: Adaptive Feature Interaction Learning via Euler's Formula for CTR Prediction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.IR","authors_text":"Ji-Rong Wen, Ting Bai, Wayne Xin Zhao, Zhao Cao, Zhen Tian","submitted_at":"2023-04-21T02:48:29Z","abstract_excerpt":"Learning effective high-order feature interactions is very crucial in the CTR prediction task. However, it is very time-consuming to calculate high-order feature interactions with massive features in online e-commerce platforms. Most existing methods manually design a maximal order and further filter out the useless interactions from them. Although they reduce the high computational costs caused by the exponential growth of high-order feature combinations, they still suffer from the degradation of model capability due to the suboptimal learning of the restricted feature orders. The solution to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.10711","kind":"arxiv","version":3},"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/2304.10711/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":"2304.10711","created_at":"2026-07-05T06:49:42.352393+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.10711v3","created_at":"2026-07-05T06:49:42.352393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.10711","created_at":"2026-07-05T06:49:42.352393+00:00"},{"alias_kind":"pith_short_12","alias_value":"GTIOOHKJ3UCF","created_at":"2026-07-05T06:49:42.352393+00:00"},{"alias_kind":"pith_short_16","alias_value":"GTIOOHKJ3UCFP3JZ","created_at":"2026-07-05T06:49:42.352393+00:00"},{"alias_kind":"pith_short_8","alias_value":"GTIOOHKJ","created_at":"2026-07-05T06:49:42.352393+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.12441","citing_title":"Towards Unifying Feature Interaction Models for Click-Through Rate Prediction","ref_index":42,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU","json":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU.json","graph_json":"https://pith.science/api/pith-number/GTIOOHKJ3UCFP3JZPQL2CNIOHU/graph.json","events_json":"https://pith.science/api/pith-number/GTIOOHKJ3UCFP3JZPQL2CNIOHU/events.json","paper":"https://pith.science/paper/GTIOOHKJ"},"agent_actions":{"view_html":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU","download_json":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU.json","view_paper":"https://pith.science/paper/GTIOOHKJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.10711&json=true","fetch_graph":"https://pith.science/api/pith-number/GTIOOHKJ3UCFP3JZPQL2CNIOHU/graph.json","fetch_events":"https://pith.science/api/pith-number/GTIOOHKJ3UCFP3JZPQL2CNIOHU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/action/storage_attestation","attest_author":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/action/author_attestation","sign_citation":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/action/citation_signature","submit_replication":"https://pith.science/pith/GTIOOHKJ3UCFP3JZPQL2CNIOHU/action/replication_record"}},"created_at":"2026-07-05T06:49:42.352393+00:00","updated_at":"2026-07-05T06:49:42.352393+00:00"}