{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:E4ZVUCFOY64SK4EOZO4PERJTNM","short_pith_number":"pith:E4ZVUCFO","canonical_record":{"source":{"id":"1906.04365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T03:08:35Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"97fc44334f34e2e272247247f4de87e537142b3c798bd982ac9318524ef88155","abstract_canon_sha256":"b28d6b674ede77d8a14d2790654eaac86f4748ad011896bd4c8a07156009a403"},"schema_version":"1.0"},"canonical_sha256":"27335a08aec7b925708ecbb8f245336b01f3983103ecfb59eed2b6969c4f57ee","source":{"kind":"arxiv","id":"1906.04365","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04365","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04365v3","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04365","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"E4ZVUCFOY64S","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4ZVUCFOY64SK4EO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4ZVUCFO","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:E4ZVUCFOY64SK4EOZO4PERJTNM","target":"record","payload":{"canonical_record":{"source":{"id":"1906.04365","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T03:08:35Z","cross_cats_sorted":["cs.IR","stat.ML"],"title_canon_sha256":"97fc44334f34e2e272247247f4de87e537142b3c798bd982ac9318524ef88155","abstract_canon_sha256":"b28d6b674ede77d8a14d2790654eaac86f4748ad011896bd4c8a07156009a403"},"schema_version":"1.0"},"canonical_sha256":"27335a08aec7b925708ecbb8f245336b01f3983103ecfb59eed2b6969c4f57ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:10.731690Z","signature_b64":"Zy7cRONzU7TDZsMSDomgCt1qYA9XJAememwxRk35mWVRfleRFllBtDx14d0E+O5+Cd+2jG7gqRtdGSdx3dKGDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27335a08aec7b925708ecbb8f245336b01f3983103ecfb59eed2b6969c4f57ee","last_reissued_at":"2026-05-17T23:40:10.730875Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:10.730875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.04365","source_version":3,"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:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ACMJtPhJXvvxtPVTiTGD/VdBlEbJk/Sl9UFrVQLlxmVWtl8DD2hB0WH7LQw4RnolLOXwP0UhPRCyTu0KuMgwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:53:25.913099Z"},"content_sha256":"106a04776adf2ceb7a0a2769c36a3986367dddadc3d72cfda6fbe3aae8e7e4c3","schema_version":"1.0","event_id":"sha256:106a04776adf2ceb7a0a2769c36a3986367dddadc3d72cfda6fbe3aae8e7e4c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:E4ZVUCFOY64SK4EOZO4PERJTNM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Learning-Assisted Click-Through Rate Prediction","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","stat.ML"],"primary_cat":"cs.LG","authors_text":"Chao Qi, Shukui Ren, Wentao Ouyang, Xiuwu Zhang, Yanlong Du, Zhaojie Liu","submitted_at":"2019-06-11T03:08:35Z","abstract_excerpt":"Click-through rate (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models other types of relationships in order to learn more informative and statistically reliable feature representations, and in consequence to improve the performance of CTR prediction. In particular, DeepMCP contains three parts: a matching subnet, a correlation subnet and a prediction subnet. These subnets model the user-ad, ad-ad and feature-CTR relationship re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04365","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":""},"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:40:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PdhyYaKhv01YDCmMKoP8U82yqNWsvoY1OuFcIITXF3H0zdjwUCL+RypGzCLnGYMEnVJ1tN9PaZ91za2u3ls9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T19:53:25.913898Z"},"content_sha256":"b1017d440a8dd425e3a410decc5fe1b4efbcdec1550e7c6108da437bc0c82693","schema_version":"1.0","event_id":"sha256:b1017d440a8dd425e3a410decc5fe1b4efbcdec1550e7c6108da437bc0c82693"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E4ZVUCFOY64SK4EOZO4PERJTNM/bundle.json","state_url":"https://pith.science/pith/E4ZVUCFOY64SK4EOZO4PERJTNM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E4ZVUCFOY64SK4EOZO4PERJTNM/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-30T19:53:25Z","links":{"resolver":"https://pith.science/pith/E4ZVUCFOY64SK4EOZO4PERJTNM","bundle":"https://pith.science/pith/E4ZVUCFOY64SK4EOZO4PERJTNM/bundle.json","state":"https://pith.science/pith/E4ZVUCFOY64SK4EOZO4PERJTNM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E4ZVUCFOY64SK4EOZO4PERJTNM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:E4ZVUCFOY64SK4EOZO4PERJTNM","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":"b28d6b674ede77d8a14d2790654eaac86f4748ad011896bd4c8a07156009a403","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T03:08:35Z","title_canon_sha256":"97fc44334f34e2e272247247f4de87e537142b3c798bd982ac9318524ef88155"},"schema_version":"1.0","source":{"id":"1906.04365","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.04365","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"arxiv_version","alias_value":"1906.04365v3","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.04365","created_at":"2026-05-17T23:40:10Z"},{"alias_kind":"pith_short_12","alias_value":"E4ZVUCFOY64S","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"E4ZVUCFOY64SK4EO","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"E4ZVUCFO","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:b1017d440a8dd425e3a410decc5fe1b4efbcdec1550e7c6108da437bc0c82693","target":"graph","created_at":"2026-05-17T23:40:10Z","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 (CTR) prediction is a critical task in online advertising systems. Most existing methods mainly model the feature-CTR relationship and suffer from the data sparsity issue. In this paper, we propose DeepMCP, which models other types of relationships in order to learn more informative and statistically reliable feature representations, and in consequence to improve the performance of CTR prediction. In particular, DeepMCP contains three parts: a matching subnet, a correlation subnet and a prediction subnet. These subnets model the user-ad, ad-ad and feature-CTR relationship re","authors_text":"Chao Qi, Shukui Ren, Wentao Ouyang, Xiuwu Zhang, Yanlong Du, Zhaojie Liu","cross_cats":["cs.IR","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T03:08:35Z","title":"Representation Learning-Assisted Click-Through Rate Prediction"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.04365","kind":"arxiv","version":3},"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:106a04776adf2ceb7a0a2769c36a3986367dddadc3d72cfda6fbe3aae8e7e4c3","target":"record","created_at":"2026-05-17T23:40:10Z","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":"b28d6b674ede77d8a14d2790654eaac86f4748ad011896bd4c8a07156009a403","cross_cats_sorted":["cs.IR","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-06-11T03:08:35Z","title_canon_sha256":"97fc44334f34e2e272247247f4de87e537142b3c798bd982ac9318524ef88155"},"schema_version":"1.0","source":{"id":"1906.04365","kind":"arxiv","version":3}},"canonical_sha256":"27335a08aec7b925708ecbb8f245336b01f3983103ecfb59eed2b6969c4f57ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27335a08aec7b925708ecbb8f245336b01f3983103ecfb59eed2b6969c4f57ee","first_computed_at":"2026-05-17T23:40:10.730875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:10.730875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Zy7cRONzU7TDZsMSDomgCt1qYA9XJAememwxRk35mWVRfleRFllBtDx14d0E+O5+Cd+2jG7gqRtdGSdx3dKGDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:10.731690Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.04365","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:106a04776adf2ceb7a0a2769c36a3986367dddadc3d72cfda6fbe3aae8e7e4c3","sha256:b1017d440a8dd425e3a410decc5fe1b4efbcdec1550e7c6108da437bc0c82693"],"state_sha256":"80105590cf6d29c1c87c2edc5a15949f8b81d0252e60ae0e680a9f712543bf96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U7pCGaTXedHdwI8hgHcpjs3zamzZx3ddnkGeVacqi0B7xr49d2QmOOW70svVGKecm2pg6fwQA1CP1UKssIOHDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T19:53:25.918658Z","bundle_sha256":"47f977d7062d5c3ca698bd356b6f76981eebd883d801bd4524122dde047ec80f"}}