{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:ATHRGU5BISETEFT7MVTFRP6BMW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"37cfd2f75d5f6bad853d7c51bc77868fd5ed49a553732feb7f2ce7db83bdb620","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-04-10T16:32:49Z","title_canon_sha256":"a01e9e7a071938d78d5ee0aa041dd81b63d8c529ffb65ade07d5470aa66c70fa"},"schema_version":"1.0","source":{"id":"1804.04021","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.04021","created_at":"2026-05-18T00:18:42Z"},{"alias_kind":"arxiv_version","alias_value":"1804.04021v1","created_at":"2026-05-18T00:18:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.04021","created_at":"2026-05-18T00:18:42Z"},{"alias_kind":"pith_short_12","alias_value":"ATHRGU5BISET","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_16","alias_value":"ATHRGU5BISETEFT7","created_at":"2026-05-18T12:32:13Z"},{"alias_kind":"pith_short_8","alias_value":"ATHRGU5B","created_at":"2026-05-18T12:32:13Z"}],"graph_snapshots":[{"event_id":"sha256:99f3e61e500c608912ecfc52fc2e119b0f0eb5e85814e9fa21bf69d1ee53c57f","target":"graph","created_at":"2026-05-18T00:18:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem consists in finding the parenthesization of a matrix product $M := A_1 A_2 \\cdots A_n$ that minimizes the number of scalar operations. In practical applications, however, one frequently encounters more complicated expressions, involving transposition, inversion, and matrix properties. Indeed, the computation of such expressions relies on a set of computatio","authors_text":"Henrik Barthels, Marcin Copik, Paolo Bientinesi","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-04-10T16:32:49Z","title":"The Generalized Matrix Chain Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04021","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cc745efb5f9e5508472994f27c11ab1c49c5d03ae9efcffe143f2e3123d8af0e","target":"record","created_at":"2026-05-18T00:18:42Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"37cfd2f75d5f6bad853d7c51bc77868fd5ed49a553732feb7f2ce7db83bdb620","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-04-10T16:32:49Z","title_canon_sha256":"a01e9e7a071938d78d5ee0aa041dd81b63d8c529ffb65ade07d5470aa66c70fa"},"schema_version":"1.0","source":{"id":"1804.04021","kind":"arxiv","version":1}},"canonical_sha256":"04cf1353a1448932167f656658bfc165ac2368327bcadec23ae54d11740c277e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"04cf1353a1448932167f656658bfc165ac2368327bcadec23ae54d11740c277e","first_computed_at":"2026-05-18T00:18:42.335988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:42.335988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0YRPuZ0pUsH5ah1n44DaV+e/AjcNVCfL3ZbHf+RP2RuUA9BAOI4H78vp4Jba+KRICpFbJu596r0Z41/D1lzBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:42.336592Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.04021","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cc745efb5f9e5508472994f27c11ab1c49c5d03ae9efcffe143f2e3123d8af0e","sha256:99f3e61e500c608912ecfc52fc2e119b0f0eb5e85814e9fa21bf69d1ee53c57f"],"state_sha256":"608114b56ee5ccb4af8d3b6e234774b037dd55c2368bf8654236979b37ff2b7c"}