{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:MC4TNTOAUW7OVIIGJNRFUWTWDV","short_pith_number":"pith:MC4TNTOA","schema_version":"1.0","canonical_sha256":"60b936cdc0a5beeaa1064b625a5a761d423732f2a32d89aaf01a33d5fc69d816","source":{"kind":"arxiv","id":"1209.2364","version":2},"attestation_state":"computed","paper":{"title":"Performance Modeling for Dense Linear Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.PF"],"primary_cat":"cs.MS","authors_text":"Elmar Peise (1), Paolo Bientinesi (1) ((1) AICES, RWTH Aachen)","submitted_at":"2012-09-11T16:37:20Z","abstract_excerpt":"It is well known that the behavior of dense linear algebra algorithms is greatly influenced by factors like target architecture, underlying libraries and even problem size; because of this, the accurate prediction of their performance is a real challenge. In this article, we are not interested in creating accurate models for a given algorithm, but in correctly ranking a set of equivalent algorithms according to their performance. Aware of the hierarchical structure of dense linear algebra routines, we approach the problem by developing a framework for the automatic generation of statistical pe"},"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":"1209.2364","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2012-09-11T16:37:20Z","cross_cats_sorted":["cs.NA","cs.PF"],"title_canon_sha256":"c838fec835ccec8e8071bbed90d03637ddcf5bbbe0ea576708b4915c1515c911","abstract_canon_sha256":"5f91579d90ed012286ee775a455aac10086f89aeff9a64eae7e8b380a6c2b9be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:55.654059Z","signature_b64":"+h/XJS4UW5/KBMPGHya00X0p1wlGGGbtO/ZYYi2H769BbjCDGWeR1RozSX+Fxt5vTn6bXfSHkapPvh3m+fOFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60b936cdc0a5beeaa1064b625a5a761d423732f2a32d89aaf01a33d5fc69d816","last_reissued_at":"2026-05-18T03:38:55.653535Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:55.653535Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Modeling for Dense Linear Algebra","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","cs.PF"],"primary_cat":"cs.MS","authors_text":"Elmar Peise (1), Paolo Bientinesi (1) ((1) AICES, RWTH Aachen)","submitted_at":"2012-09-11T16:37:20Z","abstract_excerpt":"It is well known that the behavior of dense linear algebra algorithms is greatly influenced by factors like target architecture, underlying libraries and even problem size; because of this, the accurate prediction of their performance is a real challenge. In this article, we are not interested in creating accurate models for a given algorithm, but in correctly ranking a set of equivalent algorithms according to their performance. Aware of the hierarchical structure of dense linear algebra routines, we approach the problem by developing a framework for the automatic generation of statistical pe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.2364","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1209.2364","created_at":"2026-05-18T03:38:55.653628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1209.2364v2","created_at":"2026-05-18T03:38:55.653628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.2364","created_at":"2026-05-18T03:38:55.653628+00:00"},{"alias_kind":"pith_short_12","alias_value":"MC4TNTOAUW7O","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"MC4TNTOAUW7OVIIG","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"MC4TNTOA","created_at":"2026-05-18T12:27:14.488303+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/MC4TNTOAUW7OVIIGJNRFUWTWDV","json":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV.json","graph_json":"https://pith.science/api/pith-number/MC4TNTOAUW7OVIIGJNRFUWTWDV/graph.json","events_json":"https://pith.science/api/pith-number/MC4TNTOAUW7OVIIGJNRFUWTWDV/events.json","paper":"https://pith.science/paper/MC4TNTOA"},"agent_actions":{"view_html":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV","download_json":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV.json","view_paper":"https://pith.science/paper/MC4TNTOA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1209.2364&json=true","fetch_graph":"https://pith.science/api/pith-number/MC4TNTOAUW7OVIIGJNRFUWTWDV/graph.json","fetch_events":"https://pith.science/api/pith-number/MC4TNTOAUW7OVIIGJNRFUWTWDV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV/action/storage_attestation","attest_author":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV/action/author_attestation","sign_citation":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV/action/citation_signature","submit_replication":"https://pith.science/pith/MC4TNTOAUW7OVIIGJNRFUWTWDV/action/replication_record"}},"created_at":"2026-05-18T03:38:55.653628+00:00","updated_at":"2026-05-18T03:38:55.653628+00:00"}