{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:4FAHX2VQ73XHPQCCAEWOVCDLPT","short_pith_number":"pith:4FAHX2VQ","schema_version":"1.0","canonical_sha256":"e1407beab0feee77c042012cea886b7ce7f82b49204b57f6b50f54fccedd6303","source":{"kind":"arxiv","id":"1509.07611","version":1},"attestation_state":"computed","paper":{"title":"Incremental Loop Closure Verification by Guided Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kanji Tanaka","submitted_at":"2015-09-25T07:49:50Z","abstract_excerpt":"Loop closure detection, the task of identifying locations revisited by a robot in a sequence of odometry and perceptual observations, is typically formulated as a combination of two subtasks: (1) bag-of-words image retrieval and (2) post-verification using RANSAC geometric verification. The main contribution of this study is the proposal of a novel post-verification framework that achieves good precision recall trade-off in loop closure detection. This study is motivated by the fact that not all loop closure hypotheses are equally plausible (e.g., owing to mutual consistency between loop closu"},"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":"1509.07611","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2015-09-25T07:49:50Z","cross_cats_sorted":[],"title_canon_sha256":"fae7ae0c44298664609b004d2ff934af8dc7c136ef6ba650e34cbc1f40aedd39","abstract_canon_sha256":"b0f63357570a58eac891f19b041d587dce8b5e7a3d011d2e337f35e3cd9d58f3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:02.347232Z","signature_b64":"JwI+BnGvNBXvmWMxEyl9mwuQ6U96VnqZcvo13ZMZudXVtbjy7LDcldt+Hix6xZsZzWabq1vfJtWucZPskTTODg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1407beab0feee77c042012cea886b7ce7f82b49204b57f6b50f54fccedd6303","last_reissued_at":"2026-05-18T01:32:02.346672Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:02.346672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Incremental Loop Closure Verification by Guided Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kanji Tanaka","submitted_at":"2015-09-25T07:49:50Z","abstract_excerpt":"Loop closure detection, the task of identifying locations revisited by a robot in a sequence of odometry and perceptual observations, is typically formulated as a combination of two subtasks: (1) bag-of-words image retrieval and (2) post-verification using RANSAC geometric verification. The main contribution of this study is the proposal of a novel post-verification framework that achieves good precision recall trade-off in loop closure detection. This study is motivated by the fact that not all loop closure hypotheses are equally plausible (e.g., owing to mutual consistency between loop closu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.07611","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":"1509.07611","created_at":"2026-05-18T01:32:02.346746+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.07611v1","created_at":"2026-05-18T01:32:02.346746+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.07611","created_at":"2026-05-18T01:32:02.346746+00:00"},{"alias_kind":"pith_short_12","alias_value":"4FAHX2VQ73XH","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_16","alias_value":"4FAHX2VQ73XHPQCC","created_at":"2026-05-18T12:29:05.191682+00:00"},{"alias_kind":"pith_short_8","alias_value":"4FAHX2VQ","created_at":"2026-05-18T12:29:05.191682+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/4FAHX2VQ73XHPQCCAEWOVCDLPT","json":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT.json","graph_json":"https://pith.science/api/pith-number/4FAHX2VQ73XHPQCCAEWOVCDLPT/graph.json","events_json":"https://pith.science/api/pith-number/4FAHX2VQ73XHPQCCAEWOVCDLPT/events.json","paper":"https://pith.science/paper/4FAHX2VQ"},"agent_actions":{"view_html":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT","download_json":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT.json","view_paper":"https://pith.science/paper/4FAHX2VQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.07611&json=true","fetch_graph":"https://pith.science/api/pith-number/4FAHX2VQ73XHPQCCAEWOVCDLPT/graph.json","fetch_events":"https://pith.science/api/pith-number/4FAHX2VQ73XHPQCCAEWOVCDLPT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT/action/storage_attestation","attest_author":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT/action/author_attestation","sign_citation":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT/action/citation_signature","submit_replication":"https://pith.science/pith/4FAHX2VQ73XHPQCCAEWOVCDLPT/action/replication_record"}},"created_at":"2026-05-18T01:32:02.346746+00:00","updated_at":"2026-05-18T01:32:02.346746+00:00"}