{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:45JLQDRQW5SJCXH2SBBPJON6T2","short_pith_number":"pith:45JLQDRQ","canonical_record":{"source":{"id":"1705.10826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-30T19:12:42Z","cross_cats_sorted":["cs.DC","math.CO"],"title_canon_sha256":"8f81a7c98b47cb1274a954aadb30909f7a1ba1f23d5f15015f9f7a2a9c1865f6","abstract_canon_sha256":"50555d0d5075ed7fb5e8b66dccfe92b4981045d245ea87dfae738f33701e09e7"},"schema_version":"1.0"},"canonical_sha256":"e752b80e30b764915cfa9042f4b9be9e9998bb46fc1e5d713efd9ae889790a87","source":{"kind":"arxiv","id":"1705.10826","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10826","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10826v2","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10826","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"45JLQDRQW5SJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"45JLQDRQW5SJCXH2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"45JLQDRQ","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:45JLQDRQW5SJCXH2SBBPJON6T2","target":"record","payload":{"canonical_record":{"source":{"id":"1705.10826","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-30T19:12:42Z","cross_cats_sorted":["cs.DC","math.CO"],"title_canon_sha256":"8f81a7c98b47cb1274a954aadb30909f7a1ba1f23d5f15015f9f7a2a9c1865f6","abstract_canon_sha256":"50555d0d5075ed7fb5e8b66dccfe92b4981045d245ea87dfae738f33701e09e7"},"schema_version":"1.0"},"canonical_sha256":"e752b80e30b764915cfa9042f4b9be9e9998bb46fc1e5d713efd9ae889790a87","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:44.504587Z","signature_b64":"47Fwv9rK/CDLzYdfcafh3Z8qAQhakmRH9bfi/0yakmumh7XJmqueKaHB2WATMkZEHVJ0DGb3JnNZJzXw3QfkDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e752b80e30b764915cfa9042f4b9be9e9998bb46fc1e5d713efd9ae889790a87","last_reissued_at":"2026-05-17T23:53:44.503911Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:44.503911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.10826","source_version":2,"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-17T23:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U9SBw5XaD6MPpEaTuaPxVh4oug+RKHoVRw0j1I0ZKz7RUg1wF/D7SgDgCzbfxaqX+7URaUOMCQIFSLqI7pSHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:33:12.309437Z"},"content_sha256":"618035266657e2d7bf812a920c72be97b974a069c5a65eb247a688914869c1f7","schema_version":"1.0","event_id":"sha256:618035266657e2d7bf812a920c72be97b974a069c5a65eb247a688914869c1f7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:45JLQDRQW5SJCXH2SBBPJON6T2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Minimizing the Cost of Team Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","math.CO"],"primary_cat":"cs.DM","authors_text":"Dorota Osula","submitted_at":"2017-05-30T19:12:42Z","abstract_excerpt":"A group of mobile agents is given a task to explore an edge-weighted graph $G$, i.e., every vertex of $G$ has to be visited by at least one agent. There is no centralized unit to coordinate their actions, but they can freely communicate with each other. The goal is to construct a deterministic strategy which allows agents to complete their task optimally. In this paper we are interested in a cost-optimal strategy, where the cost is understood as the total distance traversed by agents coupled with the cost of invoking them. Two graph classes are analyzed, rings and trees, in the off-line and on"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10826","kind":"arxiv","version":2},"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-17T23:53:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6Xhb9fqx2Kuw4mx8zC6kg/qH58NKiP8JSLs8UpoUMnO7fxL6X8QfbTO2ci8/rKmJeQiviMbJAlr12iya40pfCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T07:33:12.309778Z"},"content_sha256":"fbb497dfdf9beede4b9193f009868d6a354120598e997722dc23c5fc1cdf6a5e","schema_version":"1.0","event_id":"sha256:fbb497dfdf9beede4b9193f009868d6a354120598e997722dc23c5fc1cdf6a5e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/bundle.json","state_url":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/45JLQDRQW5SJCXH2SBBPJON6T2/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-07-01T07:33:12Z","links":{"resolver":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2","bundle":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/bundle.json","state":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/45JLQDRQW5SJCXH2SBBPJON6T2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:45JLQDRQW5SJCXH2SBBPJON6T2","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":"50555d0d5075ed7fb5e8b66dccfe92b4981045d245ea87dfae738f33701e09e7","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-30T19:12:42Z","title_canon_sha256":"8f81a7c98b47cb1274a954aadb30909f7a1ba1f23d5f15015f9f7a2a9c1865f6"},"schema_version":"1.0","source":{"id":"1705.10826","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10826","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10826v2","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10826","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"45JLQDRQW5SJ","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"45JLQDRQW5SJCXH2","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"45JLQDRQ","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:fbb497dfdf9beede4b9193f009868d6a354120598e997722dc23c5fc1cdf6a5e","target":"graph","created_at":"2026-05-17T23:53:44Z","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":"A group of mobile agents is given a task to explore an edge-weighted graph $G$, i.e., every vertex of $G$ has to be visited by at least one agent. There is no centralized unit to coordinate their actions, but they can freely communicate with each other. The goal is to construct a deterministic strategy which allows agents to complete their task optimally. In this paper we are interested in a cost-optimal strategy, where the cost is understood as the total distance traversed by agents coupled with the cost of invoking them. Two graph classes are analyzed, rings and trees, in the off-line and on","authors_text":"Dorota Osula","cross_cats":["cs.DC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-30T19:12:42Z","title":"Minimizing the Cost of Team Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10826","kind":"arxiv","version":2},"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:618035266657e2d7bf812a920c72be97b974a069c5a65eb247a688914869c1f7","target":"record","created_at":"2026-05-17T23:53:44Z","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":"50555d0d5075ed7fb5e8b66dccfe92b4981045d245ea87dfae738f33701e09e7","cross_cats_sorted":["cs.DC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2017-05-30T19:12:42Z","title_canon_sha256":"8f81a7c98b47cb1274a954aadb30909f7a1ba1f23d5f15015f9f7a2a9c1865f6"},"schema_version":"1.0","source":{"id":"1705.10826","kind":"arxiv","version":2}},"canonical_sha256":"e752b80e30b764915cfa9042f4b9be9e9998bb46fc1e5d713efd9ae889790a87","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e752b80e30b764915cfa9042f4b9be9e9998bb46fc1e5d713efd9ae889790a87","first_computed_at":"2026-05-17T23:53:44.503911Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:44.503911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"47Fwv9rK/CDLzYdfcafh3Z8qAQhakmRH9bfi/0yakmumh7XJmqueKaHB2WATMkZEHVJ0DGb3JnNZJzXw3QfkDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:44.504587Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10826","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:618035266657e2d7bf812a920c72be97b974a069c5a65eb247a688914869c1f7","sha256:fbb497dfdf9beede4b9193f009868d6a354120598e997722dc23c5fc1cdf6a5e"],"state_sha256":"9060e9ac94622b7145c8fe434be7996caf2f9a6bbab45f5b34a2c83fe06551e3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rf3Ax8rIhDgI9EM0fx9s5vCTSDkK45vtHzQreME6+9d7bLDShALIliFP8bmTCWIwdPCJ2Hacy4cQO6rnEh5YBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T07:33:12.311765Z","bundle_sha256":"e91f38ca4efaf6aad44eb4665b6df935308c0549d54b2a0705e6b2e2d2b0cc65"}}