{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:SQF5SSGH4HOTJBDVOUCYSWXUEW","short_pith_number":"pith:SQF5SSGH","schema_version":"1.0","canonical_sha256":"940bd948c7e1dd3484757505895af4258d154ed5f68aabb88384fc26a747591f","source":{"kind":"arxiv","id":"1602.04552","version":1},"attestation_state":"computed","paper":{"title":"Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Dinh, Harsha Vardhan Simhadri, Yuan Tang","submitted_at":"2016-02-15T02:46:59Z","abstract_excerpt":"The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. \"$\\parallel$\" (parallel) and \"$;$\" (serial), are insufficient in expressing \"partial dependencies\" or \"partial parallelism\" in a program. We propose a new dataflow composition construct \"$\\leadsto$\" to express partial dependencies in algorithms in a processor- and cache-oblivious way, thus extending the Nested Parallel (NP) model to the \\emph{Nested Dataflow} (ND) model. We redesign several divide-and-conquer algorithms ranging from dense linear algebra to dy"},"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":"1602.04552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-15T02:46:59Z","cross_cats_sorted":[],"title_canon_sha256":"7fc8247df9ae30a1413a7c424173a2be8d1033c1e4db9de34cabe53c95cde786","abstract_canon_sha256":"1cb2a0006d0a4bcaa4c6c0310c4f8fbbb752f7552ec41a52b31710821cdd843c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:49.685582Z","signature_b64":"YuDSwLCy+YUD7KEi8AK26x7d1VoaDmLk4su9PXOWlldDXTgMm9aep4ikef/4KbcxuzFH3bv9ZOvvS5y4bRMZDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"940bd948c7e1dd3484757505895af4258d154ed5f68aabb88384fc26a747591f","last_reissued_at":"2026-05-18T01:20:49.685080Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:49.685080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"David Dinh, Harsha Vardhan Simhadri, Yuan Tang","submitted_at":"2016-02-15T02:46:59Z","abstract_excerpt":"The nested parallel (a.k.a. fork-join) model is widely used for writing parallel programs. However, the two composition constructs, i.e. \"$\\parallel$\" (parallel) and \"$;$\" (serial), are insufficient in expressing \"partial dependencies\" or \"partial parallelism\" in a program. We propose a new dataflow composition construct \"$\\leadsto$\" to express partial dependencies in algorithms in a processor- and cache-oblivious way, thus extending the Nested Parallel (NP) model to the \\emph{Nested Dataflow} (ND) model. We redesign several divide-and-conquer algorithms ranging from dense linear algebra to dy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04552","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":"1602.04552","created_at":"2026-05-18T01:20:49.685153+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04552v1","created_at":"2026-05-18T01:20:49.685153+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04552","created_at":"2026-05-18T01:20:49.685153+00:00"},{"alias_kind":"pith_short_12","alias_value":"SQF5SSGH4HOT","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_16","alias_value":"SQF5SSGH4HOTJBDV","created_at":"2026-05-18T12:30:44.179134+00:00"},{"alias_kind":"pith_short_8","alias_value":"SQF5SSGH","created_at":"2026-05-18T12:30:44.179134+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/SQF5SSGH4HOTJBDVOUCYSWXUEW","json":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW.json","graph_json":"https://pith.science/api/pith-number/SQF5SSGH4HOTJBDVOUCYSWXUEW/graph.json","events_json":"https://pith.science/api/pith-number/SQF5SSGH4HOTJBDVOUCYSWXUEW/events.json","paper":"https://pith.science/paper/SQF5SSGH"},"agent_actions":{"view_html":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW","download_json":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW.json","view_paper":"https://pith.science/paper/SQF5SSGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04552&json=true","fetch_graph":"https://pith.science/api/pith-number/SQF5SSGH4HOTJBDVOUCYSWXUEW/graph.json","fetch_events":"https://pith.science/api/pith-number/SQF5SSGH4HOTJBDVOUCYSWXUEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/action/storage_attestation","attest_author":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/action/author_attestation","sign_citation":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/action/citation_signature","submit_replication":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/action/replication_record"}},"created_at":"2026-05-18T01:20:49.685153+00:00","updated_at":"2026-05-18T01:20:49.685153+00:00"}