{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JID7NP7E33WPCJVHASZWTU3SYF","short_pith_number":"pith:JID7NP7E","canonical_record":{"source":{"id":"1303.3564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-14T19:33:26Z","cross_cats_sorted":[],"title_canon_sha256":"4507e6a669ee68eea311c0e4ad1be77dcab24f07919ee27c4b5afd67290b87b6","abstract_canon_sha256":"2a8723389a55f69ec363d1b0af2f10d9f0bda032f4ad39cf645d1e4e71b1bce2"},"schema_version":"1.0"},"canonical_sha256":"4a07f6bfe4deecf126a704b369d372c14e00b5449447d7f2f3da4e51c497ca08","source":{"kind":"arxiv","id":"1303.3564","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3564","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3564v1","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3564","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"JID7NP7E33WP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JID7NP7E33WPCJVH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JID7NP7E","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JID7NP7E33WPCJVHASZWTU3SYF","target":"record","payload":{"canonical_record":{"source":{"id":"1303.3564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-14T19:33:26Z","cross_cats_sorted":[],"title_canon_sha256":"4507e6a669ee68eea311c0e4ad1be77dcab24f07919ee27c4b5afd67290b87b6","abstract_canon_sha256":"2a8723389a55f69ec363d1b0af2f10d9f0bda032f4ad39cf645d1e4e71b1bce2"},"schema_version":"1.0"},"canonical_sha256":"4a07f6bfe4deecf126a704b369d372c14e00b5449447d7f2f3da4e51c497ca08","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:54.230824Z","signature_b64":"uCLJuJ6cY45D2rJtevnyEoeJ/OfU6iZTfKN3f7/fx0UY0G3418A+UfSySkCBurAv8iN678k+tyw+QgqtuasoAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a07f6bfe4deecf126a704b369d372c14e00b5449447d7f2f3da4e51c497ca08","last_reissued_at":"2026-05-18T03:30:54.230073Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:54.230073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.3564","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:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2A29+M2aKNYtErQ38sO7f/HD/+Bv0jnum4/atrduPV7KwQt+CEqFUZ1ui8gZ4Yy7yfk96eSmaluVPwiJ8ykCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:40:34.273576Z"},"content_sha256":"35ed9ddab2f4d06266df7353096244b0d62329f693301b10f01fe11f0c40da63","schema_version":"1.0","event_id":"sha256:35ed9ddab2f4d06266df7353096244b0d62329f693301b10f01fe11f0c40da63"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JID7NP7E33WPCJVHASZWTU3SYF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Dominating Sets on Grids","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elaheh Fata, Shreyas Sundaram, Stephen L. Smith","submitted_at":"2013-03-14T19:33:26Z","abstract_excerpt":"This paper presents a distributed algorithm for finding near optimal dominating sets on grids. The basis for this algorithm is an existing centralized algorithm that constructs dominating sets on grids. The size of the dominating set provided by this centralized algorithm is upper-bounded by $\\lceil\\frac{(m+2)(n+2)}{5}\\rceil$ for $m\\times n$ grids and its difference from the optimal domination number of the grid is upper-bounded by five. Both the centralized and distributed algorithms are generalized for the $k$-distance dominating set problem, where all grid vertices are within distance $k$ o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3564","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:30:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QubXO86vqrVGGWWJ00Xzl1v4dtcUWuQNSYMC1oyLVqKXk3Wd16piS85tbhQOhAB7CdAbBZ8eFzYoX9Zvj/ytCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T15:40:34.273939Z"},"content_sha256":"d805cd60386418cb1c8abb5ea64a962823a6efe69f1acde787d7033b3cedcb57","schema_version":"1.0","event_id":"sha256:d805cd60386418cb1c8abb5ea64a962823a6efe69f1acde787d7033b3cedcb57"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JID7NP7E33WPCJVHASZWTU3SYF/bundle.json","state_url":"https://pith.science/pith/JID7NP7E33WPCJVHASZWTU3SYF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JID7NP7E33WPCJVHASZWTU3SYF/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-05-31T15:40:34Z","links":{"resolver":"https://pith.science/pith/JID7NP7E33WPCJVHASZWTU3SYF","bundle":"https://pith.science/pith/JID7NP7E33WPCJVHASZWTU3SYF/bundle.json","state":"https://pith.science/pith/JID7NP7E33WPCJVHASZWTU3SYF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JID7NP7E33WPCJVHASZWTU3SYF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JID7NP7E33WPCJVHASZWTU3SYF","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":"2a8723389a55f69ec363d1b0af2f10d9f0bda032f4ad39cf645d1e4e71b1bce2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-14T19:33:26Z","title_canon_sha256":"4507e6a669ee68eea311c0e4ad1be77dcab24f07919ee27c4b5afd67290b87b6"},"schema_version":"1.0","source":{"id":"1303.3564","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.3564","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"arxiv_version","alias_value":"1303.3564v1","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.3564","created_at":"2026-05-18T03:30:54Z"},{"alias_kind":"pith_short_12","alias_value":"JID7NP7E33WP","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JID7NP7E33WPCJVH","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JID7NP7E","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:d805cd60386418cb1c8abb5ea64a962823a6efe69f1acde787d7033b3cedcb57","target":"graph","created_at":"2026-05-18T03:30:54Z","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":"This paper presents a distributed algorithm for finding near optimal dominating sets on grids. The basis for this algorithm is an existing centralized algorithm that constructs dominating sets on grids. The size of the dominating set provided by this centralized algorithm is upper-bounded by $\\lceil\\frac{(m+2)(n+2)}{5}\\rceil$ for $m\\times n$ grids and its difference from the optimal domination number of the grid is upper-bounded by five. Both the centralized and distributed algorithms are generalized for the $k$-distance dominating set problem, where all grid vertices are within distance $k$ o","authors_text":"Elaheh Fata, Shreyas Sundaram, Stephen L. Smith","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-14T19:33:26Z","title":"Distributed Dominating Sets on Grids"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.3564","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:35ed9ddab2f4d06266df7353096244b0d62329f693301b10f01fe11f0c40da63","target":"record","created_at":"2026-05-18T03:30:54Z","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":"2a8723389a55f69ec363d1b0af2f10d9f0bda032f4ad39cf645d1e4e71b1bce2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-14T19:33:26Z","title_canon_sha256":"4507e6a669ee68eea311c0e4ad1be77dcab24f07919ee27c4b5afd67290b87b6"},"schema_version":"1.0","source":{"id":"1303.3564","kind":"arxiv","version":1}},"canonical_sha256":"4a07f6bfe4deecf126a704b369d372c14e00b5449447d7f2f3da4e51c497ca08","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a07f6bfe4deecf126a704b369d372c14e00b5449447d7f2f3da4e51c497ca08","first_computed_at":"2026-05-18T03:30:54.230073Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:54.230073Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uCLJuJ6cY45D2rJtevnyEoeJ/OfU6iZTfKN3f7/fx0UY0G3418A+UfSySkCBurAv8iN678k+tyw+QgqtuasoAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:54.230824Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.3564","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:35ed9ddab2f4d06266df7353096244b0d62329f693301b10f01fe11f0c40da63","sha256:d805cd60386418cb1c8abb5ea64a962823a6efe69f1acde787d7033b3cedcb57"],"state_sha256":"e8460aa2c612b20bef6f14a7861af6bdbcb99096c9f82d3bb604aa716f2c46a4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7g3Z/s8D8JBWEzHE0MKQO0YOsAwvJpb9I/ruQGv4lIJYtahfY/AZ6TglEU00+TjyjgOx8D3E/8nlEiCqIET0Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T15:40:34.276536Z","bundle_sha256":"9e195a2a04aba018a386ee03c1d80f9c388ec62922f2c8f0f0e311fb3b9eb1b4"}}