{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EWMRTVUBHBQEGFNZWM2FOSY4KN","short_pith_number":"pith:EWMRTVUB","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"},"canonical_sha256":"259919d68138604315b9b334574b1c536c6b16d65096562c366bea12801c5806","source":{"kind":"arxiv","id":"1706.09185","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09185","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09185v1","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09185","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"EWMRTVUBHBQE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EWMRTVUBHBQEGFNZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EWMRTVUB","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EWMRTVUBHBQEGFNZWM2FOSY4KN","target":"record","payload":{"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"},"canonical_sha256":"259919d68138604315b9b334574b1c536c6b16d65096562c366bea12801c5806","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"},"source_kind":"arxiv","source_id":"1706.09185","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:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYVDmKPaL2t0Gg49gH6HQTyW9HEbD12LeMlwGkCfYgDmq0BJqh1I56Vcx2VCg7V6TFzMyet/hGFbipm7TzkbBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:47.206696Z"},"content_sha256":"871e766c5700dc020cdae97f8c603d890920f948b7d9c487cd0916f76eb0ea2c","schema_version":"1.0","event_id":"sha256:871e766c5700dc020cdae97f8c603d890920f948b7d9c487cd0916f76eb0ea2c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EWMRTVUBHBQEGFNZWM2FOSY4KN","target":"graph","payload":{"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"},"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:41:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"anzu9aKsASGGpbqoAd6VD4drrhI/slvVowo3gecU4jQFyhd9I0/XWbfWzDVRPIvq440TXHugB41CQgy0rt/tCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:58:47.207049Z"},"content_sha256":"c90c05dd9e5b91eaf2f359f1ee591e2abbcccaaa27d727c9c0bce58e0669c825","schema_version":"1.0","event_id":"sha256:c90c05dd9e5b91eaf2f359f1ee591e2abbcccaaa27d727c9c0bce58e0669c825"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/bundle.json","state_url":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/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-25T17:58:47Z","links":{"resolver":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN","bundle":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/bundle.json","state":"https://pith.science/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWMRTVUBHBQEGFNZWM2FOSY4KN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EWMRTVUBHBQEGFNZWM2FOSY4KN","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":"03f25c36251e3ccc18bf73388604ac5115a1b6ae5ef2754da5f353f53215cd54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T09:41:19Z","title_canon_sha256":"44ef561556a2601c6fdec5b94dedfc6b98aa10a3f3475eacdbdd180ccd197141"},"schema_version":"1.0","source":{"id":"1706.09185","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09185","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09185v1","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09185","created_at":"2026-05-18T00:41:19Z"},{"alias_kind":"pith_short_12","alias_value":"EWMRTVUBHBQE","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EWMRTVUBHBQEGFNZ","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EWMRTVUB","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:c90c05dd9e5b91eaf2f359f1ee591e2abbcccaaa27d727c9c0bce58e0669c825","target":"graph","created_at":"2026-05-18T00:41:19Z","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":"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","authors_text":"Nadav Krasnopolsky, Oren Weimann, Pawe{\\l} Gawrychowski, Shay Mozes","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T09:41:19Z","title":"Dispersion on Trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09185","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:871e766c5700dc020cdae97f8c603d890920f948b7d9c487cd0916f76eb0ea2c","target":"record","created_at":"2026-05-18T00:41:19Z","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":"03f25c36251e3ccc18bf73388604ac5115a1b6ae5ef2754da5f353f53215cd54","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-28T09:41:19Z","title_canon_sha256":"44ef561556a2601c6fdec5b94dedfc6b98aa10a3f3475eacdbdd180ccd197141"},"schema_version":"1.0","source":{"id":"1706.09185","kind":"arxiv","version":1}},"canonical_sha256":"259919d68138604315b9b334574b1c536c6b16d65096562c366bea12801c5806","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"259919d68138604315b9b334574b1c536c6b16d65096562c366bea12801c5806","first_computed_at":"2026-05-18T00:41:19.503989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:19.503989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"d1b6fbp5BGEjL4XzwvWs9HfQrc6VZaC0sjT5w/V5OEXVO+2wpAkbKAmkafDUsyoLZ0Fxl75bpzNGP0Q4szpsCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:19.505001Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09185","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:871e766c5700dc020cdae97f8c603d890920f948b7d9c487cd0916f76eb0ea2c","sha256:c90c05dd9e5b91eaf2f359f1ee591e2abbcccaaa27d727c9c0bce58e0669c825"],"state_sha256":"81a7ee76d72b9f45dec9ffb6217e556788a909d408b08983281663527cb5eb38"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BDOP/dqK7tk6A8ZLyUpq6mjBYhxvbB6xYH2Gqa6yxdHR1XVlLAEGHoEoXEwM7h+qTY5cN0hbpTTwZgYwJ2AnDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:58:47.210798Z","bundle_sha256":"5efc1d4f8999b98ef666aa3078204a5b813ece8093eb0be35f87767b78ad992d"}}