{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ENKQXT5UVDRRRWP5X7WUHWOJFN","short_pith_number":"pith:ENKQXT5U","schema_version":"1.0","canonical_sha256":"23550bcfb4a8e318d9fdbfed43d9c92b6fe8f30ae7b5bba19b373dcc67ae38d7","source":{"kind":"arxiv","id":"1711.00599","version":1},"attestation_state":"computed","paper":{"title":"Optimal Parametric Search for Path and Tree Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Greg N. Frederickson, Samson Zhou","submitted_at":"2017-11-02T02:46:56Z","abstract_excerpt":"We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing $k$ edges to maximize the minimum-weight component. We also use the same framework to partition a path with weight on the vertices, removing $k$ edges to minimize the maximum-weight component. The algorithms use the parametric search paradigm, testing candidate values until an optimum is found while simultaneously reducing the running time needed for each test. For path-partitioning, the algorithm employs a synthetic weighting scheme that results in a constant fraction reduction in runn"},"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":"1711.00599","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-02T02:46:56Z","cross_cats_sorted":[],"title_canon_sha256":"bc1aa29733e81bf2f06ee9e635bee4ed69c587e600b0ea9d36eea0597275dd89","abstract_canon_sha256":"5145e9b9c5f76f9eccf3ed22f0c7422cb153c2fdc2276497dbe9833b7c1de5ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:30.065653Z","signature_b64":"magMagIyd77O5GmYg/yt9AnY3p4tY8sdQKwJfEhIbDrvl4h+Xpt1qJI6HZ7XgXvnD1jEkUk3XKcdFOox1ry3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23550bcfb4a8e318d9fdbfed43d9c92b6fe8f30ae7b5bba19b373dcc67ae38d7","last_reissued_at":"2026-05-18T00:31:30.065008Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:30.065008Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Parametric Search for Path and Tree Partitioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Greg N. Frederickson, Samson Zhou","submitted_at":"2017-11-02T02:46:56Z","abstract_excerpt":"We present linear-time algorithms for partitioning a path or a tree with weights on the vertices by removing $k$ edges to maximize the minimum-weight component. We also use the same framework to partition a path with weight on the vertices, removing $k$ edges to minimize the maximum-weight component. The algorithms use the parametric search paradigm, testing candidate values until an optimum is found while simultaneously reducing the running time needed for each test. For path-partitioning, the algorithm employs a synthetic weighting scheme that results in a constant fraction reduction in runn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.00599","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":"1711.00599","created_at":"2026-05-18T00:31:30.065089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.00599v1","created_at":"2026-05-18T00:31:30.065089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.00599","created_at":"2026-05-18T00:31:30.065089+00:00"},{"alias_kind":"pith_short_12","alias_value":"ENKQXT5UVDRR","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"ENKQXT5UVDRRRWP5","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"ENKQXT5U","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/ENKQXT5UVDRRRWP5X7WUHWOJFN","json":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN.json","graph_json":"https://pith.science/api/pith-number/ENKQXT5UVDRRRWP5X7WUHWOJFN/graph.json","events_json":"https://pith.science/api/pith-number/ENKQXT5UVDRRRWP5X7WUHWOJFN/events.json","paper":"https://pith.science/paper/ENKQXT5U"},"agent_actions":{"view_html":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN","download_json":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN.json","view_paper":"https://pith.science/paper/ENKQXT5U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.00599&json=true","fetch_graph":"https://pith.science/api/pith-number/ENKQXT5UVDRRRWP5X7WUHWOJFN/graph.json","fetch_events":"https://pith.science/api/pith-number/ENKQXT5UVDRRRWP5X7WUHWOJFN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN/action/storage_attestation","attest_author":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN/action/author_attestation","sign_citation":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN/action/citation_signature","submit_replication":"https://pith.science/pith/ENKQXT5UVDRRRWP5X7WUHWOJFN/action/replication_record"}},"created_at":"2026-05-18T00:31:30.065089+00:00","updated_at":"2026-05-18T00:31:30.065089+00:00"}