{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:7WZRDHNNYE7YRBQJEJ2QDNSSEL","short_pith_number":"pith:7WZRDHNN","schema_version":"1.0","canonical_sha256":"fdb3119dadc13f888609227501b65222ceb94c5d46383db0cb81c17dee5bbea0","source":{"kind":"arxiv","id":"1810.13087","version":1},"attestation_state":"computed","paper":{"title":"Multirobot Coordination with Counting Temporal Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Necmiye Ozay, Petter Nilsson, Yunus Emre Sahin","submitted_at":"2018-10-31T03:08:13Z","abstract_excerpt":"In many multirobot applications, planning trajectories in a way to guarantee that the collective behavior of the robots satisfies a certain high-level specification is crucial. Motivated by this problem, we introduce counting temporal logics---formal languages that enable concise expression of multirobot task specifications over possibly infinite horizons. We first introduce a general logic called counting linear temporal logic plus (cLTL+), and propose an optimization-based method that generates individual trajectories such that satisfaction of a given cLTL+ formula is guaranteed when these t"},"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":"1810.13087","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-10-31T03:08:13Z","cross_cats_sorted":["cs.FL","cs.SY","math.OC"],"title_canon_sha256":"c55adf61eddd030a16555d7acd6fbe1ac471e4a045fd43f38770e4b24b07ad3e","abstract_canon_sha256":"e3e418a6d627116ca5644c19db6ea62d5f7a58a4cb39449c9c98fbfdaf8752fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:52.306410Z","signature_b64":"wMQC85CslRbdcwlxXua9G9qFoi/OadAxCxx7NQPj0qXVnLOsz+A2pqLrsJ6Ggcpa5p+riCQKssxZd6cP82maBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fdb3119dadc13f888609227501b65222ceb94c5d46383db0cb81c17dee5bbea0","last_reissued_at":"2026-05-18T00:01:52.305899Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:52.305899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multirobot Coordination with Counting Temporal Logics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.SY","math.OC"],"primary_cat":"cs.RO","authors_text":"Necmiye Ozay, Petter Nilsson, Yunus Emre Sahin","submitted_at":"2018-10-31T03:08:13Z","abstract_excerpt":"In many multirobot applications, planning trajectories in a way to guarantee that the collective behavior of the robots satisfies a certain high-level specification is crucial. Motivated by this problem, we introduce counting temporal logics---formal languages that enable concise expression of multirobot task specifications over possibly infinite horizons. We first introduce a general logic called counting linear temporal logic plus (cLTL+), and propose an optimization-based method that generates individual trajectories such that satisfaction of a given cLTL+ formula is guaranteed when these t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13087","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":""},"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":"1810.13087","created_at":"2026-05-18T00:01:52.305983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.13087v1","created_at":"2026-05-18T00:01:52.305983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13087","created_at":"2026-05-18T00:01:52.305983+00:00"},{"alias_kind":"pith_short_12","alias_value":"7WZRDHNNYE7Y","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"7WZRDHNNYE7YRBQJ","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"7WZRDHNN","created_at":"2026-05-18T12:32:11.075285+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/7WZRDHNNYE7YRBQJEJ2QDNSSEL","json":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL.json","graph_json":"https://pith.science/api/pith-number/7WZRDHNNYE7YRBQJEJ2QDNSSEL/graph.json","events_json":"https://pith.science/api/pith-number/7WZRDHNNYE7YRBQJEJ2QDNSSEL/events.json","paper":"https://pith.science/paper/7WZRDHNN"},"agent_actions":{"view_html":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL","download_json":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL.json","view_paper":"https://pith.science/paper/7WZRDHNN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.13087&json=true","fetch_graph":"https://pith.science/api/pith-number/7WZRDHNNYE7YRBQJEJ2QDNSSEL/graph.json","fetch_events":"https://pith.science/api/pith-number/7WZRDHNNYE7YRBQJEJ2QDNSSEL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/action/storage_attestation","attest_author":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/action/author_attestation","sign_citation":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/action/citation_signature","submit_replication":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/action/replication_record"}},"created_at":"2026-05-18T00:01:52.305983+00:00","updated_at":"2026-05-18T00:01:52.305983+00:00"}