{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SSVN52AFEXAGMFXLFJ32TNYEHH","short_pith_number":"pith:SSVN52AF","schema_version":"1.0","canonical_sha256":"94aadee80525c06616eb2a77a9b70439ea09e8da935f02dbb14a827a534cccfe","source":{"kind":"arxiv","id":"2401.04003","version":4},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2401.04003","created_at":"2026-07-05T11:16:01.479033+00:00"},{"alias_kind":"arxiv_version","alias_value":"2401.04003v4","created_at":"2026-07-05T11:16:01.479033+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2401.04003","created_at":"2026-07-05T11:16:01.479033+00:00"},{"alias_kind":"pith_short_12","alias_value":"SSVN52AFEXAG","created_at":"2026-07-05T11:16:01.479033+00:00"},{"alias_kind":"pith_short_16","alias_value":"SSVN52AFEXAGMFXL","created_at":"2026-07-05T11:16:01.479033+00:00"},{"alias_kind":"pith_short_8","alias_value":"SSVN52AF","created_at":"2026-07-05T11:16:01.479033+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2504.18899","citing_title":"Hierarchical Temporal Logic Task and Motion Planning for Multi-Robot Systems","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH","json":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH.json","graph_json":"https://pith.science/api/pith-number/SSVN52AFEXAGMFXLFJ32TNYEHH/graph.json","events_json":"https://pith.science/api/pith-number/SSVN52AFEXAGMFXLFJ32TNYEHH/events.json","paper":"https://pith.science/paper/SSVN52AF"},"agent_actions":{"view_html":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH","download_json":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH.json","view_paper":"https://pith.science/paper/SSVN52AF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2401.04003&json=true","fetch_graph":"https://pith.science/api/pith-number/SSVN52AFEXAGMFXLFJ32TNYEHH/graph.json","fetch_events":"https://pith.science/api/pith-number/SSVN52AFEXAGMFXLFJ32TNYEHH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/action/storage_attestation","attest_author":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/action/author_attestation","sign_citation":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/action/citation_signature","submit_replication":"https://pith.science/pith/SSVN52AFEXAGMFXLFJ32TNYEHH/action/replication_record"}},"created_at":"2026-07-05T11:16:01.479033+00:00","updated_at":"2026-07-05T11:16:01.479033+00:00"}