{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:ND3QQM6EQVPG43TER3HPMYSB5E","short_pith_number":"pith:ND3QQM6E","canonical_record":{"source":{"id":"1404.3250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-12T00:21:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fa2c3ca3968ab7ea33b7b280c4a481845165deeaa9e5d0b051e0ed92a94df181","abstract_canon_sha256":"170ce179bb40001207c44ae5102e82245f3ec17b896b0b549190fe707eda0d8a"},"schema_version":"1.0"},"canonical_sha256":"68f70833c4855e6e6e648ecef66241e926fc3eeb0c8630fc5cc55213db15ee55","source":{"kind":"arxiv","id":"1404.3250","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3250","created_at":"2026-05-18T01:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3250v2","created_at":"2026-05-18T01:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3250","created_at":"2026-05-18T01:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"ND3QQM6EQVPG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ND3QQM6EQVPG43TE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ND3QQM6E","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:ND3QQM6EQVPG43TER3HPMYSB5E","target":"record","payload":{"canonical_record":{"source":{"id":"1404.3250","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-12T00:21:19Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"fa2c3ca3968ab7ea33b7b280c4a481845165deeaa9e5d0b051e0ed92a94df181","abstract_canon_sha256":"170ce179bb40001207c44ae5102e82245f3ec17b896b0b549190fe707eda0d8a"},"schema_version":"1.0"},"canonical_sha256":"68f70833c4855e6e6e648ecef66241e926fc3eeb0c8630fc5cc55213db15ee55","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:08:44.942370Z","signature_b64":"cYQTlH3VtuK6zm7/uSQ3QPWcUUgGNL1HRPeIwzx2nbjijsUQ+GpgQatozUn1SA3tXjoFfxgIBOo25HH6IsXEDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68f70833c4855e6e6e648ecef66241e926fc3eeb0c8630fc5cc55213db15ee55","last_reissued_at":"2026-05-18T01:08:44.941904Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:08:44.941904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.3250","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-18T01:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"435L7aZKBKqmn7zm4RoFimcokWty3yQJfp/YKmrWwLozev5BWVu/HZMJJIhmQ52+lISQAJn03GgezOkAhC0BBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:11:21.091374Z"},"content_sha256":"2921cf748e65df2f43fbed07af53d7eb0975cd454fbc10cefeeb104b3fe36c90","schema_version":"1.0","event_id":"sha256:2921cf748e65df2f43fbed07af53d7eb0975cd454fbc10cefeeb104b3fe36c90"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:ND3QQM6EQVPG43TER3HPMYSB5E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the rank of random matrices over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Alex Grant, Daniel Salmond, Ian Grivell, Terence Chan","submitted_at":"2014-04-12T00:21:19Z","abstract_excerpt":"A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly over the field. The main ingredient is a result showing that constraining additional elements to be zero cannot result in a higher probability of full rank. The bound then follows by \"zeroing\" elements to produce a block-diagonal matrix, whose full rank probability can be computed exactly. The bound is shown to be at least as tight and can be strictly tighter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3250","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-18T01:08:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBuAdcBo4dxljLp0L6CepEhZeiixApcJvyzhQ4Njtd+vWlqXyMUSK+kowjEchfU7OEyKAR+qkGRCTvTKbDm+Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T19:11:21.091726Z"},"content_sha256":"d7e117957bb33a65a02a2a711e26fe7eab39166d445b75cf612447ad6d0862af","schema_version":"1.0","event_id":"sha256:d7e117957bb33a65a02a2a711e26fe7eab39166d445b75cf612447ad6d0862af"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ND3QQM6EQVPG43TER3HPMYSB5E/bundle.json","state_url":"https://pith.science/pith/ND3QQM6EQVPG43TER3HPMYSB5E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ND3QQM6EQVPG43TER3HPMYSB5E/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-02T19:11:21Z","links":{"resolver":"https://pith.science/pith/ND3QQM6EQVPG43TER3HPMYSB5E","bundle":"https://pith.science/pith/ND3QQM6EQVPG43TER3HPMYSB5E/bundle.json","state":"https://pith.science/pith/ND3QQM6EQVPG43TER3HPMYSB5E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ND3QQM6EQVPG43TER3HPMYSB5E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:ND3QQM6EQVPG43TER3HPMYSB5E","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":"170ce179bb40001207c44ae5102e82245f3ec17b896b0b549190fe707eda0d8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-12T00:21:19Z","title_canon_sha256":"fa2c3ca3968ab7ea33b7b280c4a481845165deeaa9e5d0b051e0ed92a94df181"},"schema_version":"1.0","source":{"id":"1404.3250","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.3250","created_at":"2026-05-18T01:08:44Z"},{"alias_kind":"arxiv_version","alias_value":"1404.3250v2","created_at":"2026-05-18T01:08:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.3250","created_at":"2026-05-18T01:08:44Z"},{"alias_kind":"pith_short_12","alias_value":"ND3QQM6EQVPG","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"ND3QQM6EQVPG43TE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"ND3QQM6E","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:d7e117957bb33a65a02a2a711e26fe7eab39166d445b75cf612447ad6d0862af","target":"graph","created_at":"2026-05-18T01:08:44Z","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":"A novel lower bound is introduced for the full rank probability of random finite field matrices, where a number of elements with known location are identically zero, and remaining elements are chosen independently of each other, uniformly over the field. The main ingredient is a result showing that constraining additional elements to be zero cannot result in a higher probability of full rank. The bound then follows by \"zeroing\" elements to produce a block-diagonal matrix, whose full rank probability can be computed exactly. The bound is shown to be at least as tight and can be strictly tighter","authors_text":"Alex Grant, Daniel Salmond, Ian Grivell, Terence Chan","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-12T00:21:19Z","title":"On the rank of random matrices over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.3250","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:2921cf748e65df2f43fbed07af53d7eb0975cd454fbc10cefeeb104b3fe36c90","target":"record","created_at":"2026-05-18T01:08:44Z","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":"170ce179bb40001207c44ae5102e82245f3ec17b896b0b549190fe707eda0d8a","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2014-04-12T00:21:19Z","title_canon_sha256":"fa2c3ca3968ab7ea33b7b280c4a481845165deeaa9e5d0b051e0ed92a94df181"},"schema_version":"1.0","source":{"id":"1404.3250","kind":"arxiv","version":2}},"canonical_sha256":"68f70833c4855e6e6e648ecef66241e926fc3eeb0c8630fc5cc55213db15ee55","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"68f70833c4855e6e6e648ecef66241e926fc3eeb0c8630fc5cc55213db15ee55","first_computed_at":"2026-05-18T01:08:44.941904Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:08:44.941904Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cYQTlH3VtuK6zm7/uSQ3QPWcUUgGNL1HRPeIwzx2nbjijsUQ+GpgQatozUn1SA3tXjoFfxgIBOo25HH6IsXEDg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:08:44.942370Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.3250","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2921cf748e65df2f43fbed07af53d7eb0975cd454fbc10cefeeb104b3fe36c90","sha256:d7e117957bb33a65a02a2a711e26fe7eab39166d445b75cf612447ad6d0862af"],"state_sha256":"8b24302f99e84e941e54322ceda171d7d98dd137aa8d5664a006ca6b8572e560"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+K1CFYL5gutD9k+fk0Pe/eqEWfkWSLDeZDk+Y+basc58CMoem4tL5swf6ZSMHzL8TDSJLgBQJ/wMZXyrpk6ZDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T19:11:21.093786Z","bundle_sha256":"63a2f5dafb10e72bacc490f00fe686b3cf0a712f4e82c8019d1c7f03d5a0481c"}}