{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:S5NHMTKTBR2NGI6P5HP2JETQGK","short_pith_number":"pith:S5NHMTKT","canonical_record":{"source":{"id":"1409.7552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-26T12:25:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4ac28feeb05c127ff43ad0a91216fa57c9707230ffd45d7ec131bfdca90f1283","abstract_canon_sha256":"47d59475bf25b73fa6b265e23e32f591d2fa6f335d5e55f95dfa82fc388296fc"},"schema_version":"1.0"},"canonical_sha256":"975a764d530c74d323cfe9dfa49270328d08b41fc288a5c254c7e9c01f5be0d9","source":{"kind":"arxiv","id":"1409.7552","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7552","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7552v2","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7552","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"S5NHMTKTBR2N","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S5NHMTKTBR2NGI6P","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S5NHMTKT","created_at":"2026-05-18T12:28:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:S5NHMTKTBR2NGI6P5HP2JETQGK","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7552","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-26T12:25:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"4ac28feeb05c127ff43ad0a91216fa57c9707230ffd45d7ec131bfdca90f1283","abstract_canon_sha256":"47d59475bf25b73fa6b265e23e32f591d2fa6f335d5e55f95dfa82fc388296fc"},"schema_version":"1.0"},"canonical_sha256":"975a764d530c74d323cfe9dfa49270328d08b41fc288a5c254c7e9c01f5be0d9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:57.774723Z","signature_b64":"n1dL+fXJBn7KxnnKiNnY9IlE0p8ImQBXaJyXU5p06hEa4PRte1eFeynt+TmTzSKbe1/a1zVHSugG7/s8PZRMAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"975a764d530c74d323cfe9dfa49270328d08b41fc288a5c254c7e9c01f5be0d9","last_reissued_at":"2026-05-18T01:32:57.774030Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:57.774030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7552","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-18T01:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yt2JSZho5jMXbDAixEJF8cwP1EpofnVxj7T1V5G5NwO8wDraFRDklF5Crlnx2Y5VIZQue3FxZEyeeBlWnzq+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:10:17.379373Z"},"content_sha256":"17fc4be7f5090eba08dbb8ded520953cf2552a5e14e50ae0607bfcc89d904af7","schema_version":"1.0","event_id":"sha256:17fc4be7f5090eba08dbb8ded520953cf2552a5e14e50ae0607bfcc89d904af7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:S5NHMTKTBR2NGI6P5HP2JETQGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Advantage of Cross Entropy over Entropy in Iterative Information Gathering","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Johannes Kulick, Marc Toussaint, Robert Lieck","submitted_at":"2014-09-26T12:25:33Z","abstract_excerpt":"Gathering the most information by picking the least amount of data is a common task in experimental design or when exploring an unknown environment in reinforcement learning and robotics. A widely used measure for quantifying the information contained in some distribution of interest is its entropy. Greedily minimizing the expected entropy is therefore a standard method for choosing samples in order to gain strong beliefs about the underlying random variables. We show that this approach is prone to temporally getting stuck in local optima corresponding to wrongly biased beliefs. We suggest ins"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7552","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-18T01:32:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vequf1/4bNsXYtr9htU7P5BHewY+EwdYXHYBJpTAujncRwf2aYLSet4FxpsDYwNEujFqcxWI/b4MY+hspCdgAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:10:17.380063Z"},"content_sha256":"fb2ab6b8f7415911a4cf000a3955e4a008a5ded6e87b0ac394972b124c53aba9","schema_version":"1.0","event_id":"sha256:fb2ab6b8f7415911a4cf000a3955e4a008a5ded6e87b0ac394972b124c53aba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S5NHMTKTBR2NGI6P5HP2JETQGK/bundle.json","state_url":"https://pith.science/pith/S5NHMTKTBR2NGI6P5HP2JETQGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S5NHMTKTBR2NGI6P5HP2JETQGK/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-31T11:10:17Z","links":{"resolver":"https://pith.science/pith/S5NHMTKTBR2NGI6P5HP2JETQGK","bundle":"https://pith.science/pith/S5NHMTKTBR2NGI6P5HP2JETQGK/bundle.json","state":"https://pith.science/pith/S5NHMTKTBR2NGI6P5HP2JETQGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S5NHMTKTBR2NGI6P5HP2JETQGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:S5NHMTKTBR2NGI6P5HP2JETQGK","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":"47d59475bf25b73fa6b265e23e32f591d2fa6f335d5e55f95dfa82fc388296fc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-26T12:25:33Z","title_canon_sha256":"4ac28feeb05c127ff43ad0a91216fa57c9707230ffd45d7ec131bfdca90f1283"},"schema_version":"1.0","source":{"id":"1409.7552","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7552","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7552v2","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7552","created_at":"2026-05-18T01:32:57Z"},{"alias_kind":"pith_short_12","alias_value":"S5NHMTKTBR2N","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_16","alias_value":"S5NHMTKTBR2NGI6P","created_at":"2026-05-18T12:28:49Z"},{"alias_kind":"pith_short_8","alias_value":"S5NHMTKT","created_at":"2026-05-18T12:28:49Z"}],"graph_snapshots":[{"event_id":"sha256:fb2ab6b8f7415911a4cf000a3955e4a008a5ded6e87b0ac394972b124c53aba9","target":"graph","created_at":"2026-05-18T01:32:57Z","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":"Gathering the most information by picking the least amount of data is a common task in experimental design or when exploring an unknown environment in reinforcement learning and robotics. A widely used measure for quantifying the information contained in some distribution of interest is its entropy. Greedily minimizing the expected entropy is therefore a standard method for choosing samples in order to gain strong beliefs about the underlying random variables. We show that this approach is prone to temporally getting stuck in local optima corresponding to wrongly biased beliefs. We suggest ins","authors_text":"Johannes Kulick, Marc Toussaint, Robert Lieck","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-26T12:25:33Z","title":"The Advantage of Cross Entropy over Entropy in Iterative Information Gathering"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7552","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:17fc4be7f5090eba08dbb8ded520953cf2552a5e14e50ae0607bfcc89d904af7","target":"record","created_at":"2026-05-18T01:32:57Z","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":"47d59475bf25b73fa6b265e23e32f591d2fa6f335d5e55f95dfa82fc388296fc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-09-26T12:25:33Z","title_canon_sha256":"4ac28feeb05c127ff43ad0a91216fa57c9707230ffd45d7ec131bfdca90f1283"},"schema_version":"1.0","source":{"id":"1409.7552","kind":"arxiv","version":2}},"canonical_sha256":"975a764d530c74d323cfe9dfa49270328d08b41fc288a5c254c7e9c01f5be0d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"975a764d530c74d323cfe9dfa49270328d08b41fc288a5c254c7e9c01f5be0d9","first_computed_at":"2026-05-18T01:32:57.774030Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:57.774030Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n1dL+fXJBn7KxnnKiNnY9IlE0p8ImQBXaJyXU5p06hEa4PRte1eFeynt+TmTzSKbe1/a1zVHSugG7/s8PZRMAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:57.774723Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7552","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:17fc4be7f5090eba08dbb8ded520953cf2552a5e14e50ae0607bfcc89d904af7","sha256:fb2ab6b8f7415911a4cf000a3955e4a008a5ded6e87b0ac394972b124c53aba9"],"state_sha256":"1505afc89ce5970fc1780c197bc1edd0d23a812b6ddeb6acc55df5c95803a7d3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sNAsoO4gq+uHh5qBb59JXYaCDrj9Of/7a9LKiAs+qdfm6cowMNTdB0n8ZG5BdxhFNm+kmDtpEol6w4U2UU21AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:10:17.384056Z","bundle_sha256":"16bc5eb4cd4e68c4a23b303af33103176b5b037266b9fd7b4ea597c503c6e844"}}