{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:XM7S57L4PVTWJUDHJLDYOPLCC5","short_pith_number":"pith:XM7S57L4","schema_version":"1.0","canonical_sha256":"bb3f2efd7c7d6764d0674ac7873d62176d5de22eab92d42c541c50c19f6ae1ac","source":{"kind":"arxiv","id":"2403.14605","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2403.14605","created_at":"2026-07-05T07:59:11.283394+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.14605v1","created_at":"2026-07-05T07:59:11.283394+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.14605","created_at":"2026-07-05T07:59:11.283394+00:00"},{"alias_kind":"pith_short_12","alias_value":"XM7S57L4PVTW","created_at":"2026-07-05T07:59:11.283394+00:00"},{"alias_kind":"pith_short_16","alias_value":"XM7S57L4PVTWJUDH","created_at":"2026-07-05T07:59:11.283394+00:00"},{"alias_kind":"pith_short_8","alias_value":"XM7S57L4","created_at":"2026-07-05T07:59:11.283394+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2411.13369","citing_title":"REVISE: Robust Probabilistic Motion Planning in a Gaussian Random Field","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5","json":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5.json","graph_json":"https://pith.science/api/pith-number/XM7S57L4PVTWJUDHJLDYOPLCC5/graph.json","events_json":"https://pith.science/api/pith-number/XM7S57L4PVTWJUDHJLDYOPLCC5/events.json","paper":"https://pith.science/paper/XM7S57L4"},"agent_actions":{"view_html":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5","download_json":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5.json","view_paper":"https://pith.science/paper/XM7S57L4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.14605&json=true","fetch_graph":"https://pith.science/api/pith-number/XM7S57L4PVTWJUDHJLDYOPLCC5/graph.json","fetch_events":"https://pith.science/api/pith-number/XM7S57L4PVTWJUDHJLDYOPLCC5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/action/storage_attestation","attest_author":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/action/author_attestation","sign_citation":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/action/citation_signature","submit_replication":"https://pith.science/pith/XM7S57L4PVTWJUDHJLDYOPLCC5/action/replication_record"}},"created_at":"2026-07-05T07:59:11.283394+00:00","updated_at":"2026-07-05T07:59:11.283394+00:00"}