{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:3PWDWDKMUQ6436ADJI6FGTL2LX","short_pith_number":"pith:3PWDWDKM","schema_version":"1.0","canonical_sha256":"dbec3b0d4ca43dcdf8034a3c534d7a5dc277d7492ca2c43da9ae849d667c4bbf","source":{"kind":"arxiv","id":"2410.15026","version":1},"attestation_state":"computed","paper":{"title":"A Recommendation Model Utilizing Separation Embedding and Self-Attention for Feature Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jianjun Wei, Junming Huang, Rui Wang, Wenyi Liu, Yuanshuai Luo, Zihao Zhao","submitted_at":"2024-10-19T07:49:21Z","abstract_excerpt":"With the explosive growth of Internet data, users are facing the problem of information overload, which makes it a challenge to efficiently obtain the required resources. Recommendation systems have emerged in this context. By filtering massive amounts of information, they provide users with content that meets their needs, playing a key role in scenarios such as advertising recommendation and product recommendation. However, traditional click-through rate prediction and TOP-K recommendation mechanisms are gradually unable to meet the recommendations needs in modern life scenarios due to high c"},"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":"2410.15026","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2024-10-19T07:49:21Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"46e8a6605f4873ea025e47e5b2d95c2574cce555b5c544fc6a102776d27d02e6","abstract_canon_sha256":"f5c54846013f88058b4939f7ad60fc71adfd89b0a2f0ab62ce27402f20674675"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:22:48.987891Z","signature_b64":"e5nRqQ9Tx3p/7Xfddunfe5f06qbWxUwEON4UJPjT3AOBeMywroh34SnopDckvSOZopz02hOGYVXloLncE2jdCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbec3b0d4ca43dcdf8034a3c534d7a5dc277d7492ca2c43da9ae849d667c4bbf","last_reissued_at":"2026-07-05T09:22:48.987415Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:22:48.987415Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Recommendation Model Utilizing Separation Embedding and Self-Attention for Feature Mining","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.IR","authors_text":"Jianjun Wei, Junming Huang, Rui Wang, Wenyi Liu, Yuanshuai Luo, Zihao Zhao","submitted_at":"2024-10-19T07:49:21Z","abstract_excerpt":"With the explosive growth of Internet data, users are facing the problem of information overload, which makes it a challenge to efficiently obtain the required resources. Recommendation systems have emerged in this context. By filtering massive amounts of information, they provide users with content that meets their needs, playing a key role in scenarios such as advertising recommendation and product recommendation. However, traditional click-through rate prediction and TOP-K recommendation mechanisms are gradually unable to meet the recommendations needs in modern life scenarios due to high c"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2410.15026","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/2410.15026/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":"2410.15026","created_at":"2026-07-05T09:22:48.987476+00:00"},{"alias_kind":"arxiv_version","alias_value":"2410.15026v1","created_at":"2026-07-05T09:22:48.987476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2410.15026","created_at":"2026-07-05T09:22:48.987476+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PWDWDKMUQ64","created_at":"2026-07-05T09:22:48.987476+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PWDWDKMUQ6436AD","created_at":"2026-07-05T09:22:48.987476+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PWDWDKM","created_at":"2026-07-05T09:22:48.987476+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.15222","citing_title":"Leveraging Generative Adversarial Networks for Addressing Data Imbalance in Financial Market Supervision","ref_index":15,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX","json":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX.json","graph_json":"https://pith.science/api/pith-number/3PWDWDKMUQ6436ADJI6FGTL2LX/graph.json","events_json":"https://pith.science/api/pith-number/3PWDWDKMUQ6436ADJI6FGTL2LX/events.json","paper":"https://pith.science/paper/3PWDWDKM"},"agent_actions":{"view_html":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX","download_json":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX.json","view_paper":"https://pith.science/paper/3PWDWDKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2410.15026&json=true","fetch_graph":"https://pith.science/api/pith-number/3PWDWDKMUQ6436ADJI6FGTL2LX/graph.json","fetch_events":"https://pith.science/api/pith-number/3PWDWDKMUQ6436ADJI6FGTL2LX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX/action/storage_attestation","attest_author":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX/action/author_attestation","sign_citation":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX/action/citation_signature","submit_replication":"https://pith.science/pith/3PWDWDKMUQ6436ADJI6FGTL2LX/action/replication_record"}},"created_at":"2026-07-05T09:22:48.987476+00:00","updated_at":"2026-07-05T09:22:48.987476+00:00"}