{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SQF5SSGH4HOTJBDVOUCYSWXUEW","short_pith_number":"pith:SQF5SSGH","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"},"canonical_sha256":"940bd948c7e1dd3484757505895af4258d154ed5f68aabb88384fc26a747591f","source":{"kind":"arxiv","id":"1602.04552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04552","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04552v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04552","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"SQF5SSGH4HOT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SQF5SSGH4HOTJBDV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SQF5SSGH","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SQF5SSGH4HOTJBDVOUCYSWXUEW","target":"record","payload":{"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"},"canonical_sha256":"940bd948c7e1dd3484757505895af4258d154ed5f68aabb88384fc26a747591f","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"},"source_kind":"arxiv","source_id":"1602.04552","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-18T01:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uhxZYn1q3Qpz9pMZxMmosVxDoSvN5UXZttOFFSJHzLfnR4RXpEmwbGut7CwGuUWWWYeHXhYqMuoKiCB0nodQDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:30:44.280907Z"},"content_sha256":"733c04bbf45e8673dc62fd7476c7a422886b7eadc9c99c9f2b680ea41bdf4159","schema_version":"1.0","event_id":"sha256:733c04bbf45e8673dc62fd7476c7a422886b7eadc9c99c9f2b680ea41bdf4159"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SQF5SSGH4HOTJBDVOUCYSWXUEW","target":"graph","payload":{"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"},"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-18T01:20:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6u2kYBHq9qlbDk1vzqiliXe4Yo3MZKYT7Cxr1aVraMcfU28FUD/uPzglX5+gViqNiK/aQ4Y6mwmXy+QzzaLcDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T05:30:44.281257Z"},"content_sha256":"7117d8ca1a3c64f0d06142d408a11592650632f7208b1b0e3ebf86ca12807715","schema_version":"1.0","event_id":"sha256:7117d8ca1a3c64f0d06142d408a11592650632f7208b1b0e3ebf86ca12807715"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/bundle.json","state_url":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/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-07-07T05:30:44Z","links":{"resolver":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW","bundle":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/bundle.json","state":"https://pith.science/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQF5SSGH4HOTJBDVOUCYSWXUEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SQF5SSGH4HOTJBDVOUCYSWXUEW","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":"1cb2a0006d0a4bcaa4c6c0310c4f8fbbb752f7552ec41a52b31710821cdd843c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-15T02:46:59Z","title_canon_sha256":"7fc8247df9ae30a1413a7c424173a2be8d1033c1e4db9de34cabe53c95cde786"},"schema_version":"1.0","source":{"id":"1602.04552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1602.04552","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"arxiv_version","alias_value":"1602.04552v1","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04552","created_at":"2026-05-18T01:20:49Z"},{"alias_kind":"pith_short_12","alias_value":"SQF5SSGH4HOT","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SQF5SSGH4HOTJBDV","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SQF5SSGH","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:7117d8ca1a3c64f0d06142d408a11592650632f7208b1b0e3ebf86ca12807715","target":"graph","created_at":"2026-05-18T01:20:49Z","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":"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","authors_text":"David Dinh, Harsha Vardhan Simhadri, Yuan Tang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-15T02:46:59Z","title":"Extending the Nested Parallel Model to the Nested Dataflow Model with Provably Efficient Schedulers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04552","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:733c04bbf45e8673dc62fd7476c7a422886b7eadc9c99c9f2b680ea41bdf4159","target":"record","created_at":"2026-05-18T01:20:49Z","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":"1cb2a0006d0a4bcaa4c6c0310c4f8fbbb752f7552ec41a52b31710821cdd843c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-02-15T02:46:59Z","title_canon_sha256":"7fc8247df9ae30a1413a7c424173a2be8d1033c1e4db9de34cabe53c95cde786"},"schema_version":"1.0","source":{"id":"1602.04552","kind":"arxiv","version":1}},"canonical_sha256":"940bd948c7e1dd3484757505895af4258d154ed5f68aabb88384fc26a747591f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"940bd948c7e1dd3484757505895af4258d154ed5f68aabb88384fc26a747591f","first_computed_at":"2026-05-18T01:20:49.685080Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:20:49.685080Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"YuDSwLCy+YUD7KEi8AK26x7d1VoaDmLk4su9PXOWlldDXTgMm9aep4ikef/4KbcxuzFH3bv9ZOvvS5y4bRMZDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:20:49.685582Z","signed_message":"canonical_sha256_bytes"},"source_id":"1602.04552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:733c04bbf45e8673dc62fd7476c7a422886b7eadc9c99c9f2b680ea41bdf4159","sha256:7117d8ca1a3c64f0d06142d408a11592650632f7208b1b0e3ebf86ca12807715"],"state_sha256":"25c7b811e52ce766bb4dc5c8202f70826d2508052ec4f396c9b2b1068208e11a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1g7DLuXLNkL8+FoGsoN3bK92c4ZmLDKSgUkFMx1GXWcGVZZ6bxAQenXySqMqzTDe4EvQ+NHLUrsXXKN91DN7DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T05:30:44.283438Z","bundle_sha256":"e98f53e458920e3325da98705341f89fb430f7f8d8bbaf360d33f364c5450e5b"}}