{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YT5ZUABCW3OGMFUZLDPC7NTBXL","short_pith_number":"pith:YT5ZUABC","canonical_record":{"source":{"id":"1904.04447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-09T03:27:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c19e9cfa5648094819f2072989e07e52d852bfa5b7034dfa2408e72baa504b2a","abstract_canon_sha256":"101d71c824fd743a51be875ad4a4e1be721afd90ec44829449798dcb11383391"},"schema_version":"1.0"},"canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","source":{"kind":"arxiv","id":"1904.04447","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04447","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04447v1","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04447","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"YT5ZUABCW3OG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YT5ZUABCW3OGMFUZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YT5ZUABC","created_at":"2026-05-18T12:33:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YT5ZUABCW3OGMFUZLDPC7NTBXL","target":"record","payload":{"canonical_record":{"source":{"id":"1904.04447","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-09T03:27:06Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c19e9cfa5648094819f2072989e07e52d852bfa5b7034dfa2408e72baa504b2a","abstract_canon_sha256":"101d71c824fd743a51be875ad4a4e1be721afd90ec44829449798dcb11383391"},"schema_version":"1.0"},"canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:35.599534Z","signature_b64":"zEBNT3pJfURY9JU47owW1ukCk0Y2byINRROVaxYaTw0UiqTbq4PIe0+x73FG50+lYpbOLpP89+Z+e1RxKbWiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","last_reissued_at":"2026-05-17T23:47:35.599063Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:35.599063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1904.04447","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-17T23:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1da3NpnLBsn+DwXxOBYp7U5PcUzOUQ8ylCv7jpnaF0ZzG3xUYvHIWb1TMJghguFR2nj/SyeWZz3qzYv4XdyuDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:24:22.094851Z"},"content_sha256":"fce3c3c0ca50e065f174e22b977177de7ccbe3c254bc971a18f2a15a09cb3518","schema_version":"1.0","event_id":"sha256:fce3c3c0ca50e065f174e22b977177de7ccbe3c254bc971a18f2a15a09cb3518"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YT5ZUABCW3OGMFUZLDPC7NTBXL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.IR","authors_text":"Bin Liu, Huifeng Guo, Jinkai Yu, Ruiming Tang, Yingzhi Chen, Yuzhou Zhang","submitted_at":"2019-04-09T03:27:06Z","abstract_excerpt":"Click-Through Rate prediction is an important task in recommender systems, which aims to estimate the probability of a user to click on a given item. Recently, many deep models have been proposed to learn low-order and high-order feature interactions from original features. However, since useful interactions are always sparse, it is difficult for DNN to learn them effectively under a large number of parameters. In real scenarios, artificial features are able to improve the performance of deep models (such as Wide & Deep Learning), but feature engineering is expensive and requires domain knowle"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04447","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-17T23:47:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ivxXDVXa48g3hF5cDovGq+lyoOszLueNqJlEKEm5kh6UUSIG+UsRdk+rmlW3khdo74pC6IS8mEEvwNm2nolrAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T09:24:22.095210Z"},"content_sha256":"76167675b5fff0165e4fc08271ce89d840fa92d168535784351df5987c370501","schema_version":"1.0","event_id":"sha256:76167675b5fff0165e4fc08271ce89d840fa92d168535784351df5987c370501"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/bundle.json","state_url":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/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-06-01T09:24:22Z","links":{"resolver":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL","bundle":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/bundle.json","state":"https://pith.science/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YT5ZUABCW3OGMFUZLDPC7NTBXL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YT5ZUABCW3OGMFUZLDPC7NTBXL","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":"101d71c824fd743a51be875ad4a4e1be721afd90ec44829449798dcb11383391","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-09T03:27:06Z","title_canon_sha256":"c19e9cfa5648094819f2072989e07e52d852bfa5b7034dfa2408e72baa504b2a"},"schema_version":"1.0","source":{"id":"1904.04447","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1904.04447","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"arxiv_version","alias_value":"1904.04447v1","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04447","created_at":"2026-05-17T23:47:35Z"},{"alias_kind":"pith_short_12","alias_value":"YT5ZUABCW3OG","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_16","alias_value":"YT5ZUABCW3OGMFUZ","created_at":"2026-05-18T12:33:33Z"},{"alias_kind":"pith_short_8","alias_value":"YT5ZUABC","created_at":"2026-05-18T12:33:33Z"}],"graph_snapshots":[{"event_id":"sha256:76167675b5fff0165e4fc08271ce89d840fa92d168535784351df5987c370501","target":"graph","created_at":"2026-05-17T23:47:35Z","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":"Click-Through Rate prediction is an important task in recommender systems, which aims to estimate the probability of a user to click on a given item. Recently, many deep models have been proposed to learn low-order and high-order feature interactions from original features. However, since useful interactions are always sparse, it is difficult for DNN to learn them effectively under a large number of parameters. In real scenarios, artificial features are able to improve the performance of deep models (such as Wide & Deep Learning), but feature engineering is expensive and requires domain knowle","authors_text":"Bin Liu, Huifeng Guo, Jinkai Yu, Ruiming Tang, Yingzhi Chen, Yuzhou Zhang","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-09T03:27:06Z","title":"Feature Generation by Convolutional Neural Network for Click-Through Rate Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04447","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:fce3c3c0ca50e065f174e22b977177de7ccbe3c254bc971a18f2a15a09cb3518","target":"record","created_at":"2026-05-17T23:47:35Z","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":"101d71c824fd743a51be875ad4a4e1be721afd90ec44829449798dcb11383391","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IR","submitted_at":"2019-04-09T03:27:06Z","title_canon_sha256":"c19e9cfa5648094819f2072989e07e52d852bfa5b7034dfa2408e72baa504b2a"},"schema_version":"1.0","source":{"id":"1904.04447","kind":"arxiv","version":1}},"canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c4fb9a0022b6dc66169958de2fb661bad016d2d2c05c7e503131b4ee34ea721e","first_computed_at":"2026-05-17T23:47:35.599063Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:47:35.599063Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zEBNT3pJfURY9JU47owW1ukCk0Y2byINRROVaxYaTw0UiqTbq4PIe0+x73FG50+lYpbOLpP89+Z+e1RxKbWiAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:47:35.599534Z","signed_message":"canonical_sha256_bytes"},"source_id":"1904.04447","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fce3c3c0ca50e065f174e22b977177de7ccbe3c254bc971a18f2a15a09cb3518","sha256:76167675b5fff0165e4fc08271ce89d840fa92d168535784351df5987c370501"],"state_sha256":"4bed746223a7f56764b3c3938dfd959b7bdaac1550faca4c7107a6acb7f44242"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G/zOehye9eTz9Wdba32lZLJFFlFg4f38lY1wUEwqnjPVpxGS14NeC462uawRm8SGT1HKvwiWC112YJzzS6VSDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T09:24:22.097157Z","bundle_sha256":"55e631237f2b8b44a7813c9e54c589c5f274814c85d6c2bf74fbc8b0d507de1c"}}