{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:OYUCD7UQ5BFGNABIRO2JRCENJR","short_pith_number":"pith:OYUCD7UQ","schema_version":"1.0","canonical_sha256":"762821fe90e84a6680288bb498888d4c61863c1121ae2d78c8ce64225f2c6bc2","source":{"kind":"arxiv","id":"2511.21666","version":2},"attestation_state":"computed","paper":{"title":"Uncertainty Quantification for Visual Object Pose Estimation: S-Lemma Ellipsoidal Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Charis Georgiou, Lorenzo Shaikewitz, Luca Carlone","submitted_at":"2025-11-26T18:39:44Z","abstract_excerpt":"Quantifying the uncertainty of an object's pose estimate is essential for robust control and planning. Although pose estimation is a well-studied robotics problem, attaching statistically rigorous uncertainty is not well understood without strict distributional assumptions. We develop distribution-free pose uncertainty bounds about a given pose estimate in the monocular setting. Our pose uncertainty only requires high probability noise bounds on pixel detections of 2D semantic keypoints on a known object. This noise model induces an implicit, non-convex set of pose uncertainty constraints. Our"},"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":"2511.21666","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2025-11-26T18:39:44Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7774e6e1a2b0d126529f3b9eb5b5c1fd9395c7563eb448b8cdb0735ad9e27ff4","abstract_canon_sha256":"ac0084e6d4241aa5c9c08bb25529a36b88f79eca99d92f86fa7722b4b6840104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T02:09:15.267382Z","signature_b64":"Vk9iFrE9Oi67Ka1TaG1+2a+5YCXUBkIb9vCAhhegyQzUr1VrVZQSA0YHy9JUBz8kxG4P1qp9aDS/stYPfd44DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"762821fe90e84a6680288bb498888d4c61863c1121ae2d78c8ce64225f2c6bc2","last_reissued_at":"2026-08-04T02:09:15.265692Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T02:09:15.265692Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Uncertainty Quantification for Visual Object Pose Estimation: S-Lemma Ellipsoidal Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Charis Georgiou, Lorenzo Shaikewitz, Luca Carlone","submitted_at":"2025-11-26T18:39:44Z","abstract_excerpt":"Quantifying the uncertainty of an object's pose estimate is essential for robust control and planning. Although pose estimation is a well-studied robotics problem, attaching statistically rigorous uncertainty is not well understood without strict distributional assumptions. We develop distribution-free pose uncertainty bounds about a given pose estimate in the monocular setting. Our pose uncertainty only requires high probability noise bounds on pixel detections of 2D semantic keypoints on a known object. This noise model induces an implicit, non-convex set of pose uncertainty constraints. Our"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2511.21666","kind":"arxiv","version":2},"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/2511.21666/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":"2511.21666","created_at":"2026-08-04T02:09:15.267170+00:00"},{"alias_kind":"arxiv_version","alias_value":"2511.21666v2","created_at":"2026-08-04T02:09:15.267170+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2511.21666","created_at":"2026-08-04T02:09:15.267170+00:00"},{"alias_kind":"pith_short_12","alias_value":"OYUCD7UQ5BFG","created_at":"2026-08-04T02:09:15.267170+00:00"},{"alias_kind":"pith_short_16","alias_value":"OYUCD7UQ5BFGNABI","created_at":"2026-08-04T02:09:15.267170+00:00"},{"alias_kind":"pith_short_8","alias_value":"OYUCD7UQ","created_at":"2026-08-04T02:09:15.267170+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.28172","citing_title":"Provably Guaranteed Polytopic Uncertainty Quantification for SLAM","ref_index":22,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR","json":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR.json","graph_json":"https://pith.science/api/pith-number/OYUCD7UQ5BFGNABIRO2JRCENJR/graph.json","events_json":"https://pith.science/api/pith-number/OYUCD7UQ5BFGNABIRO2JRCENJR/events.json","paper":"https://pith.science/paper/OYUCD7UQ"},"agent_actions":{"view_html":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR","download_json":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR.json","view_paper":"https://pith.science/paper/OYUCD7UQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2511.21666&json=true","fetch_graph":"https://pith.science/api/pith-number/OYUCD7UQ5BFGNABIRO2JRCENJR/graph.json","fetch_events":"https://pith.science/api/pith-number/OYUCD7UQ5BFGNABIRO2JRCENJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR/action/storage_attestation","attest_author":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR/action/author_attestation","sign_citation":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR/action/citation_signature","submit_replication":"https://pith.science/pith/OYUCD7UQ5BFGNABIRO2JRCENJR/action/replication_record"}},"created_at":"2026-08-04T02:09:15.267170+00:00","updated_at":"2026-08-04T02:09:15.267170+00:00"}