{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:7KYAYT3QTM2FDOLLGELA33FLFM","short_pith_number":"pith:7KYAYT3Q","schema_version":"1.0","canonical_sha256":"fab00c4f709b3451b96b31160decab2b3111b071ec361a970e159c4a45942e50","source":{"kind":"arxiv","id":"2403.08094","version":2},"attestation_state":"computed","paper":{"title":"Task and Motion Planning in Hierarchical 3D Scene Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aaron Ray, Christopher Bradley, Luca Carlone, Nicholas Roy","submitted_at":"2024-03-12T22:07:01Z","abstract_excerpt":"Recent work in the construction of 3D scene graphs has enabled mobile robots to build large-scale metric-semantic hierarchical representations of the world. These detailed models contain information that is useful for planning, however an open question is how to derive a planning domain from a 3D scene graph that enables efficient computation of executable plans. In this work, we present a novel approach for defining and solving Task and Motion Planning problems in large-scale environments using hierarchical 3D scene graphs. We describe a method for building sparse problem instances which enab"},"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.08094","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.RO","submitted_at":"2024-03-12T22:07:01Z","cross_cats_sorted":[],"title_canon_sha256":"70f2be4fba14d92551dea4dcde2583e9ee1bf3db12f22943285a647d15125f1e","abstract_canon_sha256":"de0477cc1b3ea30cf0d7d9366a2bf2854ef13aab9d99c372a39d101b8d332a0f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:33:08.416683Z","signature_b64":"vJJYUuDorhDd7yQzXz0lZCptORWJQYv1g4uf9dDA9sjntJoQW+4CoU6f8MVhCjoFo+lob9G1pHQRMlmjCUzkAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fab00c4f709b3451b96b31160decab2b3111b071ec361a970e159c4a45942e50","last_reissued_at":"2026-07-05T09:33:08.416147Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:33:08.416147Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Task and Motion Planning in Hierarchical 3D Scene Graphs","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Aaron Ray, Christopher Bradley, Luca Carlone, Nicholas Roy","submitted_at":"2024-03-12T22:07:01Z","abstract_excerpt":"Recent work in the construction of 3D scene graphs has enabled mobile robots to build large-scale metric-semantic hierarchical representations of the world. These detailed models contain information that is useful for planning, however an open question is how to derive a planning domain from a 3D scene graph that enables efficient computation of executable plans. In this work, we present a novel approach for defining and solving Task and Motion Planning problems in large-scale environments using hierarchical 3D scene graphs. We describe a method for building sparse problem instances which enab"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08094","kind":"arxiv","version":2},"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.08094/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.08094","created_at":"2026-07-05T09:33:08.416215+00:00"},{"alias_kind":"arxiv_version","alias_value":"2403.08094v2","created_at":"2026-07-05T09:33:08.416215+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08094","created_at":"2026-07-05T09:33:08.416215+00:00"},{"alias_kind":"pith_short_12","alias_value":"7KYAYT3QTM2F","created_at":"2026-07-05T09:33:08.416215+00:00"},{"alias_kind":"pith_short_16","alias_value":"7KYAYT3QTM2FDOLL","created_at":"2026-07-05T09:33:08.416215+00:00"},{"alias_kind":"pith_short_8","alias_value":"7KYAYT3Q","created_at":"2026-07-05T09:33:08.416215+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.19383","citing_title":"3D Scene Graphs: Open Challenges and Future Directions","ref_index":120,"is_internal_anchor":false},{"citing_arxiv_id":"2605.21788","citing_title":"SceneGraphGrounder: Zero-Shot 3D Visual Grounding via Structured Scene Graph Matching","ref_index":8,"is_internal_anchor":false},{"citing_arxiv_id":"2509.19579","citing_title":"Terra: Hierarchical Terrain-Aware 3D Scene Graph for Task-Agnostic Outdoor Mapping","ref_index":22,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM","json":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM.json","graph_json":"https://pith.science/api/pith-number/7KYAYT3QTM2FDOLLGELA33FLFM/graph.json","events_json":"https://pith.science/api/pith-number/7KYAYT3QTM2FDOLLGELA33FLFM/events.json","paper":"https://pith.science/paper/7KYAYT3Q"},"agent_actions":{"view_html":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM","download_json":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM.json","view_paper":"https://pith.science/paper/7KYAYT3Q","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2403.08094&json=true","fetch_graph":"https://pith.science/api/pith-number/7KYAYT3QTM2FDOLLGELA33FLFM/graph.json","fetch_events":"https://pith.science/api/pith-number/7KYAYT3QTM2FDOLLGELA33FLFM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM/action/storage_attestation","attest_author":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM/action/author_attestation","sign_citation":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM/action/citation_signature","submit_replication":"https://pith.science/pith/7KYAYT3QTM2FDOLLGELA33FLFM/action/replication_record"}},"created_at":"2026-07-05T09:33:08.416215+00:00","updated_at":"2026-07-05T09:33:08.416215+00:00"}