{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:SZQU5EIZCVGYHRV4RTO7CUECEK","short_pith_number":"pith:SZQU5EIZ","schema_version":"1.0","canonical_sha256":"96614e9119154d83c6bc8cddf1508222af6fe2abcd190035b96446a66fb45f59","source":{"kind":"arxiv","id":"2406.18019","version":1},"attestation_state":"computed","paper":{"title":"Continuous Execution of High-Level Collaborative Tasks for Heterogeneous Robot Teams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Amy Fang, Hadas Kress-Gazit, Jiawei Lin, Tenny Yin","submitted_at":"2024-06-26T02:13:02Z","abstract_excerpt":"We propose a control synthesis framework for a heterogeneous multi-robot system to satisfy collaborative tasks, where actions may take varying duration of time to complete. We encode tasks using the discrete logic LTL^\\psi, which uses the concept of bindings to interleave robot actions and express information about relationship between specific task requirements and robot assignments. We present a synthesis approach to automatically generate a teaming assignment and corresponding discrete behavior that is correct-by-construction for continuous execution, while also implementing synchronization"},"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":"2406.18019","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-06-26T02:13:02Z","cross_cats_sorted":[],"title_canon_sha256":"bb27c153d41a9a6e114d2c68a4e691dd7f793de45788b7fd0ab4ff0f0db42e14","abstract_canon_sha256":"1490770de26d506675fbcc965ef0b82569ea7a5818afe6b1665bea0fa54c5018"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:36:53.789940Z","signature_b64":"HzjFCg+Y4OOIEiVHnEd0RVJBL+xgeO96i5lYKzNQklQZYqX2MGvn3hbqQm3B/3YKFlH8u8BbZ8iwbkNUjAn8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"96614e9119154d83c6bc8cddf1508222af6fe2abcd190035b96446a66fb45f59","last_reissued_at":"2026-07-05T08:36:53.789514Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:36:53.789514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Continuous Execution of High-Level Collaborative Tasks for Heterogeneous Robot Teams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.RO","authors_text":"Amy Fang, Hadas Kress-Gazit, Jiawei Lin, Tenny Yin","submitted_at":"2024-06-26T02:13:02Z","abstract_excerpt":"We propose a control synthesis framework for a heterogeneous multi-robot system to satisfy collaborative tasks, where actions may take varying duration of time to complete. We encode tasks using the discrete logic LTL^\\psi, which uses the concept of bindings to interleave robot actions and express information about relationship between specific task requirements and robot assignments. We present a synthesis approach to automatically generate a teaming assignment and corresponding discrete behavior that is correct-by-construction for continuous execution, while also implementing synchronization"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.18019","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/2406.18019/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":"2406.18019","created_at":"2026-07-05T08:36:53.789569+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.18019v1","created_at":"2026-07-05T08:36:53.789569+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.18019","created_at":"2026-07-05T08:36:53.789569+00:00"},{"alias_kind":"pith_short_12","alias_value":"SZQU5EIZCVGY","created_at":"2026-07-05T08:36:53.789569+00:00"},{"alias_kind":"pith_short_16","alias_value":"SZQU5EIZCVGYHRV4","created_at":"2026-07-05T08:36:53.789569+00:00"},{"alias_kind":"pith_short_8","alias_value":"SZQU5EIZ","created_at":"2026-07-05T08:36:53.789569+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.19429","citing_title":"An Iterative Approach for Heterogeneous Multi-Agent Route Planning with Resource Transportation Uncertainty and Temporal Logic Goals","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK","json":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK.json","graph_json":"https://pith.science/api/pith-number/SZQU5EIZCVGYHRV4RTO7CUECEK/graph.json","events_json":"https://pith.science/api/pith-number/SZQU5EIZCVGYHRV4RTO7CUECEK/events.json","paper":"https://pith.science/paper/SZQU5EIZ"},"agent_actions":{"view_html":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK","download_json":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK.json","view_paper":"https://pith.science/paper/SZQU5EIZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.18019&json=true","fetch_graph":"https://pith.science/api/pith-number/SZQU5EIZCVGYHRV4RTO7CUECEK/graph.json","fetch_events":"https://pith.science/api/pith-number/SZQU5EIZCVGYHRV4RTO7CUECEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK/action/storage_attestation","attest_author":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK/action/author_attestation","sign_citation":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK/action/citation_signature","submit_replication":"https://pith.science/pith/SZQU5EIZCVGYHRV4RTO7CUECEK/action/replication_record"}},"created_at":"2026-07-05T08:36:53.789569+00:00","updated_at":"2026-07-05T08:36:53.789569+00:00"}