{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YMMTW2ASPRV2OHKQFEOB2KD6HE","short_pith_number":"pith:YMMTW2AS","schema_version":"1.0","canonical_sha256":"c3193b68127c6ba71d50291c1d287e39029f8e7d14e4634ed5902e86b1ad0a82","source":{"kind":"arxiv","id":"1803.03864","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"B. David Saunders, Gavin Harrison, Jeremy Johnson","submitted_at":"2018-03-10T21:48:12Z","abstract_excerpt":"We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probability, structure independent. We show, using block size slightly larger than $r$, that the leading $r$ invariant factors are computed correctly with high probability over any field. Moreover, an algorithm is provided to compute the probability bound for a given matrix size and thus to select the block size needed to obtain the desired probability. The worst case probability bound is improved, post hoc, by incorporati"},"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":"1803.03864","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-03-10T21:48:12Z","cross_cats_sorted":[],"title_canon_sha256":"ace1976602285d1546a4815167e2aeca6ba8c275db59177b30b32091190162ee","abstract_canon_sha256":"0917bb3545ec1ab301e8063ffdbae0390f68fa9524604588e17d11f6c497194b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:33.593204Z","signature_b64":"VNHxCb6QkQx+nT0z9DB9/5FwmiPRFmPyryCnqGK3VAC6yG/gNAtgYpejmMPrvqGGMN4ik3SiGPpL4y13zEYVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c3193b68127c6ba71d50291c1d287e39029f8e7d14e4634ed5902e86b1ad0a82","last_reissued_at":"2026-05-18T00:21:33.592615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:33.592615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"B. David Saunders, Gavin Harrison, Jeremy Johnson","submitted_at":"2018-03-10T21:48:12Z","abstract_excerpt":"We determine the probability, structure dependent, that the block Wiedemann algorithm correctly computes leading invariant factors. This leads to a tight lower bound for the probability, structure independent. We show, using block size slightly larger than $r$, that the leading $r$ invariant factors are computed correctly with high probability over any field. Moreover, an algorithm is provided to compute the probability bound for a given matrix size and thus to select the block size needed to obtain the desired probability. The worst case probability bound is improved, post hoc, by incorporati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03864","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":"1803.03864","created_at":"2026-05-18T00:21:33.592692+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.03864v1","created_at":"2026-05-18T00:21:33.592692+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03864","created_at":"2026-05-18T00:21:33.592692+00:00"},{"alias_kind":"pith_short_12","alias_value":"YMMTW2ASPRV2","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YMMTW2ASPRV2OHKQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YMMTW2AS","created_at":"2026-05-18T12:33:04.347982+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/YMMTW2ASPRV2OHKQFEOB2KD6HE","json":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE.json","graph_json":"https://pith.science/api/pith-number/YMMTW2ASPRV2OHKQFEOB2KD6HE/graph.json","events_json":"https://pith.science/api/pith-number/YMMTW2ASPRV2OHKQFEOB2KD6HE/events.json","paper":"https://pith.science/paper/YMMTW2AS"},"agent_actions":{"view_html":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE","download_json":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE.json","view_paper":"https://pith.science/paper/YMMTW2AS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.03864&json=true","fetch_graph":"https://pith.science/api/pith-number/YMMTW2ASPRV2OHKQFEOB2KD6HE/graph.json","fetch_events":"https://pith.science/api/pith-number/YMMTW2ASPRV2OHKQFEOB2KD6HE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/action/storage_attestation","attest_author":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/action/author_attestation","sign_citation":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/action/citation_signature","submit_replication":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/action/replication_record"}},"created_at":"2026-05-18T00:21:33.592692+00:00","updated_at":"2026-05-18T00:21:33.592692+00:00"}