{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:4V52IJN2D5ZOYLVKCTRJARLCVB","short_pith_number":"pith:4V52IJN2","schema_version":"1.0","canonical_sha256":"e57ba425ba1f72ec2eaa14e2904562a8449149f823251ca2d95b163082098093","source":{"kind":"arxiv","id":"2606.12070","version":1},"attestation_state":"computed","paper":{"title":"Fibration Trees: A Unified Approach to Multi-Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andreas Orthey, Florian T. Pokorny, Lydia E. Kavraki","submitted_at":"2026-06-10T13:33:45Z","abstract_excerpt":"State space projections and decompositions have emerged as powerful tools to tackle the curse of dimensionality in high-dimensional, multi-robot motion planning problems. However, existing methods lack a unified framework which seamlessly handles combinations of projections (prioritization or task-space) and decompositions (parallel or decoupled subspaces). To fill this gap, we introduce fibration trees, which are trees consisting of state spaces as nodes and fibrations as edges, whereby a fibration models a projection from a higher-dimensional space to a lower-dimensional (or simplified) spac"},"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":"2606.12070","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-06-10T13:33:45Z","cross_cats_sorted":[],"title_canon_sha256":"530decb53a7f36cc24e7e39924addf8c74b4dba5e97877423b85d84dcbcf37a8","abstract_canon_sha256":"89a6381055725dbf971da15c976dd41f1567fed20686d631aced7f9fbb0d2d05"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T01:10:46.072750Z","signature_b64":"SFkUiHGZnfySppvO/wgCm4OnD0Oj+EEyt23QEeAG7XIzTiG+lNLLgiJkt7ysUwhDskys1NDXNeXmdw3ZafYTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e57ba425ba1f72ec2eaa14e2904562a8449149f823251ca2d95b163082098093","last_reissued_at":"2026-06-11T01:10:46.072057Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T01:10:46.072057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fibration Trees: A Unified Approach to Multi-Robot Motion Planning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Andreas Orthey, Florian T. Pokorny, Lydia E. Kavraki","submitted_at":"2026-06-10T13:33:45Z","abstract_excerpt":"State space projections and decompositions have emerged as powerful tools to tackle the curse of dimensionality in high-dimensional, multi-robot motion planning problems. However, existing methods lack a unified framework which seamlessly handles combinations of projections (prioritization or task-space) and decompositions (parallel or decoupled subspaces). To fill this gap, we introduce fibration trees, which are trees consisting of state spaces as nodes and fibrations as edges, whereby a fibration models a projection from a higher-dimensional space to a lower-dimensional (or simplified) spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.12070","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/2606.12070/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":"2606.12070","created_at":"2026-06-11T01:10:46.072152+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.12070v1","created_at":"2026-06-11T01:10:46.072152+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.12070","created_at":"2026-06-11T01:10:46.072152+00:00"},{"alias_kind":"pith_short_12","alias_value":"4V52IJN2D5ZO","created_at":"2026-06-11T01:10:46.072152+00:00"},{"alias_kind":"pith_short_16","alias_value":"4V52IJN2D5ZOYLVK","created_at":"2026-06-11T01:10:46.072152+00:00"},{"alias_kind":"pith_short_8","alias_value":"4V52IJN2","created_at":"2026-06-11T01:10:46.072152+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/4V52IJN2D5ZOYLVKCTRJARLCVB","json":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB.json","graph_json":"https://pith.science/api/pith-number/4V52IJN2D5ZOYLVKCTRJARLCVB/graph.json","events_json":"https://pith.science/api/pith-number/4V52IJN2D5ZOYLVKCTRJARLCVB/events.json","paper":"https://pith.science/paper/4V52IJN2"},"agent_actions":{"view_html":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB","download_json":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB.json","view_paper":"https://pith.science/paper/4V52IJN2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.12070&json=true","fetch_graph":"https://pith.science/api/pith-number/4V52IJN2D5ZOYLVKCTRJARLCVB/graph.json","fetch_events":"https://pith.science/api/pith-number/4V52IJN2D5ZOYLVKCTRJARLCVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB/action/storage_attestation","attest_author":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB/action/author_attestation","sign_citation":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB/action/citation_signature","submit_replication":"https://pith.science/pith/4V52IJN2D5ZOYLVKCTRJARLCVB/action/replication_record"}},"created_at":"2026-06-11T01:10:46.072152+00:00","updated_at":"2026-06-11T01:10:46.072152+00:00"}