{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:GXMI2KLYPIKZP4YL4NCAWS6O7V","short_pith_number":"pith:GXMI2KLY","canonical_record":{"source":{"id":"1211.0157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-01T12:11:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"491030cf8ddf24fa83f45b051f7bc3d83c948695ee7c7bb67ab913e1b11bd7ab","abstract_canon_sha256":"dfeab578716eb00c174573211fee977c356a563f0f4f4711dfbac6d90b1ec94e"},"schema_version":"1.0"},"canonical_sha256":"35d88d29787a1597f30be3440b4bcefd7f3af66b4c82c9965c008439c13caf7c","source":{"kind":"arxiv","id":"1211.0157","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0157","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0157v1","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0157","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"GXMI2KLYPIKZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GXMI2KLYPIKZP4YL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GXMI2KLY","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:GXMI2KLYPIKZP4YL4NCAWS6O7V","target":"record","payload":{"canonical_record":{"source":{"id":"1211.0157","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-01T12:11:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"491030cf8ddf24fa83f45b051f7bc3d83c948695ee7c7bb67ab913e1b11bd7ab","abstract_canon_sha256":"dfeab578716eb00c174573211fee977c356a563f0f4f4711dfbac6d90b1ec94e"},"schema_version":"1.0"},"canonical_sha256":"35d88d29787a1597f30be3440b4bcefd7f3af66b4c82c9965c008439c13caf7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:43.006845Z","signature_b64":"JIwBlI0LCa1ERfazWKI6K9vCIMkpBuyf01az2jw9RIxqShEEH8jQ4Ap6pUX0NCo0MCslfjfAr8hb29CGyg83Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35d88d29787a1597f30be3440b4bcefd7f3af66b4c82c9965c008439c13caf7c","last_reissued_at":"2026-05-18T03:41:43.005740Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:43.005740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1211.0157","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-05-18T03:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iV3Epx0LjDROTPaJ1WSI87+/KvzwGMVQfS+0uKpoqcFhcgdVEWtWRzRq0z38fzhWhsRFeIR+nPJltLksVRZwCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:26:09.829052Z"},"content_sha256":"6fe439b458a6e64cbfa5e72687c72bd8cc213421c5dd804e2c5ed6af58d44e4c","schema_version":"1.0","event_id":"sha256:6fe439b458a6e64cbfa5e72687c72bd8cc213421c5dd804e2c5ed6af58d44e4c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:GXMI2KLYPIKZP4YL4NCAWS6O7V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal Covering with Mobile Sensors in an Unbounded Region","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Barun Gorain, Partha Sarathi Mandal","submitted_at":"2012-11-01T12:11:23Z","abstract_excerpt":"Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \\cite{Li09}. In this paper we have proposed an {\\it id} based distributed algorithm for optimal coverage in an unbounded region. The proposed algorithm guarantees maximum spreading in $O(\\sqrt{n})$ rounds without creating any coverage hole. The algorithm executes in synchronous rounds without exchanging any message.\n  We have also explained how our proposed algorithm can achieve optimal energy consumption and handle random sensor node deployment for optimal spreading."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0157","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":""},"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-18T03:41:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxV71gc29qBZxPGXXoLj8Ni8Ou1PLvjiAW2/CDPnHRw+JOmqUe7iUcB9TUEQdZ4B8Oe0QKdfUqNDLlZarPBPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T03:26:09.829417Z"},"content_sha256":"4bf642469a1cd37c136666596383c734e468efbde36ab700a01a5a85529db844","schema_version":"1.0","event_id":"sha256:4bf642469a1cd37c136666596383c734e468efbde36ab700a01a5a85529db844"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V/bundle.json","state_url":"https://pith.science/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V/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-06-03T03:26:09Z","links":{"resolver":"https://pith.science/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V","bundle":"https://pith.science/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V/bundle.json","state":"https://pith.science/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GXMI2KLYPIKZP4YL4NCAWS6O7V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:GXMI2KLYPIKZP4YL4NCAWS6O7V","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":"dfeab578716eb00c174573211fee977c356a563f0f4f4711dfbac6d90b1ec94e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-01T12:11:23Z","title_canon_sha256":"491030cf8ddf24fa83f45b051f7bc3d83c948695ee7c7bb67ab913e1b11bd7ab"},"schema_version":"1.0","source":{"id":"1211.0157","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1211.0157","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"arxiv_version","alias_value":"1211.0157v1","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1211.0157","created_at":"2026-05-18T03:41:43Z"},{"alias_kind":"pith_short_12","alias_value":"GXMI2KLYPIKZ","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"GXMI2KLYPIKZP4YL","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"GXMI2KLY","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:4bf642469a1cd37c136666596383c734e468efbde36ab700a01a5a85529db844","target":"graph","created_at":"2026-05-18T03:41:43Z","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":"Covering a bounded region with minimum number of homogeneous sensor nodes is a NP-complete problem \\cite{Li09}. In this paper we have proposed an {\\it id} based distributed algorithm for optimal coverage in an unbounded region. The proposed algorithm guarantees maximum spreading in $O(\\sqrt{n})$ rounds without creating any coverage hole. The algorithm executes in synchronous rounds without exchanging any message.\n  We have also explained how our proposed algorithm can achieve optimal energy consumption and handle random sensor node deployment for optimal spreading.","authors_text":"Barun Gorain, Partha Sarathi Mandal","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-01T12:11:23Z","title":"Optimal Covering with Mobile Sensors in an Unbounded Region"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1211.0157","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:6fe439b458a6e64cbfa5e72687c72bd8cc213421c5dd804e2c5ed6af58d44e4c","target":"record","created_at":"2026-05-18T03:41:43Z","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":"dfeab578716eb00c174573211fee977c356a563f0f4f4711dfbac6d90b1ec94e","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-11-01T12:11:23Z","title_canon_sha256":"491030cf8ddf24fa83f45b051f7bc3d83c948695ee7c7bb67ab913e1b11bd7ab"},"schema_version":"1.0","source":{"id":"1211.0157","kind":"arxiv","version":1}},"canonical_sha256":"35d88d29787a1597f30be3440b4bcefd7f3af66b4c82c9965c008439c13caf7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"35d88d29787a1597f30be3440b4bcefd7f3af66b4c82c9965c008439c13caf7c","first_computed_at":"2026-05-18T03:41:43.005740Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:43.005740Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JIwBlI0LCa1ERfazWKI6K9vCIMkpBuyf01az2jw9RIxqShEEH8jQ4Ap6pUX0NCo0MCslfjfAr8hb29CGyg83Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:43.006845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1211.0157","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fe439b458a6e64cbfa5e72687c72bd8cc213421c5dd804e2c5ed6af58d44e4c","sha256:4bf642469a1cd37c136666596383c734e468efbde36ab700a01a5a85529db844"],"state_sha256":"eb03395e2987918d4491233f8fdd45c0a7299e3c2500780447d8b380e98ca0fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JfdmRJf/QW1LGB8OYGFoOzQvXFyC4WL+n2SCwIeeXUMBZ6LKKyDgioDNSCWDh5VIg2rvj1xP1U37dVk6qCGDCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T03:26:09.831380Z","bundle_sha256":"603000a4418edf730cd4c4f04cbc06ca1963195a3ef619c81e41db5b4f5124cb"}}