{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YMMTW2ASPRV2OHKQFEOB2KD6HE","short_pith_number":"pith:YMMTW2AS","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"},"canonical_sha256":"c3193b68127c6ba71d50291c1d287e39029f8e7d14e4634ed5902e86b1ad0a82","source":{"kind":"arxiv","id":"1803.03864","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03864","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03864v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03864","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"YMMTW2ASPRV2","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YMMTW2ASPRV2OHKQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YMMTW2AS","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YMMTW2ASPRV2OHKQFEOB2KD6HE","target":"record","payload":{"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"},"canonical_sha256":"c3193b68127c6ba71d50291c1d287e39029f8e7d14e4634ed5902e86b1ad0a82","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"},"source_kind":"arxiv","source_id":"1803.03864","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:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i7Ro1YVhMtkL7pImLDy3p3DClrQRDCTSYGw0RgUcbhJzlt0Q3gg2r9kffCWY2Sm8xW+UPKQNemu3iBFKlgVDAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:47.235059Z"},"content_sha256":"cfe7836702e5e1d52bbdcd607cb63747135ba6e3f47e506dd454638ef81219ce","schema_version":"1.0","event_id":"sha256:cfe7836702e5e1d52bbdcd607cb63747135ba6e3f47e506dd454638ef81219ce"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YMMTW2ASPRV2OHKQFEOB2KD6HE","target":"graph","payload":{"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"},"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:21:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q1MAV3nvPLnzS8e0eVm6W1qivEA1MEgQwD3vMuDoH8UdeGHPpThz/kJf+AOLSlVvmgC3hTTr5GWxLIVUrygaDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:51:47.235415Z"},"content_sha256":"02186611bb00d7b1552291905f3a9dcf2b78528f592bc9690d4257aa2f1269e1","schema_version":"1.0","event_id":"sha256:02186611bb00d7b1552291905f3a9dcf2b78528f592bc9690d4257aa2f1269e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/bundle.json","state_url":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/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-05-30T23:51:47Z","links":{"resolver":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE","bundle":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/bundle.json","state":"https://pith.science/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YMMTW2ASPRV2OHKQFEOB2KD6HE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YMMTW2ASPRV2OHKQFEOB2KD6HE","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":"0917bb3545ec1ab301e8063ffdbae0390f68fa9524604588e17d11f6c497194b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-03-10T21:48:12Z","title_canon_sha256":"ace1976602285d1546a4815167e2aeca6ba8c275db59177b30b32091190162ee"},"schema_version":"1.0","source":{"id":"1803.03864","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.03864","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"arxiv_version","alias_value":"1803.03864v1","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.03864","created_at":"2026-05-18T00:21:33Z"},{"alias_kind":"pith_short_12","alias_value":"YMMTW2ASPRV2","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YMMTW2ASPRV2OHKQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YMMTW2AS","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:02186611bb00d7b1552291905f3a9dcf2b78528f592bc9690d4257aa2f1269e1","target":"graph","created_at":"2026-05-18T00:21:33Z","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 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","authors_text":"B. David Saunders, Gavin Harrison, Jeremy Johnson","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-03-10T21:48:12Z","title":"Probabilistic Analysis of Block Wiedemann for Leading Invariant Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.03864","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:cfe7836702e5e1d52bbdcd607cb63747135ba6e3f47e506dd454638ef81219ce","target":"record","created_at":"2026-05-18T00:21:33Z","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":"0917bb3545ec1ab301e8063ffdbae0390f68fa9524604588e17d11f6c497194b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2018-03-10T21:48:12Z","title_canon_sha256":"ace1976602285d1546a4815167e2aeca6ba8c275db59177b30b32091190162ee"},"schema_version":"1.0","source":{"id":"1803.03864","kind":"arxiv","version":1}},"canonical_sha256":"c3193b68127c6ba71d50291c1d287e39029f8e7d14e4634ed5902e86b1ad0a82","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c3193b68127c6ba71d50291c1d287e39029f8e7d14e4634ed5902e86b1ad0a82","first_computed_at":"2026-05-18T00:21:33.592615Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:33.592615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VNHxCb6QkQx+nT0z9DB9/5FwmiPRFmPyryCnqGK3VAC6yG/gNAtgYpejmMPrvqGGMN4ik3SiGPpL4y13zEYVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:33.593204Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.03864","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfe7836702e5e1d52bbdcd607cb63747135ba6e3f47e506dd454638ef81219ce","sha256:02186611bb00d7b1552291905f3a9dcf2b78528f592bc9690d4257aa2f1269e1"],"state_sha256":"19bc7371cd3d5941d8d7f30a20668eed89d69d9e8671f32ff16f69684bd1f7ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biCFUuenZdg53DHd+Xa0GKw5LqMrUrVF7QqP2xhuiECREm/EKv4tQvQvHldjlii+831nvLIhQsuaXNPAZSmRBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:51:47.237466Z","bundle_sha256":"6081fe83aca4952fbdb17a1796b00712212d3d71221dda19db7d8af72e2d360e"}}