{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MWVVNYZW4HPJWH6XOYLXFOQOEJ","short_pith_number":"pith:MWVVNYZW","canonical_record":{"source":{"id":"1811.10156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-11-26T03:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"a21d7bce21ebc88d94568a59737f1cbb78d7b5846b56089f0dd6ad9f245ea7a4","abstract_canon_sha256":"163203efdf7e48688ed77f00654b33afec988fd7d600bd10f65ddf26d6755c8e"},"schema_version":"1.0"},"canonical_sha256":"65ab56e336e1de9b1fd7761772ba0e2260d71026032f02359055698dbffea68d","source":{"kind":"arxiv","id":"1811.10156","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10156","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10156v1","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10156","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"MWVVNYZW4HPJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MWVVNYZW4HPJWH6X","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MWVVNYZW","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MWVVNYZW4HPJWH6XOYLXFOQOEJ","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10156","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-11-26T03:06:56Z","cross_cats_sorted":[],"title_canon_sha256":"a21d7bce21ebc88d94568a59737f1cbb78d7b5846b56089f0dd6ad9f245ea7a4","abstract_canon_sha256":"163203efdf7e48688ed77f00654b33afec988fd7d600bd10f65ddf26d6755c8e"},"schema_version":"1.0"},"canonical_sha256":"65ab56e336e1de9b1fd7761772ba0e2260d71026032f02359055698dbffea68d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:58.544145Z","signature_b64":"ZqKTdkqbslJjQBWd4REyPOBWTG/5seXt3vo/1l/Ih9lnvBc+pQy8YT1PKQ+e77FJFPoQqTnNAhgC3WkhwDtHBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"65ab56e336e1de9b1fd7761772ba0e2260d71026032f02359055698dbffea68d","last_reissued_at":"2026-05-17T23:59:58.543765Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:58.543765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10156","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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Qe2jZZctTjptfrVaPLV92FPoQdUXWW/hoyTfAZpbpeTciyIAYLm8LQWmiNXcxy62LaPadl8V7HpGSgAjW0nqCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:05:32.515956Z"},"content_sha256":"a568d4fd8365aa310be6fcb60a0b19aecc4e96e2bf8e7a7cd578c448522ab2cd","schema_version":"1.0","event_id":"sha256:a568d4fd8365aa310be6fcb60a0b19aecc4e96e2bf8e7a7cd578c448522ab2cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MWVVNYZW4HPJWH6XOYLXFOQOEJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Gaussian Process Occupancy Maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Haofei Kuang, S\\\"oren Schwertfeger, Yijun Yuan","submitted_at":"2018-11-26T03:06:56Z","abstract_excerpt":"In this paper, we demonstrate our work on Gaussian Process Occupancy Mapping (GPOM). We concentrate on the inefficiency of the frame computation of the classical GPOM approaches. In robotics, most of the algorithms are required to run in real time. However, the high cost of computation makes the classical GPOM less useful. In this paper we dont try to optimize the Gaussian Process itself, instead, we focus on the application. By analyzing the time cost of each step of the algorithm, we find a way that to reduce the cost while maintaining a good performance compared to the general GPOM framewor"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10156","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:59:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KEmg+0N8jlDiybibL674vgNV5vMWeLfnnPXXXTX6ElwLM8APUOKIR23URJuF0PD82520IqHpyB4IcyLPHNUIAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T19:05:32.516684Z"},"content_sha256":"575292b02029639c39af452745e87973f112bdbc6a4907893e470da61931ace9","schema_version":"1.0","event_id":"sha256:575292b02029639c39af452745e87973f112bdbc6a4907893e470da61931ace9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ/bundle.json","state_url":"https://pith.science/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ/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-29T19:05:32Z","links":{"resolver":"https://pith.science/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ","bundle":"https://pith.science/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ/bundle.json","state":"https://pith.science/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MWVVNYZW4HPJWH6XOYLXFOQOEJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MWVVNYZW4HPJWH6XOYLXFOQOEJ","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":"163203efdf7e48688ed77f00654b33afec988fd7d600bd10f65ddf26d6755c8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-11-26T03:06:56Z","title_canon_sha256":"a21d7bce21ebc88d94568a59737f1cbb78d7b5846b56089f0dd6ad9f245ea7a4"},"schema_version":"1.0","source":{"id":"1811.10156","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10156","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10156v1","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10156","created_at":"2026-05-17T23:59:58Z"},{"alias_kind":"pith_short_12","alias_value":"MWVVNYZW4HPJ","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"MWVVNYZW4HPJWH6X","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"MWVVNYZW","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:575292b02029639c39af452745e87973f112bdbc6a4907893e470da61931ace9","target":"graph","created_at":"2026-05-17T23:59:58Z","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":"In this paper, we demonstrate our work on Gaussian Process Occupancy Mapping (GPOM). We concentrate on the inefficiency of the frame computation of the classical GPOM approaches. In robotics, most of the algorithms are required to run in real time. However, the high cost of computation makes the classical GPOM less useful. In this paper we dont try to optimize the Gaussian Process itself, instead, we focus on the application. By analyzing the time cost of each step of the algorithm, we find a way that to reduce the cost while maintaining a good performance compared to the general GPOM framewor","authors_text":"Haofei Kuang, S\\\"oren Schwertfeger, Yijun Yuan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-11-26T03:06:56Z","title":"Fast Gaussian Process Occupancy Maps"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10156","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:a568d4fd8365aa310be6fcb60a0b19aecc4e96e2bf8e7a7cd578c448522ab2cd","target":"record","created_at":"2026-05-17T23:59:58Z","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":"163203efdf7e48688ed77f00654b33afec988fd7d600bd10f65ddf26d6755c8e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-11-26T03:06:56Z","title_canon_sha256":"a21d7bce21ebc88d94568a59737f1cbb78d7b5846b56089f0dd6ad9f245ea7a4"},"schema_version":"1.0","source":{"id":"1811.10156","kind":"arxiv","version":1}},"canonical_sha256":"65ab56e336e1de9b1fd7761772ba0e2260d71026032f02359055698dbffea68d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"65ab56e336e1de9b1fd7761772ba0e2260d71026032f02359055698dbffea68d","first_computed_at":"2026-05-17T23:59:58.543765Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:58.543765Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZqKTdkqbslJjQBWd4REyPOBWTG/5seXt3vo/1l/Ih9lnvBc+pQy8YT1PKQ+e77FJFPoQqTnNAhgC3WkhwDtHBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:58.544145Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10156","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a568d4fd8365aa310be6fcb60a0b19aecc4e96e2bf8e7a7cd578c448522ab2cd","sha256:575292b02029639c39af452745e87973f112bdbc6a4907893e470da61931ace9"],"state_sha256":"d97e07e3ef29cf6a6a9e138dd8a001cbe0d6077dc7d41642194b8f1ece597fe8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sj4tSslOdcNNydlSC9TE14ywS/3tVSrzosJ/86JNxp4S2zZRN4GlMt8kY81zVtwGCrLuoBH3UoafyHhCnKtOCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T19:05:32.520547Z","bundle_sha256":"6d8de35541fab033df08493c837fa22bf22431b6e058580a5807f7d61554c7b6"}}