{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:IVP24ROLHPDDRFX7IPYWLJJPLS","short_pith_number":"pith:IVP24ROL","canonical_record":{"source":{"id":"1703.04247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-03-13T04:55:19Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"f4026649ab166640bc83950e57eeab116c2406cf758d71cc17b86c1c0c71e2b1","abstract_canon_sha256":"ba3ca38800ae88cf30edfc3106a9085ecabffcd47ff831d8ca4820ccb83594f0"},"schema_version":"1.0"},"canonical_sha256":"455fae45cb3bc63896ff43f165a52f5c95ae8cf1a8f1bc8945bb3d85220b3863","source":{"kind":"arxiv","id":"1703.04247","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04247","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04247v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04247","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"IVP24ROLHPDD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVP24ROLHPDDRFX7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVP24ROL","created_at":"2026-05-18T12:31:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:IVP24ROLHPDDRFX7IPYWLJJPLS","target":"record","payload":{"canonical_record":{"source":{"id":"1703.04247","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-03-13T04:55:19Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"f4026649ab166640bc83950e57eeab116c2406cf758d71cc17b86c1c0c71e2b1","abstract_canon_sha256":"ba3ca38800ae88cf30edfc3106a9085ecabffcd47ff831d8ca4820ccb83594f0"},"schema_version":"1.0"},"canonical_sha256":"455fae45cb3bc63896ff43f165a52f5c95ae8cf1a8f1bc8945bb3d85220b3863","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:49.310987Z","signature_b64":"wn6yFPfCl3pB2/Pj8PKipSlQbe79VI6dqnheT53R4LB0Y+9MI1VMFgz/MxltdqVp70PEtHtv1FAqxyHD4SPZCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"455fae45cb3bc63896ff43f165a52f5c95ae8cf1a8f1bc8945bb3d85220b3863","last_reissued_at":"2026-05-18T00:48:49.310254Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:49.310254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.04247","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y6jaZFqoVfI7vaFik6/8JQUVjhQ2jgN0AW35CpvzpdeLhYOHCjyk+iSO1v3sCKpNiBDBzXyj7kM1PZP1Up60Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:19:47.630075Z"},"content_sha256":"e5e5b359f734c0a51eebe3968e94ec7a28c6df0d7df6ff767e1cfb259f41ee0e","schema_version":"1.0","event_id":"sha256:e5e5b359f734c0a51eebe3968e94ec7a28c6df0d7df6ff767e1cfb259f41ee0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:IVP24ROLHPDDRFX7IPYWLJJPLS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL"],"primary_cat":"cs.IR","authors_text":"Huifeng Guo, Ruiming Tang, Xiuqiang He, Yunming Ye, Zhenguo Li","submitted_at":"2017-03-13T04:55:19Z","abstract_excerpt":"Learning sophisticated feature interactions behind user behaviors is critical in maximizing CTR for recommender systems. Despite great progress, existing methods seem to have a strong bias towards low- or high-order interactions, or require expertise feature engineering. In this paper, we show that it is possible to derive an end-to-end learning model that emphasizes both low- and high-order feature interactions. The proposed model, DeepFM, combines the power of factorization machines for recommendation and deep learning for feature learning in a new neural network architecture. Compared to th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04247","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:48:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hX1rAY1FyINXGeqMqHwS4YgTlXy+ZcTfVuGptbEXiGhg4GvvMC9K+JgWoikeJ+/1jpp6zsMY1PVQP/wKIMQHDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:19:47.630694Z"},"content_sha256":"44f2faea3a06854f3f2aa127d6bd8c15a902ed63c741afca100b5294ba348e6a","schema_version":"1.0","event_id":"sha256:44f2faea3a06854f3f2aa127d6bd8c15a902ed63c741afca100b5294ba348e6a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IVP24ROLHPDDRFX7IPYWLJJPLS/bundle.json","state_url":"https://pith.science/pith/IVP24ROLHPDDRFX7IPYWLJJPLS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IVP24ROLHPDDRFX7IPYWLJJPLS/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:19:47Z","links":{"resolver":"https://pith.science/pith/IVP24ROLHPDDRFX7IPYWLJJPLS","bundle":"https://pith.science/pith/IVP24ROLHPDDRFX7IPYWLJJPLS/bundle.json","state":"https://pith.science/pith/IVP24ROLHPDDRFX7IPYWLJJPLS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IVP24ROLHPDDRFX7IPYWLJJPLS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:IVP24ROLHPDDRFX7IPYWLJJPLS","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"ba3ca38800ae88cf30edfc3106a9085ecabffcd47ff831d8ca4820ccb83594f0","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-03-13T04:55:19Z","title_canon_sha256":"f4026649ab166640bc83950e57eeab116c2406cf758d71cc17b86c1c0c71e2b1"},"schema_version":"1.0","source":{"id":"1703.04247","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.04247","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"arxiv_version","alias_value":"1703.04247v1","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04247","created_at":"2026-05-18T00:48:49Z"},{"alias_kind":"pith_short_12","alias_value":"IVP24ROLHPDD","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_16","alias_value":"IVP24ROLHPDDRFX7","created_at":"2026-05-18T12:31:21Z"},{"alias_kind":"pith_short_8","alias_value":"IVP24ROL","created_at":"2026-05-18T12:31:21Z"}],"graph_snapshots":[{"event_id":"sha256:44f2faea3a06854f3f2aa127d6bd8c15a902ed63c741afca100b5294ba348e6a","target":"graph","created_at":"2026-05-18T00:48:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Learning sophisticated feature interactions behind user behaviors is critical in maximizing CTR for recommender systems. Despite great progress, existing methods seem to have a strong bias towards low- or high-order interactions, or require expertise feature engineering. In this paper, we show that it is possible to derive an end-to-end learning model that emphasizes both low- and high-order feature interactions. The proposed model, DeepFM, combines the power of factorization machines for recommendation and deep learning for feature learning in a new neural network architecture. Compared to th","authors_text":"Huifeng Guo, Ruiming Tang, Xiuqiang He, Yunming Ye, Zhenguo Li","cross_cats":["cs.CL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-03-13T04:55:19Z","title":"DeepFM: A Factorization-Machine based Neural Network for CTR Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04247","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:e5e5b359f734c0a51eebe3968e94ec7a28c6df0d7df6ff767e1cfb259f41ee0e","target":"record","created_at":"2026-05-18T00:48:49Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"ba3ca38800ae88cf30edfc3106a9085ecabffcd47ff831d8ca4820ccb83594f0","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2017-03-13T04:55:19Z","title_canon_sha256":"f4026649ab166640bc83950e57eeab116c2406cf758d71cc17b86c1c0c71e2b1"},"schema_version":"1.0","source":{"id":"1703.04247","kind":"arxiv","version":1}},"canonical_sha256":"455fae45cb3bc63896ff43f165a52f5c95ae8cf1a8f1bc8945bb3d85220b3863","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"455fae45cb3bc63896ff43f165a52f5c95ae8cf1a8f1bc8945bb3d85220b3863","first_computed_at":"2026-05-18T00:48:49.310254Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:49.310254Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wn6yFPfCl3pB2/Pj8PKipSlQbe79VI6dqnheT53R4LB0Y+9MI1VMFgz/MxltdqVp70PEtHtv1FAqxyHD4SPZCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:49.310987Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.04247","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e5e5b359f734c0a51eebe3968e94ec7a28c6df0d7df6ff767e1cfb259f41ee0e","sha256:44f2faea3a06854f3f2aa127d6bd8c15a902ed63c741afca100b5294ba348e6a"],"state_sha256":"05af70ba29a35d43bccdf992d4266e9f5300959620326ce3f9686bc2bfe47efa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7HyQD18oFYm4psPAWNBLRYDZ4suTGZiIQMyxGR0lGbEprJG8ijNm5aI9zi1k4qs9YarLBJRUElkVwngUdSWAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:19:47.634726Z","bundle_sha256":"8d1ae1b5e403be31d40dbfceb2d29337ca899b147917fdfbef92fe6f7e27b719"}}