{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:IXLURDVAYGEVX7O33ELQIO5VZY","short_pith_number":"pith:IXLURDVA","schema_version":"1.0","canonical_sha256":"45d7488ea0c1895bfddbd917043bb5ce3ac29832e35450bd6f4f88af54d261ad","source":{"kind":"arxiv","id":"2409.10692","version":1},"attestation_state":"computed","paper":{"title":"Encoding Reusable Multi-Robot Planning Strategies as Abstract Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"James Motes, Khen Elimelech, Lydia E. Kavraki, Marco Morales, Moshe Y. Vardi, Nancy M. Amato","submitted_at":"2024-09-16T19:39:52Z","abstract_excerpt":"Multi-Robot Task Planning (MR-TP) is the search for a discrete-action plan a team of robots should take to complete a task. The complexity of such problems scales exponentially with the number of robots and task complexity, making them challenging for online solution. To accelerate MR-TP over a system's lifetime, this work looks at combining two recent advances: (i) Decomposable State Space Hypergraph (DaSH), a novel hypergraph-based framework to efficiently model and solve MR-TP problems; and \\mbox{(ii) learning-by-abstraction,} a technique that enables automatic extraction of generalizable p"},"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":"2409.10692","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-16T19:39:52Z","cross_cats_sorted":["cs.AI","cs.MA"],"title_canon_sha256":"258fe6014c14e6eb947f1418572947dc2d7cc89d367da11430643b18007e62bc","abstract_canon_sha256":"bab818be4c45c0ee1239134dcaac6f12365da5097286d4a853d03231e8caea5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:07:54.835098Z","signature_b64":"V1B+Rek23VSX17OKf01pVpXQGRERyv/yeYLasj7mVKKv4AeOyUYwTYc5+61GJJ68LZtKQ6JkuDFmGSUg1qjJCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"45d7488ea0c1895bfddbd917043bb5ce3ac29832e35450bd6f4f88af54d261ad","last_reissued_at":"2026-07-05T09:07:54.834541Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:07:54.834541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Encoding Reusable Multi-Robot Planning Strategies as Abstract Hypergraphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.MA"],"primary_cat":"cs.RO","authors_text":"James Motes, Khen Elimelech, Lydia E. Kavraki, Marco Morales, Moshe Y. Vardi, Nancy M. Amato","submitted_at":"2024-09-16T19:39:52Z","abstract_excerpt":"Multi-Robot Task Planning (MR-TP) is the search for a discrete-action plan a team of robots should take to complete a task. The complexity of such problems scales exponentially with the number of robots and task complexity, making them challenging for online solution. To accelerate MR-TP over a system's lifetime, this work looks at combining two recent advances: (i) Decomposable State Space Hypergraph (DaSH), a novel hypergraph-based framework to efficiently model and solve MR-TP problems; and \\mbox{(ii) learning-by-abstraction,} a technique that enables automatic extraction of generalizable p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10692","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/2409.10692/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":"2409.10692","created_at":"2026-07-05T09:07:54.834606+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.10692v1","created_at":"2026-07-05T09:07:54.834606+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10692","created_at":"2026-07-05T09:07:54.834606+00:00"},{"alias_kind":"pith_short_12","alias_value":"IXLURDVAYGEV","created_at":"2026-07-05T09:07:54.834606+00:00"},{"alias_kind":"pith_short_16","alias_value":"IXLURDVAYGEVX7O3","created_at":"2026-07-05T09:07:54.834606+00:00"},{"alias_kind":"pith_short_8","alias_value":"IXLURDVA","created_at":"2026-07-05T09:07:54.834606+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/IXLURDVAYGEVX7O33ELQIO5VZY","json":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY.json","graph_json":"https://pith.science/api/pith-number/IXLURDVAYGEVX7O33ELQIO5VZY/graph.json","events_json":"https://pith.science/api/pith-number/IXLURDVAYGEVX7O33ELQIO5VZY/events.json","paper":"https://pith.science/paper/IXLURDVA"},"agent_actions":{"view_html":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY","download_json":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY.json","view_paper":"https://pith.science/paper/IXLURDVA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.10692&json=true","fetch_graph":"https://pith.science/api/pith-number/IXLURDVAYGEVX7O33ELQIO5VZY/graph.json","fetch_events":"https://pith.science/api/pith-number/IXLURDVAYGEVX7O33ELQIO5VZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/action/storage_attestation","attest_author":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/action/author_attestation","sign_citation":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/action/citation_signature","submit_replication":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/action/replication_record"}},"created_at":"2026-07-05T09:07:54.834606+00:00","updated_at":"2026-07-05T09:07:54.834606+00:00"}