{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XM7S57L4PVTWJUDHJLDYOPLCC5","short_pith_number":"pith:XM7S57L4","canonical_record":{"source":{"id":"2403.14605","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-21T17:54:56Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"5e1252cf73e40c11544fdfe820bac7a2d6f64e949a78b9795d193a184df345b1","abstract_canon_sha256":"86a0e5eff9ec3ca7e87eb9c6548f0c105f47275eca7299a32a1a67fc1dc56fb8"},"schema_version":"1.0"},"canonical_sha256":"bb3f2efd7c7d6764d0674ac7873d62176d5de22eab92d42c541c50c19f6ae1ac","source":{"kind":"arxiv","id":"2403.14605","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.14605","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"2403.14605v1","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14605","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"XM7S57L4PVTW","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"pith_short_16","alias_value":"XM7S57L4PVTWJUDH","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"pith_short_8","alias_value":"XM7S57L4","created_at":"2026-07-05T07:59:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XM7S57L4PVTWJUDHJLDYOPLCC5","target":"record","payload":{"canonical_record":{"source":{"id":"2403.14605","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-21T17:54:56Z","cross_cats_sorted":["cs.SY","eess.SY"],"title_canon_sha256":"5e1252cf73e40c11544fdfe820bac7a2d6f64e949a78b9795d193a184df345b1","abstract_canon_sha256":"86a0e5eff9ec3ca7e87eb9c6548f0c105f47275eca7299a32a1a67fc1dc56fb8"},"schema_version":"1.0"},"canonical_sha256":"bb3f2efd7c7d6764d0674ac7873d62176d5de22eab92d42c541c50c19f6ae1ac","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:59:11.283791Z","signature_b64":"Vr2M0dYf3Zbn0KEZE2WWSLsdcp6TnoAsPA2mhNUy4M6sDeIM4KxACcPXWyyNg2PJ46wDL2xcQq7BzYIYntOyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb3f2efd7c7d6764d0674ac7873d62176d5de22eab92d42c541c50c19f6ae1ac","last_reissued_at":"2026-07-05T07:59:11.283330Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:59:11.283330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.14605","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-05T07:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"op5b9rMacXeBcN+OTX9kNZL2fniXIgXqBli7aA/pgBkEKwKAhYjBr5qL33XpR5M2MzaDbttpknPVnajAUp5WDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:37:13.958011Z"},"content_sha256":"febbf226c53a43cbbe0bfa73fe85cdad802470a3bc17d8e652da880fb944db05","schema_version":"1.0","event_id":"sha256:febbf226c53a43cbbe0bfa73fe85cdad802470a3bc17d8e652da880fb944db05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XM7S57L4PVTWJUDHJLDYOPLCC5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"SDP Synthesis of Maximum Coverage Trees for Probabilistic Planning under Control Constraints","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Jonathan P. How, Naman Aggarwal","submitted_at":"2024-03-21T17:54:56Z","abstract_excerpt":"The paper presents Maximal Covariance Backward Reachable Trees (MAXCOVAR BRT), which is a multi-query algorithm for planning of dynamic systems under stochastic motion uncertainty and constraints on the control input with explicit coverage guarantees. In contrast to existing roadmap-based probabilistic planning methods that sample belief nodes randomly and draw edges between them \\cite{csbrm_tro2024}, under control constraints, the reachability of belief nodes needs to be explicitly established and is determined by checking the feasibility of a non-convex program. Moreover, there is no explici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14605","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/2403.14605/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-05T07:59:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"l5OaLkzalr9rtm28/AWNVM4Jiqk/KYfGxYaCQp750wd+Tj8cA/PQ7ZbneXIiBwoQPi/O17BCWFt4l3pRxnWJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T01:37:13.958582Z"},"content_sha256":"532d437ce95ada083ba768ee3a3e299385b4822a21448375d0a2143fc6c823c1","schema_version":"1.0","event_id":"sha256:532d437ce95ada083ba768ee3a3e299385b4822a21448375d0a2143fc6c823c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/bundle.json","state_url":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/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-13T01:37:13Z","links":{"resolver":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5","bundle":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/bundle.json","state":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XM7S57L4PVTWJUDHJLDYOPLCC5","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":"86a0e5eff9ec3ca7e87eb9c6548f0c105f47275eca7299a32a1a67fc1dc56fb8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-21T17:54:56Z","title_canon_sha256":"5e1252cf73e40c11544fdfe820bac7a2d6f64e949a78b9795d193a184df345b1"},"schema_version":"1.0","source":{"id":"2403.14605","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.14605","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"arxiv_version","alias_value":"2403.14605v1","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14605","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"pith_short_12","alias_value":"XM7S57L4PVTW","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"pith_short_16","alias_value":"XM7S57L4PVTWJUDH","created_at":"2026-07-05T07:59:11Z"},{"alias_kind":"pith_short_8","alias_value":"XM7S57L4","created_at":"2026-07-05T07:59:11Z"}],"graph_snapshots":[{"event_id":"sha256:532d437ce95ada083ba768ee3a3e299385b4822a21448375d0a2143fc6c823c1","target":"graph","created_at":"2026-07-05T07:59:11Z","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/2403.14605/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The paper presents Maximal Covariance Backward Reachable Trees (MAXCOVAR BRT), which is a multi-query algorithm for planning of dynamic systems under stochastic motion uncertainty and constraints on the control input with explicit coverage guarantees. In contrast to existing roadmap-based probabilistic planning methods that sample belief nodes randomly and draw edges between them \\cite{csbrm_tro2024}, under control constraints, the reachability of belief nodes needs to be explicitly established and is determined by checking the feasibility of a non-convex program. Moreover, there is no explici","authors_text":"Jonathan P. How, Naman Aggarwal","cross_cats":["cs.SY","eess.SY"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-21T17:54:56Z","title":"SDP Synthesis of Maximum Coverage Trees for Probabilistic Planning under Control Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.14605","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:febbf226c53a43cbbe0bfa73fe85cdad802470a3bc17d8e652da880fb944db05","target":"record","created_at":"2026-07-05T07:59:11Z","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":"86a0e5eff9ec3ca7e87eb9c6548f0c105f47275eca7299a32a1a67fc1dc56fb8","cross_cats_sorted":["cs.SY","eess.SY"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-21T17:54:56Z","title_canon_sha256":"5e1252cf73e40c11544fdfe820bac7a2d6f64e949a78b9795d193a184df345b1"},"schema_version":"1.0","source":{"id":"2403.14605","kind":"arxiv","version":1}},"canonical_sha256":"bb3f2efd7c7d6764d0674ac7873d62176d5de22eab92d42c541c50c19f6ae1ac","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb3f2efd7c7d6764d0674ac7873d62176d5de22eab92d42c541c50c19f6ae1ac","first_computed_at":"2026-07-05T07:59:11.283330Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:59:11.283330Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vr2M0dYf3Zbn0KEZE2WWSLsdcp6TnoAsPA2mhNUy4M6sDeIM4KxACcPXWyyNg2PJ46wDL2xcQq7BzYIYntOyAA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:59:11.283791Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.14605","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:febbf226c53a43cbbe0bfa73fe85cdad802470a3bc17d8e652da880fb944db05","sha256:532d437ce95ada083ba768ee3a3e299385b4822a21448375d0a2143fc6c823c1"],"state_sha256":"68a58692afb988145917f0bffcc4722d1c5d1e6c3ebb7966fb653e85d3fe2d3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xdagJO/swhmKcDbLcedWwsyVkp4uEJ+Mdu4Ej7rfwcSKW/+HO921Dl84IHl4XtnQ9sxZKjRSoJe8WtyQOWR+CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T01:37:13.963208Z","bundle_sha256":"ceb65b57f922938c3082771092b8f15057cac9e6e48d35d0ee4657ea48b9c017"}}