{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:7WZRDHNNYE7YRBQJEJ2QDNSSEL","short_pith_number":"pith:7WZRDHNN","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"},"canonical_sha256":"fdb3119dadc13f888609227501b65222ceb94c5d46383db0cb81c17dee5bbea0","source":{"kind":"arxiv","id":"1810.13087","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13087","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13087v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13087","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"7WZRDHNNYE7Y","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WZRDHNNYE7YRBQJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WZRDHNN","created_at":"2026-05-18T12:32:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:7WZRDHNNYE7YRBQJEJ2QDNSSEL","target":"record","payload":{"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"},"canonical_sha256":"fdb3119dadc13f888609227501b65222ceb94c5d46383db0cb81c17dee5bbea0","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"},"source_kind":"arxiv","source_id":"1810.13087","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-05-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jKAf9qEv8SPqlpZvvZzJ11goy1ZETMIMxE4D6CGp5qqs8ZKfE1TNNIAaQM1c85DNZN78NBYJ6gTyD+yUp85LBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:18:34.213544Z"},"content_sha256":"3ecc43ad6ba1850e7f5193c7533f6767b7738ce600eabecbe0f8375be606360a","schema_version":"1.0","event_id":"sha256:3ecc43ad6ba1850e7f5193c7533f6767b7738ce600eabecbe0f8375be606360a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:7WZRDHNNYE7YRBQJEJ2QDNSSEL","target":"graph","payload":{"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"},"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-05-18T00:01:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TGVfQyQ5hvc4mZwrt2FLLHNyE8SAY5436o5lv+XxB/l3RAnByxzfePSAK6UuIjx348zr8Rv09WOSRwfBcyCRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T12:18:34.214112Z"},"content_sha256":"b2ff458a7f137471a397b85e88391a9051cd68fb37e72f19e5c6dc09672c6308","schema_version":"1.0","event_id":"sha256:b2ff458a7f137471a397b85e88391a9051cd68fb37e72f19e5c6dc09672c6308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/bundle.json","state_url":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/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-06-26T12:18:34Z","links":{"resolver":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL","bundle":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/bundle.json","state":"https://pith.science/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7WZRDHNNYE7YRBQJEJ2QDNSSEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:7WZRDHNNYE7YRBQJEJ2QDNSSEL","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":"e3e418a6d627116ca5644c19db6ea62d5f7a58a4cb39449c9c98fbfdaf8752fb","cross_cats_sorted":["cs.FL","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-10-31T03:08:13Z","title_canon_sha256":"c55adf61eddd030a16555d7acd6fbe1ac471e4a045fd43f38770e4b24b07ad3e"},"schema_version":"1.0","source":{"id":"1810.13087","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.13087","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"arxiv_version","alias_value":"1810.13087v1","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.13087","created_at":"2026-05-18T00:01:52Z"},{"alias_kind":"pith_short_12","alias_value":"7WZRDHNNYE7Y","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_16","alias_value":"7WZRDHNNYE7YRBQJ","created_at":"2026-05-18T12:32:11Z"},{"alias_kind":"pith_short_8","alias_value":"7WZRDHNN","created_at":"2026-05-18T12:32:11Z"}],"graph_snapshots":[{"event_id":"sha256:b2ff458a7f137471a397b85e88391a9051cd68fb37e72f19e5c6dc09672c6308","target":"graph","created_at":"2026-05-18T00:01:52Z","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"},"paper":{"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","authors_text":"Necmiye Ozay, Petter Nilsson, Yunus Emre Sahin","cross_cats":["cs.FL","cs.SY","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-10-31T03:08:13Z","title":"Multirobot Coordination with Counting Temporal Logics"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.13087","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:3ecc43ad6ba1850e7f5193c7533f6767b7738ce600eabecbe0f8375be606360a","target":"record","created_at":"2026-05-18T00:01:52Z","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":"e3e418a6d627116ca5644c19db6ea62d5f7a58a4cb39449c9c98fbfdaf8752fb","cross_cats_sorted":["cs.FL","cs.SY","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2018-10-31T03:08:13Z","title_canon_sha256":"c55adf61eddd030a16555d7acd6fbe1ac471e4a045fd43f38770e4b24b07ad3e"},"schema_version":"1.0","source":{"id":"1810.13087","kind":"arxiv","version":1}},"canonical_sha256":"fdb3119dadc13f888609227501b65222ceb94c5d46383db0cb81c17dee5bbea0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fdb3119dadc13f888609227501b65222ceb94c5d46383db0cb81c17dee5bbea0","first_computed_at":"2026-05-18T00:01:52.305899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:52.305899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wMQC85CslRbdcwlxXua9G9qFoi/OadAxCxx7NQPj0qXVnLOsz+A2pqLrsJ6Ggcpa5p+riCQKssxZd6cP82maBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:52.306410Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.13087","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ecc43ad6ba1850e7f5193c7533f6767b7738ce600eabecbe0f8375be606360a","sha256:b2ff458a7f137471a397b85e88391a9051cd68fb37e72f19e5c6dc09672c6308"],"state_sha256":"d9dc812b1674cc8fdbe88fe9e23e7630f7d8e848c54e0ec2e12fb16093900b44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CHvWojZXOAFFzmWstwAHrEDMDQTiByN2mT8MxJlkgVh23q3Q2KfWUJMeZYaIWlkh0GoKgj1QWxG5WQcyzyfVCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T12:18:34.217505Z","bundle_sha256":"72068a8c986393fc15cf374ef3c7fd88f238fd958c3b92a9522d3f8a7dbe684d"}}