{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:7JTHYPEHRFMOHQB2EKP5JUSSES","short_pith_number":"pith:7JTHYPEH","schema_version":"1.0","canonical_sha256":"fa667c3c878958e3c03a229fd4d25224b396af4ee64fed517dd9b2d7351a73be","source":{"kind":"arxiv","id":"1908.03605","version":1},"attestation_state":"computed","paper":{"title":"View management for lifelong visual maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dimitri Lisin, Jimmy Briggs, Manjunath Narayana, Mario E. Munich, Nandan Banerjee, Ryan C. Connolly","submitted_at":"2019-08-09T19:26:56Z","abstract_excerpt":"The time complexity of making observations and loop closures in a graph-based visual SLAM system is a function of the number of views stored. Clever algorithms, such as approximate nearest neighbor search, can make this function sub-linear. Despite this, over time the number of views can still grow to a point at which the speed and/or accuracy of the system becomes unacceptable, especially in computation- and memory-constrained SLAM systems. However, not all views are created equal. Some views are rarely observed, because they have been created in an unusual lighting condition, or from low qua"},"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":"1908.03605","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-09T19:26:56Z","cross_cats_sorted":[],"title_canon_sha256":"cfb84a0ba153e3ac5497c9ecc5724844ab9bedccf432879353458be865fb8aa2","abstract_canon_sha256":"d5981753b0010f2e7450c838b6d2a95b3229833afb3e439af9ec4d1b2887d7d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:42.744049Z","signature_b64":"7coRRA67kQLJfVbrWsLUPN2qgjnp/Mw8IrwcOm8b4wst4ADjxLY4RfYWUrRMBCTwJxvahSQ1MxTqs1LW0d+JAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa667c3c878958e3c03a229fd4d25224b396af4ee64fed517dd9b2d7351a73be","last_reissued_at":"2026-07-04T23:52:42.743515Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:42.743515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"View management for lifelong visual maps","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Dimitri Lisin, Jimmy Briggs, Manjunath Narayana, Mario E. Munich, Nandan Banerjee, Ryan C. Connolly","submitted_at":"2019-08-09T19:26:56Z","abstract_excerpt":"The time complexity of making observations and loop closures in a graph-based visual SLAM system is a function of the number of views stored. Clever algorithms, such as approximate nearest neighbor search, can make this function sub-linear. Despite this, over time the number of views can still grow to a point at which the speed and/or accuracy of the system becomes unacceptable, especially in computation- and memory-constrained SLAM systems. However, not all views are created equal. Some views are rarely observed, because they have been created in an unusual lighting condition, or from low qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03605","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.03605/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.03605","created_at":"2026-07-04T23:52:42.743574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03605v1","created_at":"2026-07-04T23:52:42.743574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03605","created_at":"2026-07-04T23:52:42.743574+00:00"},{"alias_kind":"pith_short_12","alias_value":"7JTHYPEHRFMO","created_at":"2026-07-04T23:52:42.743574+00:00"},{"alias_kind":"pith_short_16","alias_value":"7JTHYPEHRFMOHQB2","created_at":"2026-07-04T23:52:42.743574+00:00"},{"alias_kind":"pith_short_8","alias_value":"7JTHYPEH","created_at":"2026-07-04T23:52:42.743574+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES","json":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES.json","graph_json":"https://pith.science/api/pith-number/7JTHYPEHRFMOHQB2EKP5JUSSES/graph.json","events_json":"https://pith.science/api/pith-number/7JTHYPEHRFMOHQB2EKP5JUSSES/events.json","paper":"https://pith.science/paper/7JTHYPEH"},"agent_actions":{"view_html":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES","download_json":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES.json","view_paper":"https://pith.science/paper/7JTHYPEH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03605&json=true","fetch_graph":"https://pith.science/api/pith-number/7JTHYPEHRFMOHQB2EKP5JUSSES/graph.json","fetch_events":"https://pith.science/api/pith-number/7JTHYPEHRFMOHQB2EKP5JUSSES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES/action/storage_attestation","attest_author":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES/action/author_attestation","sign_citation":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES/action/citation_signature","submit_replication":"https://pith.science/pith/7JTHYPEHRFMOHQB2EKP5JUSSES/action/replication_record"}},"created_at":"2026-07-04T23:52:42.743574+00:00","updated_at":"2026-07-04T23:52:42.743574+00:00"}