{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:UPQBXWX4VVD5MMGWGCCEZ5TBBN","short_pith_number":"pith:UPQBXWX4","canonical_record":{"source":{"id":"1209.5198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-24T08:58:34Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"386cbe40cd06a4419ad277c6e67d35c36a07e375581debd8472a2866d01a5bca","abstract_canon_sha256":"f3f9fcd551c2b8a686eefacdf2909229b12f469c82eaeb609c1421dbb65ee2b5"},"schema_version":"1.0"},"canonical_sha256":"a3e01bdafcad47d630d630844cf6610b4fc48b815b705c1275466bb19818f61a","source":{"kind":"arxiv","id":"1209.5198","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5198","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5198v2","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5198","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"UPQBXWX4VVD5","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UPQBXWX4VVD5MMGW","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UPQBXWX4","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:UPQBXWX4VVD5MMGWGCCEZ5TBBN","target":"record","payload":{"canonical_record":{"source":{"id":"1209.5198","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-24T08:58:34Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"386cbe40cd06a4419ad277c6e67d35c36a07e375581debd8472a2866d01a5bca","abstract_canon_sha256":"f3f9fcd551c2b8a686eefacdf2909229b12f469c82eaeb609c1421dbb65ee2b5"},"schema_version":"1.0"},"canonical_sha256":"a3e01bdafcad47d630d630844cf6610b4fc48b815b705c1275466bb19818f61a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:29.239097Z","signature_b64":"M+m2qH3Jn7Bv+yEGy9Lb4Uq8HTyg5O8gCgA9itlJ6KKau+3UBBlZfuyShAYTXvBIyrl5Rdn4h4No4xURl1KXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3e01bdafcad47d630d630844cf6610b4fc48b815b705c1275466bb19818f61a","last_reissued_at":"2026-05-18T00:31:29.238585Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:29.238585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1209.5198","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:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pqMaC1Re0OTi8xnvS4GqUR0Yo+kaGTuwNFsGtqwk4pvfCQZGojmaROC/GFf9/eNlmvtWTrxD+PM3WVWnoquNBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:41:44.749181Z"},"content_sha256":"f18ee7092d986650c1604470aba3a3b014292404430355b45b5b6547b52bf7c8","schema_version":"1.0","event_id":"sha256:f18ee7092d986650c1604470aba3a3b014292404430355b45b5b6547b52bf7c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:UPQBXWX4VVD5MMGWGCCEZ5TBBN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast matrix decomposition in F2","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Anna Rimoldi, Enrico Bertolazzi","submitted_at":"2012-09-24T08:58:34Z","abstract_excerpt":"In this work an efficient algorithm to perform a block decomposition (and so to compute the rank) of large dense rectangular matrices with entries in $\\mathbb{F}_2$ is presented. Depending on the way the matrix is stored, the operations acting on rows or block of consecutive columns (stored as one integer) should be preferred. In this paper, an algorithm that completely avoids the column permutations is given. In particular, a block decomposition is presented and its running times are compared with the ones adopted into SAGE."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5198","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:31:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sfm/FIG7jQ3Vg+TjGQulbOaUVN4HG82Hfnf50R3P7Y2KtpXiKrNwd2NPR60uEAL5pfhNcfbWWftdYXB32ulmDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:41:44.749615Z"},"content_sha256":"10a763e9397bd07eb3911c081756b9dd3f445d66861032e0304b20d38808a184","schema_version":"1.0","event_id":"sha256:10a763e9397bd07eb3911c081756b9dd3f445d66861032e0304b20d38808a184"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN/bundle.json","state_url":"https://pith.science/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN/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-02T04:41:44Z","links":{"resolver":"https://pith.science/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN","bundle":"https://pith.science/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN/bundle.json","state":"https://pith.science/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UPQBXWX4VVD5MMGWGCCEZ5TBBN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:UPQBXWX4VVD5MMGWGCCEZ5TBBN","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":"f3f9fcd551c2b8a686eefacdf2909229b12f469c82eaeb609c1421dbb65ee2b5","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-24T08:58:34Z","title_canon_sha256":"386cbe40cd06a4419ad277c6e67d35c36a07e375581debd8472a2866d01a5bca"},"schema_version":"1.0","source":{"id":"1209.5198","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1209.5198","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"arxiv_version","alias_value":"1209.5198v2","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1209.5198","created_at":"2026-05-18T00:31:29Z"},{"alias_kind":"pith_short_12","alias_value":"UPQBXWX4VVD5","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"UPQBXWX4VVD5MMGW","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"UPQBXWX4","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:10a763e9397bd07eb3911c081756b9dd3f445d66861032e0304b20d38808a184","target":"graph","created_at":"2026-05-18T00:31:29Z","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":"In this work an efficient algorithm to perform a block decomposition (and so to compute the rank) of large dense rectangular matrices with entries in $\\mathbb{F}_2$ is presented. Depending on the way the matrix is stored, the operations acting on rows or block of consecutive columns (stored as one integer) should be preferred. In this paper, an algorithm that completely avoids the column permutations is given. In particular, a block decomposition is presented and its running times are compared with the ones adopted into SAGE.","authors_text":"Anna Rimoldi, Enrico Bertolazzi","cross_cats":["cs.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-24T08:58:34Z","title":"Fast matrix decomposition in F2"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1209.5198","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:f18ee7092d986650c1604470aba3a3b014292404430355b45b5b6547b52bf7c8","target":"record","created_at":"2026-05-18T00:31:29Z","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":"f3f9fcd551c2b8a686eefacdf2909229b12f469c82eaeb609c1421dbb65ee2b5","cross_cats_sorted":["cs.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2012-09-24T08:58:34Z","title_canon_sha256":"386cbe40cd06a4419ad277c6e67d35c36a07e375581debd8472a2866d01a5bca"},"schema_version":"1.0","source":{"id":"1209.5198","kind":"arxiv","version":2}},"canonical_sha256":"a3e01bdafcad47d630d630844cf6610b4fc48b815b705c1275466bb19818f61a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a3e01bdafcad47d630d630844cf6610b4fc48b815b705c1275466bb19818f61a","first_computed_at":"2026-05-18T00:31:29.238585Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:29.238585Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M+m2qH3Jn7Bv+yEGy9Lb4Uq8HTyg5O8gCgA9itlJ6KKau+3UBBlZfuyShAYTXvBIyrl5Rdn4h4No4xURl1KXCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:29.239097Z","signed_message":"canonical_sha256_bytes"},"source_id":"1209.5198","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f18ee7092d986650c1604470aba3a3b014292404430355b45b5b6547b52bf7c8","sha256:10a763e9397bd07eb3911c081756b9dd3f445d66861032e0304b20d38808a184"],"state_sha256":"e9ab2a71a81427eac9bffa5ee9ab3ed059999146971061bf5edc447803dc8118"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PM9huZB5BHnAcRETp//mHxHf4OqKF/hpDqH1yuxwm4qjqAMTYY5+FAXjLuK49gYCac4PXAvtHzjK/5ohtaxDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:41:44.751594Z","bundle_sha256":"51613021e6bd1c19c5a5a501963d9a9aecb60f3be37a057c84923524c091231a"}}