{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ODPZ5PSTBVSOQIM37E6UVLCG5H","short_pith_number":"pith:ODPZ5PST","schema_version":"1.0","canonical_sha256":"70df9ebe530d64e8219bf93d4aac46e9f54590dbad1792a201daa1be11aa5281","source":{"kind":"arxiv","id":"1410.0567","version":1},"attestation_state":"computed","paper":{"title":"Knowledge-Based Automatic Generation of Partitioned Matrix Expressions","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:33:43Z","abstract_excerpt":"In a series of papers it has been shown that for many linear algebra operations it is possible to generate families of algorithms by following a systematic procedure. Although powerful, such a methodology involves complex algebraic manipulation, symbolic computations and pattern matching, making the generation a process challenging to be performed by hand. We aim for a fully automated system that from the sole description of a target operation creates multiple algorithms without any human intervention. Our approach consists of three main stages. The first stage yields the core object for the e"},"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.0567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2014-10-02T14:33:43Z","cross_cats_sorted":["cs.SC"],"title_canon_sha256":"f8c9392c94c5803e57dae02195f467759098cbc8e3f91f99a2ebb2167a6eb2f7","abstract_canon_sha256":"403b7957bd391fe9459bd1fb829368356137d6eabeaa336b62ccc74097bcae49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:10.718468Z","signature_b64":"RchCUjy+ZiM9Z3FlvTQVtTgTZUs8IDHPjvCGNHJlafbZSAnZ+jFZ23PozdrIdj2z/azA3ZsyrHC3s0kHPdxlCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"70df9ebe530d64e8219bf93d4aac46e9f54590dbad1792a201daa1be11aa5281","last_reissued_at":"2026-05-18T02:41:10.717863Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:10.717863Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Knowledge-Based Automatic Generation of Partitioned Matrix Expressions","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:33:43Z","abstract_excerpt":"In a series of papers it has been shown that for many linear algebra operations it is possible to generate families of algorithms by following a systematic procedure. Although powerful, such a methodology involves complex algebraic manipulation, symbolic computations and pattern matching, making the generation a process challenging to be performed by hand. We aim for a fully automated system that from the sole description of a target operation creates multiple algorithms without any human intervention. Our approach consists of three main stages. The first stage yields the core object for the e"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0567","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.0567","created_at":"2026-05-18T02:41:10.717964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0567v1","created_at":"2026-05-18T02:41:10.717964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0567","created_at":"2026-05-18T02:41:10.717964+00:00"},{"alias_kind":"pith_short_12","alias_value":"ODPZ5PSTBVSO","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"ODPZ5PSTBVSOQIM3","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"ODPZ5PST","created_at":"2026-05-18T12:28:41.024544+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/ODPZ5PSTBVSOQIM37E6UVLCG5H","json":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H.json","graph_json":"https://pith.science/api/pith-number/ODPZ5PSTBVSOQIM37E6UVLCG5H/graph.json","events_json":"https://pith.science/api/pith-number/ODPZ5PSTBVSOQIM37E6UVLCG5H/events.json","paper":"https://pith.science/paper/ODPZ5PST"},"agent_actions":{"view_html":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H","download_json":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H.json","view_paper":"https://pith.science/paper/ODPZ5PST","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0567&json=true","fetch_graph":"https://pith.science/api/pith-number/ODPZ5PSTBVSOQIM37E6UVLCG5H/graph.json","fetch_events":"https://pith.science/api/pith-number/ODPZ5PSTBVSOQIM37E6UVLCG5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H/action/storage_attestation","attest_author":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H/action/author_attestation","sign_citation":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H/action/citation_signature","submit_replication":"https://pith.science/pith/ODPZ5PSTBVSOQIM37E6UVLCG5H/action/replication_record"}},"created_at":"2026-05-18T02:41:10.717964+00:00","updated_at":"2026-05-18T02:41:10.717964+00:00"}