{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:CE3RDJMEEX7CPXWKRWQUFCA6VV","short_pith_number":"pith:CE3RDJME","canonical_record":{"source":{"id":"2308.07420","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-14T19:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"815ac7f0096431494e51711b3901fc2396a5081cc863b726812d5d2cc6cc1c7b","abstract_canon_sha256":"0218a4e845960f170821ebf7e3e1bb196aa5a704fcc0caf5aa6135448e0f02e7"},"schema_version":"1.0"},"canonical_sha256":"113711a58425fe27deca8da142881ead57b60f703b8de87949054fc8854d08cd","source":{"kind":"arxiv","id":"2308.07420","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07420","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07420v1","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07420","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"CE3RDJMEEX7C","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"pith_short_16","alias_value":"CE3RDJMEEX7CPXWK","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"pith_short_8","alias_value":"CE3RDJME","created_at":"2026-07-05T06:41:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:CE3RDJMEEX7CPXWKRWQUFCA6VV","target":"record","payload":{"canonical_record":{"source":{"id":"2308.07420","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-14T19:19:47Z","cross_cats_sorted":[],"title_canon_sha256":"815ac7f0096431494e51711b3901fc2396a5081cc863b726812d5d2cc6cc1c7b","abstract_canon_sha256":"0218a4e845960f170821ebf7e3e1bb196aa5a704fcc0caf5aa6135448e0f02e7"},"schema_version":"1.0"},"canonical_sha256":"113711a58425fe27deca8da142881ead57b60f703b8de87949054fc8854d08cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:41:25.068131Z","signature_b64":"7Zao8QbSdDs6hXDxSeftE7dnvMdBZx/1ufCYwA+bo/9sBIZrhr05+9ESykxbeECUybd7vRXE/j5I6a7Ydxq2AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"113711a58425fe27deca8da142881ead57b60f703b8de87949054fc8854d08cd","last_reissued_at":"2026-07-05T06:41:25.067658Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:41:25.067658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2308.07420","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-07-05T06:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S063V0zFQXETJ/jmmR3kTzjK8q78Lsr2BHH/M+kMaf6idGjBk0ZFQrfr1+3VXI606GwLfZenIVeUNzlTzJa8AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:55:20.555146Z"},"content_sha256":"3bb58f90667783c89163846cbbf7c1b1becf4e577ae17fc6f0d7a96a23042d9a","schema_version":"1.0","event_id":"sha256:3bb58f90667783c89163846cbbf7c1b1becf4e577ae17fc6f0d7a96a23042d9a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:CE3RDJMEEX7CPXWKRWQUFCA6VV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multiple-Hypothesis Path Planning with Uncertain Object Detections","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aaron Peng, Beatriz Asfora, Brian H. Wang, Jacopo Banfi, Mark Campbell, Rachel Zheng","submitted_at":"2023-08-14T19:19:47Z","abstract_excerpt":"Path planning in obstacle-dense environments is a key challenge in robotics, and depends on inferring scene attributes and associated uncertainties. We present a multiple-hypothesis path planner designed to navigate complex environments using obstacle detections. Path hypotheses are generated by reasoning about uncertainty and range, as initial detections are typically at far ranges with high uncertainty, before subsequent detections reduce this uncertainty. Given estimated obstacles, we build a graph of pairwise connections between objects based on the probability that the robot can safely pa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07420","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/2308.07420/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-07-05T06:41:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jftIvlemlygDj31xMKK4g+m60em81Me7TvYjJtAXdUofvRj+AaPSQ211IxRUa8A0rZKk/xIrBYhMy6g8vew1Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T12:55:20.555674Z"},"content_sha256":"9279c4da58a08ed0a08d9c5151830b4eca36dc73d61c62fcec9fd524d069aaa7","schema_version":"1.0","event_id":"sha256:9279c4da58a08ed0a08d9c5151830b4eca36dc73d61c62fcec9fd524d069aaa7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV/bundle.json","state_url":"https://pith.science/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV/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-08T12:55:20Z","links":{"resolver":"https://pith.science/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV","bundle":"https://pith.science/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV/bundle.json","state":"https://pith.science/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CE3RDJMEEX7CPXWKRWQUFCA6VV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:CE3RDJMEEX7CPXWKRWQUFCA6VV","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":"0218a4e845960f170821ebf7e3e1bb196aa5a704fcc0caf5aa6135448e0f02e7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-14T19:19:47Z","title_canon_sha256":"815ac7f0096431494e51711b3901fc2396a5081cc863b726812d5d2cc6cc1c7b"},"schema_version":"1.0","source":{"id":"2308.07420","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2308.07420","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"arxiv_version","alias_value":"2308.07420v1","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.07420","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"pith_short_12","alias_value":"CE3RDJMEEX7C","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"pith_short_16","alias_value":"CE3RDJMEEX7CPXWK","created_at":"2026-07-05T06:41:25Z"},{"alias_kind":"pith_short_8","alias_value":"CE3RDJME","created_at":"2026-07-05T06:41:25Z"}],"graph_snapshots":[{"event_id":"sha256:9279c4da58a08ed0a08d9c5151830b4eca36dc73d61c62fcec9fd524d069aaa7","target":"graph","created_at":"2026-07-05T06:41:25Z","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/2308.07420/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Path planning in obstacle-dense environments is a key challenge in robotics, and depends on inferring scene attributes and associated uncertainties. We present a multiple-hypothesis path planner designed to navigate complex environments using obstacle detections. Path hypotheses are generated by reasoning about uncertainty and range, as initial detections are typically at far ranges with high uncertainty, before subsequent detections reduce this uncertainty. Given estimated obstacles, we build a graph of pairwise connections between objects based on the probability that the robot can safely pa","authors_text":"Aaron Peng, Beatriz Asfora, Brian H. Wang, Jacopo Banfi, Mark Campbell, Rachel Zheng","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-14T19:19:47Z","title":"Multiple-Hypothesis Path Planning with Uncertain Object Detections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.07420","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:3bb58f90667783c89163846cbbf7c1b1becf4e577ae17fc6f0d7a96a23042d9a","target":"record","created_at":"2026-07-05T06:41:25Z","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":"0218a4e845960f170821ebf7e3e1bb196aa5a704fcc0caf5aa6135448e0f02e7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2023-08-14T19:19:47Z","title_canon_sha256":"815ac7f0096431494e51711b3901fc2396a5081cc863b726812d5d2cc6cc1c7b"},"schema_version":"1.0","source":{"id":"2308.07420","kind":"arxiv","version":1}},"canonical_sha256":"113711a58425fe27deca8da142881ead57b60f703b8de87949054fc8854d08cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"113711a58425fe27deca8da142881ead57b60f703b8de87949054fc8854d08cd","first_computed_at":"2026-07-05T06:41:25.067658Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:41:25.067658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7Zao8QbSdDs6hXDxSeftE7dnvMdBZx/1ufCYwA+bo/9sBIZrhr05+9ESykxbeECUybd7vRXE/j5I6a7Ydxq2AQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:41:25.068131Z","signed_message":"canonical_sha256_bytes"},"source_id":"2308.07420","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3bb58f90667783c89163846cbbf7c1b1becf4e577ae17fc6f0d7a96a23042d9a","sha256:9279c4da58a08ed0a08d9c5151830b4eca36dc73d61c62fcec9fd524d069aaa7"],"state_sha256":"7b3dba0fdbddd6314f31cdb0b2d94bb0d738ccdea1df7b602774170d9110ecc5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XYDXRd8RIOnFGH4iqgsKZ9Zn6Z1YObIjCgOY6WpS2zf0bWrH5pBGpWMv1d2bcocUerfpUv2SNo/nY24Qb5FUCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T12:55:20.560587Z","bundle_sha256":"122f5ebd6ce1d7382fb5bf5f2d858e583f02ea6a20f4cc1b2f1873b4c33d4fac"}}