{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ZOEMSQL6UIQMZDZKDXB6YQKP7S","short_pith_number":"pith:ZOEMSQL6","schema_version":"1.0","canonical_sha256":"cb88c9417ea220cc8f2a1dc3ec414ffcad3d8f9abce1b0c5beb15cd1707f00ab","source":{"kind":"arxiv","id":"1912.06526","version":2},"attestation_state":"computed","paper":{"title":"Flexible Communication Avoiding Matrix Multiplication on FPGA with High-Level Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Grzegorz Kwasniewski, Johannes De Fine Licht, Torsten Hoefler","submitted_at":"2019-12-13T14:28:42Z","abstract_excerpt":"Data movement is the dominating factor affecting performance and energy in modern computing systems. Consequently, many algorithms have been developed to minimize the number of I/O operations for common computing patterns. Matrix multiplication is no exception, and lower bounds have been proven and implemented both for shared and distributed memory systems. Reconfigurable hardware platforms are a lucrative target for I/O minimizing algorithms, as they offer full control of memory accesses to the programmer. While bounds developed in the context of fixed architectures still apply to these platf"},"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":"1912.06526","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-12-13T14:28:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"91da256029884380b4ad3ab1d04a1835ebcb7256d1414e103994e6f40781f4e1","abstract_canon_sha256":"c1ac15fdac1babe34a3844dba20e2ad0af744af1a6aded2ec52f36085a9677f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:09:01.943743Z","signature_b64":"F4szmXjpjJiKp9MtrRW/caZ61bdCt+tn79OF2pQsjey0fmuzE7eJetTA5FlXLN58V7F6viDGLsnUe6ATTLoSDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb88c9417ea220cc8f2a1dc3ec414ffcad3d8f9abce1b0c5beb15cd1707f00ab","last_reissued_at":"2026-07-05T02:09:01.943308Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:09:01.943308Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Flexible Communication Avoiding Matrix Multiplication on FPGA with High-Level Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Grzegorz Kwasniewski, Johannes De Fine Licht, Torsten Hoefler","submitted_at":"2019-12-13T14:28:42Z","abstract_excerpt":"Data movement is the dominating factor affecting performance and energy in modern computing systems. Consequently, many algorithms have been developed to minimize the number of I/O operations for common computing patterns. Matrix multiplication is no exception, and lower bounds have been proven and implemented both for shared and distributed memory systems. Reconfigurable hardware platforms are a lucrative target for I/O minimizing algorithms, as they offer full control of memory accesses to the programmer. While bounds developed in the context of fixed architectures still apply to these platf"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1912.06526","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1912.06526/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1912.06526","created_at":"2026-07-05T02:09:01.943383+00:00"},{"alias_kind":"arxiv_version","alias_value":"1912.06526v2","created_at":"2026-07-05T02:09:01.943383+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1912.06526","created_at":"2026-07-05T02:09:01.943383+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOEMSQL6UIQM","created_at":"2026-07-05T02:09:01.943383+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOEMSQL6UIQMZDZK","created_at":"2026-07-05T02:09:01.943383+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOEMSQL6","created_at":"2026-07-05T02:09:01.943383+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/ZOEMSQL6UIQMZDZKDXB6YQKP7S","json":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S.json","graph_json":"https://pith.science/api/pith-number/ZOEMSQL6UIQMZDZKDXB6YQKP7S/graph.json","events_json":"https://pith.science/api/pith-number/ZOEMSQL6UIQMZDZKDXB6YQKP7S/events.json","paper":"https://pith.science/paper/ZOEMSQL6"},"agent_actions":{"view_html":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S","download_json":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S.json","view_paper":"https://pith.science/paper/ZOEMSQL6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1912.06526&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOEMSQL6UIQMZDZKDXB6YQKP7S/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOEMSQL6UIQMZDZKDXB6YQKP7S/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S/action/storage_attestation","attest_author":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S/action/author_attestation","sign_citation":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S/action/citation_signature","submit_replication":"https://pith.science/pith/ZOEMSQL6UIQMZDZKDXB6YQKP7S/action/replication_record"}},"created_at":"2026-07-05T02:09:01.943383+00:00","updated_at":"2026-07-05T02:09:01.943383+00:00"}