{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:IXLURDVAYGEVX7O33ELQIO5VZY","short_pith_number":"pith:IXLURDVA","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"},"canonical_sha256":"45d7488ea0c1895bfddbd917043bb5ce3ac29832e35450bd6f4f88af54d261ad","source":{"kind":"arxiv","id":"2409.10692","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10692","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10692v1","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10692","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"IXLURDVAYGEV","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"pith_short_16","alias_value":"IXLURDVAYGEVX7O3","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"pith_short_8","alias_value":"IXLURDVA","created_at":"2026-07-05T09:07:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:IXLURDVAYGEVX7O33ELQIO5VZY","target":"record","payload":{"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"},"canonical_sha256":"45d7488ea0c1895bfddbd917043bb5ce3ac29832e35450bd6f4f88af54d261ad","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"},"source_kind":"arxiv","source_id":"2409.10692","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-05T09:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aTDcMhvVFNhur4AP4hMMwjm1qKY2HerqmrVG2j4Rs/627jk5RWFT9phx82BPFevLB8SISJUz4C3rK8NLCO0sCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:18:49.821180Z"},"content_sha256":"f7a3a54898a237cdac193ad97b194298ca346c52f17ed4b8c8af077de1609825","schema_version":"1.0","event_id":"sha256:f7a3a54898a237cdac193ad97b194298ca346c52f17ed4b8c8af077de1609825"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:IXLURDVAYGEVX7O33ELQIO5VZY","target":"graph","payload":{"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"},"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-05T09:07:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PyHzkwUkzdW2OCOUJFvR61PsEDuqBug4/iheZRVdZc2Xe3tjjg4lqc5ukUubWN8B9WbPb3p+MGZ0G/KMtvbPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T18:18:49.821679Z"},"content_sha256":"71bac0fdf9f302aefe3e662cb9ebe6c40214af8166d6e7842c4c1d538b707f16","schema_version":"1.0","event_id":"sha256:71bac0fdf9f302aefe3e662cb9ebe6c40214af8166d6e7842c4c1d538b707f16"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/bundle.json","state_url":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IXLURDVAYGEVX7O33ELQIO5VZY/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-03T18:18:49Z","links":{"resolver":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY","bundle":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/bundle.json","state":"https://pith.science/pith/IXLURDVAYGEVX7O33ELQIO5VZY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IXLURDVAYGEVX7O33ELQIO5VZY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:IXLURDVAYGEVX7O33ELQIO5VZY","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":"bab818be4c45c0ee1239134dcaac6f12365da5097286d4a853d03231e8caea5a","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-16T19:39:52Z","title_canon_sha256":"258fe6014c14e6eb947f1418572947dc2d7cc89d367da11430643b18007e62bc"},"schema_version":"1.0","source":{"id":"2409.10692","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.10692","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"arxiv_version","alias_value":"2409.10692v1","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.10692","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"pith_short_12","alias_value":"IXLURDVAYGEV","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"pith_short_16","alias_value":"IXLURDVAYGEVX7O3","created_at":"2026-07-05T09:07:54Z"},{"alias_kind":"pith_short_8","alias_value":"IXLURDVA","created_at":"2026-07-05T09:07:54Z"}],"graph_snapshots":[{"event_id":"sha256:71bac0fdf9f302aefe3e662cb9ebe6c40214af8166d6e7842c4c1d538b707f16","target":"graph","created_at":"2026-07-05T09:07:54Z","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/2409.10692/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"James Motes, Khen Elimelech, Lydia E. Kavraki, Marco Morales, Moshe Y. Vardi, Nancy M. Amato","cross_cats":["cs.AI","cs.MA"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-16T19:39:52Z","title":"Encoding Reusable Multi-Robot Planning Strategies as Abstract Hypergraphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.10692","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:f7a3a54898a237cdac193ad97b194298ca346c52f17ed4b8c8af077de1609825","target":"record","created_at":"2026-07-05T09:07:54Z","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":"bab818be4c45c0ee1239134dcaac6f12365da5097286d4a853d03231e8caea5a","cross_cats_sorted":["cs.AI","cs.MA"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-09-16T19:39:52Z","title_canon_sha256":"258fe6014c14e6eb947f1418572947dc2d7cc89d367da11430643b18007e62bc"},"schema_version":"1.0","source":{"id":"2409.10692","kind":"arxiv","version":1}},"canonical_sha256":"45d7488ea0c1895bfddbd917043bb5ce3ac29832e35450bd6f4f88af54d261ad","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"45d7488ea0c1895bfddbd917043bb5ce3ac29832e35450bd6f4f88af54d261ad","first_computed_at":"2026-07-05T09:07:54.834541Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:07:54.834541Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V1B+Rek23VSX17OKf01pVpXQGRERyv/yeYLasj7mVKKv4AeOyUYwTYc5+61GJJ68LZtKQ6JkuDFmGSUg1qjJCg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:07:54.835098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.10692","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f7a3a54898a237cdac193ad97b194298ca346c52f17ed4b8c8af077de1609825","sha256:71bac0fdf9f302aefe3e662cb9ebe6c40214af8166d6e7842c4c1d538b707f16"],"state_sha256":"b4de6ee4efe7c5237696309067c6e1fa57f665befadb3ef8942ea2bd9e9e96b1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QUT/HLlZZecI3D09IHC3ZApB+lhQZSsyFEqr55Exp2J5yyu+AVE/M3Ibdyt5TFUlj90lISoSENsYd0QoNlX1BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T18:18:49.825583Z","bundle_sha256":"9d6e47eeb24000ee1bfd0cdf1bf453f6145b3e5b3e095859c39c30a4245c1357"}}