{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2Y4AEOBMWJEUXLIY4NLQWOIHK7","short_pith_number":"pith:2Y4AEOBM","canonical_record":{"source":{"id":"1511.05778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-18T13:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"91a0e940ad75843410c81acf594ae1f31f66949c2df20df25459b1af2995b33f","abstract_canon_sha256":"205d90577c00c0d3958e2b64d8fa61cf78defe711669c57f5f3df9e1b8afdd03"},"schema_version":"1.0"},"canonical_sha256":"d63802382cb2494bad18e3570b390757c616dfc341170bc0b21e2e795ba68595","source":{"kind":"arxiv","id":"1511.05778","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05778","created_at":"2026-05-18T01:26:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05778v2","created_at":"2026-05-18T01:26:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05778","created_at":"2026-05-18T01:26:30Z"},{"alias_kind":"pith_short_12","alias_value":"2Y4AEOBMWJEU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2Y4AEOBMWJEUXLIY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2Y4AEOBM","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2Y4AEOBMWJEUXLIY4NLQWOIHK7","target":"record","payload":{"canonical_record":{"source":{"id":"1511.05778","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-18T13:48:35Z","cross_cats_sorted":[],"title_canon_sha256":"91a0e940ad75843410c81acf594ae1f31f66949c2df20df25459b1af2995b33f","abstract_canon_sha256":"205d90577c00c0d3958e2b64d8fa61cf78defe711669c57f5f3df9e1b8afdd03"},"schema_version":"1.0"},"canonical_sha256":"d63802382cb2494bad18e3570b390757c616dfc341170bc0b21e2e795ba68595","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:30.933989Z","signature_b64":"c5o6Sj52+N4Y4FGpEWkjBBkgasCESDLAk/Qoy+hmrtLtBiDf+M8ce9zhYIWcXpEkRQrNuZm7/bmJ+60rVVoPAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d63802382cb2494bad18e3570b390757c616dfc341170bc0b21e2e795ba68595","last_reissued_at":"2026-05-18T01:26:30.933354Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:30.933354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.05778","source_version":2,"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-18T01:26:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mBE3b1OsM43CbRJnBCE146U7nkMUvlhEpctzv/VfOIHfVo6nY8egn70xQLfG1F3gjsHKnMJvaH962pBlYmy4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:41:09.485983Z"},"content_sha256":"82988dbd8ccd5cb276e3fbf0c37df27b0c45521b6f185f69d66ae1ffc1375c28","schema_version":"1.0","event_id":"sha256:82988dbd8ccd5cb276e3fbf0c37df27b0c45521b6f185f69d66ae1ffc1375c28"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2Y4AEOBMWJEUXLIY4NLQWOIHK7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Cache-Conscious Run-time Decomposition of Data Parallel Computations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Herv\\'e Paulino, Nuno Delgado","submitted_at":"2015-11-18T13:48:35Z","abstract_excerpt":"Multi-core architectures feature an intricate hierarchy of cache memories, with multiple levels and sizes. To adequately decompose an application according to the traits of a particular memory hierarchy is a cumbersome task that may be rewarded with significant performance gains. The current state-of-the-art in memory-hierarchy-aware parallel computing delegates this endeavour on the programmer, demanding from him deep knowledge of both parallel programming and computer architecture. In this paper we propose the shifting of these memory-hierarchy-related concerns to the run-time system, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05778","kind":"arxiv","version":2},"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-18T01:26:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"unl5N+T5NdRCXrJJiEp6l73Hb5lZ4Tin6wPl70XHnVuY5eG8W6sNurtbUQg8o4wX/Lq9AL47NPiSahorlO4gDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-23T10:41:09.486341Z"},"content_sha256":"497f9a4111911f7bdb29a3577a970e0bc33fee21d72bade767f9a29ed7a3d14b","schema_version":"1.0","event_id":"sha256:497f9a4111911f7bdb29a3577a970e0bc33fee21d72bade767f9a29ed7a3d14b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7/bundle.json","state_url":"https://pith.science/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7/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-23T10:41:09Z","links":{"resolver":"https://pith.science/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7","bundle":"https://pith.science/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7/bundle.json","state":"https://pith.science/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2Y4AEOBMWJEUXLIY4NLQWOIHK7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2Y4AEOBMWJEUXLIY4NLQWOIHK7","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":"205d90577c00c0d3958e2b64d8fa61cf78defe711669c57f5f3df9e1b8afdd03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-18T13:48:35Z","title_canon_sha256":"91a0e940ad75843410c81acf594ae1f31f66949c2df20df25459b1af2995b33f"},"schema_version":"1.0","source":{"id":"1511.05778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.05778","created_at":"2026-05-18T01:26:30Z"},{"alias_kind":"arxiv_version","alias_value":"1511.05778v2","created_at":"2026-05-18T01:26:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.05778","created_at":"2026-05-18T01:26:30Z"},{"alias_kind":"pith_short_12","alias_value":"2Y4AEOBMWJEU","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"2Y4AEOBMWJEUXLIY","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"2Y4AEOBM","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:497f9a4111911f7bdb29a3577a970e0bc33fee21d72bade767f9a29ed7a3d14b","target":"graph","created_at":"2026-05-18T01:26:30Z","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":"Multi-core architectures feature an intricate hierarchy of cache memories, with multiple levels and sizes. To adequately decompose an application according to the traits of a particular memory hierarchy is a cumbersome task that may be rewarded with significant performance gains. The current state-of-the-art in memory-hierarchy-aware parallel computing delegates this endeavour on the programmer, demanding from him deep knowledge of both parallel programming and computer architecture. In this paper we propose the shifting of these memory-hierarchy-related concerns to the run-time system, which ","authors_text":"Herv\\'e Paulino, Nuno Delgado","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-18T13:48:35Z","title":"Cache-Conscious Run-time Decomposition of Data Parallel Computations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.05778","kind":"arxiv","version":2},"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:82988dbd8ccd5cb276e3fbf0c37df27b0c45521b6f185f69d66ae1ffc1375c28","target":"record","created_at":"2026-05-18T01:26:30Z","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":"205d90577c00c0d3958e2b64d8fa61cf78defe711669c57f5f3df9e1b8afdd03","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-11-18T13:48:35Z","title_canon_sha256":"91a0e940ad75843410c81acf594ae1f31f66949c2df20df25459b1af2995b33f"},"schema_version":"1.0","source":{"id":"1511.05778","kind":"arxiv","version":2}},"canonical_sha256":"d63802382cb2494bad18e3570b390757c616dfc341170bc0b21e2e795ba68595","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d63802382cb2494bad18e3570b390757c616dfc341170bc0b21e2e795ba68595","first_computed_at":"2026-05-18T01:26:30.933354Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:26:30.933354Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"c5o6Sj52+N4Y4FGpEWkjBBkgasCESDLAk/Qoy+hmrtLtBiDf+M8ce9zhYIWcXpEkRQrNuZm7/bmJ+60rVVoPAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:26:30.933989Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.05778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:82988dbd8ccd5cb276e3fbf0c37df27b0c45521b6f185f69d66ae1ffc1375c28","sha256:497f9a4111911f7bdb29a3577a970e0bc33fee21d72bade767f9a29ed7a3d14b"],"state_sha256":"0baf5f1d2ae7e455c371eeaa7aecb6732f1fc6c9049e4885bff2eabbcc6b1866"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3Rdas4Fe/EQkGkazDTpuZF9l0Wv3VCD4H+B6bGBXdJLPc0dWfsc/YkYyh1dvH5+YhKeQ0w0y7uI1TWQ6zTjpBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-23T10:41:09.488216Z","bundle_sha256":"02f51b48a4538cf7c01bf186446a476d1b654493f2399476bdd982520949bab7"}}