{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VCZTB7DNGXVBA65NL3MNKP7YBC","short_pith_number":"pith:VCZTB7DN","canonical_record":{"source":{"id":"1701.08921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-01-31T05:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"491f97897c58cf352db4ded66d00fd9215b2aa1b7a7b409dfec92b7920dba149","abstract_canon_sha256":"1f58de63f03e5378e2a056dbd6f30e7c047b5ca563d3dda0bbc4434d0e583e71"},"schema_version":"1.0"},"canonical_sha256":"a8b330fc6d35ea107bad5ed8d53ff8089e9d4a5985cb5366de161b21575a8a59","source":{"kind":"arxiv","id":"1701.08921","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08921","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08921v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08921","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"VCZTB7DNGXVB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VCZTB7DNGXVBA65N","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VCZTB7DN","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VCZTB7DNGXVBA65NL3MNKP7YBC","target":"record","payload":{"canonical_record":{"source":{"id":"1701.08921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-01-31T05:32:09Z","cross_cats_sorted":[],"title_canon_sha256":"491f97897c58cf352db4ded66d00fd9215b2aa1b7a7b409dfec92b7920dba149","abstract_canon_sha256":"1f58de63f03e5378e2a056dbd6f30e7c047b5ca563d3dda0bbc4434d0e583e71"},"schema_version":"1.0"},"canonical_sha256":"a8b330fc6d35ea107bad5ed8d53ff8089e9d4a5985cb5366de161b21575a8a59","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:38.894582Z","signature_b64":"KbhC0a9qyJ8EwzQh4VUMpCQ3JBtHuWFCMe2FnNLIvgY/0cakIFtVATnF3x69nb315VDDFO5BDgY7cm/ERb9hBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8b330fc6d35ea107bad5ed8d53ff8089e9d4a5985cb5366de161b21575a8a59","last_reissued_at":"2026-05-18T00:51:38.894038Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:38.894038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1701.08921","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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1AeuqmYHgjXSQDJibLN2TsFwWJ4oqzsFCW73dZIxIgkpUxGxvaDNRNbO1oGDN/aQOpOeep5i4b2Nxm3o2aVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:19.565116Z"},"content_sha256":"519ff49589c390329d05265074e2c7a3353c6e5e47567ef3a5ab832f1fedce35","schema_version":"1.0","event_id":"sha256:519ff49589c390329d05265074e2c7a3353c6e5e47567ef3a5ab832f1fedce35"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VCZTB7DNGXVBA65NL3MNKP7YBC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Optimization for Robust and Efficient Loop Closing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Guoquan Huang, John Leonard, Jose Neira, Yasir Latif","submitted_at":"2017-01-31T05:32:09Z","abstract_excerpt":"It is essential for a robot to be able to detect revisits or loop closures for long-term visual navigation.A key insight explored in this work is that the loop-closing event inherently occurs sparsely, that is, the image currently being taken matches with only a small subset (if any) of previous images. Based on this observation, we formulate the problem of loop-closure detection as a sparse, convex $\\ell_1$-minimization problem. By leveraging fast convex optimization techniques, we are able to efficiently find loop closures, thus enabling real-time robot navigation. This novel formulation req"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08921","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-18T00:51:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XGamzUSiPbuZOxGWB7ielFILiqIb3J402KrbWgtcvPxiJR4OZLcOnQHxjEnYQsl23M5NKgCL5BI5qYN4wuDuCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T14:28:19.565761Z"},"content_sha256":"454e877865a37f0f4e9712cb2c848806980dd7fb981c754afdad48e564a5bedf","schema_version":"1.0","event_id":"sha256:454e877865a37f0f4e9712cb2c848806980dd7fb981c754afdad48e564a5bedf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VCZTB7DNGXVBA65NL3MNKP7YBC/bundle.json","state_url":"https://pith.science/pith/VCZTB7DNGXVBA65NL3MNKP7YBC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VCZTB7DNGXVBA65NL3MNKP7YBC/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-31T14:28:19Z","links":{"resolver":"https://pith.science/pith/VCZTB7DNGXVBA65NL3MNKP7YBC","bundle":"https://pith.science/pith/VCZTB7DNGXVBA65NL3MNKP7YBC/bundle.json","state":"https://pith.science/pith/VCZTB7DNGXVBA65NL3MNKP7YBC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VCZTB7DNGXVBA65NL3MNKP7YBC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VCZTB7DNGXVBA65NL3MNKP7YBC","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":"1f58de63f03e5378e2a056dbd6f30e7c047b5ca563d3dda0bbc4434d0e583e71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-01-31T05:32:09Z","title_canon_sha256":"491f97897c58cf352db4ded66d00fd9215b2aa1b7a7b409dfec92b7920dba149"},"schema_version":"1.0","source":{"id":"1701.08921","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1701.08921","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"arxiv_version","alias_value":"1701.08921v1","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1701.08921","created_at":"2026-05-18T00:51:38Z"},{"alias_kind":"pith_short_12","alias_value":"VCZTB7DNGXVB","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VCZTB7DNGXVBA65N","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VCZTB7DN","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:454e877865a37f0f4e9712cb2c848806980dd7fb981c754afdad48e564a5bedf","target":"graph","created_at":"2026-05-18T00:51:38Z","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":"It is essential for a robot to be able to detect revisits or loop closures for long-term visual navigation.A key insight explored in this work is that the loop-closing event inherently occurs sparsely, that is, the image currently being taken matches with only a small subset (if any) of previous images. Based on this observation, we formulate the problem of loop-closure detection as a sparse, convex $\\ell_1$-minimization problem. By leveraging fast convex optimization techniques, we are able to efficiently find loop closures, thus enabling real-time robot navigation. This novel formulation req","authors_text":"Guoquan Huang, John Leonard, Jose Neira, Yasir Latif","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-01-31T05:32:09Z","title":"Sparse Optimization for Robust and Efficient Loop Closing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1701.08921","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:519ff49589c390329d05265074e2c7a3353c6e5e47567ef3a5ab832f1fedce35","target":"record","created_at":"2026-05-18T00:51:38Z","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":"1f58de63f03e5378e2a056dbd6f30e7c047b5ca563d3dda0bbc4434d0e583e71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2017-01-31T05:32:09Z","title_canon_sha256":"491f97897c58cf352db4ded66d00fd9215b2aa1b7a7b409dfec92b7920dba149"},"schema_version":"1.0","source":{"id":"1701.08921","kind":"arxiv","version":1}},"canonical_sha256":"a8b330fc6d35ea107bad5ed8d53ff8089e9d4a5985cb5366de161b21575a8a59","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8b330fc6d35ea107bad5ed8d53ff8089e9d4a5985cb5366de161b21575a8a59","first_computed_at":"2026-05-18T00:51:38.894038Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:38.894038Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KbhC0a9qyJ8EwzQh4VUMpCQ3JBtHuWFCMe2FnNLIvgY/0cakIFtVATnF3x69nb315VDDFO5BDgY7cm/ERb9hBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:38.894582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1701.08921","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:519ff49589c390329d05265074e2c7a3353c6e5e47567ef3a5ab832f1fedce35","sha256:454e877865a37f0f4e9712cb2c848806980dd7fb981c754afdad48e564a5bedf"],"state_sha256":"2cfe46242ba1de11d50bc437e4a2aa3a6027c502c5325d0b2a566f18d4636850"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WpgIfB25MDB2HHetErmsabd/qx3L9g4/BGbZoZa+KD6f0Vm4ktVyciz9AWu/JRUGc2Sdc1UgFrQwRF7emI/7Bg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T14:28:19.569442Z","bundle_sha256":"4a6573fed0ca0ba797c33f64608b030c16852fcb71c6a68d556e08a1a2059a58"}}