{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:WWQLGMG2ZTL7AXB6QU3NPPFRC6","short_pith_number":"pith:WWQLGMG2","canonical_record":{"source":{"id":"1408.0994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-08-05T15:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"313005e92a33e02488ee923a29a9d555a8d555cee126678efebb0e3def2f4586","abstract_canon_sha256":"c66db1ae4c2e8491f8b57590554038523f9efda62851914831f4145122a99ac8"},"schema_version":"1.0"},"canonical_sha256":"b5a0b330daccd7f05c3e8536d7bcb117abb0e323ddc5cefa59653aff841554bf","source":{"kind":"arxiv","id":"1408.0994","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0994","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0994v2","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0994","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"WWQLGMG2ZTL7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WWQLGMG2ZTL7AXB6","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WWQLGMG2","created_at":"2026-05-18T12:28:54Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:WWQLGMG2ZTL7AXB6QU3NPPFRC6","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0994","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-08-05T15:04:34Z","cross_cats_sorted":[],"title_canon_sha256":"313005e92a33e02488ee923a29a9d555a8d555cee126678efebb0e3def2f4586","abstract_canon_sha256":"c66db1ae4c2e8491f8b57590554038523f9efda62851914831f4145122a99ac8"},"schema_version":"1.0"},"canonical_sha256":"b5a0b330daccd7f05c3e8536d7bcb117abb0e323ddc5cefa59653aff841554bf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:21.882140Z","signature_b64":"tCjUFo8oX3qu7ReQ8N8A04wvmNz2ipXtFDyoB6ont2QqjMQ64qGit9cw5QIAO/XWJizAYyPUZ7WpVgkYYKT4Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5a0b330daccd7f05c3e8536d7bcb117abb0e323ddc5cefa59653aff841554bf","last_reissued_at":"2026-05-18T00:32:21.881563Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:21.881563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0994","source_version":2,"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:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhMOxjcEHNoratJJoXPl0p5PiY4eWpB3rxKEGdFX3LKIITAwSP+k6N/sIzgVTWVklXFj4pmGhKIHNve7NsDdBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:54:54.859082Z"},"content_sha256":"0af00675836a7b638eeb9e83b50aa442a1fe01a8ee7f56e5abce90e9b29ac75b","schema_version":"1.0","event_id":"sha256:0af00675836a7b638eeb9e83b50aa442a1fe01a8ee7f56e5abce90e9b29ac75b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:WWQLGMG2ZTL7AXB6QU3NPPFRC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Lower-Upper-Lower Block Triangular Decomposition with Minimal Off-Diagonal Ranks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.RA","authors_text":"Fran\\c{c}ois Serre, Markus P\\\"uschel","submitted_at":"2014-08-05T15:04:34Z","abstract_excerpt":"We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower block-unitriangular, respectively. Our goal is to make this factorization \"as block-diagonal as possible\" by minimizing the ranks of the off-diagonal blocks. We give lower bounds on these ranks and show that they are sharp by providing an algorithm that computes an optimal solution. The proposed decomposition can be viewed as a generalization of the well-know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0994","kind":"arxiv","version":2},"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:32:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BOWFukVbTlMDQ/Fk3lPiX51MYiHLosWkU+J/tmfacNeOfgWMO9pC8H7lcqVsegGy69wtf8I5VCThy+DIxCSfAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T06:54:54.859435Z"},"content_sha256":"a8f1a8ee46a930b8c10cc2da442254c6a66c651ce34d73f809fd6f613cab9811","schema_version":"1.0","event_id":"sha256:a8f1a8ee46a930b8c10cc2da442254c6a66c651ce34d73f809fd6f613cab9811"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6/bundle.json","state_url":"https://pith.science/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6/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-28T06:54:54Z","links":{"resolver":"https://pith.science/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6","bundle":"https://pith.science/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6/bundle.json","state":"https://pith.science/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WWQLGMG2ZTL7AXB6QU3NPPFRC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:WWQLGMG2ZTL7AXB6QU3NPPFRC6","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":"c66db1ae4c2e8491f8b57590554038523f9efda62851914831f4145122a99ac8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-08-05T15:04:34Z","title_canon_sha256":"313005e92a33e02488ee923a29a9d555a8d555cee126678efebb0e3def2f4586"},"schema_version":"1.0","source":{"id":"1408.0994","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0994","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0994v2","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0994","created_at":"2026-05-18T00:32:21Z"},{"alias_kind":"pith_short_12","alias_value":"WWQLGMG2ZTL7","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_16","alias_value":"WWQLGMG2ZTL7AXB6","created_at":"2026-05-18T12:28:54Z"},{"alias_kind":"pith_short_8","alias_value":"WWQLGMG2","created_at":"2026-05-18T12:28:54Z"}],"graph_snapshots":[{"event_id":"sha256:a8f1a8ee46a930b8c10cc2da442254c6a66c651ce34d73f809fd6f613cab9811","target":"graph","created_at":"2026-05-18T00:32:21Z","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":"We propose a novel factorization of a non-singular matrix $P$, viewed as a $2\\times 2$-blocked matrix. The factorization decomposes $P$ into a product of three matrices that are lower block-unitriangular, upper block-triangular, and lower block-unitriangular, respectively. Our goal is to make this factorization \"as block-diagonal as possible\" by minimizing the ranks of the off-diagonal blocks. We give lower bounds on these ranks and show that they are sharp by providing an algorithm that computes an optimal solution. The proposed decomposition can be viewed as a generalization of the well-know","authors_text":"Fran\\c{c}ois Serre, Markus P\\\"uschel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-08-05T15:04:34Z","title":"A Lower-Upper-Lower Block Triangular Decomposition with Minimal Off-Diagonal Ranks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0994","kind":"arxiv","version":2},"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:0af00675836a7b638eeb9e83b50aa442a1fe01a8ee7f56e5abce90e9b29ac75b","target":"record","created_at":"2026-05-18T00:32:21Z","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":"c66db1ae4c2e8491f8b57590554038523f9efda62851914831f4145122a99ac8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.RA","submitted_at":"2014-08-05T15:04:34Z","title_canon_sha256":"313005e92a33e02488ee923a29a9d555a8d555cee126678efebb0e3def2f4586"},"schema_version":"1.0","source":{"id":"1408.0994","kind":"arxiv","version":2}},"canonical_sha256":"b5a0b330daccd7f05c3e8536d7bcb117abb0e323ddc5cefa59653aff841554bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b5a0b330daccd7f05c3e8536d7bcb117abb0e323ddc5cefa59653aff841554bf","first_computed_at":"2026-05-18T00:32:21.881563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:21.881563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tCjUFo8oX3qu7ReQ8N8A04wvmNz2ipXtFDyoB6ont2QqjMQ64qGit9cw5QIAO/XWJizAYyPUZ7WpVgkYYKT4Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:21.882140Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0994","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0af00675836a7b638eeb9e83b50aa442a1fe01a8ee7f56e5abce90e9b29ac75b","sha256:a8f1a8ee46a930b8c10cc2da442254c6a66c651ce34d73f809fd6f613cab9811"],"state_sha256":"ef3a6a82ba235f6d72a990732c431980c0d79bfab892693883bb90dc5275f35e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xwyt72TPdH/KNTkDBtND0dYmL09XXr0ESJl6QqoiLOnZqrOyWuZON/UpgChfK91XQSCDhn1opcVk6Jt+OdoABA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T06:54:54.861286Z","bundle_sha256":"f6abb1b82fafa380b464724cfd94d57cd19b1fd2b3d6196f8da2b53a2b72a624"}}