{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:UGVSKE5MPWXNITJZ7ORZ3Q7OEK","short_pith_number":"pith:UGVSKE5M","canonical_record":{"source":{"id":"1603.03713","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-11T18:21:55Z","cross_cats_sorted":[],"title_canon_sha256":"d6036e23db41a20c4bc29192e78b6ae4682cda26260fd710e77de9bc1a0ac8ac","abstract_canon_sha256":"d3fe88b23c9da3feac36d89320614ceef95ea324f3cf3b174e90d76455907bd0"},"schema_version":"1.0"},"canonical_sha256":"a1ab2513ac7daed44d39fba39dc3ee2288fc58cd8c865e357c1416e330509d7f","source":{"kind":"arxiv","id":"1603.03713","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03713","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03713v3","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03713","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"UGVSKE5MPWXN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UGVSKE5MPWXNITJZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UGVSKE5M","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:UGVSKE5MPWXNITJZ7ORZ3Q7OEK","target":"record","payload":{"canonical_record":{"source":{"id":"1603.03713","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-11T18:21:55Z","cross_cats_sorted":[],"title_canon_sha256":"d6036e23db41a20c4bc29192e78b6ae4682cda26260fd710e77de9bc1a0ac8ac","abstract_canon_sha256":"d3fe88b23c9da3feac36d89320614ceef95ea324f3cf3b174e90d76455907bd0"},"schema_version":"1.0"},"canonical_sha256":"a1ab2513ac7daed44d39fba39dc3ee2288fc58cd8c865e357c1416e330509d7f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:28.884327Z","signature_b64":"JxJq9TeL0RSHtzlneyyX9rKJ55n3xkiA+5MwpzIfm7HLlp0jPvItpbk4eru6wd+ez16PEAXxWT36XhudOTGDBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a1ab2513ac7daed44d39fba39dc3ee2288fc58cd8c865e357c1416e330509d7f","last_reissued_at":"2026-05-18T00:40:28.883749Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:28.883749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.03713","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-18T00:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6/vEhl2t/Ob4jHmywFEart6Xp3DrFAuAu1aXm3SWOg82tOIH0socL8HpELooxNgeuNmGyRLE1nfPwe17oYi5Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:59:15.140423Z"},"content_sha256":"cc698e00370ad7006831c0e759ee28a82823ccb6f156f32a8718dc961b3b100e","schema_version":"1.0","event_id":"sha256:cc698e00370ad7006831c0e759ee28a82823ccb6f156f32a8718dc961b3b100e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:UGVSKE5MPWXNITJZ7ORZ3Q7OEK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cost-sensitive Learning for Utility Optimization in Online Advertising Auctions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Damien Lefortier, Flavian Vasile, Olivier Chapelle","submitted_at":"2016-03-11T18:21:55Z","abstract_excerpt":"One of the most challenging problems in computational advertising is the prediction of click-through and conversion rates for bidding in online advertising auctions. An unaddressed problem in previous approaches is the existence of highly non-uniform misprediction costs. While for model evaluation these costs have been taken into account through recently proposed business-aware offline metrics -- such as the Utility metric which measures the impact on advertiser profit -- this is not the case when training the models themselves. In this paper, to bridge the gap, we formally analyze the relatio"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03713","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-18T00:40:28Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q0z64OpuYNyT3muFLi+XkBBilTcRE3Sc1pj7bt5lF+Hs/7/sSqrIN4ehVnbz7prNvpFKmSCRbaCyFH/9e1IOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T10:59:15.141111Z"},"content_sha256":"347618e7412c5b6c42729b239f1bf621b70a396b14b9f5c055e8d50bcdd5d6f3","schema_version":"1.0","event_id":"sha256:347618e7412c5b6c42729b239f1bf621b70a396b14b9f5c055e8d50bcdd5d6f3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK/bundle.json","state_url":"https://pith.science/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK/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-27T10:59:15Z","links":{"resolver":"https://pith.science/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK","bundle":"https://pith.science/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK/bundle.json","state":"https://pith.science/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UGVSKE5MPWXNITJZ7ORZ3Q7OEK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:UGVSKE5MPWXNITJZ7ORZ3Q7OEK","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":"d3fe88b23c9da3feac36d89320614ceef95ea324f3cf3b174e90d76455907bd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-11T18:21:55Z","title_canon_sha256":"d6036e23db41a20c4bc29192e78b6ae4682cda26260fd710e77de9bc1a0ac8ac"},"schema_version":"1.0","source":{"id":"1603.03713","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.03713","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"arxiv_version","alias_value":"1603.03713v3","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.03713","created_at":"2026-05-18T00:40:28Z"},{"alias_kind":"pith_short_12","alias_value":"UGVSKE5MPWXN","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"UGVSKE5MPWXNITJZ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"UGVSKE5M","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:347618e7412c5b6c42729b239f1bf621b70a396b14b9f5c055e8d50bcdd5d6f3","target":"graph","created_at":"2026-05-18T00:40:28Z","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":"One of the most challenging problems in computational advertising is the prediction of click-through and conversion rates for bidding in online advertising auctions. An unaddressed problem in previous approaches is the existence of highly non-uniform misprediction costs. While for model evaluation these costs have been taken into account through recently proposed business-aware offline metrics -- such as the Utility metric which measures the impact on advertiser profit -- this is not the case when training the models themselves. In this paper, to bridge the gap, we formally analyze the relatio","authors_text":"Damien Lefortier, Flavian Vasile, Olivier Chapelle","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-11T18:21:55Z","title":"Cost-sensitive Learning for Utility Optimization in Online Advertising Auctions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.03713","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:cc698e00370ad7006831c0e759ee28a82823ccb6f156f32a8718dc961b3b100e","target":"record","created_at":"2026-05-18T00:40:28Z","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":"d3fe88b23c9da3feac36d89320614ceef95ea324f3cf3b174e90d76455907bd0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2016-03-11T18:21:55Z","title_canon_sha256":"d6036e23db41a20c4bc29192e78b6ae4682cda26260fd710e77de9bc1a0ac8ac"},"schema_version":"1.0","source":{"id":"1603.03713","kind":"arxiv","version":3}},"canonical_sha256":"a1ab2513ac7daed44d39fba39dc3ee2288fc58cd8c865e357c1416e330509d7f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a1ab2513ac7daed44d39fba39dc3ee2288fc58cd8c865e357c1416e330509d7f","first_computed_at":"2026-05-18T00:40:28.883749Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:28.883749Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JxJq9TeL0RSHtzlneyyX9rKJ55n3xkiA+5MwpzIfm7HLlp0jPvItpbk4eru6wd+ez16PEAXxWT36XhudOTGDBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:28.884327Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.03713","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc698e00370ad7006831c0e759ee28a82823ccb6f156f32a8718dc961b3b100e","sha256:347618e7412c5b6c42729b239f1bf621b70a396b14b9f5c055e8d50bcdd5d6f3"],"state_sha256":"79e3e6bbcc03c31c124d4305eca1a10e96fdeedb1df905a99cca60cbd7f4a2a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QiWziiNXS5Le5leDV6PcEVBX8ps1faWt2duxxZTJa80HDQi2p3RLFaw/BbXNdj6TQoHbgVfwrg2T5MBJItDDDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T10:59:15.145079Z","bundle_sha256":"0b5a28eedc92e45b1efea383ebafd191bf2aa77b78d30fc217cdd2e96df9c26b"}}