{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:SSVN52AFEXAGMFXLFJ32TNYEHH","short_pith_number":"pith:SSVN52AF","canonical_record":{"source":{"id":"2401.04003","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-08T16:35:13Z","cross_cats_sorted":["cs.AI","cs.FL"],"title_canon_sha256":"802d2a874257de0a1d88718e04172ee3aa9301deadae2c7df2e87b837a650580","abstract_canon_sha256":"01e072e0f5a9b28b8989caaea6f6aeda9523b036b6a70cddc2c9903934942f15"},"schema_version":"1.0"},"canonical_sha256":"94aadee80525c06616eb2a77a9b70439ea09e8da935f02dbb14a827a534cccfe","source":{"kind":"arxiv","id":"2401.04003","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.04003","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"2401.04003v4","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04003","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"SSVN52AFEXAG","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"pith_short_16","alias_value":"SSVN52AFEXAGMFXL","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"pith_short_8","alias_value":"SSVN52AF","created_at":"2026-07-05T11:16:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:SSVN52AFEXAGMFXLFJ32TNYEHH","target":"record","payload":{"canonical_record":{"source":{"id":"2401.04003","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-08T16:35:13Z","cross_cats_sorted":["cs.AI","cs.FL"],"title_canon_sha256":"802d2a874257de0a1d88718e04172ee3aa9301deadae2c7df2e87b837a650580","abstract_canon_sha256":"01e072e0f5a9b28b8989caaea6f6aeda9523b036b6a70cddc2c9903934942f15"},"schema_version":"1.0"},"canonical_sha256":"94aadee80525c06616eb2a77a9b70439ea09e8da935f02dbb14a827a534cccfe","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:16:01.479607Z","signature_b64":"KfIzXLhAMBobBcqjL8gJ4cGBaeecl2880weGs+IE9jwNjnIkOaSWwuCaUm3fMQL+dLkgYWpuzNP0GNE4DNHQAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94aadee80525c06616eb2a77a9b70439ea09e8da935f02dbb14a827a534cccfe","last_reissued_at":"2026-07-05T11:16:01.478954Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:16:01.478954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2401.04003","source_version":4,"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-05T11:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2akio1MkwlKRhwqtliS/AJKNaFN1V6tI8rsXR72yTzB8c1AY6XKOgwxjNAs9KLZCjkNF/cmHyWdBcZuNje76Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:57:33.992693Z"},"content_sha256":"7dce09ab36a15082674f8df999e550c5817d547c7f358142e2f80f53baef954f","schema_version":"1.0","event_id":"sha256:7dce09ab36a15082674f8df999e550c5817d547c7f358142e2f80f53baef954f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:SSVN52AFEXAGMFXLFJ32TNYEHH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simultaneous Task Allocation and Planning for Multi-Robots under Hierarchical Temporal Logic Specifications","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI","cs.FL"],"primary_cat":"cs.RO","authors_text":"Changliu Liu, Xusheng Luo","submitted_at":"2024-01-08T16:35:13Z","abstract_excerpt":"Research in robotic planning with temporal logic specifications, such as Linear Temporal Logic (LTL), has relied on single formulas. However, as task complexity increases, LTL formulas become lengthy, making them difficult to interpret and generate, and straining the computational capacities of planners. To address this, we introduce a hierarchical structure for a widely used specification type -- LTL on finite traces (LTL$_f$). The resulting language, termed H-LTL$_f$, is defined with both its syntax and semantics. We further prove that H-LTL$_f$ is more expressive than its standard \"flat\" co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.04003","kind":"arxiv","version":4},"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/2401.04003/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-05T11:16:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Q9RfxP/N/DP/Ewf5690B0ZWIrqtQ3TI/GeaupJ6R7HKtafHZhZ3zQJ7DSkGS3UUr+tc30VQe6cslaZUnqQoAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-19T07:57:33.993205Z"},"content_sha256":"1706ef10856f6cb90204e68142d6a3cfe32d17f6aa60173779da5b773fa24134","schema_version":"1.0","event_id":"sha256:1706ef10856f6cb90204e68142d6a3cfe32d17f6aa60173779da5b773fa24134"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/bundle.json","state_url":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/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-19T07:57:33Z","links":{"resolver":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH","bundle":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/bundle.json","state":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:SSVN52AFEXAGMFXLFJ32TNYEHH","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":"01e072e0f5a9b28b8989caaea6f6aeda9523b036b6a70cddc2c9903934942f15","cross_cats_sorted":["cs.AI","cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-08T16:35:13Z","title_canon_sha256":"802d2a874257de0a1d88718e04172ee3aa9301deadae2c7df2e87b837a650580"},"schema_version":"1.0","source":{"id":"2401.04003","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2401.04003","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"arxiv_version","alias_value":"2401.04003v4","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04003","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"pith_short_12","alias_value":"SSVN52AFEXAG","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"pith_short_16","alias_value":"SSVN52AFEXAGMFXL","created_at":"2026-07-05T11:16:01Z"},{"alias_kind":"pith_short_8","alias_value":"SSVN52AF","created_at":"2026-07-05T11:16:01Z"}],"graph_snapshots":[{"event_id":"sha256:1706ef10856f6cb90204e68142d6a3cfe32d17f6aa60173779da5b773fa24134","target":"graph","created_at":"2026-07-05T11:16:01Z","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/2401.04003/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Research in robotic planning with temporal logic specifications, such as Linear Temporal Logic (LTL), has relied on single formulas. However, as task complexity increases, LTL formulas become lengthy, making them difficult to interpret and generate, and straining the computational capacities of planners. To address this, we introduce a hierarchical structure for a widely used specification type -- LTL on finite traces (LTL$_f$). The resulting language, termed H-LTL$_f$, is defined with both its syntax and semantics. We further prove that H-LTL$_f$ is more expressive than its standard \"flat\" co","authors_text":"Changliu Liu, Xusheng Luo","cross_cats":["cs.AI","cs.FL"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-08T16:35:13Z","title":"Simultaneous Task Allocation and Planning for Multi-Robots under Hierarchical Temporal Logic Specifications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2401.04003","kind":"arxiv","version":4},"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:7dce09ab36a15082674f8df999e550c5817d547c7f358142e2f80f53baef954f","target":"record","created_at":"2026-07-05T11:16:01Z","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":"01e072e0f5a9b28b8989caaea6f6aeda9523b036b6a70cddc2c9903934942f15","cross_cats_sorted":["cs.AI","cs.FL"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.RO","submitted_at":"2024-01-08T16:35:13Z","title_canon_sha256":"802d2a874257de0a1d88718e04172ee3aa9301deadae2c7df2e87b837a650580"},"schema_version":"1.0","source":{"id":"2401.04003","kind":"arxiv","version":4}},"canonical_sha256":"94aadee80525c06616eb2a77a9b70439ea09e8da935f02dbb14a827a534cccfe","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94aadee80525c06616eb2a77a9b70439ea09e8da935f02dbb14a827a534cccfe","first_computed_at":"2026-07-05T11:16:01.478954Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:16:01.478954Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KfIzXLhAMBobBcqjL8gJ4cGBaeecl2880weGs+IE9jwNjnIkOaSWwuCaUm3fMQL+dLkgYWpuzNP0GNE4DNHQAg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:16:01.479607Z","signed_message":"canonical_sha256_bytes"},"source_id":"2401.04003","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7dce09ab36a15082674f8df999e550c5817d547c7f358142e2f80f53baef954f","sha256:1706ef10856f6cb90204e68142d6a3cfe32d17f6aa60173779da5b773fa24134"],"state_sha256":"9d44710e85af9001b2c491c7f20bc2a641ff70f06cd9570297d1b23dc426d1b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mWlGXLyFqKDqa5/vaweDgziof6096807G9OBSOkE0T1UpKagWwnTo0V0EoiT4xpvVAFsUsDLRd8+q4sUO5vGCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-19T07:57:33.998239Z","bundle_sha256":"a65470ac779d2146686da47a2ab328098f4a57037e87ecdaf35a258e29e991cf"}}