{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HRNRIA2N2GYRJTSLEOODVPHI5Z","short_pith_number":"pith:HRNRIA2N","schema_version":"1.0","canonical_sha256":"3c5b14034dd1b114ce4b239c3abce8ee4fbfca04c29c47d743a5d1ee13107bf0","source":{"kind":"arxiv","id":"1504.02696","version":1},"attestation_state":"computed","paper":{"title":"Incremental Sparse GP Regression for Continuous-time Trajectory Estimation & Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Byron Boots, Vadim Indelman, Xinyan Yan","submitted_at":"2015-04-10T14:47:25Z","abstract_excerpt":"Recent work on simultaneous trajectory estimation and mapping (STEAM) for mobile robots has found success by representing the trajectory as a Gaussian process. Gaussian processes can represent a continuous-time trajectory, elegantly handle asynchronous and sparse measurements, and allow the robot to query the trajectory to recover its estimated position at any time of interest. A major drawback of this approach is that STEAM is formulated as a batch estimation problem. In this paper we provide the critical extensions necessary to transform the existing batch algorithm into an extremely efficie"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1504.02696","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2015-04-10T14:47:25Z","cross_cats_sorted":[],"title_canon_sha256":"6cafffd82f65df83bec43cd3a7198a1f87706c5ede5901f2d4316b787023187e","abstract_canon_sha256":"65a7b85b5f603ae21d957c16180a2b1923721e18e902fd3adea8a1621724df0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:06.829155Z","signature_b64":"TVkxPDzI+wjmFkQT4OThosQaAnwEX+UTrU2GFDGf4hS6ftkP2IQ65PMfqM5qRYcpK/LdzI5ldFkCaGJllkJXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c5b14034dd1b114ce4b239c3abce8ee4fbfca04c29c47d743a5d1ee13107bf0","last_reissued_at":"2026-05-18T02:19:06.828738Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:06.828738Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Sparse GP Regression for Continuous-time Trajectory Estimation & Mapping","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Byron Boots, Vadim Indelman, Xinyan Yan","submitted_at":"2015-04-10T14:47:25Z","abstract_excerpt":"Recent work on simultaneous trajectory estimation and mapping (STEAM) for mobile robots has found success by representing the trajectory as a Gaussian process. Gaussian processes can represent a continuous-time trajectory, elegantly handle asynchronous and sparse measurements, and allow the robot to query the trajectory to recover its estimated position at any time of interest. A major drawback of this approach is that STEAM is formulated as a batch estimation problem. In this paper we provide the critical extensions necessary to transform the existing batch algorithm into an extremely efficie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02696","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02696","created_at":"2026-05-18T02:19:06.828802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02696v1","created_at":"2026-05-18T02:19:06.828802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02696","created_at":"2026-05-18T02:19:06.828802+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRNRIA2N2GYR","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRNRIA2N2GYRJTSL","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRNRIA2N","created_at":"2026-05-18T12:29:25.134429+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.09073","citing_title":"Smoothing Out the Edges: Continuous-Time Estimation with Gaussian Process Motion Priors on Factor Graphs","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z","json":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z.json","graph_json":"https://pith.science/api/pith-number/HRNRIA2N2GYRJTSLEOODVPHI5Z/graph.json","events_json":"https://pith.science/api/pith-number/HRNRIA2N2GYRJTSLEOODVPHI5Z/events.json","paper":"https://pith.science/paper/HRNRIA2N"},"agent_actions":{"view_html":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z","download_json":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z.json","view_paper":"https://pith.science/paper/HRNRIA2N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02696&json=true","fetch_graph":"https://pith.science/api/pith-number/HRNRIA2N2GYRJTSLEOODVPHI5Z/graph.json","fetch_events":"https://pith.science/api/pith-number/HRNRIA2N2GYRJTSLEOODVPHI5Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z/action/storage_attestation","attest_author":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z/action/author_attestation","sign_citation":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z/action/citation_signature","submit_replication":"https://pith.science/pith/HRNRIA2N2GYRJTSLEOODVPHI5Z/action/replication_record"}},"created_at":"2026-05-18T02:19:06.828802+00:00","updated_at":"2026-05-18T02:19:06.828802+00:00"}