{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RLTXGYZGA2MQUTSYA24MBQ4WKU","short_pith_number":"pith:RLTXGYZG","canonical_record":{"source":{"id":"0912.4506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2009-12-22T20:44:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6b268c6b5ad2e3aa9afb0772b1ad65ce43145560fe8ad0d2f425617a968215ae","abstract_canon_sha256":"849939a9d7ddb944c3fb2eed161806815187d847ccade5a50b3aebe72895f4e9"},"schema_version":"1.0"},"canonical_sha256":"8ae773632606990a4e5806b8c0c396552eb07fe6ebe8cef16ad0a691e6c6d179","source":{"kind":"arxiv","id":"0912.4506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.4506","created_at":"2026-05-18T04:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"0912.4506v1","created_at":"2026-05-18T04:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.4506","created_at":"2026-05-18T04:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"RLTXGYZGA2MQ","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RLTXGYZGA2MQUTSY","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RLTXGYZG","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RLTXGYZGA2MQUTSYA24MBQ4WKU","target":"record","payload":{"canonical_record":{"source":{"id":"0912.4506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2009-12-22T20:44:59Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"6b268c6b5ad2e3aa9afb0772b1ad65ce43145560fe8ad0d2f425617a968215ae","abstract_canon_sha256":"849939a9d7ddb944c3fb2eed161806815187d847ccade5a50b3aebe72895f4e9"},"schema_version":"1.0"},"canonical_sha256":"8ae773632606990a4e5806b8c0c396552eb07fe6ebe8cef16ad0a691e6c6d179","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:01:13.469984Z","signature_b64":"s5WKTAdcQucNoMtRPx4WSIZtr8cDUirZadfEzbs1r9OcgSN1zJNWBPi7z3N0u5vpdl+cBa0ypuKj3ZESkqKLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8ae773632606990a4e5806b8c0c396552eb07fe6ebe8cef16ad0a691e6c6d179","last_reissued_at":"2026-05-18T04:01:13.469416Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:01:13.469416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0912.4506","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-18T04:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQqQTvBt3HOMyiLgp6KYEROEnTR8uXgRiPFgH4CeaZh1hMXORCRhdzckim6OrNHgg1caR94D4zDqZlxH0NkKBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:23:24.754295Z"},"content_sha256":"230e83052c280f61012707cf64b7453f46f35a3d20120f22600c432329c880f4","schema_version":"1.0","event_id":"sha256:230e83052c280f61012707cf64b7453f46f35a3d20120f22600c432329c880f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RLTXGYZGA2MQUTSYA24MBQ4WKU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multicore-aware parallel temporal blocking of stencil codes for shared and distributed memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.PF","authors_text":"Georg Hager, Gerhard Wellein, Markus Wittmann","submitted_at":"2009-12-22T20:44:59Z","abstract_excerpt":"New algorithms and optimization techniques are needed to balance the accelerating trend towards bandwidth-starved multicore chips. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the pressure on the memory interface. We introduce a new pipelined approach that makes explicit use of shared caches in multicore environments and minimizes synchronization and boundary overhead. For clusters of shared-memory nodes we demonstrate how temporal blocking can be employed successfully in a hybrid shared/distributed-memory environment."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.4506","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-18T04:01:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuOa5tPXFUzFYJyhU1kdhaveED2PjlUrVJPmKvMxlJp2bCjXE+Ip7qIlbAq/pWedhPrGejZDBCBZEXw4fvsGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T14:23:24.754951Z"},"content_sha256":"895c72dc31ae1e46021006be0a7bfceb2c2f8502b1ab65d6672b39b9c91a6c21","schema_version":"1.0","event_id":"sha256:895c72dc31ae1e46021006be0a7bfceb2c2f8502b1ab65d6672b39b9c91a6c21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU/bundle.json","state_url":"https://pith.science/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU/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-06-08T14:23:24Z","links":{"resolver":"https://pith.science/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU","bundle":"https://pith.science/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU/bundle.json","state":"https://pith.science/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RLTXGYZGA2MQUTSYA24MBQ4WKU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RLTXGYZGA2MQUTSYA24MBQ4WKU","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":"849939a9d7ddb944c3fb2eed161806815187d847ccade5a50b3aebe72895f4e9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2009-12-22T20:44:59Z","title_canon_sha256":"6b268c6b5ad2e3aa9afb0772b1ad65ce43145560fe8ad0d2f425617a968215ae"},"schema_version":"1.0","source":{"id":"0912.4506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.4506","created_at":"2026-05-18T04:01:13Z"},{"alias_kind":"arxiv_version","alias_value":"0912.4506v1","created_at":"2026-05-18T04:01:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.4506","created_at":"2026-05-18T04:01:13Z"},{"alias_kind":"pith_short_12","alias_value":"RLTXGYZGA2MQ","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RLTXGYZGA2MQUTSY","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RLTXGYZG","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:895c72dc31ae1e46021006be0a7bfceb2c2f8502b1ab65d6672b39b9c91a6c21","target":"graph","created_at":"2026-05-18T04:01:13Z","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":"New algorithms and optimization techniques are needed to balance the accelerating trend towards bandwidth-starved multicore chips. It is well known that the performance of stencil codes can be improved by temporal blocking, lessening the pressure on the memory interface. We introduce a new pipelined approach that makes explicit use of shared caches in multicore environments and minimizes synchronization and boundary overhead. For clusters of shared-memory nodes we demonstrate how temporal blocking can be employed successfully in a hybrid shared/distributed-memory environment.","authors_text":"Georg Hager, Gerhard Wellein, Markus Wittmann","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2009-12-22T20:44:59Z","title":"Multicore-aware parallel temporal blocking of stencil codes for shared and distributed memory"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.4506","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:230e83052c280f61012707cf64b7453f46f35a3d20120f22600c432329c880f4","target":"record","created_at":"2026-05-18T04:01:13Z","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":"849939a9d7ddb944c3fb2eed161806815187d847ccade5a50b3aebe72895f4e9","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2009-12-22T20:44:59Z","title_canon_sha256":"6b268c6b5ad2e3aa9afb0772b1ad65ce43145560fe8ad0d2f425617a968215ae"},"schema_version":"1.0","source":{"id":"0912.4506","kind":"arxiv","version":1}},"canonical_sha256":"8ae773632606990a4e5806b8c0c396552eb07fe6ebe8cef16ad0a691e6c6d179","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8ae773632606990a4e5806b8c0c396552eb07fe6ebe8cef16ad0a691e6c6d179","first_computed_at":"2026-05-18T04:01:13.469416Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:01:13.469416Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"s5WKTAdcQucNoMtRPx4WSIZtr8cDUirZadfEzbs1r9OcgSN1zJNWBPi7z3N0u5vpdl+cBa0ypuKj3ZESkqKLCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:01:13.469984Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.4506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:230e83052c280f61012707cf64b7453f46f35a3d20120f22600c432329c880f4","sha256:895c72dc31ae1e46021006be0a7bfceb2c2f8502b1ab65d6672b39b9c91a6c21"],"state_sha256":"36fbfb09f80be7cee7a5f2d23ccfc0c3ef7c826898ace8e9312bf224a4ce821f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ywzmdFJ42h4q/uOIy9fLpwyWD2PlCtw+HhhhRGgVDPH397kY4WqxczvhLNsvlpdwiCoOXQ71oaiGFkgSEHa6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T14:23:24.758243Z","bundle_sha256":"4e67680c7834083608fc5d6863e861ca7f5f5976d331908f019523b68944849b"}}