{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JLNJPWZICV5TENS6TUFOMJ7J32","short_pith_number":"pith:JLNJPWZI","canonical_record":{"source":{"id":"1705.01229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-03T01:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"0b78b414fc8527f2729750499965e946ebacb8b0bce09e6527196a9898393aa2","abstract_canon_sha256":"1a08a08b139fd35bc7d3eb8a7e86d6b4a7df1120fb2026f268efb30a7dd5229f"},"schema_version":"1.0"},"canonical_sha256":"4ada97db28157b32365e9d0ae627e9dea4d6b896e463ed6d6ab7853639cce2c2","source":{"kind":"arxiv","id":"1705.01229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01229","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01229v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01229","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"JLNJPWZICV5T","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLNJPWZICV5TENS6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLNJPWZI","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JLNJPWZICV5TENS6TUFOMJ7J32","target":"record","payload":{"canonical_record":{"source":{"id":"1705.01229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-03T01:49:35Z","cross_cats_sorted":[],"title_canon_sha256":"0b78b414fc8527f2729750499965e946ebacb8b0bce09e6527196a9898393aa2","abstract_canon_sha256":"1a08a08b139fd35bc7d3eb8a7e86d6b4a7df1120fb2026f268efb30a7dd5229f"},"schema_version":"1.0"},"canonical_sha256":"4ada97db28157b32365e9d0ae627e9dea4d6b896e463ed6d6ab7853639cce2c2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:45:05.619215Z","signature_b64":"zqTRk5UIPaR0oDROycyxXav3V2m11jk8TIwRzgp2mg8/6vvDXJB0U59iFBJDsefIrojBKcRA/DQBAKdVG25LAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4ada97db28157b32365e9d0ae627e9dea4d6b896e463ed6d6ab7853639cce2c2","last_reissued_at":"2026-05-18T00:45:05.618873Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:45:05.618873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.01229","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-18T00:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KbJSeQ1ErxN1PYxWCwnOLsFaXZpZrQfnWniZ6AiaZuNQauOdGbql0NTUK1EsaLIRJh4hwoPtBopzdywn95CTAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:57:32.249612Z"},"content_sha256":"47eae0aba263d89f0d5b31789704ca94ff43a5247bff195cd7b676a4370a336c","schema_version":"1.0","event_id":"sha256:47eae0aba263d89f0d5b31789704ca94ff43a5247bff195cd7b676a4370a336c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JLNJPWZICV5TENS6TUFOMJ7J32","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andrzej Pelc, Avery Miller","submitted_at":"2017-05-03T01:49:35Z","abstract_excerpt":"A $k$-dominating set is a set $D$ of nodes of a graph such that, for each node $v$, there exists a node $w \\in D$ at distance at most $k$ from $v$. Our aim is the deterministic distributed construction of small $T$-dominating sets in time $T$ in networks modeled as undirected $n$-node graphs and under the $\\cal{LOCAL}$ communication model.\n  For any positive integer $T$, if $b$ is the size of a pairwise disjoint collection of balls of radii at least $T$ in a graph, then $b$ is an obvious lower bound on the size of a $T$-dominating set. Our first result shows that, even on rings, it is impossib"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01229","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-18T00:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqd0VMdE63u+rjxxxk0XvC3eS7uci4amxl4E9Q8ivXw4rrlk0Oi6gysZZWZBxM7a+ugypAVOB+jnveWGmOSSBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T09:57:32.249959Z"},"content_sha256":"fe8e2616931f60cc20347a06d18b490c84d9764c7a08d8be237f176e0014cd61","schema_version":"1.0","event_id":"sha256:fe8e2616931f60cc20347a06d18b490c84d9764c7a08d8be237f176e0014cd61"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/bundle.json","state_url":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JLNJPWZICV5TENS6TUFOMJ7J32/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-26T09:57:32Z","links":{"resolver":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32","bundle":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/bundle.json","state":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JLNJPWZICV5TENS6TUFOMJ7J32/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JLNJPWZICV5TENS6TUFOMJ7J32","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":"1a08a08b139fd35bc7d3eb8a7e86d6b4a7df1120fb2026f268efb30a7dd5229f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-03T01:49:35Z","title_canon_sha256":"0b78b414fc8527f2729750499965e946ebacb8b0bce09e6527196a9898393aa2"},"schema_version":"1.0","source":{"id":"1705.01229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01229","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01229v1","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01229","created_at":"2026-05-18T00:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"JLNJPWZICV5T","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JLNJPWZICV5TENS6","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JLNJPWZI","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:fe8e2616931f60cc20347a06d18b490c84d9764c7a08d8be237f176e0014cd61","target":"graph","created_at":"2026-05-18T00:45:05Z","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":"A $k$-dominating set is a set $D$ of nodes of a graph such that, for each node $v$, there exists a node $w \\in D$ at distance at most $k$ from $v$. Our aim is the deterministic distributed construction of small $T$-dominating sets in time $T$ in networks modeled as undirected $n$-node graphs and under the $\\cal{LOCAL}$ communication model.\n  For any positive integer $T$, if $b$ is the size of a pairwise disjoint collection of balls of radii at least $T$ in a graph, then $b$ is an obvious lower bound on the size of a $T$-dominating set. Our first result shows that, even on rings, it is impossib","authors_text":"Andrzej Pelc, Avery Miller","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-03T01:49:35Z","title":"Deterministic Distributed Construction of $T$-Dominating Sets in Time $T$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01229","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:47eae0aba263d89f0d5b31789704ca94ff43a5247bff195cd7b676a4370a336c","target":"record","created_at":"2026-05-18T00:45:05Z","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":"1a08a08b139fd35bc7d3eb8a7e86d6b4a7df1120fb2026f268efb30a7dd5229f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-03T01:49:35Z","title_canon_sha256":"0b78b414fc8527f2729750499965e946ebacb8b0bce09e6527196a9898393aa2"},"schema_version":"1.0","source":{"id":"1705.01229","kind":"arxiv","version":1}},"canonical_sha256":"4ada97db28157b32365e9d0ae627e9dea4d6b896e463ed6d6ab7853639cce2c2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4ada97db28157b32365e9d0ae627e9dea4d6b896e463ed6d6ab7853639cce2c2","first_computed_at":"2026-05-18T00:45:05.618873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:45:05.618873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zqTRk5UIPaR0oDROycyxXav3V2m11jk8TIwRzgp2mg8/6vvDXJB0U59iFBJDsefIrojBKcRA/DQBAKdVG25LAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:45:05.619215Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47eae0aba263d89f0d5b31789704ca94ff43a5247bff195cd7b676a4370a336c","sha256:fe8e2616931f60cc20347a06d18b490c84d9764c7a08d8be237f176e0014cd61"],"state_sha256":"bd3a4e0b00792b15ceb90917595c100243b5eba5bdad813030202ea26b2c3baf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AH26dyQXrKej3rbNnC68C1OUSThyIwMt4eWBNOHsJEMM06Rj0uPMqaGqbQ+XHW1UYESUPuvPkH6S05icTvgICw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T09:57:32.251887Z","bundle_sha256":"bfa2aacb47705a9bd93c10a70c3b64f014e8852a07960c4d3d64d7b2664a59e3"}}