{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:HMOSWUX3I7KAEYPQYJHJQARWMM","short_pith_number":"pith:HMOSWUX3","schema_version":"1.0","canonical_sha256":"3b1d2b52fb47d40261f0c24e980236632bd92f4d8c900f8b6575e554064d405b","source":{"kind":"arxiv","id":"1802.00166","version":1},"attestation_state":"computed","paper":{"title":"PCOT: Cache Oblivious Tiling of Polyhedral Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Nirmal Prajapati, Sanjay Rajopadhye, Tomofumi Yuki, Waruna Ranasinghe","submitted_at":"2018-02-01T05:48:31Z","abstract_excerpt":"This paper studies two variants of tiling: iteration space tiling (or loop blocking) and cache-oblivious methods that recursively split the iteration space with divide-and-conquer. The key question to answer is when we should be using one over the other. The answer to this question is complicated for modern architecture due to a number of reasons. In this paper, we present a detailed empirical study to answer this question for a range of kernels that fit the polyhedral model. Our study is based on a generalized cache oblivious code generator that support this class, which is a superset of thos"},"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":"1802.00166","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PL","submitted_at":"2018-02-01T05:48:31Z","cross_cats_sorted":[],"title_canon_sha256":"f77a43fd20f0c406b3cb89ceb00b16ae64b191c658e6b7dbdaaa45f5bc24793e","abstract_canon_sha256":"e6bc8b99d8d2090030f88b5939096622c2ea2f15173b46195040ece08787409b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:36.642869Z","signature_b64":"sJcgaeArlqwjih3/LsDNsqroTahSEl3H/i8mSaVyoD59C0T4YZOKvbNjN3O1Vb0YJLFgNlKEuinUy5fcJe56DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3b1d2b52fb47d40261f0c24e980236632bd92f4d8c900f8b6575e554064d405b","last_reissued_at":"2026-05-18T00:24:36.642300Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:36.642300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PCOT: Cache Oblivious Tiling of Polyhedral Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PL","authors_text":"Nirmal Prajapati, Sanjay Rajopadhye, Tomofumi Yuki, Waruna Ranasinghe","submitted_at":"2018-02-01T05:48:31Z","abstract_excerpt":"This paper studies two variants of tiling: iteration space tiling (or loop blocking) and cache-oblivious methods that recursively split the iteration space with divide-and-conquer. The key question to answer is when we should be using one over the other. The answer to this question is complicated for modern architecture due to a number of reasons. In this paper, we present a detailed empirical study to answer this question for a range of kernels that fit the polyhedral model. Our study is based on a generalized cache oblivious code generator that support this class, which is a superset of thos"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00166","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":"1802.00166","created_at":"2026-05-18T00:24:36.642393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.00166v1","created_at":"2026-05-18T00:24:36.642393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00166","created_at":"2026-05-18T00:24:36.642393+00:00"},{"alias_kind":"pith_short_12","alias_value":"HMOSWUX3I7KA","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_16","alias_value":"HMOSWUX3I7KAEYPQ","created_at":"2026-05-18T12:32:28.185984+00:00"},{"alias_kind":"pith_short_8","alias_value":"HMOSWUX3","created_at":"2026-05-18T12:32:28.185984+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/HMOSWUX3I7KAEYPQYJHJQARWMM","json":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM.json","graph_json":"https://pith.science/api/pith-number/HMOSWUX3I7KAEYPQYJHJQARWMM/graph.json","events_json":"https://pith.science/api/pith-number/HMOSWUX3I7KAEYPQYJHJQARWMM/events.json","paper":"https://pith.science/paper/HMOSWUX3"},"agent_actions":{"view_html":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM","download_json":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM.json","view_paper":"https://pith.science/paper/HMOSWUX3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.00166&json=true","fetch_graph":"https://pith.science/api/pith-number/HMOSWUX3I7KAEYPQYJHJQARWMM/graph.json","fetch_events":"https://pith.science/api/pith-number/HMOSWUX3I7KAEYPQYJHJQARWMM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM/action/storage_attestation","attest_author":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM/action/author_attestation","sign_citation":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM/action/citation_signature","submit_replication":"https://pith.science/pith/HMOSWUX3I7KAEYPQYJHJQARWMM/action/replication_record"}},"created_at":"2026-05-18T00:24:36.642393+00:00","updated_at":"2026-05-18T00:24:36.642393+00:00"}