{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:OA6A42IQ7WWSQ3ITQFWNDHNTY2","short_pith_number":"pith:OA6A42IQ","canonical_record":{"source":{"id":"1905.02238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-06T19:01:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"522aa6fc074c82e5d32e2f81e2b6075407c2469d3e45babc83c35c1ea75604e5","abstract_canon_sha256":"0dc803e9581bdc584e8b6914446745cfed437e477b71d0cd14ad0f49b239bf8d"},"schema_version":"1.0"},"canonical_sha256":"703c0e6910fdad286d13816cd19db3c6beb6d43556feb41c6313f1bb71a0338d","source":{"kind":"arxiv","id":"1905.02238","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02238","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02238v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02238","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"OA6A42IQ7WWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OA6A42IQ7WWSQ3IT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OA6A42IQ","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:OA6A42IQ7WWSQ3ITQFWNDHNTY2","target":"record","payload":{"canonical_record":{"source":{"id":"1905.02238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-06T19:01:59Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"522aa6fc074c82e5d32e2f81e2b6075407c2469d3e45babc83c35c1ea75604e5","abstract_canon_sha256":"0dc803e9581bdc584e8b6914446745cfed437e477b71d0cd14ad0f49b239bf8d"},"schema_version":"1.0"},"canonical_sha256":"703c0e6910fdad286d13816cd19db3c6beb6d43556feb41c6313f1bb71a0338d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:51.985109Z","signature_b64":"zBqQa1WG56QiTc794woXSCoD4ZKREsoyfRz/kMH4n+zFLnM8WMGO7W1vM2Bb97nFe+4vNaClAA3QmsVeScsABQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"703c0e6910fdad286d13816cd19db3c6beb6d43556feb41c6313f1bb71a0338d","last_reissued_at":"2026-05-17T23:46:51.984240Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:51.984240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.02238","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-17T23:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jva+9jz9YeT4wJFC2EafsU5dcDyRWvildcwK/eaLJNtWYZC1HZC0cUFWVx1I+Nq+BFOp2WHOV5rM96tiAkEUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:55:45.667113Z"},"content_sha256":"e471e592ef1651c30401ed80d4d3b6af24534c9bba4cc3149bf3193b2a5ec553","schema_version":"1.0","event_id":"sha256:e471e592ef1651c30401ed80d4d3b6af24534c9bba4cc3149bf3193b2a5ec553"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:OA6A42IQ7WWSQ3ITQFWNDHNTY2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FSMI: Fast computation of Shannon Mutual Information for information-theoretic mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.RO","authors_text":"Sertac Karaman, Trevor Henderson, Vivienne Sze, Zhengdong Zhang","submitted_at":"2019-05-06T19:01:59Z","abstract_excerpt":"Exploration tasks are embedded in many robotics applications, such as search and rescue and space exploration. Information-based exploration algorithms aim to find the most informative trajectories by maximizing an information-theoretic metric, such as the mutual information between the map and potential future measurements. Unfortunately, most existing information-based exploration algorithms are plagued by the computational difficulty of evaluating the Shannon mutual information metric. In this paper, we consider the fundamental problem of evaluating Shannon mutual information between the ma"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02238","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-17T23:46:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pnM+LG2JFLovs2Onh1UTIuMhQLsHNWsqsiLwXcpk43Qfk4YAW0HfkUB+Af5ql0Ll7BmEqkZjAHO6oXETZrdnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T16:55:45.667712Z"},"content_sha256":"c93e0d289053c51910dac4e3e8240a0c5dbb937e5accd9771d4d53111f604286","schema_version":"1.0","event_id":"sha256:c93e0d289053c51910dac4e3e8240a0c5dbb937e5accd9771d4d53111f604286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2/bundle.json","state_url":"https://pith.science/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2/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-27T16:55:45Z","links":{"resolver":"https://pith.science/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2","bundle":"https://pith.science/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2/bundle.json","state":"https://pith.science/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OA6A42IQ7WWSQ3ITQFWNDHNTY2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:OA6A42IQ7WWSQ3ITQFWNDHNTY2","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":"0dc803e9581bdc584e8b6914446745cfed437e477b71d0cd14ad0f49b239bf8d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-06T19:01:59Z","title_canon_sha256":"522aa6fc074c82e5d32e2f81e2b6075407c2469d3e45babc83c35c1ea75604e5"},"schema_version":"1.0","source":{"id":"1905.02238","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.02238","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"arxiv_version","alias_value":"1905.02238v1","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02238","created_at":"2026-05-17T23:46:51Z"},{"alias_kind":"pith_short_12","alias_value":"OA6A42IQ7WWS","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"OA6A42IQ7WWSQ3IT","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"OA6A42IQ","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:c93e0d289053c51910dac4e3e8240a0c5dbb937e5accd9771d4d53111f604286","target":"graph","created_at":"2026-05-17T23:46:51Z","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":"Exploration tasks are embedded in many robotics applications, such as search and rescue and space exploration. Information-based exploration algorithms aim to find the most informative trajectories by maximizing an information-theoretic metric, such as the mutual information between the map and potential future measurements. Unfortunately, most existing information-based exploration algorithms are plagued by the computational difficulty of evaluating the Shannon mutual information metric. In this paper, we consider the fundamental problem of evaluating Shannon mutual information between the ma","authors_text":"Sertac Karaman, Trevor Henderson, Vivienne Sze, Zhengdong Zhang","cross_cats":["cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-06T19:01:59Z","title":"FSMI: Fast computation of Shannon Mutual Information for information-theoretic mapping"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02238","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:e471e592ef1651c30401ed80d4d3b6af24534c9bba4cc3149bf3193b2a5ec553","target":"record","created_at":"2026-05-17T23:46:51Z","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":"0dc803e9581bdc584e8b6914446745cfed437e477b71d0cd14ad0f49b239bf8d","cross_cats_sorted":["cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-05-06T19:01:59Z","title_canon_sha256":"522aa6fc074c82e5d32e2f81e2b6075407c2469d3e45babc83c35c1ea75604e5"},"schema_version":"1.0","source":{"id":"1905.02238","kind":"arxiv","version":1}},"canonical_sha256":"703c0e6910fdad286d13816cd19db3c6beb6d43556feb41c6313f1bb71a0338d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"703c0e6910fdad286d13816cd19db3c6beb6d43556feb41c6313f1bb71a0338d","first_computed_at":"2026-05-17T23:46:51.984240Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:51.984240Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zBqQa1WG56QiTc794woXSCoD4ZKREsoyfRz/kMH4n+zFLnM8WMGO7W1vM2Bb97nFe+4vNaClAA3QmsVeScsABQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:51.985109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.02238","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e471e592ef1651c30401ed80d4d3b6af24534c9bba4cc3149bf3193b2a5ec553","sha256:c93e0d289053c51910dac4e3e8240a0c5dbb937e5accd9771d4d53111f604286"],"state_sha256":"086da640b7f435f08eb8f6f1a8142e9f68796509f7b4dff7b5f1f248b83abc01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mNmtyRLpHlpXA/qEVeXgo05o7eYa4MX2TlOYwcInXhsLic9Aw3WKLEFiEIfansV5G0vJBcDMqGsYr3GIUFIWDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T16:55:45.670385Z","bundle_sha256":"78383c467294948dafdfbdc2f8872df15ea3714e9528f972f37dddfdaada4ba2"}}