{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JX3MRUMCC47X6QVSPANHI52YJF","short_pith_number":"pith:JX3MRUMC","canonical_record":{"source":{"id":"1704.01168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-04T20:07:26Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"f108ed4ed387d2213fc9907519ff4f196391088d2c8f71b5a46fb3e1e4cacd2b","abstract_canon_sha256":"2e5030083554d831991b4f89a2edb8c5dd667d801ac417575f9f614c64bc8e56"},"schema_version":"1.0"},"canonical_sha256":"4df6c8d182173f7f42b2781a7477584956fe25d6c503099909df28d5f8796008","source":{"kind":"arxiv","id":"1704.01168","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01168","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01168v3","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01168","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"JX3MRUMCC47X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JX3MRUMCC47X6QVS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JX3MRUMC","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JX3MRUMCC47X6QVSPANHI52YJF","target":"record","payload":{"canonical_record":{"source":{"id":"1704.01168","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-04T20:07:26Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"f108ed4ed387d2213fc9907519ff4f196391088d2c8f71b5a46fb3e1e4cacd2b","abstract_canon_sha256":"2e5030083554d831991b4f89a2edb8c5dd667d801ac417575f9f614c64bc8e56"},"schema_version":"1.0"},"canonical_sha256":"4df6c8d182173f7f42b2781a7477584956fe25d6c503099909df28d5f8796008","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:38:35.797995Z","signature_b64":"KWVjDLVWfJcPJFe56Cn2KGKTcdK13TOE4RZ6uLrVfTAR2A5MV+udr2/DXCAuuaWW+QlLDMFMaDz5yQ4+p/TcDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4df6c8d182173f7f42b2781a7477584956fe25d6c503099909df28d5f8796008","last_reissued_at":"2026-05-18T00:38:35.797577Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:38:35.797577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1704.01168","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PqxB8eG/nnqj7xRQJT68OvTaPazOpaKH21xK+h397tOcaG9auBq6kZJgeTAdKbCoyiLKwIf71jLVYB69HfSBCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:24:02.222105Z"},"content_sha256":"7f7d40ac37db7080b744c0f698b7542c03f893b280aaedbcb484955e8983b2ca","schema_version":"1.0","event_id":"sha256:7f7d40ac37db7080b744c0f698b7542c03f893b280aaedbcb484955e8983b2ca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JX3MRUMCC47X6QVSPANHI52YJF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Approximately Objective Priors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ML","authors_text":"Eric Nalisnick, Padhraic Smyth","submitted_at":"2017-04-04T20:07:26Z","abstract_excerpt":"Informative Bayesian priors are often difficult to elicit, and when this is the case, modelers usually turn to noninformative or objective priors. However, objective priors such as the Jeffreys and reference priors are not tractable to derive for many models of interest. We address this issue by proposing techniques for learning reference prior approximations: we select a parametric family and optimize a black-box lower bound on the reference prior objective to find the member of the family that serves as a good approximation. We experimentally demonstrate the method's effectiveness by recover"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01168","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:38:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xES9myPr0mgkBojl9PFAOXsep/EX5OkN6XHKiFXwfSXttJQkHBGMh9cb63ZA60twox02tHvP/LWCA2ouivReBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T23:24:02.222917Z"},"content_sha256":"e25e2d40e2785472c21c97d9db0ac7218906b1454a8900a135b1212d1d8b28ae","schema_version":"1.0","event_id":"sha256:e25e2d40e2785472c21c97d9db0ac7218906b1454a8900a135b1212d1d8b28ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JX3MRUMCC47X6QVSPANHI52YJF/bundle.json","state_url":"https://pith.science/pith/JX3MRUMCC47X6QVSPANHI52YJF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JX3MRUMCC47X6QVSPANHI52YJF/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-06-10T23:24:02Z","links":{"resolver":"https://pith.science/pith/JX3MRUMCC47X6QVSPANHI52YJF","bundle":"https://pith.science/pith/JX3MRUMCC47X6QVSPANHI52YJF/bundle.json","state":"https://pith.science/pith/JX3MRUMCC47X6QVSPANHI52YJF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JX3MRUMCC47X6QVSPANHI52YJF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JX3MRUMCC47X6QVSPANHI52YJF","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":"2e5030083554d831991b4f89a2edb8c5dd667d801ac417575f9f614c64bc8e56","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-04T20:07:26Z","title_canon_sha256":"f108ed4ed387d2213fc9907519ff4f196391088d2c8f71b5a46fb3e1e4cacd2b"},"schema_version":"1.0","source":{"id":"1704.01168","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.01168","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"arxiv_version","alias_value":"1704.01168v3","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.01168","created_at":"2026-05-18T00:38:35Z"},{"alias_kind":"pith_short_12","alias_value":"JX3MRUMCC47X","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JX3MRUMCC47X6QVS","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JX3MRUMC","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:e25e2d40e2785472c21c97d9db0ac7218906b1454a8900a135b1212d1d8b28ae","target":"graph","created_at":"2026-05-18T00:38:35Z","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":"Informative Bayesian priors are often difficult to elicit, and when this is the case, modelers usually turn to noninformative or objective priors. However, objective priors such as the Jeffreys and reference priors are not tractable to derive for many models of interest. We address this issue by proposing techniques for learning reference prior approximations: we select a parametric family and optimize a black-box lower bound on the reference prior objective to find the member of the family that serves as a good approximation. We experimentally demonstrate the method's effectiveness by recover","authors_text":"Eric Nalisnick, Padhraic Smyth","cross_cats":["stat.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-04T20:07:26Z","title":"Learning Approximately Objective Priors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.01168","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:7f7d40ac37db7080b744c0f698b7542c03f893b280aaedbcb484955e8983b2ca","target":"record","created_at":"2026-05-18T00:38:35Z","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":"2e5030083554d831991b4f89a2edb8c5dd667d801ac417575f9f614c64bc8e56","cross_cats_sorted":["stat.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-04-04T20:07:26Z","title_canon_sha256":"f108ed4ed387d2213fc9907519ff4f196391088d2c8f71b5a46fb3e1e4cacd2b"},"schema_version":"1.0","source":{"id":"1704.01168","kind":"arxiv","version":3}},"canonical_sha256":"4df6c8d182173f7f42b2781a7477584956fe25d6c503099909df28d5f8796008","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4df6c8d182173f7f42b2781a7477584956fe25d6c503099909df28d5f8796008","first_computed_at":"2026-05-18T00:38:35.797577Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:38:35.797577Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KWVjDLVWfJcPJFe56Cn2KGKTcdK13TOE4RZ6uLrVfTAR2A5MV+udr2/DXCAuuaWW+QlLDMFMaDz5yQ4+p/TcDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:38:35.797995Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.01168","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7f7d40ac37db7080b744c0f698b7542c03f893b280aaedbcb484955e8983b2ca","sha256:e25e2d40e2785472c21c97d9db0ac7218906b1454a8900a135b1212d1d8b28ae"],"state_sha256":"b48a9987a09c97b22086cbedf6d893ba4bcac39435f88021ab6ffc8528fb91ee"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"18vVJ71jKyJQin9Atwnqds0SbHEQXFFuZuo03v+KiLp/iOaQc2kLtlhLOuUKz1/TbWcoWi9e8sAa2ZFURhH4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T23:24:02.227099Z","bundle_sha256":"744aec96ce90156a32ae9475a84d449c5f15dc09d93440d123414ce449489fed"}}