{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:R6Z3FVS5I6XDZELZSN4GPPAJ2V","short_pith_number":"pith:R6Z3FVS5","schema_version":"1.0","canonical_sha256":"8fb3b2d65d47ae3c9179937867bc09d54e3f07dcde8de3487fc94a2010ab6a07","source":{"kind":"arxiv","id":"1809.03685","version":2},"attestation_state":"computed","paper":{"title":"Massively Parallel Dynamic Programming on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahsa Derakhshan, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Soheil Behnezhad, Vahab Mirrokni","submitted_at":"2018-09-11T05:24:43Z","abstract_excerpt":"Dynamic programming is a powerful technique that is, unfortunately, often inherently sequential. That is, there exists no unified method to parallelize algorithms that use dynamic programming. In this paper, we attempt to address this issue in the Massively Parallel Computations (MPC) model which is a popular abstraction of MapReduce-like paradigms. Our main result is an algorithmic framework to adapt a large family of dynamic programs defined over trees.\n  We introduce two classes of graph problems that admit dynamic programming solutions on trees. We refer to them as \"(polylog)-expressible\" "},"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":"1809.03685","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-09-11T05:24:43Z","cross_cats_sorted":[],"title_canon_sha256":"5e746c6aae12ebf133b5796524f35a596c24cd780b094d4eaba809c490aa86e5","abstract_canon_sha256":"ca581442c656be54029354d80090e4aa28f14b472ea89124d6b6ee9f47029967"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:40.759739Z","signature_b64":"90+ff10Jub3nSx8mZ/QvmMl0A3r/ckmQZ3dWzZCJ8WTBBSIwU7vn1/baj5vZQzjIUNuvMsshbmBOUWM/A4sfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8fb3b2d65d47ae3c9179937867bc09d54e3f07dcde8de3487fc94a2010ab6a07","last_reissued_at":"2026-05-18T00:05:40.759103Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:40.759103Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Massively Parallel Dynamic Programming on Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mahsa Derakhshan, MohammadHossein Bateni, MohammadTaghi Hajiaghayi, Soheil Behnezhad, Vahab Mirrokni","submitted_at":"2018-09-11T05:24:43Z","abstract_excerpt":"Dynamic programming is a powerful technique that is, unfortunately, often inherently sequential. That is, there exists no unified method to parallelize algorithms that use dynamic programming. In this paper, we attempt to address this issue in the Massively Parallel Computations (MPC) model which is a popular abstraction of MapReduce-like paradigms. Our main result is an algorithmic framework to adapt a large family of dynamic programs defined over trees.\n  We introduce two classes of graph problems that admit dynamic programming solutions on trees. We refer to them as \"(polylog)-expressible\" "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1809.03685","kind":"arxiv","version":2},"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":"1809.03685","created_at":"2026-05-18T00:05:40.759227+00:00"},{"alias_kind":"arxiv_version","alias_value":"1809.03685v2","created_at":"2026-05-18T00:05:40.759227+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1809.03685","created_at":"2026-05-18T00:05:40.759227+00:00"},{"alias_kind":"pith_short_12","alias_value":"R6Z3FVS5I6XD","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"R6Z3FVS5I6XDZELZ","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"R6Z3FVS5","created_at":"2026-05-18T12:32:50.500415+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/R6Z3FVS5I6XDZELZSN4GPPAJ2V","json":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V.json","graph_json":"https://pith.science/api/pith-number/R6Z3FVS5I6XDZELZSN4GPPAJ2V/graph.json","events_json":"https://pith.science/api/pith-number/R6Z3FVS5I6XDZELZSN4GPPAJ2V/events.json","paper":"https://pith.science/paper/R6Z3FVS5"},"agent_actions":{"view_html":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V","download_json":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V.json","view_paper":"https://pith.science/paper/R6Z3FVS5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1809.03685&json=true","fetch_graph":"https://pith.science/api/pith-number/R6Z3FVS5I6XDZELZSN4GPPAJ2V/graph.json","fetch_events":"https://pith.science/api/pith-number/R6Z3FVS5I6XDZELZSN4GPPAJ2V/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V/action/timestamp_anchor","attest_storage":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V/action/storage_attestation","attest_author":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V/action/author_attestation","sign_citation":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V/action/citation_signature","submit_replication":"https://pith.science/pith/R6Z3FVS5I6XDZELZSN4GPPAJ2V/action/replication_record"}},"created_at":"2026-05-18T00:05:40.759227+00:00","updated_at":"2026-05-18T00:05:40.759227+00:00"}