{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:ILWUQNIWWJRQ6MHJIR4SZSKLDI","short_pith_number":"pith:ILWUQNIW","schema_version":"1.0","canonical_sha256":"42ed483516b2630f30e944792cc94b1a2ca0ef0fb03835c441620fcb46f32b38","source":{"kind":"arxiv","id":"1402.3501","version":1},"attestation_state":"computed","paper":{"title":"Parallel computation of echelon forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Cl\\'ement Pernet (INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Jean-Guillaume Dumas (LJK), Thierry Gautier (INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Ziad Sultan (LJK","submitted_at":"2014-02-14T15:35:37Z","abstract_excerpt":"We propose efficient parallel algorithms and implementations on shared memory architectures of LU factorization over a finite field. Compared to the corresponding numerical routines, we have identified three main difficulties specific to linear algebra over finite fields. First, the arithmetic complexity could be dominated by modular reductions. Therefore, it is mandatory to delay as much as possible these reductions while mixing fine-grain parallelizations of tiled iterative and recursive algorithms. Second, fast linear algebra variants, e.g., using Strassen-Winograd algorithm, never suffer f"},"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":"1402.3501","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-02-14T15:35:37Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"f1730d9aea400b2c01c80c88d4c8f2e77458466b258e92969bcca408f3de8347","abstract_canon_sha256":"4d72d83d5c2e9fef6acb158b7053697a06535e676f958bbcdd6e3998030dc0e1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:58.580878Z","signature_b64":"/YbHymISQDHw9VZUjGnuBHdnnkm0ywAviQhVTVfHUcHVBA2R/jNMK+Sc9lLFK70pSRFbLeAR6NB9vqyFhb8GDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42ed483516b2630f30e944792cc94b1a2ca0ef0fb03835c441620fcb46f32b38","last_reissued_at":"2026-05-18T02:58:58.580105Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:58.580105Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parallel computation of echelon forms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.SC","authors_text":"Cl\\'ement Pernet (INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Jean-Guillaume Dumas (LJK), Thierry Gautier (INRIA Grenoble Rh\\^one-Alpes / LIG Laboratoire d'Informatique de Grenoble), Ziad Sultan (LJK","submitted_at":"2014-02-14T15:35:37Z","abstract_excerpt":"We propose efficient parallel algorithms and implementations on shared memory architectures of LU factorization over a finite field. Compared to the corresponding numerical routines, we have identified three main difficulties specific to linear algebra over finite fields. First, the arithmetic complexity could be dominated by modular reductions. Therefore, it is mandatory to delay as much as possible these reductions while mixing fine-grain parallelizations of tiled iterative and recursive algorithms. Second, fast linear algebra variants, e.g., using Strassen-Winograd algorithm, never suffer f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.3501","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":"1402.3501","created_at":"2026-05-18T02:58:58.580243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.3501v1","created_at":"2026-05-18T02:58:58.580243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.3501","created_at":"2026-05-18T02:58:58.580243+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILWUQNIWWJRQ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILWUQNIWWJRQ6MHJ","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILWUQNIW","created_at":"2026-05-18T12:28:33.132498+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/ILWUQNIWWJRQ6MHJIR4SZSKLDI","json":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI.json","graph_json":"https://pith.science/api/pith-number/ILWUQNIWWJRQ6MHJIR4SZSKLDI/graph.json","events_json":"https://pith.science/api/pith-number/ILWUQNIWWJRQ6MHJIR4SZSKLDI/events.json","paper":"https://pith.science/paper/ILWUQNIW"},"agent_actions":{"view_html":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI","download_json":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI.json","view_paper":"https://pith.science/paper/ILWUQNIW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.3501&json=true","fetch_graph":"https://pith.science/api/pith-number/ILWUQNIWWJRQ6MHJIR4SZSKLDI/graph.json","fetch_events":"https://pith.science/api/pith-number/ILWUQNIWWJRQ6MHJIR4SZSKLDI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI/action/storage_attestation","attest_author":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI/action/author_attestation","sign_citation":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI/action/citation_signature","submit_replication":"https://pith.science/pith/ILWUQNIWWJRQ6MHJIR4SZSKLDI/action/replication_record"}},"created_at":"2026-05-18T02:58:58.580243+00:00","updated_at":"2026-05-18T02:58:58.580243+00:00"}