{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:5IT3M6AVRZ4EYPDQBVUGG767YU","short_pith_number":"pith:5IT3M6AV","canonical_record":{"source":{"id":"1207.5217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-07-22T12:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"fdb202e658917560e9c89b75d9296fd0ce2f7df5dd2074aba5173f464563c63a","abstract_canon_sha256":"23cd490c1f7db7adcab43d119b70e5e97aa35d52017e4c2910620c8cc329a4e5"},"schema_version":"1.0"},"canonical_sha256":"ea27b678158e784c3c700d68637fdfc51fbf013d6a8e14a3d4ca721d8d3536ec","source":{"kind":"arxiv","id":"1207.5217","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5217","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5217v3","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5217","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"5IT3M6AVRZ4E","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5IT3M6AVRZ4EYPDQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5IT3M6AV","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:5IT3M6AVRZ4EYPDQBVUGG767YU","target":"record","payload":{"canonical_record":{"source":{"id":"1207.5217","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-07-22T12:04:53Z","cross_cats_sorted":[],"title_canon_sha256":"fdb202e658917560e9c89b75d9296fd0ce2f7df5dd2074aba5173f464563c63a","abstract_canon_sha256":"23cd490c1f7db7adcab43d119b70e5e97aa35d52017e4c2910620c8cc329a4e5"},"schema_version":"1.0"},"canonical_sha256":"ea27b678158e784c3c700d68637fdfc51fbf013d6a8e14a3d4ca721d8d3536ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:47:00.646942Z","signature_b64":"r4Od+gIj+6a7EQTa/J/9OPqizsLVzun1Xm9mgBym+ZYkQg+qdpO9LIP5d9WeoSubpiOBGc2GdpmpwaA80aDpDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea27b678158e784c3c700d68637fdfc51fbf013d6a8e14a3d4ca721d8d3536ec","last_reissued_at":"2026-05-18T03:47:00.646143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:47:00.646143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.5217","source_version":3,"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-18T03:47:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"05WG5NR9lmCU3WtPmpiyL7CPiEeCMh6k4wk3Q0Q1ojkQlmKm1if/ftnZNKlbS0h+pvJsl6Pdj2+jNGIlER/5BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:40:31.235613Z"},"content_sha256":"d33b4aaacc754f12963023ded2c9f0a0923b4a24d2a5df60ba8adb193c3a8687","schema_version":"1.0","event_id":"sha256:d33b4aaacc754f12963023ded2c9f0a0923b4a24d2a5df60ba8adb193c3a8687"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:5IT3M6AVRZ4EYPDQBVUGG767YU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hierarchical Performance Modeling for Ranking Dense Linear Algebra Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Elmar Peise (1) ((1) AICES, RWTH Aachen)","submitted_at":"2012-07-22T12:04:53Z","abstract_excerpt":"A large class of dense linear algebra operations, such as LU decomposition or inversion of a triangular matrix, are usually performed by blocked algorithms. For one such operation, typically, not only one but many algorithmic variants exist; depending on computing architecture, libraries and problem size, each variant attains a different performances. We propose methods and tools to rank the algorithmic variants according to their performance for a given scenario without executing them.\n  For this purpose, we identify the routines upon which the algorithms are built. A first tool - the Sampler"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5217","kind":"arxiv","version":3},"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-18T03:47:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vqCPh/LxPoU1kTkAqY09tb/HUH3+yxwhuHGLPA1W0uQmoYR5RjafvMCh4tHLN1R7xMiivE1YYx+lAW91OD8xBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T11:40:31.235971Z"},"content_sha256":"152c08f247372ec673b4228fdaeacd7578a2d48a1dfacac15c54df671a20fa7f","schema_version":"1.0","event_id":"sha256:152c08f247372ec673b4228fdaeacd7578a2d48a1dfacac15c54df671a20fa7f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/bundle.json","state_url":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/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-25T11:40:31Z","links":{"resolver":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU","bundle":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/bundle.json","state":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:5IT3M6AVRZ4EYPDQBVUGG767YU","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":"23cd490c1f7db7adcab43d119b70e5e97aa35d52017e4c2910620c8cc329a4e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-07-22T12:04:53Z","title_canon_sha256":"fdb202e658917560e9c89b75d9296fd0ce2f7df5dd2074aba5173f464563c63a"},"schema_version":"1.0","source":{"id":"1207.5217","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.5217","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"arxiv_version","alias_value":"1207.5217v3","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5217","created_at":"2026-05-18T03:47:00Z"},{"alias_kind":"pith_short_12","alias_value":"5IT3M6AVRZ4E","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"5IT3M6AVRZ4EYPDQ","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"5IT3M6AV","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:152c08f247372ec673b4228fdaeacd7578a2d48a1dfacac15c54df671a20fa7f","target":"graph","created_at":"2026-05-18T03:47:00Z","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":"A large class of dense linear algebra operations, such as LU decomposition or inversion of a triangular matrix, are usually performed by blocked algorithms. For one such operation, typically, not only one but many algorithmic variants exist; depending on computing architecture, libraries and problem size, each variant attains a different performances. We propose methods and tools to rank the algorithmic variants according to their performance for a given scenario without executing them.\n  For this purpose, we identify the routines upon which the algorithms are built. A first tool - the Sampler","authors_text":"Elmar Peise (1) ((1) AICES, RWTH Aachen)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-07-22T12:04:53Z","title":"Hierarchical Performance Modeling for Ranking Dense Linear Algebra Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.5217","kind":"arxiv","version":3},"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:d33b4aaacc754f12963023ded2c9f0a0923b4a24d2a5df60ba8adb193c3a8687","target":"record","created_at":"2026-05-18T03:47:00Z","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":"23cd490c1f7db7adcab43d119b70e5e97aa35d52017e4c2910620c8cc329a4e5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2012-07-22T12:04:53Z","title_canon_sha256":"fdb202e658917560e9c89b75d9296fd0ce2f7df5dd2074aba5173f464563c63a"},"schema_version":"1.0","source":{"id":"1207.5217","kind":"arxiv","version":3}},"canonical_sha256":"ea27b678158e784c3c700d68637fdfc51fbf013d6a8e14a3d4ca721d8d3536ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea27b678158e784c3c700d68637fdfc51fbf013d6a8e14a3d4ca721d8d3536ec","first_computed_at":"2026-05-18T03:47:00.646143Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:47:00.646143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r4Od+gIj+6a7EQTa/J/9OPqizsLVzun1Xm9mgBym+ZYkQg+qdpO9LIP5d9WeoSubpiOBGc2GdpmpwaA80aDpDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:47:00.646942Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.5217","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d33b4aaacc754f12963023ded2c9f0a0923b4a24d2a5df60ba8adb193c3a8687","sha256:152c08f247372ec673b4228fdaeacd7578a2d48a1dfacac15c54df671a20fa7f"],"state_sha256":"cb7a9f0c7b9e7d711ac88f5e75da0cd48ee08446e69cd160737cf696b1592994"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5T+Z+esQjXYHK45tAG90+9HQYFkknMpwAYthDL8YtWBJLWorRujP1aYcNO5iqYKWa/Vv6LNRobf1U0oL8OXvCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T11:40:31.237826Z","bundle_sha256":"a9b0ff4e76c51f28d392a9b37e6f52efc65a74020221b144a2a40a8c851794de"}}