{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:EPMG3CMOV4VMZ3KHZBJRIQJYNF","short_pith_number":"pith:EPMG3CMO","schema_version":"1.0","canonical_sha256":"23d86d898eaf2acced47c853144138695cc2a8121e48879029ab25962e710cc3","source":{"kind":"arxiv","id":"1410.0564","version":1},"attestation_state":"computed","paper":{"title":"Automatic Generation of Loop-Invariants for Matrix Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.MS","authors_text":"Diego Fabregat-Traver, Paolo Bientinesi","submitted_at":"2014-10-02T14:27:17Z","abstract_excerpt":"In recent years it has been shown that for many linear algebra operations it is possible to create families of algorithms following a very systematic procedure. We do not refer to the fine tuning of a known algorithm, but to a methodology for the actual generation of both algorithms and routines to solve a given target matrix equation. Although systematic, the methodology relies on complex algebraic manipulations and non-obvious pattern matching, making the procedure challenging to be performed by hand, our goal is the development of a fully automated system that from the sole description of a"},"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":"1410.0564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-10-02T14:27:17Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"9b40ffa1f2b7ad8a6cc616c5a7d74ea9aa2c93275e6987f4aca7c4d0a87d7b70","abstract_canon_sha256":"47ea38bf4c3e7d9e6c1d44ec7dd596854718d41379aeada991d7a83cd3af94ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:10.732586Z","signature_b64":"4Zeo1MkYvvrVg7Uhrn5w8m8MguNWj2lg3U6Q8oKlhLQtgj0yrsg0EVuYVAI6XmJi9Cf2XCY8Fuhd+Z6QdtXxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23d86d898eaf2acced47c853144138695cc2a8121e48879029ab25962e710cc3","last_reissued_at":"2026-05-18T02:41:10.732056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:10.732056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Automatic Generation of Loop-Invariants for Matrix Operations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC"],"primary_cat":"cs.MS","authors_text":"Diego Fabregat-Traver, Paolo Bientinesi","submitted_at":"2014-10-02T14:27:17Z","abstract_excerpt":"In recent years it has been shown that for many linear algebra operations it is possible to create families of algorithms following a very systematic procedure. We do not refer to the fine tuning of a known algorithm, but to a methodology for the actual generation of both algorithms and routines to solve a given target matrix equation. Although systematic, the methodology relies on complex algebraic manipulations and non-obvious pattern matching, making the procedure challenging to be performed by hand, our goal is the development of a fully automated system that from the sole description of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0564","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":"1410.0564","created_at":"2026-05-18T02:41:10.732132+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0564v1","created_at":"2026-05-18T02:41:10.732132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0564","created_at":"2026-05-18T02:41:10.732132+00:00"},{"alias_kind":"pith_short_12","alias_value":"EPMG3CMOV4VM","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"EPMG3CMOV4VMZ3KH","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"EPMG3CMO","created_at":"2026-05-18T12:28:28.263976+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/EPMG3CMOV4VMZ3KHZBJRIQJYNF","json":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF.json","graph_json":"https://pith.science/api/pith-number/EPMG3CMOV4VMZ3KHZBJRIQJYNF/graph.json","events_json":"https://pith.science/api/pith-number/EPMG3CMOV4VMZ3KHZBJRIQJYNF/events.json","paper":"https://pith.science/paper/EPMG3CMO"},"agent_actions":{"view_html":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF","download_json":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF.json","view_paper":"https://pith.science/paper/EPMG3CMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0564&json=true","fetch_graph":"https://pith.science/api/pith-number/EPMG3CMOV4VMZ3KHZBJRIQJYNF/graph.json","fetch_events":"https://pith.science/api/pith-number/EPMG3CMOV4VMZ3KHZBJRIQJYNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF/action/storage_attestation","attest_author":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF/action/author_attestation","sign_citation":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF/action/citation_signature","submit_replication":"https://pith.science/pith/EPMG3CMOV4VMZ3KHZBJRIQJYNF/action/replication_record"}},"created_at":"2026-05-18T02:41:10.732132+00:00","updated_at":"2026-05-18T02:41:10.732132+00:00"}