{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QW7ZWUR5BA6S75OHBLGXAPL3YZ","short_pith_number":"pith:QW7ZWUR5","canonical_record":{"source":{"id":"1203.6705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-30T03:15:57Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"01842e120e24f82b408673ea00cc81b3d4c83ad56413c19c2ad5317efa9fd042","abstract_canon_sha256":"09e76394e26f5bdbfe3de2e3cebedaa3bb7d44f00b1f69565e45075e1d2d41e5"},"schema_version":"1.0"},"canonical_sha256":"85bf9b523d083d2ff5c70acd703d7bc64b650168c8ecb50c1396a5601745d66c","source":{"kind":"arxiv","id":"1203.6705","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6705","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6705v2","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6705","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"QW7ZWUR5BA6S","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QW7ZWUR5BA6S75OH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QW7ZWUR5","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QW7ZWUR5BA6S75OHBLGXAPL3YZ","target":"record","payload":{"canonical_record":{"source":{"id":"1203.6705","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-30T03:15:57Z","cross_cats_sorted":["cs.NA","math.NA"],"title_canon_sha256":"01842e120e24f82b408673ea00cc81b3d4c83ad56413c19c2ad5317efa9fd042","abstract_canon_sha256":"09e76394e26f5bdbfe3de2e3cebedaa3bb7d44f00b1f69565e45075e1d2d41e5"},"schema_version":"1.0"},"canonical_sha256":"85bf9b523d083d2ff5c70acd703d7bc64b650168c8ecb50c1396a5601745d66c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.745519Z","signature_b64":"zSFlYcxvb8pHTtbG8iF1toJSjJ3Gy9pOk5XuK2fqCfYkxsC4L5SrTTj24X1oQuu75Dbqcbeh3uqzWuQjlfN4Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85bf9b523d083d2ff5c70acd703d7bc64b650168c8ecb50c1396a5601745d66c","last_reissued_at":"2026-05-18T02:21:16.744883Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.744883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.6705","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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ClYjVF9WmNuIIJ68wvBD8J07y2Pmq7g332zw82my0ADiHjHVhUkvHhoDBmc6X/zINvtg6nuaRjK+MeOlwh1mDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:21:02.210807Z"},"content_sha256":"4a6fdc44ca24b754724f73a133f0ea7a012094c2f83ceddb4b840391afcba2e4","schema_version":"1.0","event_id":"sha256:4a6fdc44ca24b754724f73a133f0ea7a012094c2f83ceddb4b840391afcba2e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QW7ZWUR5BA6S75OHBLGXAPL3YZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Matrix Rank Algorithms and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA"],"primary_cat":"cs.DS","authors_text":"Ho Yee Cheung, Lap Chi Lau, Tsz Chiu Kwok","submitted_at":"2012-03-30T03:15:57Z","abstract_excerpt":"We consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in \\~O(|A| + r^\\omega) field operations, where |A| denotes the number of nonzero entries in A and \\omega < 2.38 is the matrix multiplication exponent. Previously the best known algorithm to find a set of r linearly independent columns is by Gaussian elimination, with running time O(mnr^{\\omega-2}). Our algorithm is faster when r < max(m,n), for instance when the matrix is rectangular. We also consider the problem of computi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6705","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-18T02:21:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gdECkap1enqTZi/JKpWAD7y7M0k+CJlsVqkitx4y9TrSmEj5dCZTgB0c6y/BFPgaX9NqCJT0MAgRLZOJouh5DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T06:21:02.211160Z"},"content_sha256":"bdb3deb745d8a51d2d1d7d758d63a95b0101163fb55aef48bc0dd1b5468ff101","schema_version":"1.0","event_id":"sha256:bdb3deb745d8a51d2d1d7d758d63a95b0101163fb55aef48bc0dd1b5468ff101"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ/bundle.json","state_url":"https://pith.science/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ/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-05T06:21:02Z","links":{"resolver":"https://pith.science/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ","bundle":"https://pith.science/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ/bundle.json","state":"https://pith.science/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QW7ZWUR5BA6S75OHBLGXAPL3YZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QW7ZWUR5BA6S75OHBLGXAPL3YZ","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":"09e76394e26f5bdbfe3de2e3cebedaa3bb7d44f00b1f69565e45075e1d2d41e5","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-30T03:15:57Z","title_canon_sha256":"01842e120e24f82b408673ea00cc81b3d4c83ad56413c19c2ad5317efa9fd042"},"schema_version":"1.0","source":{"id":"1203.6705","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.6705","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"arxiv_version","alias_value":"1203.6705v2","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.6705","created_at":"2026-05-18T02:21:16Z"},{"alias_kind":"pith_short_12","alias_value":"QW7ZWUR5BA6S","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"QW7ZWUR5BA6S75OH","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"QW7ZWUR5","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:bdb3deb745d8a51d2d1d7d758d63a95b0101163fb55aef48bc0dd1b5468ff101","target":"graph","created_at":"2026-05-18T02:21:16Z","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 consider the problem of computing the rank of an m x n matrix A over a field. We present a randomized algorithm to find a set of r = rank(A) linearly independent columns in \\~O(|A| + r^\\omega) field operations, where |A| denotes the number of nonzero entries in A and \\omega < 2.38 is the matrix multiplication exponent. Previously the best known algorithm to find a set of r linearly independent columns is by Gaussian elimination, with running time O(mnr^{\\omega-2}). Our algorithm is faster when r < max(m,n), for instance when the matrix is rectangular. We also consider the problem of computi","authors_text":"Ho Yee Cheung, Lap Chi Lau, Tsz Chiu Kwok","cross_cats":["cs.NA","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-30T03:15:57Z","title":"Fast Matrix Rank Algorithms and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.6705","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:4a6fdc44ca24b754724f73a133f0ea7a012094c2f83ceddb4b840391afcba2e4","target":"record","created_at":"2026-05-18T02:21:16Z","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":"09e76394e26f5bdbfe3de2e3cebedaa3bb7d44f00b1f69565e45075e1d2d41e5","cross_cats_sorted":["cs.NA","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-03-30T03:15:57Z","title_canon_sha256":"01842e120e24f82b408673ea00cc81b3d4c83ad56413c19c2ad5317efa9fd042"},"schema_version":"1.0","source":{"id":"1203.6705","kind":"arxiv","version":2}},"canonical_sha256":"85bf9b523d083d2ff5c70acd703d7bc64b650168c8ecb50c1396a5601745d66c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85bf9b523d083d2ff5c70acd703d7bc64b650168c8ecb50c1396a5601745d66c","first_computed_at":"2026-05-18T02:21:16.744883Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:21:16.744883Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zSFlYcxvb8pHTtbG8iF1toJSjJ3Gy9pOk5XuK2fqCfYkxsC4L5SrTTj24X1oQuu75Dbqcbeh3uqzWuQjlfN4Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:21:16.745519Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.6705","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a6fdc44ca24b754724f73a133f0ea7a012094c2f83ceddb4b840391afcba2e4","sha256:bdb3deb745d8a51d2d1d7d758d63a95b0101163fb55aef48bc0dd1b5468ff101"],"state_sha256":"56e651f2e896f282192f0315b0b773ebecb40206c5808d29b3089047336e1a37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wBcXemGaEDg1d59Hf4XVMfHiznYgrz3i6qnPiHSvoJf5n8zLhUZbTTeHLbSNN9UdWIUTllVNo7xLT1pSpimKAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T06:21:02.213152Z","bundle_sha256":"38fd96e96a08d2250bae75d1597674871da9ee39f01b8a3b6757392a9d347984"}}