{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:OWY4FRZ7EWPDHTFUATW7X3ISWI","short_pith_number":"pith:OWY4FRZ7","schema_version":"1.0","canonical_sha256":"75b1c2c73f259e33ccb404edfbed12b22161f3e164418cbaa90166787f162883","source":{"kind":"arxiv","id":"2309.02200","version":1},"attestation_state":"computed","paper":{"title":"Run for Cover: Dominating Set via Mobile Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Prabhat Kumar Chand, Sumathi Sivasubramaniam","submitted_at":"2023-09-05T13:06:05Z","abstract_excerpt":"Research involving computing with mobile agents is a fast-growing field, given the advancement of technology in automated systems, e.g., robots, drones, self-driving cars, etc. Therefore, it is pressing to focus on solving classical network problems using mobile agents. In this paper, we study one such problem -- finding small dominating sets of a graph $G$ using mobile agents. Dominating set is interesting in the field of mobile agents as it opens up a way for solving various robotic problems, e.g., guarding, covering, facility location, transport routing, etc. In this paper, we first present"},"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":"2309.02200","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-09-05T13:06:05Z","cross_cats_sorted":[],"title_canon_sha256":"40985d53333616d5365d605d546b9ab5a305012dc67fd00c522a79516f3355d0","abstract_canon_sha256":"92b2ba753b797a9f9c7aa59a0ffdf711f4360fa30bfcc6badf49281bc74a4c39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:47:57.095021Z","signature_b64":"3tpqpVfwAHFqe6+HgtmJtpAN/KI9/95cvdkCep1ipAHCfqYLlqxbrLkmYsGyC7s7pXP88NXQKfdGB8up54h9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75b1c2c73f259e33ccb404edfbed12b22161f3e164418cbaa90166787f162883","last_reissued_at":"2026-07-05T06:47:57.094455Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:47:57.094455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Run for Cover: Dominating Set via Mobile Agents","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Anisur Rahaman Molla, Prabhat Kumar Chand, Sumathi Sivasubramaniam","submitted_at":"2023-09-05T13:06:05Z","abstract_excerpt":"Research involving computing with mobile agents is a fast-growing field, given the advancement of technology in automated systems, e.g., robots, drones, self-driving cars, etc. Therefore, it is pressing to focus on solving classical network problems using mobile agents. In this paper, we study one such problem -- finding small dominating sets of a graph $G$ using mobile agents. Dominating set is interesting in the field of mobile agents as it opens up a way for solving various robotic problems, e.g., guarding, covering, facility location, transport routing, etc. In this paper, we first present"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02200","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/2309.02200/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":"2309.02200","created_at":"2026-07-05T06:47:57.094528+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.02200v1","created_at":"2026-07-05T06:47:57.094528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02200","created_at":"2026-07-05T06:47:57.094528+00:00"},{"alias_kind":"pith_short_12","alias_value":"OWY4FRZ7EWPD","created_at":"2026-07-05T06:47:57.094528+00:00"},{"alias_kind":"pith_short_16","alias_value":"OWY4FRZ7EWPDHTFU","created_at":"2026-07-05T06:47:57.094528+00:00"},{"alias_kind":"pith_short_8","alias_value":"OWY4FRZ7","created_at":"2026-07-05T06:47:57.094528+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.03667","citing_title":"Accelerating SfM-based Pose Estimation with Dominating Set","ref_index":2023,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI","json":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI.json","graph_json":"https://pith.science/api/pith-number/OWY4FRZ7EWPDHTFUATW7X3ISWI/graph.json","events_json":"https://pith.science/api/pith-number/OWY4FRZ7EWPDHTFUATW7X3ISWI/events.json","paper":"https://pith.science/paper/OWY4FRZ7"},"agent_actions":{"view_html":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI","download_json":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI.json","view_paper":"https://pith.science/paper/OWY4FRZ7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.02200&json=true","fetch_graph":"https://pith.science/api/pith-number/OWY4FRZ7EWPDHTFUATW7X3ISWI/graph.json","fetch_events":"https://pith.science/api/pith-number/OWY4FRZ7EWPDHTFUATW7X3ISWI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/action/storage_attestation","attest_author":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/action/author_attestation","sign_citation":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/action/citation_signature","submit_replication":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/action/replication_record"}},"created_at":"2026-07-05T06:47:57.094528+00:00","updated_at":"2026-07-05T06:47:57.094528+00:00"}