{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:ATHRGU5BISETEFT7MVTFRP6BMW","short_pith_number":"pith:ATHRGU5B","canonical_record":{"source":{"id":"1804.04021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-04-10T16:32:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a01e9e7a071938d78d5ee0aa041dd81b63d8c529ffb65ade07d5470aa66c70fa","abstract_canon_sha256":"37cfd2f75d5f6bad853d7c51bc77868fd5ed49a553732feb7f2ce7db83bdb620"},"schema_version":"1.0"},"canonical_sha256":"04cf1353a1448932167f656658bfc165ac2368327bcadec23ae54d11740c277e","source":{"kind":"arxiv","id":"1804.04021","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"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:ATHRGU5BISETEFT7MVTFRP6BMW","target":"record","payload":{"canonical_record":{"source":{"id":"1804.04021","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2018-04-10T16:32:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"a01e9e7a071938d78d5ee0aa041dd81b63d8c529ffb65ade07d5470aa66c70fa","abstract_canon_sha256":"37cfd2f75d5f6bad853d7c51bc77868fd5ed49a553732feb7f2ce7db83bdb620"},"schema_version":"1.0"},"canonical_sha256":"04cf1353a1448932167f656658bfc165ac2368327bcadec23ae54d11740c277e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:42.336592Z","signature_b64":"x0YRPuZ0pUsH5ah1n44DaV+e/AjcNVCfL3ZbHf+RP2RuUA9BAOI4H78vp4Jba+KRICpFbJu596r0Z41/D1lzBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"04cf1353a1448932167f656658bfc165ac2368327bcadec23ae54d11740c277e","last_reissued_at":"2026-05-18T00:18:42.335988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:42.335988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.04021","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OSJss1cDI96w6F0nac78ExmBOzQ65NUyFeWtBfJDOOsOrozrtT0mSvR6GHCowuMZh9Qepmxzcwm0u7mlGcTfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:04:34.932868Z"},"content_sha256":"cc745efb5f9e5508472994f27c11ab1c49c5d03ae9efcffe143f2e3123d8af0e","schema_version":"1.0","event_id":"sha256:cc745efb5f9e5508472994f27c11ab1c49c5d03ae9efcffe143f2e3123d8af0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:ATHRGU5BISETEFT7MVTFRP6BMW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Generalized Matrix Chain Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.MS","authors_text":"Henrik Barthels, Marcin Copik, Paolo Bientinesi","submitted_at":"2018-04-10T16:32:49Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.04021","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:18:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PhkExYT0ojkggyu/g81LrEDpMwlK/t8MoKuQew/+pkcRuPXzYVh+fe7wboOzmCWNLkWj9dWgTMwnHZ/j8NpQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:04:34.933214Z"},"content_sha256":"99f3e61e500c608912ecfc52fc2e119b0f0eb5e85814e9fa21bf69d1ee53c57f","schema_version":"1.0","event_id":"sha256:99f3e61e500c608912ecfc52fc2e119b0f0eb5e85814e9fa21bf69d1ee53c57f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ATHRGU5BISETEFT7MVTFRP6BMW/bundle.json","state_url":"https://pith.science/pith/ATHRGU5BISETEFT7MVTFRP6BMW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ATHRGU5BISETEFT7MVTFRP6BMW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-02T05:04:34Z","links":{"resolver":"https://pith.science/pith/ATHRGU5BISETEFT7MVTFRP6BMW","bundle":"https://pith.science/pith/ATHRGU5BISETEFT7MVTFRP6BMW/bundle.json","state":"https://pith.science/pith/ATHRGU5BISETEFT7MVTFRP6BMW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ATHRGU5BISETEFT7MVTFRP6BMW/bundle.json"},"state":{"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"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtoR2I+ThC14Qg8pfrZvY6apt66DcFXo25hE7hTw//HMzXo4vXzppVIGfemiyx4jSTkCxkRBmD8/gjpQq/ibAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:04:34.935179Z","bundle_sha256":"e5a1a55cdc3771f600aa4f86872fd3cd30b271f931bca9fcc926166af31c66b8"}}