{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:EJXUOEZ26J5SZDLVV76WFHT4PU","short_pith_number":"pith:EJXUOEZ2","schema_version":"1.0","canonical_sha256":"226f47133af27b2c8d75affd629e7c7d269523a918a8feeef8c3688e7c557c7e","source":{"kind":"arxiv","id":"2209.02658","version":1},"attestation_state":"computed","paper":{"title":"Group-$k$ Consistent Measurement Set Maximization for Robust Outlier Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brendon Forsgren, Joshua G. Mangelson, Michael Kaess, Ram Vasudevan, Timothy W. McLain","submitted_at":"2022-09-06T17:15:39Z","abstract_excerpt":"This paper presents a method for the robust selection of measurements in a simultaneous localization and mapping (SLAM) framework. Existing methods check consistency or compatibility on a pairwise basis, however many measurement types are not sufficiently constrained in a pairwise scenario to determine if either measurement is inconsistent with the other. This paper presents group-$k$ consistency maximization (G$k$CM) that estimates the largest set of measurements that is internally group-$k$ consistent. Solving for the largest set of group-$k$ consistent measurements can be formulated as an i"},"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":"2209.02658","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2022-09-06T17:15:39Z","cross_cats_sorted":[],"title_canon_sha256":"758a4cf20cfcd96c6c408d360a1ccba2b178a6bc6eeb6aca97bef75143ff0b4e","abstract_canon_sha256":"61c5a7462545401473f309cf1ce9bc197f99b6e57d06f96b63f767f603743f61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:55:13.762250Z","signature_b64":"/sYoIQeY8a1XDN5OjKRl1Uflaors8am6lKLvqG11nmdxsbmcyZjWOL2g6wSKbwzav5hspMYxhrSYCC4SRVKsAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"226f47133af27b2c8d75affd629e7c7d269523a918a8feeef8c3688e7c557c7e","last_reissued_at":"2026-07-05T04:55:13.761825Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:55:13.761825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Group-$k$ Consistent Measurement Set Maximization for Robust Outlier Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Brendon Forsgren, Joshua G. Mangelson, Michael Kaess, Ram Vasudevan, Timothy W. McLain","submitted_at":"2022-09-06T17:15:39Z","abstract_excerpt":"This paper presents a method for the robust selection of measurements in a simultaneous localization and mapping (SLAM) framework. Existing methods check consistency or compatibility on a pairwise basis, however many measurement types are not sufficiently constrained in a pairwise scenario to determine if either measurement is inconsistent with the other. This paper presents group-$k$ consistency maximization (G$k$CM) that estimates the largest set of measurements that is internally group-$k$ consistent. Solving for the largest set of group-$k$ consistent measurements can be formulated as an i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2209.02658","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/2209.02658/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":"2209.02658","created_at":"2026-07-05T04:55:13.761890+00:00"},{"alias_kind":"arxiv_version","alias_value":"2209.02658v1","created_at":"2026-07-05T04:55:13.761890+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2209.02658","created_at":"2026-07-05T04:55:13.761890+00:00"},{"alias_kind":"pith_short_12","alias_value":"EJXUOEZ26J5S","created_at":"2026-07-05T04:55:13.761890+00:00"},{"alias_kind":"pith_short_16","alias_value":"EJXUOEZ26J5SZDLV","created_at":"2026-07-05T04:55:13.761890+00:00"},{"alias_kind":"pith_short_8","alias_value":"EJXUOEZ2","created_at":"2026-07-05T04:55:13.761890+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/EJXUOEZ26J5SZDLVV76WFHT4PU","json":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU.json","graph_json":"https://pith.science/api/pith-number/EJXUOEZ26J5SZDLVV76WFHT4PU/graph.json","events_json":"https://pith.science/api/pith-number/EJXUOEZ26J5SZDLVV76WFHT4PU/events.json","paper":"https://pith.science/paper/EJXUOEZ2"},"agent_actions":{"view_html":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU","download_json":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU.json","view_paper":"https://pith.science/paper/EJXUOEZ2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2209.02658&json=true","fetch_graph":"https://pith.science/api/pith-number/EJXUOEZ26J5SZDLVV76WFHT4PU/graph.json","fetch_events":"https://pith.science/api/pith-number/EJXUOEZ26J5SZDLVV76WFHT4PU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU/action/storage_attestation","attest_author":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU/action/author_attestation","sign_citation":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU/action/citation_signature","submit_replication":"https://pith.science/pith/EJXUOEZ26J5SZDLVV76WFHT4PU/action/replication_record"}},"created_at":"2026-07-05T04:55:13.761890+00:00","updated_at":"2026-07-05T04:55:13.761890+00:00"}