{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NOWLMFMKM4OP6Z3LLMLUZUSTMJ","short_pith_number":"pith:NOWLMFMK","canonical_record":{"source":{"id":"1607.08038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-27T11:12:02Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"25c38be486ff9f80bdf8a76025900e1968e957f04b40ff7feaeba53d43d30802","abstract_canon_sha256":"e23537303f6cadaa366e0878526ac6060aa41bf59692a1be60442f581708fa6f"},"schema_version":"1.0"},"canonical_sha256":"6bacb6158a671cff676b5b174cd253626eddc39f322757b782e83566b6dd32cd","source":{"kind":"arxiv","id":"1607.08038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08038","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08038v1","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08038","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"NOWLMFMKM4OP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NOWLMFMKM4OP6Z3L","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NOWLMFMK","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NOWLMFMKM4OP6Z3LLMLUZUSTMJ","target":"record","payload":{"canonical_record":{"source":{"id":"1607.08038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-27T11:12:02Z","cross_cats_sorted":["cs.RO"],"title_canon_sha256":"25c38be486ff9f80bdf8a76025900e1968e957f04b40ff7feaeba53d43d30802","abstract_canon_sha256":"e23537303f6cadaa366e0878526ac6060aa41bf59692a1be60442f581708fa6f"},"schema_version":"1.0"},"canonical_sha256":"6bacb6158a671cff676b5b174cd253626eddc39f322757b782e83566b6dd32cd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:22.635310Z","signature_b64":"X8BAZF6mGLNkmROqFu6KtJ9NgsaOjV7KlwnfPGJhKItlHjYBrsuHwIL+5BVU9jr4vw/UbjHrcWyLuBE8/kYeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6bacb6158a671cff676b5b174cd253626eddc39f322757b782e83566b6dd32cd","last_reissued_at":"2026-05-18T01:10:22.634715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:22.634715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1607.08038","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-18T01:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A+Ia5tX41XGIrBdn+0qBZ/+uhr7eaubWMveyiaVG168/cQDhie2AXlEDS/OCoG/5a77OIaOCfXaScxnjQamOCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:52:08.569240Z"},"content_sha256":"b9823f5e7389605ad63cbe8ed50a0174ea83a97f82818e6220c5f0e262413183","schema_version":"1.0","event_id":"sha256:b9823f5e7389605ad63cbe8ed50a0174ea83a97f82818e6220c5f0e262413183"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NOWLMFMKM4OP6Z3LLMLUZUSTMJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Behavior and path planning for the coalition of cognitive robots in smart relocation tasks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.RO"],"primary_cat":"cs.AI","authors_text":"Aleksandr I. Panov, Konstantin Yakovlev","submitted_at":"2016-07-27T11:12:02Z","abstract_excerpt":"In this paper we outline the approach of solving special type of navigation tasks for robotic systems, when a coalition of robots (agents) acts in the 2D environment, which can be modified by the actions, and share the same goal location. The latter is originally unreachable for some members of the coalition, but the common task still can be accomplished as the agents can assist each other (e.g. by modifying the environment). We call such tasks smart relocation tasks (as the can not be solved by pure path planning methods) and study spatial and behavior interaction of robots while solving them"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08038","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-18T01:10:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U+ofAF52ocN42Lmwcx+Fl7YWjkLgfG/29hw7rB38S5sJfHO82Ob1lInKjL+A3CJQJGFX5L2clpwgTyTKqS5gBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:52:08.569609Z"},"content_sha256":"0e8f3b69202015e5e6158b028e8ed510fa26e9e9b320587eade6ad4e8814a441","schema_version":"1.0","event_id":"sha256:0e8f3b69202015e5e6158b028e8ed510fa26e9e9b320587eade6ad4e8814a441"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ/bundle.json","state_url":"https://pith.science/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ/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-28T06:52:08Z","links":{"resolver":"https://pith.science/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ","bundle":"https://pith.science/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ/bundle.json","state":"https://pith.science/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOWLMFMKM4OP6Z3LLMLUZUSTMJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NOWLMFMKM4OP6Z3LLMLUZUSTMJ","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":"e23537303f6cadaa366e0878526ac6060aa41bf59692a1be60442f581708fa6f","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-27T11:12:02Z","title_canon_sha256":"25c38be486ff9f80bdf8a76025900e1968e957f04b40ff7feaeba53d43d30802"},"schema_version":"1.0","source":{"id":"1607.08038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1607.08038","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"arxiv_version","alias_value":"1607.08038v1","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.08038","created_at":"2026-05-18T01:10:22Z"},{"alias_kind":"pith_short_12","alias_value":"NOWLMFMKM4OP","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"NOWLMFMKM4OP6Z3L","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"NOWLMFMK","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:0e8f3b69202015e5e6158b028e8ed510fa26e9e9b320587eade6ad4e8814a441","target":"graph","created_at":"2026-05-18T01:10:22Z","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 this paper we outline the approach of solving special type of navigation tasks for robotic systems, when a coalition of robots (agents) acts in the 2D environment, which can be modified by the actions, and share the same goal location. The latter is originally unreachable for some members of the coalition, but the common task still can be accomplished as the agents can assist each other (e.g. by modifying the environment). We call such tasks smart relocation tasks (as the can not be solved by pure path planning methods) and study spatial and behavior interaction of robots while solving them","authors_text":"Aleksandr I. Panov, Konstantin Yakovlev","cross_cats":["cs.RO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-27T11:12:02Z","title":"Behavior and path planning for the coalition of cognitive robots in smart relocation tasks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.08038","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:b9823f5e7389605ad63cbe8ed50a0174ea83a97f82818e6220c5f0e262413183","target":"record","created_at":"2026-05-18T01:10:22Z","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":"e23537303f6cadaa366e0878526ac6060aa41bf59692a1be60442f581708fa6f","cross_cats_sorted":["cs.RO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-07-27T11:12:02Z","title_canon_sha256":"25c38be486ff9f80bdf8a76025900e1968e957f04b40ff7feaeba53d43d30802"},"schema_version":"1.0","source":{"id":"1607.08038","kind":"arxiv","version":1}},"canonical_sha256":"6bacb6158a671cff676b5b174cd253626eddc39f322757b782e83566b6dd32cd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6bacb6158a671cff676b5b174cd253626eddc39f322757b782e83566b6dd32cd","first_computed_at":"2026-05-18T01:10:22.634715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:22.634715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"X8BAZF6mGLNkmROqFu6KtJ9NgsaOjV7KlwnfPGJhKItlHjYBrsuHwIL+5BVU9jr4vw/UbjHrcWyLuBE8/kYeAw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:22.635310Z","signed_message":"canonical_sha256_bytes"},"source_id":"1607.08038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b9823f5e7389605ad63cbe8ed50a0174ea83a97f82818e6220c5f0e262413183","sha256:0e8f3b69202015e5e6158b028e8ed510fa26e9e9b320587eade6ad4e8814a441"],"state_sha256":"42b529be814b44d85e8dfe040992293ca7e5cfed13e7a56abbc19d1fafb24e4a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HRSfaPI0W/bQaucvBviyxlCLZN/Mv9FvPxmHmzkv9kdMexF6trXIxkvEpaThQgVq7JnlSna2h2GILPVt6BjvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:52:08.572017Z","bundle_sha256":"38cbb4f9f9b5b0590d66a61b3204ece1b888b2bb5725ad204addac2051634289"}}