{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:CGFZBZBQCOOVPTIZT4KTWRSRQT","short_pith_number":"pith:CGFZBZBQ","canonical_record":{"source":{"id":"1406.5826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-23T08:03:23Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"ad943778843e1ecd965003b36308f9123d36426507f25f8ec7692bedf71066e2","abstract_canon_sha256":"efc74bbea9c0ecfdd3d1c7d9096e33db82f207e48d2d129323e0cb3b25fbbebf"},"schema_version":"1.0"},"canonical_sha256":"118b90e430139d57cd199f153b465184cc630f76a7a88978613f0383b5bb0cdf","source":{"kind":"arxiv","id":"1406.5826","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5826","created_at":"2026-05-18T02:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5826v1","created_at":"2026-05-18T02:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5826","created_at":"2026-05-18T02:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"CGFZBZBQCOOV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CGFZBZBQCOOVPTIZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CGFZBZBQ","created_at":"2026-05-18T12:28:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:CGFZBZBQCOOVPTIZT4KTWRSRQT","target":"record","payload":{"canonical_record":{"source":{"id":"1406.5826","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-23T08:03:23Z","cross_cats_sorted":["cs.CC","math.CO"],"title_canon_sha256":"ad943778843e1ecd965003b36308f9123d36426507f25f8ec7692bedf71066e2","abstract_canon_sha256":"efc74bbea9c0ecfdd3d1c7d9096e33db82f207e48d2d129323e0cb3b25fbbebf"},"schema_version":"1.0"},"canonical_sha256":"118b90e430139d57cd199f153b465184cc630f76a7a88978613f0383b5bb0cdf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:04.140208Z","signature_b64":"0gDlxz6mu4wPnKiHn/KTsCOM2ZiyE6QZLWRQf0Xn8Ptx9o47Wj2mp/zK1iQJT77OXTMvTy1jndi+4TOSexaUAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"118b90e430139d57cd199f153b465184cc630f76a7a88978613f0383b5bb0cdf","last_reissued_at":"2026-05-18T02:49:04.139828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:04.139828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.5826","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-18T02:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wdbwd+9QKcjMs6fx4UFbKbHIVRaa1raZkL/05Xt/s8o988nyps8F40La8EiU7FG9vpEvaGcHWpTxcM1Vfe6+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:14:27.672329Z"},"content_sha256":"c0a790b51eb144c9bfe9fdc989d6d7fd26ce2ce48fbc9e150d0ed8a2ff14d216","schema_version":"1.0","event_id":"sha256:c0a790b51eb144c9bfe9fdc989d6d7fd26ce2ce48fbc9e150d0ed8a2ff14d216"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:CGFZBZBQCOOVPTIZT4KTWRSRQT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The asymptotic complexity of matrix reduction over finite fields","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.CO"],"primary_cat":"cs.DS","authors_text":"Demetres Christofides","submitted_at":"2014-06-23T08:03:23Z","abstract_excerpt":"Consider an invertible n \\times n matrix over some field. The Gauss-Jordan elimination reduces this matrix to the identity matrix using at most n^2 row operations and in general that many operations might be needed.\n  In [1] the authors considered matrices in GL(n;q), the set of n \\times n invertible matrices in the finite field of q elements, and provided an algorithm using only row operations which performs asymptotically better than the Gauss-Jordan elimination. More specifically their `striped elimination algorithm' has asymptotic complexity \\frac{n^2}{\\log_q{n}}. Furthermore they proved t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5826","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-18T02:49:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"07Pb95NngEi6LYmwE+zKjI4zvsgPojTR45KTtmeZAHqkj8iuEwTEE2Q6J4gfD3qzLI6e33v2TCoHdLPGxn9UDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:14:27.672988Z"},"content_sha256":"d129bedc10cb3f3c002b3a03d21e6723c9a165a2355c1dd7d44277d4aa46e37a","schema_version":"1.0","event_id":"sha256:d129bedc10cb3f3c002b3a03d21e6723c9a165a2355c1dd7d44277d4aa46e37a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT/bundle.json","state_url":"https://pith.science/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT/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-27T08:14:27Z","links":{"resolver":"https://pith.science/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT","bundle":"https://pith.science/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT/bundle.json","state":"https://pith.science/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CGFZBZBQCOOVPTIZT4KTWRSRQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CGFZBZBQCOOVPTIZT4KTWRSRQT","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":"efc74bbea9c0ecfdd3d1c7d9096e33db82f207e48d2d129323e0cb3b25fbbebf","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-23T08:03:23Z","title_canon_sha256":"ad943778843e1ecd965003b36308f9123d36426507f25f8ec7692bedf71066e2"},"schema_version":"1.0","source":{"id":"1406.5826","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.5826","created_at":"2026-05-18T02:49:04Z"},{"alias_kind":"arxiv_version","alias_value":"1406.5826v1","created_at":"2026-05-18T02:49:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5826","created_at":"2026-05-18T02:49:04Z"},{"alias_kind":"pith_short_12","alias_value":"CGFZBZBQCOOV","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CGFZBZBQCOOVPTIZ","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CGFZBZBQ","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:d129bedc10cb3f3c002b3a03d21e6723c9a165a2355c1dd7d44277d4aa46e37a","target":"graph","created_at":"2026-05-18T02:49:04Z","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":"Consider an invertible n \\times n matrix over some field. The Gauss-Jordan elimination reduces this matrix to the identity matrix using at most n^2 row operations and in general that many operations might be needed.\n  In [1] the authors considered matrices in GL(n;q), the set of n \\times n invertible matrices in the finite field of q elements, and provided an algorithm using only row operations which performs asymptotically better than the Gauss-Jordan elimination. More specifically their `striped elimination algorithm' has asymptotic complexity \\frac{n^2}{\\log_q{n}}. Furthermore they proved t","authors_text":"Demetres Christofides","cross_cats":["cs.CC","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-23T08:03:23Z","title":"The asymptotic complexity of matrix reduction over finite fields"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5826","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:c0a790b51eb144c9bfe9fdc989d6d7fd26ce2ce48fbc9e150d0ed8a2ff14d216","target":"record","created_at":"2026-05-18T02:49:04Z","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":"efc74bbea9c0ecfdd3d1c7d9096e33db82f207e48d2d129323e0cb3b25fbbebf","cross_cats_sorted":["cs.CC","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-23T08:03:23Z","title_canon_sha256":"ad943778843e1ecd965003b36308f9123d36426507f25f8ec7692bedf71066e2"},"schema_version":"1.0","source":{"id":"1406.5826","kind":"arxiv","version":1}},"canonical_sha256":"118b90e430139d57cd199f153b465184cc630f76a7a88978613f0383b5bb0cdf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"118b90e430139d57cd199f153b465184cc630f76a7a88978613f0383b5bb0cdf","first_computed_at":"2026-05-18T02:49:04.139828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:49:04.139828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0gDlxz6mu4wPnKiHn/KTsCOM2ZiyE6QZLWRQf0Xn8Ptx9o47Wj2mp/zK1iQJT77OXTMvTy1jndi+4TOSexaUAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:49:04.140208Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.5826","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c0a790b51eb144c9bfe9fdc989d6d7fd26ce2ce48fbc9e150d0ed8a2ff14d216","sha256:d129bedc10cb3f3c002b3a03d21e6723c9a165a2355c1dd7d44277d4aa46e37a"],"state_sha256":"21807bfbc1669786f4434a7f8f7a51a7e7746f1758608297e465dcadc1afbffd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMX6OunrqFsS86gmnFr6Vzrh9CeFk7rbP2Oa1InquJhJMTN5eydMOBJLj2+1E8EkmT6rvWyqcRh4hKtonY4ACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:14:27.676461Z","bundle_sha256":"b3e5a2b1ecce4e33c44d4517ddb610fab7e3c5f151649508e48b5f3f65f9682e"}}