{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5IT3M6AVRZ4EYPDQBVUGG767YU","short_pith_number":"pith:5IT3M6AV","schema_version":"1.0","canonical_sha256":"ea27b678158e784c3c700d68637fdfc51fbf013d6a8e14a3d4ca721d8d3536ec","source":{"kind":"arxiv","id":"1207.5217","version":3},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1207.5217","created_at":"2026-05-18T03:47:00.646245+00:00"},{"alias_kind":"arxiv_version","alias_value":"1207.5217v3","created_at":"2026-05-18T03:47:00.646245+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.5217","created_at":"2026-05-18T03:47:00.646245+00:00"},{"alias_kind":"pith_short_12","alias_value":"5IT3M6AVRZ4E","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"5IT3M6AVRZ4EYPDQ","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"5IT3M6AV","created_at":"2026-05-18T12:26:53.410803+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/5IT3M6AVRZ4EYPDQBVUGG767YU","json":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU.json","graph_json":"https://pith.science/api/pith-number/5IT3M6AVRZ4EYPDQBVUGG767YU/graph.json","events_json":"https://pith.science/api/pith-number/5IT3M6AVRZ4EYPDQBVUGG767YU/events.json","paper":"https://pith.science/paper/5IT3M6AV"},"agent_actions":{"view_html":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU","download_json":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU.json","view_paper":"https://pith.science/paper/5IT3M6AV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1207.5217&json=true","fetch_graph":"https://pith.science/api/pith-number/5IT3M6AVRZ4EYPDQBVUGG767YU/graph.json","fetch_events":"https://pith.science/api/pith-number/5IT3M6AVRZ4EYPDQBVUGG767YU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/action/storage_attestation","attest_author":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/action/author_attestation","sign_citation":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/action/citation_signature","submit_replication":"https://pith.science/pith/5IT3M6AVRZ4EYPDQBVUGG767YU/action/replication_record"}},"created_at":"2026-05-18T03:47:00.646245+00:00","updated_at":"2026-05-18T03:47:00.646245+00:00"}