{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4KPO2DASMMZ4Y5I2TDB7P2FFP3","short_pith_number":"pith:4KPO2DAS","canonical_record":{"source":{"id":"1111.6549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-11-28T18:55:12Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"86671b9971305ff98781f672d177a3c3a6e8b1752ead5be4eb756a2141c56cbe","abstract_canon_sha256":"e3b85f67d7c59b2c16a4bbf0bb66910903d1e000a08912c691fc02c1652b1b4e"},"schema_version":"1.0"},"canonical_sha256":"e29eed0c126333cc751a98c3f7e8a57efa406cc0e7bb0d2023057cdc75d30ff1","source":{"kind":"arxiv","id":"1111.6549","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6549","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6549v1","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6549","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"pith_short_12","alias_value":"4KPO2DASMMZ4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4KPO2DASMMZ4Y5I2","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4KPO2DAS","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4KPO2DASMMZ4Y5I2TDB7P2FFP3","target":"record","payload":{"canonical_record":{"source":{"id":"1111.6549","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-11-28T18:55:12Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"86671b9971305ff98781f672d177a3c3a6e8b1752ead5be4eb756a2141c56cbe","abstract_canon_sha256":"e3b85f67d7c59b2c16a4bbf0bb66910903d1e000a08912c691fc02c1652b1b4e"},"schema_version":"1.0"},"canonical_sha256":"e29eed0c126333cc751a98c3f7e8a57efa406cc0e7bb0d2023057cdc75d30ff1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:29.664624Z","signature_b64":"pTIlDiFBynCF+q4WZ5LlamhpS/cpT/urjaGvFAod8HY79V4FtiM42WN/5VPxiK2tbrUE2R9GXC4i27q3ixX5BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e29eed0c126333cc751a98c3f7e8a57efa406cc0e7bb0d2023057cdc75d30ff1","last_reissued_at":"2026-05-18T04:07:29.663950Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:29.663950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.6549","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-18T04:07:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxxLj0hXfJcd3NN3rliO6EvmUiZZHgmlUGPKOtGOmbiTxGjIyzaQksVLF4965Eni4d+byzw79vcw0DhLS5hWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:57:37.207083Z"},"content_sha256":"cf0f188209efa8e28a60e2c4cf387e793a90b66fb4029f3c5438d00479b12cd8","schema_version":"1.0","event_id":"sha256:cf0f188209efa8e28a60e2c4cf387e793a90b66fb4029f3c5438d00479b12cd8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4KPO2DASMMZ4Y5I2TDB7P2FFP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Dense Gaussian Elimination over the Finite Field with Two Elements","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.MS","authors_text":"Cl\\'ement Pernet, Gregory V. Bard, Martin R. Albrecht","submitted_at":"2011-11-28T18:55:12Z","abstract_excerpt":"In this work we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements. We discuss both well-known and new algorithms as well as our implementations in the M4RI library, which has been adopted into Sage. The focus of our discussion is a block iterative algorithm for PLE decomposition which is inspired by the M4RI algorithm. The implementation presented in this work provides considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6549","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-18T04:07:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hbnNI8Z5zOtulfEHbuxrgpGdmBuz8ituRGUcYOEtMQhAViqHQ3Z8I4zB6vnPHTNxuISmPOvX9tXpGM2hn8YDBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T15:57:37.207813Z"},"content_sha256":"30da6aa1ccccf6516584b09deba4c76c534d0b89190d469b365c3403e00ef92e","schema_version":"1.0","event_id":"sha256:30da6aa1ccccf6516584b09deba4c76c534d0b89190d469b365c3403e00ef92e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3/bundle.json","state_url":"https://pith.science/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3/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-08T15:57:37Z","links":{"resolver":"https://pith.science/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3","bundle":"https://pith.science/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3/bundle.json","state":"https://pith.science/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4KPO2DASMMZ4Y5I2TDB7P2FFP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4KPO2DASMMZ4Y5I2TDB7P2FFP3","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":"e3b85f67d7c59b2c16a4bbf0bb66910903d1e000a08912c691fc02c1652b1b4e","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-11-28T18:55:12Z","title_canon_sha256":"86671b9971305ff98781f672d177a3c3a6e8b1752ead5be4eb756a2141c56cbe"},"schema_version":"1.0","source":{"id":"1111.6549","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.6549","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"arxiv_version","alias_value":"1111.6549v1","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.6549","created_at":"2026-05-18T04:07:29Z"},{"alias_kind":"pith_short_12","alias_value":"4KPO2DASMMZ4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4KPO2DASMMZ4Y5I2","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4KPO2DAS","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:30da6aa1ccccf6516584b09deba4c76c534d0b89190d469b365c3403e00ef92e","target":"graph","created_at":"2026-05-18T04:07: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 we describe an efficient implementation of a hierarchy of algorithms for Gaussian elimination upon dense matrices over the field with two elements. We discuss both well-known and new algorithms as well as our implementations in the M4RI library, which has been adopted into Sage. The focus of our discussion is a block iterative algorithm for PLE decomposition which is inspired by the M4RI algorithm. The implementation presented in this work provides considerable performance gains in practice when compared to the previously fastest implementation. We provide performance figures on x","authors_text":"Cl\\'ement Pernet, Gregory V. Bard, Martin R. Albrecht","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-11-28T18:55:12Z","title":"Efficient Dense Gaussian Elimination over the Finite Field with Two Elements"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.6549","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:cf0f188209efa8e28a60e2c4cf387e793a90b66fb4029f3c5438d00479b12cd8","target":"record","created_at":"2026-05-18T04:07: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":"e3b85f67d7c59b2c16a4bbf0bb66910903d1e000a08912c691fc02c1652b1b4e","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.MS","submitted_at":"2011-11-28T18:55:12Z","title_canon_sha256":"86671b9971305ff98781f672d177a3c3a6e8b1752ead5be4eb756a2141c56cbe"},"schema_version":"1.0","source":{"id":"1111.6549","kind":"arxiv","version":1}},"canonical_sha256":"e29eed0c126333cc751a98c3f7e8a57efa406cc0e7bb0d2023057cdc75d30ff1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e29eed0c126333cc751a98c3f7e8a57efa406cc0e7bb0d2023057cdc75d30ff1","first_computed_at":"2026-05-18T04:07:29.663950Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:29.663950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pTIlDiFBynCF+q4WZ5LlamhpS/cpT/urjaGvFAod8HY79V4FtiM42WN/5VPxiK2tbrUE2R9GXC4i27q3ixX5BA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:29.664624Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.6549","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf0f188209efa8e28a60e2c4cf387e793a90b66fb4029f3c5438d00479b12cd8","sha256:30da6aa1ccccf6516584b09deba4c76c534d0b89190d469b365c3403e00ef92e"],"state_sha256":"5784661fde7ace955b7c7d218c848c2669ad30956f3c45c6e1926e299bee0be8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TkGrX/NyZaU/x3keq4D/4ZCjseABSYf3C3ofbVbl3y3uegmR4fLW9lbCv/zAu6hCCTam2EoPvJwfPQEPdldBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T15:57:37.211465Z","bundle_sha256":"39e798844697f33d4611c605c33f8ebb82073b8b84da05be9c6459ae7205192a"}}