{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G5IHCJSEEST43IQPHKP4P3JX3F","short_pith_number":"pith:G5IHCJSE","canonical_record":{"source":{"id":"1908.05630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-15T16:41:56Z","cross_cats_sorted":["cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"73b414dc4f57d77ecb5356b50c9f7f988d90c5826b91bf3e0396735723381e76","abstract_canon_sha256":"b4e77034a1b794a85ab573e2260b3ec8d02586e326cde00b88a6ceed127461a5"},"schema_version":"1.0"},"canonical_sha256":"375071264424a7cda20f3a9fc7ed37d94aa29fa44bd1d0d0ca72461089e4eba4","source":{"kind":"arxiv","id":"1908.05630","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05630","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05630v1","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05630","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_12","alias_value":"G5IHCJSEEST4","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_16","alias_value":"G5IHCJSEEST43IQP","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_8","alias_value":"G5IHCJSE","created_at":"2026-07-04T23:56:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G5IHCJSEEST43IQPHKP4P3JX3F","target":"record","payload":{"canonical_record":{"source":{"id":"1908.05630","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-15T16:41:56Z","cross_cats_sorted":["cs.MA","cs.SY","eess.SY"],"title_canon_sha256":"73b414dc4f57d77ecb5356b50c9f7f988d90c5826b91bf3e0396735723381e76","abstract_canon_sha256":"b4e77034a1b794a85ab573e2260b3ec8d02586e326cde00b88a6ceed127461a5"},"schema_version":"1.0"},"canonical_sha256":"375071264424a7cda20f3a9fc7ed37d94aa29fa44bd1d0d0ca72461089e4eba4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:56:54.435275Z","signature_b64":"s6lJC03V7MD24uZ3/4C8Ilg+xxSBKLlPJE+HnuifVc4GpbPw+6r4ofhfKCOVZiOhPO4UL3P4t0q9gZi8hXOECA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"375071264424a7cda20f3a9fc7ed37d94aa29fa44bd1d0d0ca72461089e4eba4","last_reissued_at":"2026-07-04T23:56:54.434887Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:56:54.434887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.05630","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-07-04T23:56:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8KopRk+7I9iWWpkbZwG8QTinw26X81oKHCVichVcFhDs7vugbv95yOQratc5IGWIQSrDN+uZCVNf0a6wVjPIBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:29:54.640681Z"},"content_sha256":"fa67fc9def837a41ad1bd3e7d7943776b691eee35820c2bb10d4af770c9f2399","schema_version":"1.0","event_id":"sha256:fa67fc9def837a41ad1bd3e7d7943776b691eee35820c2bb10d4af770c9f2399"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G5IHCJSEEST43IQPHKP4P3JX3F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.MA","cs.SY","eess.SY"],"primary_cat":"cs.RO","authors_text":"Derya Aksaray, Raghavendra Bhat, Yasin Yazicioglu","submitted_at":"2019-08-15T16:41:56Z","abstract_excerpt":"We investigate the distributed planning of robot trajectories for optimal execution of cooperative tasks with time windows. In this setting, each task has a value and is completed if sufficiently many robots are simultaneously present at the necessary location within the specified time window. Tasks keep arriving periodically over cycles. The task specifications (required number of robots, location, time window, and value) are unknown a priori and the robots try to maximize the value of completed tasks by planning their own trajectories for the upcoming cycle based on their past observations i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05630","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/1908.05630/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-04T23:56:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biOWIVqednaDq6EPrYqJFiZwkqiExR5/kQoBdNZayLnyHJX1VQMT058x07TKixVN7/8+jX3PVfv4h5ZBEl77Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:29:54.641763Z"},"content_sha256":"14725f429cbdd8f5c36b7fc8d7c50e9ad1fc89e991a08c8a4ef6215e877f77eb","schema_version":"1.0","event_id":"sha256:14725f429cbdd8f5c36b7fc8d7c50e9ad1fc89e991a08c8a4ef6215e877f77eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G5IHCJSEEST43IQPHKP4P3JX3F/bundle.json","state_url":"https://pith.science/pith/G5IHCJSEEST43IQPHKP4P3JX3F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G5IHCJSEEST43IQPHKP4P3JX3F/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-16T06:29:54Z","links":{"resolver":"https://pith.science/pith/G5IHCJSEEST43IQPHKP4P3JX3F","bundle":"https://pith.science/pith/G5IHCJSEEST43IQPHKP4P3JX3F/bundle.json","state":"https://pith.science/pith/G5IHCJSEEST43IQPHKP4P3JX3F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G5IHCJSEEST43IQPHKP4P3JX3F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G5IHCJSEEST43IQPHKP4P3JX3F","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":"b4e77034a1b794a85ab573e2260b3ec8d02586e326cde00b88a6ceed127461a5","cross_cats_sorted":["cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-15T16:41:56Z","title_canon_sha256":"73b414dc4f57d77ecb5356b50c9f7f988d90c5826b91bf3e0396735723381e76"},"schema_version":"1.0","source":{"id":"1908.05630","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.05630","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"arxiv_version","alias_value":"1908.05630v1","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.05630","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_12","alias_value":"G5IHCJSEEST4","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_16","alias_value":"G5IHCJSEEST43IQP","created_at":"2026-07-04T23:56:54Z"},{"alias_kind":"pith_short_8","alias_value":"G5IHCJSE","created_at":"2026-07-04T23:56:54Z"}],"graph_snapshots":[{"event_id":"sha256:14725f429cbdd8f5c36b7fc8d7c50e9ad1fc89e991a08c8a4ef6215e877f77eb","target":"graph","created_at":"2026-07-04T23:56:54Z","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/1908.05630/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We investigate the distributed planning of robot trajectories for optimal execution of cooperative tasks with time windows. In this setting, each task has a value and is completed if sufficiently many robots are simultaneously present at the necessary location within the specified time window. Tasks keep arriving periodically over cycles. The task specifications (required number of robots, location, time window, and value) are unknown a priori and the robots try to maximize the value of completed tasks by planning their own trajectories for the upcoming cycle based on their past observations i","authors_text":"Derya Aksaray, Raghavendra Bhat, Yasin Yazicioglu","cross_cats":["cs.MA","cs.SY","eess.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-15T16:41:56Z","title":"Distributed Path Planning for Executing Cooperative Tasks with Time Windows"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.05630","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:fa67fc9def837a41ad1bd3e7d7943776b691eee35820c2bb10d4af770c9f2399","target":"record","created_at":"2026-07-04T23:56:54Z","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":"b4e77034a1b794a85ab573e2260b3ec8d02586e326cde00b88a6ceed127461a5","cross_cats_sorted":["cs.MA","cs.SY","eess.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2019-08-15T16:41:56Z","title_canon_sha256":"73b414dc4f57d77ecb5356b50c9f7f988d90c5826b91bf3e0396735723381e76"},"schema_version":"1.0","source":{"id":"1908.05630","kind":"arxiv","version":1}},"canonical_sha256":"375071264424a7cda20f3a9fc7ed37d94aa29fa44bd1d0d0ca72461089e4eba4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"375071264424a7cda20f3a9fc7ed37d94aa29fa44bd1d0d0ca72461089e4eba4","first_computed_at":"2026-07-04T23:56:54.434887Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:56:54.434887Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s6lJC03V7MD24uZ3/4C8Ilg+xxSBKLlPJE+HnuifVc4GpbPw+6r4ofhfKCOVZiOhPO4UL3P4t0q9gZi8hXOECA==","signature_status":"signed_v1","signed_at":"2026-07-04T23:56:54.435275Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.05630","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa67fc9def837a41ad1bd3e7d7943776b691eee35820c2bb10d4af770c9f2399","sha256:14725f429cbdd8f5c36b7fc8d7c50e9ad1fc89e991a08c8a4ef6215e877f77eb"],"state_sha256":"f5c32a0342343201bf919e5097555db5dac5b813e8979e6ecd95a625a7aa3c1a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s8EP09DAQdua5qjrcXWjgRKX5F0UERye1E+knROGF8XZYC8WPbclnbPk3VFnT6IipuzZzWEfOBbOwWU5sHB6BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:29:54.649474Z","bundle_sha256":"b66569d8bd0b5d7fbfd228a5c1eb4ba95ca6d38da0d050a4bcb74835a88cee5c"}}