{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YKYOZ6WBX5T2TEGLZO7P4EZOPT","short_pith_number":"pith:YKYOZ6WB","canonical_record":{"source":{"id":"1510.08437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-28T19:58:31Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"411f3af4ef1f111659ea5697a5f9b5ec46925b6640d7fe4b37f3f1dfe5bf158a","abstract_canon_sha256":"3aa808417c9ec05db289802247fdbd2bef62ae4144d118764432c9921c051a3b"},"schema_version":"1.0"},"canonical_sha256":"c2b0ecfac1bf67a990cbcbbefe132e7cc04ad3d1fe8d333cfeb7d1ece210b676","source":{"kind":"arxiv","id":"1510.08437","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08437","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08437v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08437","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"YKYOZ6WBX5T2","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YKYOZ6WBX5T2TEGL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YKYOZ6WB","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YKYOZ6WBX5T2TEGLZO7P4EZOPT","target":"record","payload":{"canonical_record":{"source":{"id":"1510.08437","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-28T19:58:31Z","cross_cats_sorted":["stat.ME"],"title_canon_sha256":"411f3af4ef1f111659ea5697a5f9b5ec46925b6640d7fe4b37f3f1dfe5bf158a","abstract_canon_sha256":"3aa808417c9ec05db289802247fdbd2bef62ae4144d118764432c9921c051a3b"},"schema_version":"1.0"},"canonical_sha256":"c2b0ecfac1bf67a990cbcbbefe132e7cc04ad3d1fe8d333cfeb7d1ece210b676","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:25:56.703546Z","signature_b64":"g4pbioORJN/+UyzCyxFhdYLOcDXm7QZNl8pBXN7akTZdn9e9Q2/I/B97mGxH31FTP+dC71Yn3yeqIlADpefeDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2b0ecfac1bf67a990cbcbbefe132e7cc04ad3d1fe8d333cfeb7d1ece210b676","last_reissued_at":"2026-05-18T01:25:56.702822Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:25:56.702822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1510.08437","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-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HkgXjBD5OugZe6EOYImV6+9X1qego+TVERCzx+6tg2lZyoUKN+2as7nHk2pi5dWYvHpnIJPJxQ19XMgk8+9hAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:12:02.636176Z"},"content_sha256":"7dd37845cf5df133bd329c73e2055e8569535890ff9503c070fd9bcb83d43e45","schema_version":"1.0","event_id":"sha256:7dd37845cf5df133bd329c73e2055e8569535890ff9503c070fd9bcb83d43e45"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YKYOZ6WBX5T2TEGLZO7P4EZOPT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Second Order Calibration: A Simple Way to Get Approximate Posteriors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME"],"primary_cat":"stat.AP","authors_text":"Amir Najmi, Omkar Muralidharan","submitted_at":"2015-10-28T19:58:31Z","abstract_excerpt":"Many large-scale machine learning problems involve estimating an unknown parameter $\\theta_{i}$ for each of many items. For example, a key problem in sponsored search is to estimate the click through rate (CTR) of each of billions of query-ad pairs. Most common methods, though, only give a point estimate of each $\\theta_{i}$. A posterior distribution for each $\\theta_{i}$ is usually more useful but harder to get.\n  We present a simple post-processing technique that takes point estimates or scores $t_{i}$ (from any method) and estimates an approximate posterior for each $\\theta_{i}$. We build o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08437","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-18T01:25:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aQ4wa6lp7eMRgaDcGt4k8hw3cmfg6FUi48Hm5CjDAugfZeCFcvD/3OF49TEjSU8/mDalDG6mEQEalV/JsVFuBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:12:02.636774Z"},"content_sha256":"71e7f12d7929c034176adc74c0f6b979995d6f5b0eeb8e336ac95c58a35b68a4","schema_version":"1.0","event_id":"sha256:71e7f12d7929c034176adc74c0f6b979995d6f5b0eeb8e336ac95c58a35b68a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT/bundle.json","state_url":"https://pith.science/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT/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-27T13:12:02Z","links":{"resolver":"https://pith.science/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT","bundle":"https://pith.science/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT/bundle.json","state":"https://pith.science/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKYOZ6WBX5T2TEGLZO7P4EZOPT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YKYOZ6WBX5T2TEGLZO7P4EZOPT","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":"3aa808417c9ec05db289802247fdbd2bef62ae4144d118764432c9921c051a3b","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-28T19:58:31Z","title_canon_sha256":"411f3af4ef1f111659ea5697a5f9b5ec46925b6640d7fe4b37f3f1dfe5bf158a"},"schema_version":"1.0","source":{"id":"1510.08437","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1510.08437","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"arxiv_version","alias_value":"1510.08437v1","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.08437","created_at":"2026-05-18T01:25:56Z"},{"alias_kind":"pith_short_12","alias_value":"YKYOZ6WBX5T2","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YKYOZ6WBX5T2TEGL","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YKYOZ6WB","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:71e7f12d7929c034176adc74c0f6b979995d6f5b0eeb8e336ac95c58a35b68a4","target":"graph","created_at":"2026-05-18T01:25:56Z","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":"Many large-scale machine learning problems involve estimating an unknown parameter $\\theta_{i}$ for each of many items. For example, a key problem in sponsored search is to estimate the click through rate (CTR) of each of billions of query-ad pairs. Most common methods, though, only give a point estimate of each $\\theta_{i}$. A posterior distribution for each $\\theta_{i}$ is usually more useful but harder to get.\n  We present a simple post-processing technique that takes point estimates or scores $t_{i}$ (from any method) and estimates an approximate posterior for each $\\theta_{i}$. We build o","authors_text":"Amir Najmi, Omkar Muralidharan","cross_cats":["stat.ME"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-28T19:58:31Z","title":"Second Order Calibration: A Simple Way to Get Approximate Posteriors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.08437","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:7dd37845cf5df133bd329c73e2055e8569535890ff9503c070fd9bcb83d43e45","target":"record","created_at":"2026-05-18T01:25:56Z","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":"3aa808417c9ec05db289802247fdbd2bef62ae4144d118764432c9921c051a3b","cross_cats_sorted":["stat.ME"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.AP","submitted_at":"2015-10-28T19:58:31Z","title_canon_sha256":"411f3af4ef1f111659ea5697a5f9b5ec46925b6640d7fe4b37f3f1dfe5bf158a"},"schema_version":"1.0","source":{"id":"1510.08437","kind":"arxiv","version":1}},"canonical_sha256":"c2b0ecfac1bf67a990cbcbbefe132e7cc04ad3d1fe8d333cfeb7d1ece210b676","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2b0ecfac1bf67a990cbcbbefe132e7cc04ad3d1fe8d333cfeb7d1ece210b676","first_computed_at":"2026-05-18T01:25:56.702822Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:25:56.702822Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g4pbioORJN/+UyzCyxFhdYLOcDXm7QZNl8pBXN7akTZdn9e9Q2/I/B97mGxH31FTP+dC71Yn3yeqIlADpefeDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:25:56.703546Z","signed_message":"canonical_sha256_bytes"},"source_id":"1510.08437","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dd37845cf5df133bd329c73e2055e8569535890ff9503c070fd9bcb83d43e45","sha256:71e7f12d7929c034176adc74c0f6b979995d6f5b0eeb8e336ac95c58a35b68a4"],"state_sha256":"6cb4017cbdde0789441f482d9d07a9ce7bc6e50ca9c0d182143e48c0e12c9bdd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tZzdGjnJEshwmO6IUgvKPaAuaiwesb6zd4JNWrD5CA1p2FMsRgqXnJXmi5hHO5HTsN7DFKBoGsftbfn+2lQaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:12:02.639536Z","bundle_sha256":"972d2b1d428ac6ce18a0541d4f3ba187c2392cb0616dd9345174e4bf783dd1e7"}}