{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:KTL5EPYG6JXOSR2476BCJSUK6E","short_pith_number":"pith:KTL5EPYG","schema_version":"1.0","canonical_sha256":"54d7d23f06f26ee9475cff8224ca8af138dc0ae6cec9dda1c13574a6a1a4ee55","source":{"kind":"arxiv","id":"2411.14619","version":1},"attestation_state":"computed","paper":{"title":"Path Planning and Task Assignment for Data Retrieval from Wireless Sensor Nodes Relying on Game-Theoretic Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Anthony Tzes, Michalis Smyrnakis, Sotiris Papatheodorou, Tembine Hamidou","submitted_at":"2024-11-21T22:34:53Z","abstract_excerpt":"The energy-efficient trip allocation of mobile robots employing differential drives for data retrieval from stationary sensor locations is the scope of this article. Given a team of robots and a set of targets (wireless sensor nodes), the planner computes all possible tours that each robot can make if it needs to visit a part of or the entire set of targets. Each segment of the tour relies on a minimum energy path planning algorithm. After the computation of all possible tour-segments, a utility function penalizing the overall energy consumption is formed. Rather than relying on the NP-hard Mo"},"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":"2411.14619","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SY","submitted_at":"2024-11-21T22:34:53Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"874ccd6b6a6dfb616e664d8779c9332b6514e4dd38cfb470b0586a1c35bd7bfc","abstract_canon_sha256":"15a89116f37827c2089bcee5d3149e62bc3dddf8f86d01afb4bf0b8257cb836f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:38:54.160057Z","signature_b64":"ywHjhmb+s8ep+7oPUkRxfwRFpqIZnBvtAb48etyoxZs1sslzfdbYtcC49oU2pdbBVPwWHH7RWs0O1IDleJfeDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54d7d23f06f26ee9475cff8224ca8af138dc0ae6cec9dda1c13574a6a1a4ee55","last_reissued_at":"2026-07-05T09:38:54.159590Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:38:54.159590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Path Planning and Task Assignment for Data Retrieval from Wireless Sensor Nodes Relying on Game-Theoretic Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"eess.SY","authors_text":"Anthony Tzes, Michalis Smyrnakis, Sotiris Papatheodorou, Tembine Hamidou","submitted_at":"2024-11-21T22:34:53Z","abstract_excerpt":"The energy-efficient trip allocation of mobile robots employing differential drives for data retrieval from stationary sensor locations is the scope of this article. Given a team of robots and a set of targets (wireless sensor nodes), the planner computes all possible tours that each robot can make if it needs to visit a part of or the entire set of targets. Each segment of the tour relies on a minimum energy path planning algorithm. After the computation of all possible tour-segments, a utility function penalizing the overall energy consumption is formed. Rather than relying on the NP-hard Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.14619","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/2411.14619/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.14619","created_at":"2026-07-05T09:38:54.159658+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.14619v1","created_at":"2026-07-05T09:38:54.159658+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.14619","created_at":"2026-07-05T09:38:54.159658+00:00"},{"alias_kind":"pith_short_12","alias_value":"KTL5EPYG6JXO","created_at":"2026-07-05T09:38:54.159658+00:00"},{"alias_kind":"pith_short_16","alias_value":"KTL5EPYG6JXOSR24","created_at":"2026-07-05T09:38:54.159658+00:00"},{"alias_kind":"pith_short_8","alias_value":"KTL5EPYG","created_at":"2026-07-05T09:38:54.159658+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/KTL5EPYG6JXOSR2476BCJSUK6E","json":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E.json","graph_json":"https://pith.science/api/pith-number/KTL5EPYG6JXOSR2476BCJSUK6E/graph.json","events_json":"https://pith.science/api/pith-number/KTL5EPYG6JXOSR2476BCJSUK6E/events.json","paper":"https://pith.science/paper/KTL5EPYG"},"agent_actions":{"view_html":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E","download_json":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E.json","view_paper":"https://pith.science/paper/KTL5EPYG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.14619&json=true","fetch_graph":"https://pith.science/api/pith-number/KTL5EPYG6JXOSR2476BCJSUK6E/graph.json","fetch_events":"https://pith.science/api/pith-number/KTL5EPYG6JXOSR2476BCJSUK6E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E/action/storage_attestation","attest_author":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E/action/author_attestation","sign_citation":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E/action/citation_signature","submit_replication":"https://pith.science/pith/KTL5EPYG6JXOSR2476BCJSUK6E/action/replication_record"}},"created_at":"2026-07-05T09:38:54.159658+00:00","updated_at":"2026-07-05T09:38:54.159658+00:00"}