{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AYTYRPDX27NDBDOQJDZTL5R6X4","short_pith_number":"pith:AYTYRPDX","schema_version":"1.0","canonical_sha256":"062788bc77d7da308dd048f335f63ebf0449c3b34b6d1969cbeb0671598bfaf9","source":{"kind":"arxiv","id":"2608.07724","version":1},"attestation_state":"computed","paper":{"title":"Communication-efficient parallel Bruhat decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Tiskin, Ioanna Evtushevskaya-Konovalova","submitted_at":"2026-08-07T19:28:37Z","abstract_excerpt":"The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Bruhat decomposition is an important method in numerical linear algebra, generalising ordinary LU decomposition while providing a symmetric structured way of expessing pivoting. Block-recursive algorithms have been developed in the past for various numerical linear algebra problems, including Bruhat decomposition; however, expressing recursive algorithms in the BSP model still remains a challenge. In this paper, we consider the communication and synchronisation complexity of "},"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":"2608.07724","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-08-07T19:28:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"9d6b52f39e1a3bf00a280975994e3f9b34952112a009e9fdf211a134f22b6bf8","abstract_canon_sha256":"87f8b7dd95aff32fa32c10ea9d80ae345f9b7c3147d778f55589e6967210b031"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-08-11T00:15:47.302210Z","signature_b64":"3LcnwypilNDeaigw+UyV+25td81rAX4Y3owzwHjlUiuD6Is7ayuSCmEbQCe40s4yRSz3N6S05AWv0CigfAR/CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"062788bc77d7da308dd048f335f63ebf0449c3b34b6d1969cbeb0671598bfaf9","last_reissued_at":"2026-08-11T00:15:47.300060Z","signature_status":"signed_v1","first_computed_at":"2026-08-11T00:15:47.300060Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Communication-efficient parallel Bruhat decomposition","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Alexander Tiskin, Ioanna Evtushevskaya-Konovalova","submitted_at":"2026-08-07T19:28:37Z","abstract_excerpt":"The model of bulk-synchronous parallel (BSP) computation is an emerging paradigm of general-purpose parallel computing. Bruhat decomposition is an important method in numerical linear algebra, generalising ordinary LU decomposition while providing a symmetric structured way of expessing pivoting. Block-recursive algorithms have been developed in the past for various numerical linear algebra problems, including Bruhat decomposition; however, expressing recursive algorithms in the BSP model still remains a challenge. In this paper, we consider the communication and synchronisation complexity of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2608.07724","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2608.07724/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2608.07724","created_at":"2026-08-11T00:15:47.300408+00:00"},{"alias_kind":"arxiv_version","alias_value":"2608.07724v1","created_at":"2026-08-11T00:15:47.300408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2608.07724","created_at":"2026-08-11T00:15:47.300408+00:00"},{"alias_kind":"pith_short_12","alias_value":"AYTYRPDX27ND","created_at":"2026-08-11T00:15:47.300408+00:00"},{"alias_kind":"pith_short_16","alias_value":"AYTYRPDX27NDBDOQ","created_at":"2026-08-11T00:15:47.300408+00:00"},{"alias_kind":"pith_short_8","alias_value":"AYTYRPDX","created_at":"2026-08-11T00:15:47.300408+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/AYTYRPDX27NDBDOQJDZTL5R6X4","json":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4.json","graph_json":"https://pith.science/api/pith-number/AYTYRPDX27NDBDOQJDZTL5R6X4/graph.json","events_json":"https://pith.science/api/pith-number/AYTYRPDX27NDBDOQJDZTL5R6X4/events.json","paper":"https://pith.science/paper/AYTYRPDX"},"agent_actions":{"view_html":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4","download_json":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4.json","view_paper":"https://pith.science/paper/AYTYRPDX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2608.07724&json=true","fetch_graph":"https://pith.science/api/pith-number/AYTYRPDX27NDBDOQJDZTL5R6X4/graph.json","fetch_events":"https://pith.science/api/pith-number/AYTYRPDX27NDBDOQJDZTL5R6X4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4/action/storage_attestation","attest_author":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4/action/author_attestation","sign_citation":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4/action/citation_signature","submit_replication":"https://pith.science/pith/AYTYRPDX27NDBDOQJDZTL5R6X4/action/replication_record"}},"created_at":"2026-08-11T00:15:47.300408+00:00","updated_at":"2026-08-11T00:15:47.300408+00:00"}