{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GOSLERT5XZ4KMPCK2L5VY6OTST","short_pith_number":"pith:GOSLERT5","canonical_record":{"source":{"id":"1806.02321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-06-01T01:34:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8852178234e600ad8a5e8927b47e8bba1deb2e1cb1a05b6aecbc4c8a764bede5","abstract_canon_sha256":"8f97d6a7a76f0e2f699fa9e6342162b5aeb86f03cd9d773a66e5392ff064d6c9"},"schema_version":"1.0"},"canonical_sha256":"33a4b2467dbe78a63c4ad2fb5c79d394f912638cea5e3e1124d7c043ccbe965c","source":{"kind":"arxiv","id":"1806.02321","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02321","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02321v1","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02321","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"GOSLERT5XZ4K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GOSLERT5XZ4KMPCK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GOSLERT5","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GOSLERT5XZ4KMPCK2L5VY6OTST","target":"record","payload":{"canonical_record":{"source":{"id":"1806.02321","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-06-01T01:34:04Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"8852178234e600ad8a5e8927b47e8bba1deb2e1cb1a05b6aecbc4c8a764bede5","abstract_canon_sha256":"8f97d6a7a76f0e2f699fa9e6342162b5aeb86f03cd9d773a66e5392ff064d6c9"},"schema_version":"1.0"},"canonical_sha256":"33a4b2467dbe78a63c4ad2fb5c79d394f912638cea5e3e1124d7c043ccbe965c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:01.849620Z","signature_b64":"upfcBtzaihu33xwq8FL4Hu2ffGvURctOW3G9fjHJcgrm/3dUqLXYEF7y8KtINUfcvJztObBNXA5w+chtTublBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33a4b2467dbe78a63c4ad2fb5c79d394f912638cea5e3e1124d7c043ccbe965c","last_reissued_at":"2026-05-18T00:14:01.848964Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:01.848964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.02321","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-18T00:14:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M+vheEKY5QXf9wWcPvCJ0K44mnjfj4hoxMUdXui0CtoNa41AjY3HGfsgFsfNsC4QhlTkRQ409EbFJX4GuZpWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:27:57.511423Z"},"content_sha256":"bc317cc853e5ec540a41591f77b43b0f83e6317c11075e2a5ca6d1363bc81fde","schema_version":"1.0","event_id":"sha256:bc317cc853e5ec540a41591f77b43b0f83e6317c11075e2a5ca6d1363bc81fde"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GOSLERT5XZ4KMPCK2L5VY6OTST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fitting a deeply-nested hierarchical model to a large book review dataset using a moment-based estimator","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.ME","authors_text":"Kyle Schmaus, Ningshan Zhang, Patrick O. Perry","submitted_at":"2018-06-01T01:34:04Z","abstract_excerpt":"We consider a particular instance of a common problem in recommender systems: using a database of book reviews to inform user-targeted recommendations. In our dataset, books are categorized into genres and sub-genres. To exploit this nested taxonomy, we use a hierarchical model that enables information pooling across across similar items at many levels within the genre hierarchy. The main challenge in deploying this model is computational: the data sizes are large, and fitting the model at scale using off-the-shelf maximum likelihood procedures is prohibitive. To get around this computational "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02321","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-18T00:14:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g3C748WmSOeEgaSTd6j0viMGl71pkA5WKypfLDNNtkJ25CkS3F27hprqCsK/dClO6memSpFD5yr2RamAwjPLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T15:27:57.512122Z"},"content_sha256":"56a4ab28afc58a8dbdf7eb32b8d5eb03b2f5a506805898c5a2ccc8b8fb6886dd","schema_version":"1.0","event_id":"sha256:56a4ab28afc58a8dbdf7eb32b8d5eb03b2f5a506805898c5a2ccc8b8fb6886dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GOSLERT5XZ4KMPCK2L5VY6OTST/bundle.json","state_url":"https://pith.science/pith/GOSLERT5XZ4KMPCK2L5VY6OTST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GOSLERT5XZ4KMPCK2L5VY6OTST/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-29T15:27:57Z","links":{"resolver":"https://pith.science/pith/GOSLERT5XZ4KMPCK2L5VY6OTST","bundle":"https://pith.science/pith/GOSLERT5XZ4KMPCK2L5VY6OTST/bundle.json","state":"https://pith.science/pith/GOSLERT5XZ4KMPCK2L5VY6OTST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GOSLERT5XZ4KMPCK2L5VY6OTST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GOSLERT5XZ4KMPCK2L5VY6OTST","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":"8f97d6a7a76f0e2f699fa9e6342162b5aeb86f03cd9d773a66e5392ff064d6c9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-06-01T01:34:04Z","title_canon_sha256":"8852178234e600ad8a5e8927b47e8bba1deb2e1cb1a05b6aecbc4c8a764bede5"},"schema_version":"1.0","source":{"id":"1806.02321","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.02321","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"arxiv_version","alias_value":"1806.02321v1","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.02321","created_at":"2026-05-18T00:14:01Z"},{"alias_kind":"pith_short_12","alias_value":"GOSLERT5XZ4K","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GOSLERT5XZ4KMPCK","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GOSLERT5","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:56a4ab28afc58a8dbdf7eb32b8d5eb03b2f5a506805898c5a2ccc8b8fb6886dd","target":"graph","created_at":"2026-05-18T00:14:01Z","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":"We consider a particular instance of a common problem in recommender systems: using a database of book reviews to inform user-targeted recommendations. In our dataset, books are categorized into genres and sub-genres. To exploit this nested taxonomy, we use a hierarchical model that enables information pooling across across similar items at many levels within the genre hierarchy. The main challenge in deploying this model is computational: the data sizes are large, and fitting the model at scale using off-the-shelf maximum likelihood procedures is prohibitive. To get around this computational ","authors_text":"Kyle Schmaus, Ningshan Zhang, Patrick O. Perry","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-06-01T01:34:04Z","title":"Fitting a deeply-nested hierarchical model to a large book review dataset using a moment-based estimator"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.02321","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:bc317cc853e5ec540a41591f77b43b0f83e6317c11075e2a5ca6d1363bc81fde","target":"record","created_at":"2026-05-18T00:14:01Z","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":"8f97d6a7a76f0e2f699fa9e6342162b5aeb86f03cd9d773a66e5392ff064d6c9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2018-06-01T01:34:04Z","title_canon_sha256":"8852178234e600ad8a5e8927b47e8bba1deb2e1cb1a05b6aecbc4c8a764bede5"},"schema_version":"1.0","source":{"id":"1806.02321","kind":"arxiv","version":1}},"canonical_sha256":"33a4b2467dbe78a63c4ad2fb5c79d394f912638cea5e3e1124d7c043ccbe965c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33a4b2467dbe78a63c4ad2fb5c79d394f912638cea5e3e1124d7c043ccbe965c","first_computed_at":"2026-05-18T00:14:01.848964Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:01.848964Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"upfcBtzaihu33xwq8FL4Hu2ffGvURctOW3G9fjHJcgrm/3dUqLXYEF7y8KtINUfcvJztObBNXA5w+chtTublBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:01.849620Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.02321","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bc317cc853e5ec540a41591f77b43b0f83e6317c11075e2a5ca6d1363bc81fde","sha256:56a4ab28afc58a8dbdf7eb32b8d5eb03b2f5a506805898c5a2ccc8b8fb6886dd"],"state_sha256":"4dd5a7b8b5a8544ee7c5009a8c1767d9b14c8c7e4a3f1d55b8da8ce9ab56e903"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hzz1/tNihCttf/s+SIYtDJWB2lWM3W3gaFq14DpfpK1KhaqdfUoUVA9+v6ha3PUR5d6gysxltjsAO4NTLdnyAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T15:27:57.515814Z","bundle_sha256":"2a7253a6221ea326db9a27760c84c9d035cb3fafd81062d288c56b2c7312b3fe"}}