{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HPPQGSSZZIGVYS7WEPJ3JAWI2U","short_pith_number":"pith:HPPQGSSZ","canonical_record":{"source":{"id":"1311.6976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-27T14:19:21Z","cross_cats_sorted":["cs.LG","stat.AP","stat.ME"],"title_canon_sha256":"647b0605841ea753e70a44d6879914e4f04cb4059267f1e664de5bcd133b6341","abstract_canon_sha256":"817b0c5afb988315a56d02c179946801f1025bca992aad69d7d2540990c13b46"},"schema_version":"1.0"},"canonical_sha256":"3bdf034a59ca0d5c4bf623d3b482c8d53b8e2eda444fcfe9088271f0ae2a0f69","source":{"kind":"arxiv","id":"1311.6976","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6976","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6976v2","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6976","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"HPPQGSSZZIGV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HPPQGSSZZIGVYS7W","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HPPQGSSZ","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HPPQGSSZZIGVYS7WEPJ3JAWI2U","target":"record","payload":{"canonical_record":{"source":{"id":"1311.6976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-27T14:19:21Z","cross_cats_sorted":["cs.LG","stat.AP","stat.ME"],"title_canon_sha256":"647b0605841ea753e70a44d6879914e4f04cb4059267f1e664de5bcd133b6341","abstract_canon_sha256":"817b0c5afb988315a56d02c179946801f1025bca992aad69d7d2540990c13b46"},"schema_version":"1.0"},"canonical_sha256":"3bdf034a59ca0d5c4bf623d3b482c8d53b8e2eda444fcfe9088271f0ae2a0f69","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:04.020910Z","signature_b64":"1D1zmwM2P6gWyMJtoVZgtz0fjhe7PEjtyprUejrrCHMKZS5u8n56DfR/M+sTvlyn2SNz1/9lM9W6CO2wi0ovAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bdf034a59ca0d5c4bf623d3b482c8d53b8e2eda444fcfe9088271f0ae2a0f69","last_reissued_at":"2026-05-18T02:52:04.020385Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:04.020385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.6976","source_version":2,"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-18T02:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JliN83/PWr9Zk1L95oPdSCaYceTjbyhINsIeOaJ7GU+TgEV3s3/+up2fdk98Ddg4/iS98HqV/S6QX6HujilpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:31:35.864997Z"},"content_sha256":"5340131c0167004e558d78cd78234ee069ecbd90277ba4eff2d25e4437f43fcd","schema_version":"1.0","event_id":"sha256:5340131c0167004e558d78cd78234ee069ecbd90277ba4eff2d25e4437f43fcd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HPPQGSSZZIGVYS7WEPJ3JAWI2U","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dimensionality reduction for click-through rate prediction: Dense versus sparse representation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.AP","stat.ME"],"primary_cat":"stat.ML","authors_text":"Bjarne {\\O}rum Fruergaard, Lars Kai Hansen, Toke Jansen Hansen","submitted_at":"2013-11-27T14:19:21Z","abstract_excerpt":"In online advertising, display ads are increasingly being placed based on real-time auctions where the advertiser who wins gets to serve the ad. This is called real-time bidding (RTB). In RTB, auctions have very tight time constraints on the order of 100ms. Therefore mechanisms for bidding intelligently such as clickthrough rate prediction need to be sufficiently fast. In this work, we propose to use dimensionality reduction of the user-website interaction graph in order to produce simplified features of users and websites that can be used as predictors of clickthrough rate. We demonstrate tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6976","kind":"arxiv","version":2},"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-18T02:52:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1oWURuUa2yg4QX556kQW92l7YdpiyMLhmtglyOQ2aC8rlkGADY3iJNWh7ELCx2LqhP9yCvxY2lsrxnMj0Jx/Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-05T00:31:35.865367Z"},"content_sha256":"c3712a5a6ff03052f8a1767f73f869a8bc7cc0168cd37b5dc31c8e8b544b7d3b","schema_version":"1.0","event_id":"sha256:c3712a5a6ff03052f8a1767f73f869a8bc7cc0168cd37b5dc31c8e8b544b7d3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U/bundle.json","state_url":"https://pith.science/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U/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-07-05T00:31:35Z","links":{"resolver":"https://pith.science/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U","bundle":"https://pith.science/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U/bundle.json","state":"https://pith.science/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HPPQGSSZZIGVYS7WEPJ3JAWI2U/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HPPQGSSZZIGVYS7WEPJ3JAWI2U","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":"817b0c5afb988315a56d02c179946801f1025bca992aad69d7d2540990c13b46","cross_cats_sorted":["cs.LG","stat.AP","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-27T14:19:21Z","title_canon_sha256":"647b0605841ea753e70a44d6879914e4f04cb4059267f1e664de5bcd133b6341"},"schema_version":"1.0","source":{"id":"1311.6976","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.6976","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.6976v2","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.6976","created_at":"2026-05-18T02:52:04Z"},{"alias_kind":"pith_short_12","alias_value":"HPPQGSSZZIGV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HPPQGSSZZIGVYS7W","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HPPQGSSZ","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:c3712a5a6ff03052f8a1767f73f869a8bc7cc0168cd37b5dc31c8e8b544b7d3b","target":"graph","created_at":"2026-05-18T02:52:04Z","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":"In online advertising, display ads are increasingly being placed based on real-time auctions where the advertiser who wins gets to serve the ad. This is called real-time bidding (RTB). In RTB, auctions have very tight time constraints on the order of 100ms. Therefore mechanisms for bidding intelligently such as clickthrough rate prediction need to be sufficiently fast. In this work, we propose to use dimensionality reduction of the user-website interaction graph in order to produce simplified features of users and websites that can be used as predictors of clickthrough rate. We demonstrate tha","authors_text":"Bjarne {\\O}rum Fruergaard, Lars Kai Hansen, Toke Jansen Hansen","cross_cats":["cs.LG","stat.AP","stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-27T14:19:21Z","title":"Dimensionality reduction for click-through rate prediction: Dense versus sparse representation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.6976","kind":"arxiv","version":2},"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:5340131c0167004e558d78cd78234ee069ecbd90277ba4eff2d25e4437f43fcd","target":"record","created_at":"2026-05-18T02:52:04Z","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":"817b0c5afb988315a56d02c179946801f1025bca992aad69d7d2540990c13b46","cross_cats_sorted":["cs.LG","stat.AP","stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2013-11-27T14:19:21Z","title_canon_sha256":"647b0605841ea753e70a44d6879914e4f04cb4059267f1e664de5bcd133b6341"},"schema_version":"1.0","source":{"id":"1311.6976","kind":"arxiv","version":2}},"canonical_sha256":"3bdf034a59ca0d5c4bf623d3b482c8d53b8e2eda444fcfe9088271f0ae2a0f69","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bdf034a59ca0d5c4bf623d3b482c8d53b8e2eda444fcfe9088271f0ae2a0f69","first_computed_at":"2026-05-18T02:52:04.020385Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:52:04.020385Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1D1zmwM2P6gWyMJtoVZgtz0fjhe7PEjtyprUejrrCHMKZS5u8n56DfR/M+sTvlyn2SNz1/9lM9W6CO2wi0ovAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:52:04.020910Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.6976","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5340131c0167004e558d78cd78234ee069ecbd90277ba4eff2d25e4437f43fcd","sha256:c3712a5a6ff03052f8a1767f73f869a8bc7cc0168cd37b5dc31c8e8b544b7d3b"],"state_sha256":"370211fde6a19c5d98e38e49808f8e91654f7c3fc154a1a05e6d81e1208ff21d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iMViFjKqc6/iM3Cbn7CheIdIDg9tmcin5ZUcJ53PKPiZGqbvsKXAQ9i1DXbHpzItO5BonQIg8IOWqhIlIORZAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-05T00:31:35.867552Z","bundle_sha256":"2e297eaf8aed8a7c3ca3c999234459e7fa43028d4d012558094844ea28a14ba6"}}