{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:JLNJPWZICV5TENS6TUFOMJ7J32","short_pith_number":"pith:JLNJPWZI","schema_version":"1.0","canonical_sha256":"4ada97db28157b32365e9d0ae627e9dea4d6b896e463ed6d6ab7853639cce2c2","source":{"kind":"arxiv","id":"1705.01229","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1705.01229","created_at":"2026-05-18T00:45:05.618928+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01229v1","created_at":"2026-05-18T00:45:05.618928+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01229","created_at":"2026-05-18T00:45:05.618928+00:00"},{"alias_kind":"pith_short_12","alias_value":"JLNJPWZICV5T","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_16","alias_value":"JLNJPWZICV5TENS6","created_at":"2026-05-18T12:31:24.725408+00:00"},{"alias_kind":"pith_short_8","alias_value":"JLNJPWZI","created_at":"2026-05-18T12:31:24.725408+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32","json":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32.json","graph_json":"https://pith.science/api/pith-number/JLNJPWZICV5TENS6TUFOMJ7J32/graph.json","events_json":"https://pith.science/api/pith-number/JLNJPWZICV5TENS6TUFOMJ7J32/events.json","paper":"https://pith.science/paper/JLNJPWZI"},"agent_actions":{"view_html":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32","download_json":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32.json","view_paper":"https://pith.science/paper/JLNJPWZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01229&json=true","fetch_graph":"https://pith.science/api/pith-number/JLNJPWZICV5TENS6TUFOMJ7J32/graph.json","fetch_events":"https://pith.science/api/pith-number/JLNJPWZICV5TENS6TUFOMJ7J32/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/action/storage_attestation","attest_author":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/action/author_attestation","sign_citation":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/action/citation_signature","submit_replication":"https://pith.science/pith/JLNJPWZICV5TENS6TUFOMJ7J32/action/replication_record"}},"created_at":"2026-05-18T00:45:05.618928+00:00","updated_at":"2026-05-18T00:45:05.618928+00:00"}