{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:45JLQDRQW5SJCXH2SBBPJON6T2","short_pith_number":"pith:45JLQDRQ","schema_version":"1.0","canonical_sha256":"e752b80e30b764915cfa9042f4b9be9e9998bb46fc1e5d713efd9ae889790a87","source":{"kind":"arxiv","id":"1705.10826","version":2},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.10826","created_at":"2026-05-17T23:53:44.504006+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10826v2","created_at":"2026-05-17T23:53:44.504006+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10826","created_at":"2026-05-17T23:53:44.504006+00:00"},{"alias_kind":"pith_short_12","alias_value":"45JLQDRQW5SJ","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"45JLQDRQW5SJCXH2","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"45JLQDRQ","created_at":"2026-05-18T12:30:58.224056+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/45JLQDRQW5SJCXH2SBBPJON6T2","json":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2.json","graph_json":"https://pith.science/api/pith-number/45JLQDRQW5SJCXH2SBBPJON6T2/graph.json","events_json":"https://pith.science/api/pith-number/45JLQDRQW5SJCXH2SBBPJON6T2/events.json","paper":"https://pith.science/paper/45JLQDRQ"},"agent_actions":{"view_html":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2","download_json":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2.json","view_paper":"https://pith.science/paper/45JLQDRQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10826&json=true","fetch_graph":"https://pith.science/api/pith-number/45JLQDRQW5SJCXH2SBBPJON6T2/graph.json","fetch_events":"https://pith.science/api/pith-number/45JLQDRQW5SJCXH2SBBPJON6T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/action/storage_attestation","attest_author":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/action/author_attestation","sign_citation":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/action/citation_signature","submit_replication":"https://pith.science/pith/45JLQDRQW5SJCXH2SBBPJON6T2/action/replication_record"}},"created_at":"2026-05-17T23:53:44.504006+00:00","updated_at":"2026-05-17T23:53:44.504006+00:00"}