{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:34H63JSW4W5WZVAV43RR2S4BSX","short_pith_number":"pith:34H63JSW","schema_version":"1.0","canonical_sha256":"df0feda656e5bb6cd415e6e31d4b8195de324f2f33614d117e77eb4cb1747a0e","source":{"kind":"arxiv","id":"2112.14216","version":4},"attestation_state":"computed","paper":{"title":"Casper: Accelerating Stencil Computation using Near-cache Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alain Denzler, Gagandeep Singh, Geraldo F. Oliveira, Juan G\\'omez-Luna, Nastaran Hajinazar, Onur Mutlu, Rahul Bera","submitted_at":"2021-12-28T16:45:56Z","abstract_excerpt":"Stencil computation is one of the most used kernels in a wide variety of scientific applications, ranging from large-scale weather prediction to solving partial differential equations. Stencil computations are characterized by three unique properties: (1) low arithmetic intensity, (2) limited temporal data reuse, and (3) regular and predictable data access pattern. As a result, stencil computations are typically bandwidth-bound workloads, which only experience limited benefits from the deep cache hierarchy of modern CPUs. In this work, we propose Casper, a near-cache accelerator consisting of "},"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":"2112.14216","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AR","submitted_at":"2021-12-28T16:45:56Z","cross_cats_sorted":[],"title_canon_sha256":"ad365fb46dbaa82f3cd276fba163c18d1c1c037ade58b5dbcb4476ecad1ea9f1","abstract_canon_sha256":"e497964c3f1bfc85185f31230f4b00415f80e32e1e3468fa9d41ccfbc6038053"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:48:01.713425Z","signature_b64":"cj+k3s3xrMl/YEo5sPZToItFIRnhpMNi97rR0cMc7Rpf/j3Rrd+MlihrU7rHs1dPrGePtaSD7jw4AhT0Y6S9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"df0feda656e5bb6cd415e6e31d4b8195de324f2f33614d117e77eb4cb1747a0e","last_reissued_at":"2026-07-05T06:48:01.712827Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:48:01.712827Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Casper: Accelerating Stencil Computation using Near-cache Processing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AR","authors_text":"Alain Denzler, Gagandeep Singh, Geraldo F. Oliveira, Juan G\\'omez-Luna, Nastaran Hajinazar, Onur Mutlu, Rahul Bera","submitted_at":"2021-12-28T16:45:56Z","abstract_excerpt":"Stencil computation is one of the most used kernels in a wide variety of scientific applications, ranging from large-scale weather prediction to solving partial differential equations. Stencil computations are characterized by three unique properties: (1) low arithmetic intensity, (2) limited temporal data reuse, and (3) regular and predictable data access pattern. As a result, stencil computations are typically bandwidth-bound workloads, which only experience limited benefits from the deep cache hierarchy of modern CPUs. In this work, we propose Casper, a near-cache accelerator consisting of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.14216","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.14216/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.14216","created_at":"2026-07-05T06:48:01.712901+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.14216v4","created_at":"2026-07-05T06:48:01.712901+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.14216","created_at":"2026-07-05T06:48:01.712901+00:00"},{"alias_kind":"pith_short_12","alias_value":"34H63JSW4W5W","created_at":"2026-07-05T06:48:01.712901+00:00"},{"alias_kind":"pith_short_16","alias_value":"34H63JSW4W5WZVAV","created_at":"2026-07-05T06:48:01.712901+00:00"},{"alias_kind":"pith_short_8","alias_value":"34H63JSW","created_at":"2026-07-05T06:48:01.712901+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.22812","citing_title":"Clutch: High Performance Vector-Scalar Comparison using DRAM via Chunked Temporal Coding","ref_index":52,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX","json":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX.json","graph_json":"https://pith.science/api/pith-number/34H63JSW4W5WZVAV43RR2S4BSX/graph.json","events_json":"https://pith.science/api/pith-number/34H63JSW4W5WZVAV43RR2S4BSX/events.json","paper":"https://pith.science/paper/34H63JSW"},"agent_actions":{"view_html":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX","download_json":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX.json","view_paper":"https://pith.science/paper/34H63JSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.14216&json=true","fetch_graph":"https://pith.science/api/pith-number/34H63JSW4W5WZVAV43RR2S4BSX/graph.json","fetch_events":"https://pith.science/api/pith-number/34H63JSW4W5WZVAV43RR2S4BSX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX/action/storage_attestation","attest_author":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX/action/author_attestation","sign_citation":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX/action/citation_signature","submit_replication":"https://pith.science/pith/34H63JSW4W5WZVAV43RR2S4BSX/action/replication_record"}},"created_at":"2026-07-05T06:48:01.712901+00:00","updated_at":"2026-07-05T06:48:01.712901+00:00"}