{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:BPT56OLQ46MHJIIJIIUV5NTB75","short_pith_number":"pith:BPT56OLQ","canonical_record":{"source":{"id":"1608.02052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-06T02:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"940d274a7b33dfd202b9a6a844090022f22f0718a02cec343347e461600450ea","abstract_canon_sha256":"85fbf734e64f29dd247d3d8edfc428c2f3310ef7ce8a6769d25ca356d7a21657"},"schema_version":"1.0"},"canonical_sha256":"0be7df3970e79874a10942295eb661ff712255bf6497a949dc68e0152fff8b4f","source":{"kind":"arxiv","id":"1608.02052","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02052","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02052v1","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02052","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"BPT56OLQ46MH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BPT56OLQ46MHJIIJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BPT56OLQ","created_at":"2026-05-18T12:30:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:BPT56OLQ46MHJIIJIIUV5NTB75","target":"record","payload":{"canonical_record":{"source":{"id":"1608.02052","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-06T02:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"940d274a7b33dfd202b9a6a844090022f22f0718a02cec343347e461600450ea","abstract_canon_sha256":"85fbf734e64f29dd247d3d8edfc428c2f3310ef7ce8a6769d25ca356d7a21657"},"schema_version":"1.0"},"canonical_sha256":"0be7df3970e79874a10942295eb661ff712255bf6497a949dc68e0152fff8b4f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:09:41.064478Z","signature_b64":"8UjTX6HTMIfz1MhAPdui613fCwc37WEqhxLblQU3f13ylpe13m9O1FchJ5top6JVj/n2ZgWYjdDaBL+u9PaICg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0be7df3970e79874a10942295eb661ff712255bf6497a949dc68e0152fff8b4f","last_reissued_at":"2026-05-18T01:09:41.064005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:09:41.064005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.02052","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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7IGlETEGm1NPz/X0wKznM7E3zUSwmv/obdGuP8J5aj3FQG3HCI2+x03CZ37kZSZGP6h3+UJ/lK7KfClu350YAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:22:14.615009Z"},"content_sha256":"a48774b71fedfdec86ec1286e9ae75bb97ce1531b084f630063655ce597a460e","schema_version":"1.0","event_id":"sha256:a48774b71fedfdec86ec1286e9ae75bb97ce1531b084f630063655ce597a460e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:BPT56OLQ46MHJIIJIIUV5NTB75","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-Model Hypothesize-and-Verify Approach for Incremental Loop Closure Verification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Kanji Tanaka","submitted_at":"2016-08-06T02:06:23Z","abstract_excerpt":"Loop closure detection, which is the task of identifying locations revisited by a robot in a sequence of odometry and perceptual observations, is typically formulated as a visual place recognition (VPR) task. However, even state-of-the-art VPR techniques generate a considerable number of false positives as a result of confusing visual features and perceptual aliasing. In this paper, we propose a robust incremental framework for loop closure detection, termed incremental loop closure verification. Our approach reformulates the problem of loop closure detection as an instance of a multi-model hy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02052","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-18T01:09:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iELy+6w2YYcaYJh2/Dw0/apk7+ldpdyhdk1WwaUav4MzX7cUKpLLWKaP+DQA3UiJ3fwZyZeQ+ddlylPlAAoiBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:22:14.615364Z"},"content_sha256":"ce673d8cb6e69e0e3f23a130ba709bedb031bb75493141a43fb184a5297eaa4d","schema_version":"1.0","event_id":"sha256:ce673d8cb6e69e0e3f23a130ba709bedb031bb75493141a43fb184a5297eaa4d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BPT56OLQ46MHJIIJIIUV5NTB75/bundle.json","state_url":"https://pith.science/pith/BPT56OLQ46MHJIIJIIUV5NTB75/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BPT56OLQ46MHJIIJIIUV5NTB75/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-06-11T13:22:14Z","links":{"resolver":"https://pith.science/pith/BPT56OLQ46MHJIIJIIUV5NTB75","bundle":"https://pith.science/pith/BPT56OLQ46MHJIIJIIUV5NTB75/bundle.json","state":"https://pith.science/pith/BPT56OLQ46MHJIIJIIUV5NTB75/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BPT56OLQ46MHJIIJIIUV5NTB75/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:BPT56OLQ46MHJIIJIIUV5NTB75","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":"85fbf734e64f29dd247d3d8edfc428c2f3310ef7ce8a6769d25ca356d7a21657","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-06T02:06:23Z","title_canon_sha256":"940d274a7b33dfd202b9a6a844090022f22f0718a02cec343347e461600450ea"},"schema_version":"1.0","source":{"id":"1608.02052","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.02052","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"arxiv_version","alias_value":"1608.02052v1","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.02052","created_at":"2026-05-18T01:09:41Z"},{"alias_kind":"pith_short_12","alias_value":"BPT56OLQ46MH","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_16","alias_value":"BPT56OLQ46MHJIIJ","created_at":"2026-05-18T12:30:07Z"},{"alias_kind":"pith_short_8","alias_value":"BPT56OLQ","created_at":"2026-05-18T12:30:07Z"}],"graph_snapshots":[{"event_id":"sha256:ce673d8cb6e69e0e3f23a130ba709bedb031bb75493141a43fb184a5297eaa4d","target":"graph","created_at":"2026-05-18T01:09:41Z","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":"Loop closure detection, which is the task of identifying locations revisited by a robot in a sequence of odometry and perceptual observations, is typically formulated as a visual place recognition (VPR) task. However, even state-of-the-art VPR techniques generate a considerable number of false positives as a result of confusing visual features and perceptual aliasing. In this paper, we propose a robust incremental framework for loop closure detection, termed incremental loop closure verification. Our approach reformulates the problem of loop closure detection as an instance of a multi-model hy","authors_text":"Kanji Tanaka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-06T02:06:23Z","title":"Multi-Model Hypothesize-and-Verify Approach for Incremental Loop Closure Verification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.02052","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:a48774b71fedfdec86ec1286e9ae75bb97ce1531b084f630063655ce597a460e","target":"record","created_at":"2026-05-18T01:09:41Z","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":"85fbf734e64f29dd247d3d8edfc428c2f3310ef7ce8a6769d25ca356d7a21657","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2016-08-06T02:06:23Z","title_canon_sha256":"940d274a7b33dfd202b9a6a844090022f22f0718a02cec343347e461600450ea"},"schema_version":"1.0","source":{"id":"1608.02052","kind":"arxiv","version":1}},"canonical_sha256":"0be7df3970e79874a10942295eb661ff712255bf6497a949dc68e0152fff8b4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0be7df3970e79874a10942295eb661ff712255bf6497a949dc68e0152fff8b4f","first_computed_at":"2026-05-18T01:09:41.064005Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:09:41.064005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8UjTX6HTMIfz1MhAPdui613fCwc37WEqhxLblQU3f13ylpe13m9O1FchJ5top6JVj/n2ZgWYjdDaBL+u9PaICg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:09:41.064478Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.02052","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a48774b71fedfdec86ec1286e9ae75bb97ce1531b084f630063655ce597a460e","sha256:ce673d8cb6e69e0e3f23a130ba709bedb031bb75493141a43fb184a5297eaa4d"],"state_sha256":"b21bd9eeb23a8d78dbc18d58d1507ad1a765cab23dd41e1f2997a2f7026c9126"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gqAcqsFGFXik2yacZWwXiyurYy9G9sNEJDhx5+8YpgG6ZPNcqBUdnl9EBnlVXxns+T61GDs4duaUlsf98xuvDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:22:14.748837Z","bundle_sha256":"1a1913efd45e3335ebff8187d667dadaebf9d7f7193c3c75f8285fe4397ae628"}}