{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CLVRV3TM6PJUK2GMDNP6DEWF7H","short_pith_number":"pith:CLVRV3TM","schema_version":"1.0","canonical_sha256":"12eb1aee6cf3d34568cc1b5fe192c5f9cf08f746168884d77b666b5a1b40fba1","source":{"kind":"arxiv","id":"1505.07716","version":1},"attestation_state":"computed","paper":{"title":"Polly's Polyhedral Scheduling in the Presence of Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Johannes Doerfert, Kevin Streit, Sebastian Hack, Zino Benaissa","submitted_at":"2015-05-28T15:05:46Z","abstract_excerpt":"The polyhedral model provides a powerful mathematical abstraction to enable effective optimization of loop nests with respect to a given optimization goal, e.g., exploiting parallelism. Unexploited reduction properties are a frequent reason for polyhedral optimizers to assume parallelism prohibiting dependences. To our knowledge, no polyhedral loop optimizer available in any production compiler provides support for reductions. In this paper, we show that leveraging the parallelism of reductions can lead to a significant performance increase. We give a precise, dependence based, definition of r"},"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":"1505.07716","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2015-05-28T15:05:46Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"37b073a95b82383bd4852f46c4ef294a913be5cf3fca5cb0b01b1dba60028077","abstract_canon_sha256":"9ba5fbe8ed5562b8d717ee03fde07ebeffbb75e17213b540d0dfe469b4c19ce7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:56.014386Z","signature_b64":"Nua4L3BDS+UgRufgIv7SsEZB3B3NAbQw2/gvKILGqTMjhfZmrc5rx8WTvkuFELRpclBVolTZiRcuamPBebEFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"12eb1aee6cf3d34568cc1b5fe192c5f9cf08f746168884d77b666b5a1b40fba1","last_reissued_at":"2026-05-18T02:00:56.013838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:56.013838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Polly's Polyhedral Scheduling in the Presence of Reductions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PL","authors_text":"Johannes Doerfert, Kevin Streit, Sebastian Hack, Zino Benaissa","submitted_at":"2015-05-28T15:05:46Z","abstract_excerpt":"The polyhedral model provides a powerful mathematical abstraction to enable effective optimization of loop nests with respect to a given optimization goal, e.g., exploiting parallelism. Unexploited reduction properties are a frequent reason for polyhedral optimizers to assume parallelism prohibiting dependences. To our knowledge, no polyhedral loop optimizer available in any production compiler provides support for reductions. In this paper, we show that leveraging the parallelism of reductions can lead to a significant performance increase. We give a precise, dependence based, definition of r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07716","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":"1505.07716","created_at":"2026-05-18T02:00:56.013925+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07716v1","created_at":"2026-05-18T02:00:56.013925+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07716","created_at":"2026-05-18T02:00:56.013925+00:00"},{"alias_kind":"pith_short_12","alias_value":"CLVRV3TM6PJU","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"CLVRV3TM6PJUK2GM","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"CLVRV3TM","created_at":"2026-05-18T12:29:17.054201+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/CLVRV3TM6PJUK2GMDNP6DEWF7H","json":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H.json","graph_json":"https://pith.science/api/pith-number/CLVRV3TM6PJUK2GMDNP6DEWF7H/graph.json","events_json":"https://pith.science/api/pith-number/CLVRV3TM6PJUK2GMDNP6DEWF7H/events.json","paper":"https://pith.science/paper/CLVRV3TM"},"agent_actions":{"view_html":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H","download_json":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H.json","view_paper":"https://pith.science/paper/CLVRV3TM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07716&json=true","fetch_graph":"https://pith.science/api/pith-number/CLVRV3TM6PJUK2GMDNP6DEWF7H/graph.json","fetch_events":"https://pith.science/api/pith-number/CLVRV3TM6PJUK2GMDNP6DEWF7H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H/action/storage_attestation","attest_author":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H/action/author_attestation","sign_citation":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H/action/citation_signature","submit_replication":"https://pith.science/pith/CLVRV3TM6PJUK2GMDNP6DEWF7H/action/replication_record"}},"created_at":"2026-05-18T02:00:56.013925+00:00","updated_at":"2026-05-18T02:00:56.013925+00:00"}