{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:BDFI22RU5YIIEYAW4DCSTGXTYN","short_pith_number":"pith:BDFI22RU","schema_version":"1.0","canonical_sha256":"08ca8d6a34ee10826016e0c5299af3c357b42034a32f209770f8de3dc9f24ff7","source":{"kind":"arxiv","id":"1904.01031","version":1},"attestation_state":"computed","paper":{"title":"Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Azadeh Farzan, Victor Nicolet","submitted_at":"2019-04-01T18:01:02Z","abstract_excerpt":"We propose a methodology for automatic generation of divide-and-conquer parallel implementations of sequential nested loops. We focus on a class of loops that traverse read-only multidimensional collections (lists or arrays) and compute a function over these collections. Our approach is modular, in that, the inner loop nest is abstracted away to produce a simpler loop nest for parallelization. Then, the summarized version of the loop nest is parallelized. The main challenge addressed by this paper is that to perform the code transformations necessary in each step, the loop nest may have to be "},"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":"1904.01031","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2019-04-01T18:01:02Z","cross_cats_sorted":[],"title_canon_sha256":"c5e21a2761974fde20decd85e2c0260e4509d354528446b02f9b2b545b0e3b68","abstract_canon_sha256":"85b61ee2adc9ade3832c5d18c122a71ff63dab745147e4d7b564a61642cf3b10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:38.078519Z","signature_b64":"vPK0TEsqJcRyCLeHVergUJjmRpDvsQN99r3DQpMCtN+VjZEHfLP43F7lLe/DuCE2i8Z2lszcZlGBfZLX1awzCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08ca8d6a34ee10826016e0c5299af3c357b42034a32f209770f8de3dc9f24ff7","last_reissued_at":"2026-05-17T23:49:38.077862Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:38.077862Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Modular Synthesis of Divide-and-Conquer Parallelism for Nested Loops (Extended Version)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Azadeh Farzan, Victor Nicolet","submitted_at":"2019-04-01T18:01:02Z","abstract_excerpt":"We propose a methodology for automatic generation of divide-and-conquer parallel implementations of sequential nested loops. We focus on a class of loops that traverse read-only multidimensional collections (lists or arrays) and compute a function over these collections. Our approach is modular, in that, the inner loop nest is abstracted away to produce a simpler loop nest for parallelization. Then, the summarized version of the loop nest is parallelized. The main challenge addressed by this paper is that to perform the code transformations necessary in each step, the loop nest may have to be "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.01031","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":"1904.01031","created_at":"2026-05-17T23:49:38.077950+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.01031v1","created_at":"2026-05-17T23:49:38.077950+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.01031","created_at":"2026-05-17T23:49:38.077950+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDFI22RU5YII","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDFI22RU5YIIEYAW","created_at":"2026-05-18T12:33:12.712433+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDFI22RU","created_at":"2026-05-18T12:33:12.712433+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/BDFI22RU5YIIEYAW4DCSTGXTYN","json":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN.json","graph_json":"https://pith.science/api/pith-number/BDFI22RU5YIIEYAW4DCSTGXTYN/graph.json","events_json":"https://pith.science/api/pith-number/BDFI22RU5YIIEYAW4DCSTGXTYN/events.json","paper":"https://pith.science/paper/BDFI22RU"},"agent_actions":{"view_html":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN","download_json":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN.json","view_paper":"https://pith.science/paper/BDFI22RU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.01031&json=true","fetch_graph":"https://pith.science/api/pith-number/BDFI22RU5YIIEYAW4DCSTGXTYN/graph.json","fetch_events":"https://pith.science/api/pith-number/BDFI22RU5YIIEYAW4DCSTGXTYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN/action/storage_attestation","attest_author":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN/action/author_attestation","sign_citation":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN/action/citation_signature","submit_replication":"https://pith.science/pith/BDFI22RU5YIIEYAW4DCSTGXTYN/action/replication_record"}},"created_at":"2026-05-17T23:49:38.077950+00:00","updated_at":"2026-05-17T23:49:38.077950+00:00"}