{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:EWMRTVUBHBQEGFNZWM2FOSY4KN","short_pith_number":"pith:EWMRTVUB","schema_version":"1.0","canonical_sha256":"259919d68138604315b9b334574b1c536c6b16d65096562c366bea12801c5806","source":{"kind":"arxiv","id":"1706.09185","version":1},"attestation_state":"computed","paper":{"title":"Dispersion on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nadav Krasnopolsky, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2017-06-28T09:41:19Z","abstract_excerpt":"In the $k$-dispersion problem, we need to select $k$ nodes of a given graph so as to maximize the minimum distance between any two chosen nodes. This can be seen as a generalization of the independent set problem, where the goal is to select nodes so that the minimum distance is larger than 1. We design an optimal $O(n)$ time algorithm for the dispersion problem on trees consisting of $n$ nodes, thus improving the previous $O(n\\log n)$ time solution from 1997.\n  We also consider the weighted case, where the goal is to choose a set of nodes of total weight at least $W$. We present an $O(n\\log^2"},"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":"1706.09185","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T09:41:19Z","cross_cats_sorted":[],"title_canon_sha256":"44ef561556a2601c6fdec5b94dedfc6b98aa10a3f3475eacdbdd180ccd197141","abstract_canon_sha256":"03f25c36251e3ccc18bf73388604ac5115a1b6ae5ef2754da5f353f53215cd54"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:19.505001Z","signature_b64":"d1b6fbp5BGEjL4XzwvWs9HfQrc6VZaC0sjT5w/V5OEXVO+2wpAkbKAmkafDUsyoLZ0Fxl75bpzNGP0Q4szpsCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"259919d68138604315b9b334574b1c536c6b16d65096562c366bea12801c5806","last_reissued_at":"2026-05-18T00:41:19.503989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:19.503989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dispersion on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nadav Krasnopolsky, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","submitted_at":"2017-06-28T09:41:19Z","abstract_excerpt":"In the $k$-dispersion problem, we need to select $k$ nodes of a given graph so as to maximize the minimum distance between any two chosen nodes. This can be seen as a generalization of the independent set problem, where the goal is to select nodes so that the minimum distance is larger than 1. We design an optimal $O(n)$ time algorithm for the dispersion problem on trees consisting of $n$ nodes, thus improving the previous $O(n\\log n)$ time solution from 1997.\n  We also consider the weighted case, where the goal is to choose a set of nodes of total weight at least $W$. We present an $O(n\\log^2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09185","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":"1706.09185","created_at":"2026-05-18T00:41:19.504116+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.09185v1","created_at":"2026-05-18T00:41:19.504116+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09185","created_at":"2026-05-18T00:41:19.504116+00:00"},{"alias_kind":"pith_short_12","alias_value":"EWMRTVUBHBQE","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"EWMRTVUBHBQEGFNZ","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"EWMRTVUB","created_at":"2026-05-18T12:31:12.930513+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/EWMRTVUBHBQEGFNZWM2FOSY4KN","json":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN.json","graph_json":"https://pith.science/api/pith-number/EWMRTVUBHBQEGFNZWM2FOSY4KN/graph.json","events_json":"https://pith.science/api/pith-number/EWMRTVUBHBQEGFNZWM2FOSY4KN/events.json","paper":"https://pith.science/paper/EWMRTVUB"},"agent_actions":{"view_html":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN","download_json":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN.json","view_paper":"https://pith.science/paper/EWMRTVUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.09185&json=true","fetch_graph":"https://pith.science/api/pith-number/EWMRTVUBHBQEGFNZWM2FOSY4KN/graph.json","fetch_events":"https://pith.science/api/pith-number/EWMRTVUBHBQEGFNZWM2FOSY4KN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/action/storage_attestation","attest_author":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/action/author_attestation","sign_citation":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/action/citation_signature","submit_replication":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/action/replication_record"}},"created_at":"2026-05-18T00:41:19.504116+00:00","updated_at":"2026-05-18T00:41:19.504116+00:00"}