{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:AR5EJSRZI6PHBP53DYXGFIYHTP","short_pith_number":"pith:AR5EJSRZ","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"},"canonical_sha256":"047a44ca39479e70bfbb1e2e62a3079bdd68d6e588866be4457069cf4ac537bd","source":{"kind":"arxiv","id":"2608.00822","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00822","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00822v1","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00822","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"pith_short_12","alias_value":"AR5EJSRZI6PH","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"pith_short_16","alias_value":"AR5EJSRZI6PHBP53","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"pith_short_8","alias_value":"AR5EJSRZ","created_at":"2026-08-04T01:55:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:AR5EJSRZI6PHBP53DYXGFIYHTP","target":"record","payload":{"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"},"canonical_sha256":"047a44ca39479e70bfbb1e2e62a3079bdd68d6e588866be4457069cf4ac537bd","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"},"source_kind":"arxiv","source_id":"2608.00822","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-08-04T01:55:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o1Z1l7CL647W8l7jK2VeCDhvuXKFn4QNwfH40EPFNNYKjzltsIUYyZG+Hv8ndsYMWyIg09x3cq/d4cGRoB2+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:52:58.610525Z"},"content_sha256":"250c05052b51298499bb0ced345d3fcb4aab21e02d2893f381495cc6fc72a3e3","schema_version":"1.0","event_id":"sha256:250c05052b51298499bb0ced345d3fcb4aab21e02d2893f381495cc6fc72a3e3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:AR5EJSRZI6PHBP53DYXGFIYHTP","target":"graph","payload":{"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"},"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-08-04T01:55:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzcjTeUQeJt8Tyx2P9BLB69uvKlBv8mO8yrWBBwtKFnvCaYirnDd8b7hfegRpuz7RGLHD8sD5Dwzlc39M13HDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-05T09:52:58.611087Z"},"content_sha256":"389595b2acc78420e8d6acf7a8396943b0fad0db394ee58c531208c2784ab818","schema_version":"1.0","event_id":"sha256:389595b2acc78420e8d6acf7a8396943b0fad0db394ee58c531208c2784ab818"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/bundle.json","state_url":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/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-08-05T09:52:58Z","links":{"resolver":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP","bundle":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/bundle.json","state":"https://pith.science/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AR5EJSRZI6PHBP53DYXGFIYHTP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:AR5EJSRZI6PHBP53DYXGFIYHTP","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":"6036dd2cbe93f1ec8f3841318dd7c6c7d53f85a247b4fb99b9ce58e4cf7437e7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-08-01T18:59:52Z","title_canon_sha256":"6c52c08dc270ede49e76e6ce7710b140a84f214b718d52d56c2599c763894b58"},"schema_version":"1.0","source":{"id":"2608.00822","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2608.00822","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"arxiv_version","alias_value":"2608.00822v1","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.00822","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"pith_short_12","alias_value":"AR5EJSRZI6PH","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"pith_short_16","alias_value":"AR5EJSRZI6PHBP53","created_at":"2026-08-04T01:55:12Z"},{"alias_kind":"pith_short_8","alias_value":"AR5EJSRZ","created_at":"2026-08-04T01:55:12Z"}],"graph_snapshots":[{"event_id":"sha256:389595b2acc78420e8d6acf7a8396943b0fad0db394ee58c531208c2784ab818","target":"graph","created_at":"2026-08-04T01:55:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2608.00822/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Ahmed Nadar, Irfan Hussain, Jan Rosell, Muhayy Ud Din","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-08-01T18:59:52Z","title":"RIT*: Riemannian Informed Trees for Cost-Adaptive Optimal Motion Planning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.00822","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:250c05052b51298499bb0ced345d3fcb4aab21e02d2893f381495cc6fc72a3e3","target":"record","created_at":"2026-08-04T01:55:12Z","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":"6036dd2cbe93f1ec8f3841318dd7c6c7d53f85a247b4fb99b9ce58e4cf7437e7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2026-08-01T18:59:52Z","title_canon_sha256":"6c52c08dc270ede49e76e6ce7710b140a84f214b718d52d56c2599c763894b58"},"schema_version":"1.0","source":{"id":"2608.00822","kind":"arxiv","version":1}},"canonical_sha256":"047a44ca39479e70bfbb1e2e62a3079bdd68d6e588866be4457069cf4ac537bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"047a44ca39479e70bfbb1e2e62a3079bdd68d6e588866be4457069cf4ac537bd","first_computed_at":"2026-08-04T01:55:12.576662Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-08-04T01:55:12.576662Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0J09eDwHW7OgVqu5yk6nAsu370FYisLsQc/N41F9tV/l1cIDUegwqT97ubPlm9MHgEfnhGW/fRkeAUElxdIVDg==","signature_status":"signed_v1","signed_at":"2026-08-04T01:55:12.578204Z","signed_message":"canonical_sha256_bytes"},"source_id":"2608.00822","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:250c05052b51298499bb0ced345d3fcb4aab21e02d2893f381495cc6fc72a3e3","sha256:389595b2acc78420e8d6acf7a8396943b0fad0db394ee58c531208c2784ab818"],"state_sha256":"dbb668814fd189cec474f86d2974ff0498395d11e5d49029a575e117cf7a89be"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5uUn93sxF74KzAd5oNHEQt9Ky54HfEbGTytReSuLxHG3LS7E4BBbKwVaNRMIIFSgJiIhjzUc7JkS9E3BKqf6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-05T09:52:58.618705Z","bundle_sha256":"aa2060b0cc9b5b575edf7d3d378ff263ed62f96e18645edda4975dc63f1e0199"}}