{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AR5EJSRZI6PHBP53DYXGFIYHTP","short_pith_number":"pith:AR5EJSRZ","schema_version":"1.0","canonical_sha256":"047a44ca39479e70bfbb1e2e62a3079bdd68d6e588866be4457069cf4ac537bd","source":{"kind":"arxiv","id":"2608.00822","version":1},"attestation_state":"computed","paper":{"title":"RIT*: Riemannian Informed Trees for Cost-Adaptive Optimal Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ahmed Nadar, Irfan Hussain, Jan Rosell, Muhayy Ud Din","submitted_at":"2026-08-01T18:59:52Z","abstract_excerpt":"We present Riemannian Informed Trees (RIT*), a planning framework that replaces Euclidean primitives in batch-informed search with their Riemannian counterparts. RIT* constructs a tighter, cost-consistent informed set, performs a nearest-neighbour search under an anisotropic distance metric, and evaluates edge costs efficiently via a cascading scheme. We further introduce a Collision-Adaptive Metric Refinement (CARM), which learns an obstacle-proximity cost field online from collision feedback, reducing the reliance on prior metric design in practical settings. Experiments across environments "},"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":"2608.00822","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-08-01T18:59:52Z","cross_cats_sorted":[],"title_canon_sha256":"6c52c08dc270ede49e76e6ce7710b140a84f214b718d52d56c2599c763894b58","abstract_canon_sha256":"6036dd2cbe93f1ec8f3841318dd7c6c7d53f85a247b4fb99b9ce58e4cf7437e7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-04T01:55:12.578204Z","signature_b64":"0J09eDwHW7OgVqu5yk6nAsu370FYisLsQc/N41F9tV/l1cIDUegwqT97ubPlm9MHgEfnhGW/fRkeAUElxdIVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"047a44ca39479e70bfbb1e2e62a3079bdd68d6e588866be4457069cf4ac537bd","last_reissued_at":"2026-08-04T01:55:12.576662Z","signature_status":"signed_v1","first_computed_at":"2026-08-04T01:55:12.576662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RIT*: Riemannian Informed Trees for Cost-Adaptive Optimal Motion Planning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Ahmed Nadar, Irfan Hussain, Jan Rosell, Muhayy Ud Din","submitted_at":"2026-08-01T18:59:52Z","abstract_excerpt":"We present Riemannian Informed Trees (RIT*), a planning framework that replaces Euclidean primitives in batch-informed search with their Riemannian counterparts. RIT* constructs a tighter, cost-consistent informed set, performs a nearest-neighbour search under an anisotropic distance metric, and evaluates edge costs efficiently via a cascading scheme. We further introduce a Collision-Adaptive Metric Refinement (CARM), which learns an obstacle-proximity cost field online from collision feedback, reducing the reliance on prior metric design in practical settings. Experiments across environments "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00822","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/2608.00822/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":"2608.00822","created_at":"2026-08-04T01:55:12.577965+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.00822v1","created_at":"2026-08-04T01:55:12.577965+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00822","created_at":"2026-08-04T01:55:12.577965+00:00"},{"alias_kind":"pith_short_12","alias_value":"AR5EJSRZI6PH","created_at":"2026-08-04T01:55:12.577965+00:00"},{"alias_kind":"pith_short_16","alias_value":"AR5EJSRZI6PHBP53","created_at":"2026-08-04T01:55:12.577965+00:00"},{"alias_kind":"pith_short_8","alias_value":"AR5EJSRZ","created_at":"2026-08-04T01:55:12.577965+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/AR5EJSRZI6PHBP53DYXGFIYHTP","json":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP.json","graph_json":"https://pith.science/api/pith-number/AR5EJSRZI6PHBP53DYXGFIYHTP/graph.json","events_json":"https://pith.science/api/pith-number/AR5EJSRZI6PHBP53DYXGFIYHTP/events.json","paper":"https://pith.science/paper/AR5EJSRZ"},"agent_actions":{"view_html":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP","download_json":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP.json","view_paper":"https://pith.science/paper/AR5EJSRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.00822&json=true","fetch_graph":"https://pith.science/api/pith-number/AR5EJSRZI6PHBP53DYXGFIYHTP/graph.json","fetch_events":"https://pith.science/api/pith-number/AR5EJSRZI6PHBP53DYXGFIYHTP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/action/storage_attestation","attest_author":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/action/author_attestation","sign_citation":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/action/citation_signature","submit_replication":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/action/replication_record"}},"created_at":"2026-08-04T01:55:12.577965+00:00","updated_at":"2026-08-04T01:55:12.577965+00:00"}