{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BUBJE5QFFGT2HYFUCG3J7NDI7W","short_pith_number":"pith:BUBJE5QF","schema_version":"1.0","canonical_sha256":"0d0292760529a7a3e0b411b69fb468fd8c8b631f99d9acf99b326cc2be0d9b5d","source":{"kind":"arxiv","id":"1312.4818","version":1},"attestation_state":"computed","paper":{"title":"Typing linear algebra: A biproduct-oriented approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.SE","authors_text":"Hugo Daniel Macedo (INRIA Paris-Rocquencourt), Jos\\'e N. Oliveira (HASLab)","submitted_at":"2013-12-17T15:13:48Z","abstract_excerpt":"Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the central operation of matrix al"},"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":"1312.4818","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SE","submitted_at":"2013-12-17T15:13:48Z","cross_cats_sorted":["math.CT"],"title_canon_sha256":"0901679cefa69299005ef2d1b45fbe6ce7688e79cf78dbea5ce83351d8345e2a","abstract_canon_sha256":"531048f8a59943703cb698eaeedf637d4ea61b1682e8e9e8fad4afd5069ce27d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:04:23.065203Z","signature_b64":"oya78cV9WJDtM5z4EFTPG3sIzAGtfzKzK7VqQd3gz5xmU4F+0mwjdrjz3Be+BdJJlwwNPA/6ANosRB2keHi+Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d0292760529a7a3e0b411b69fb468fd8c8b631f99d9acf99b326cc2be0d9b5d","last_reissued_at":"2026-05-18T03:04:23.064544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:04:23.064544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Typing linear algebra: A biproduct-oriented approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CT"],"primary_cat":"cs.SE","authors_text":"Hugo Daniel Macedo (INRIA Paris-Rocquencourt), Jos\\'e N. Oliveira (HASLab)","submitted_at":"2013-12-17T15:13:48Z","abstract_excerpt":"Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the central operation of matrix al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.4818","kind":"arxiv","version":1},"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":"1312.4818","created_at":"2026-05-18T03:04:23.064644+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.4818v1","created_at":"2026-05-18T03:04:23.064644+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.4818","created_at":"2026-05-18T03:04:23.064644+00:00"},{"alias_kind":"pith_short_12","alias_value":"BUBJE5QFFGT2","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_16","alias_value":"BUBJE5QFFGT2HYFU","created_at":"2026-05-18T12:27:40.988391+00:00"},{"alias_kind":"pith_short_8","alias_value":"BUBJE5QF","created_at":"2026-05-18T12:27:40.988391+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/BUBJE5QFFGT2HYFUCG3J7NDI7W","json":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W.json","graph_json":"https://pith.science/api/pith-number/BUBJE5QFFGT2HYFUCG3J7NDI7W/graph.json","events_json":"https://pith.science/api/pith-number/BUBJE5QFFGT2HYFUCG3J7NDI7W/events.json","paper":"https://pith.science/paper/BUBJE5QF"},"agent_actions":{"view_html":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W","download_json":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W.json","view_paper":"https://pith.science/paper/BUBJE5QF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.4818&json=true","fetch_graph":"https://pith.science/api/pith-number/BUBJE5QFFGT2HYFUCG3J7NDI7W/graph.json","fetch_events":"https://pith.science/api/pith-number/BUBJE5QFFGT2HYFUCG3J7NDI7W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W/action/storage_attestation","attest_author":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W/action/author_attestation","sign_citation":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W/action/citation_signature","submit_replication":"https://pith.science/pith/BUBJE5QFFGT2HYFUCG3J7NDI7W/action/replication_record"}},"created_at":"2026-05-18T03:04:23.064644+00:00","updated_at":"2026-05-18T03:04:23.064644+00:00"}