{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:OWY4FRZ7EWPDHTFUATW7X3ISWI","short_pith_number":"pith:OWY4FRZ7","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"},"canonical_sha256":"75b1c2c73f259e33ccb404edfbed12b22161f3e164418cbaa90166787f162883","source":{"kind":"arxiv","id":"2309.02200","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02200","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02200v1","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02200","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"OWY4FRZ7EWPD","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"pith_short_16","alias_value":"OWY4FRZ7EWPDHTFU","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"pith_short_8","alias_value":"OWY4FRZ7","created_at":"2026-07-05T06:47:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:OWY4FRZ7EWPDHTFUATW7X3ISWI","target":"record","payload":{"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"},"canonical_sha256":"75b1c2c73f259e33ccb404edfbed12b22161f3e164418cbaa90166787f162883","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"},"source_kind":"arxiv","source_id":"2309.02200","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-07-05T06:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PoB60eWNLGi+nWzU6ae2lEvaDaqQ1Stu/KWfc7aRaph2lqdtzrAOQp9HswTB44edqdOsR/oyK28QGoa+1uUeCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T10:07:48.738383Z"},"content_sha256":"51535b4adaa889d9fe26b2770c0dd7506dafed2457457dafcfc855171dd3416a","schema_version":"1.0","event_id":"sha256:51535b4adaa889d9fe26b2770c0dd7506dafed2457457dafcfc855171dd3416a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:OWY4FRZ7EWPDHTFUATW7X3ISWI","target":"graph","payload":{"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"},"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-07-05T06:47:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EzkOzsJFYoM977MlHJbAkgdzBhzTeuAZdeWI2wuRTw5SSsJqBu64LCIXGYyz7oTiLketjbqCvIPbgREb+tzbDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T10:07:48.738886Z"},"content_sha256":"281886ca4c78cf40cc944bd2d3be67096d0eae558c82f0afb9347ef2ea8d89b1","schema_version":"1.0","event_id":"sha256:281886ca4c78cf40cc944bd2d3be67096d0eae558c82f0afb9347ef2ea8d89b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/bundle.json","state_url":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/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-08-08T10:07:48Z","links":{"resolver":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI","bundle":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/bundle.json","state":"https://pith.science/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OWY4FRZ7EWPDHTFUATW7X3ISWI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:OWY4FRZ7EWPDHTFUATW7X3ISWI","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":"92b2ba753b797a9f9c7aa59a0ffdf711f4360fa30bfcc6badf49281bc74a4c39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-09-05T13:06:05Z","title_canon_sha256":"40985d53333616d5365d605d546b9ab5a305012dc67fd00c522a79516f3355d0"},"schema_version":"1.0","source":{"id":"2309.02200","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.02200","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"arxiv_version","alias_value":"2309.02200v1","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.02200","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"pith_short_12","alias_value":"OWY4FRZ7EWPD","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"pith_short_16","alias_value":"OWY4FRZ7EWPDHTFU","created_at":"2026-07-05T06:47:57Z"},{"alias_kind":"pith_short_8","alias_value":"OWY4FRZ7","created_at":"2026-07-05T06:47:57Z"}],"graph_snapshots":[{"event_id":"sha256:281886ca4c78cf40cc944bd2d3be67096d0eae558c82f0afb9347ef2ea8d89b1","target":"graph","created_at":"2026-07-05T06:47:57Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.02200/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anisur Rahaman Molla, Prabhat Kumar Chand, Sumathi Sivasubramaniam","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-09-05T13:06:05Z","title":"Run for Cover: Dominating Set via Mobile Agents"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.02200","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:51535b4adaa889d9fe26b2770c0dd7506dafed2457457dafcfc855171dd3416a","target":"record","created_at":"2026-07-05T06:47:57Z","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":"92b2ba753b797a9f9c7aa59a0ffdf711f4360fa30bfcc6badf49281bc74a4c39","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2023-09-05T13:06:05Z","title_canon_sha256":"40985d53333616d5365d605d546b9ab5a305012dc67fd00c522a79516f3355d0"},"schema_version":"1.0","source":{"id":"2309.02200","kind":"arxiv","version":1}},"canonical_sha256":"75b1c2c73f259e33ccb404edfbed12b22161f3e164418cbaa90166787f162883","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75b1c2c73f259e33ccb404edfbed12b22161f3e164418cbaa90166787f162883","first_computed_at":"2026-07-05T06:47:57.094455Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:47:57.094455Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3tpqpVfwAHFqe6+HgtmJtpAN/KI9/95cvdkCep1ipAHCfqYLlqxbrLkmYsGyC7s7pXP88NXQKfdGB8up54h9DQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:47:57.095021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.02200","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:51535b4adaa889d9fe26b2770c0dd7506dafed2457457dafcfc855171dd3416a","sha256:281886ca4c78cf40cc944bd2d3be67096d0eae558c82f0afb9347ef2ea8d89b1"],"state_sha256":"ec5e48ca19f68940fd6a3b8c0f2325bc77e052b49d074e8bc4cdc321f8d27949"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w/J0R9QsE1lfrbuwUg3TPFWVU02rNolDATicvty9CrRGNxwnfFY45vTfGK9tzysX5rKWwxY8aAr6um4lUWC7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T10:07:48.742059Z","bundle_sha256":"06afb8f1f5d0203abdbb20f5dde008d92260e0ff4703d69c06ea0b8ceba31ef7"}}