{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:3YS2JOK3B3R2YNUA6SSLOQLNOE","short_pith_number":"pith:3YS2JOK3","canonical_record":{"source":{"id":"1201.5365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-01-25T20:32:55Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"0723253cfc5454b9addd7cac8706a3f76bd9820c0f71f9a8368aa77ebb69d4e9","abstract_canon_sha256":"93d98d131d413fee3e58ad851f5ca6721fa0171fa2a5d8741f51b51437f3ac6c"},"schema_version":"1.0"},"canonical_sha256":"de25a4b95b0ee3ac3680f4a4b7416d713a972f4a36c8656f4fb922c93db89000","source":{"kind":"arxiv","id":"1201.5365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5365","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5365v2","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5365","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"3YS2JOK3B3R2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YS2JOK3B3R2YNUA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YS2JOK3","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:3YS2JOK3B3R2YNUA6SSLOQLNOE","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-01-25T20:32:55Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"0723253cfc5454b9addd7cac8706a3f76bd9820c0f71f9a8368aa77ebb69d4e9","abstract_canon_sha256":"93d98d131d413fee3e58ad851f5ca6721fa0171fa2a5d8741f51b51437f3ac6c"},"schema_version":"1.0"},"canonical_sha256":"de25a4b95b0ee3ac3680f4a4b7416d713a972f4a36c8656f4fb922c93db89000","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:46.016617Z","signature_b64":"ga42/3pcxDiPhgXrsQ/r/MqCvLYe7IZ4+wwHxNYtBBJEI3Hz4NA3JcrzjLJ3iGEXSGxi+LQcRQJdN0ZyWecYDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"de25a4b95b0ee3ac3680f4a4b7416d713a972f4a36c8656f4fb922c93db89000","last_reissued_at":"2026-05-18T03:56:46.015945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:46.015945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5365","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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"toduGXGTiUcFD+fZ4TVLqZxJW4GEKNmdh9iww1En1zIlc4TsCJSBPN/hXhwBxy/EwyMjJYpMoHbZJ5r3SR7hCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:46:13.537616Z"},"content_sha256":"58a97ef44eefd7f67d842cc790978b88a62a12c311a40a534dbd1407330df7d6","schema_version":"1.0","event_id":"sha256:58a97ef44eefd7f67d842cc790978b88a62a12c311a40a534dbd1407330df7d6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:3YS2JOK3B3R2YNUA6SSLOQLNOE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Computation of Smith Forms of Sparse Matrices Over Local Rings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.SC","authors_text":"Andy Novocin, B. David Saunders, Mark Giesbrecht, Mustafa Elsheikh","submitted_at":"2012-01-25T20:32:55Z","abstract_excerpt":"We present algorithms to compute the Smith Normal Form of matrices over two families of local rings.\n  The algorithms use the \\emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of tools, such as matrix rank computation over finite fields, for which the best-known time- and memory-efficient algorithms are probabilistic.\n  For an $\\nxn$ matrix $A$ over the ring $\\Fzfe$, where $f^e$ is a power of an irreducible polynomial $f \\in \\Fz$ of degree $d$, our algorithm requires $\\bigO(\\eta de^2n)$ operations in $\\F$, where our black-box is assu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5365","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-18T03:56:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nFaXfM5EYI/Weeaz/T2hsZd7IdPqLB/W5SmpR/d9MgoD4BC0yy9ptN/wF1fkpEMCwVJuHGBQ/Nqq4/TjO176Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T11:46:13.538226Z"},"content_sha256":"3226d398eb573c825be7df9c172f01b3a60bc99551a47388ce402f0a7cd983f7","schema_version":"1.0","event_id":"sha256:3226d398eb573c825be7df9c172f01b3a60bc99551a47388ce402f0a7cd983f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/bundle.json","state_url":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/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-31T11:46:13Z","links":{"resolver":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE","bundle":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/bundle.json","state":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:3YS2JOK3B3R2YNUA6SSLOQLNOE","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":"93d98d131d413fee3e58ad851f5ca6721fa0171fa2a5d8741f51b51437f3ac6c","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-01-25T20:32:55Z","title_canon_sha256":"0723253cfc5454b9addd7cac8706a3f76bd9820c0f71f9a8368aa77ebb69d4e9"},"schema_version":"1.0","source":{"id":"1201.5365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5365","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5365v2","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5365","created_at":"2026-05-18T03:56:46Z"},{"alias_kind":"pith_short_12","alias_value":"3YS2JOK3B3R2","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"3YS2JOK3B3R2YNUA","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"3YS2JOK3","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:3226d398eb573c825be7df9c172f01b3a60bc99551a47388ce402f0a7cd983f7","target":"graph","created_at":"2026-05-18T03:56:46Z","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 present algorithms to compute the Smith Normal Form of matrices over two families of local rings.\n  The algorithms use the \\emph{black-box} model which is suitable for sparse and structured matrices. The algorithms depend on a number of tools, such as matrix rank computation over finite fields, for which the best-known time- and memory-efficient algorithms are probabilistic.\n  For an $\\nxn$ matrix $A$ over the ring $\\Fzfe$, where $f^e$ is a power of an irreducible polynomial $f \\in \\Fz$ of degree $d$, our algorithm requires $\\bigO(\\eta de^2n)$ operations in $\\F$, where our black-box is assu","authors_text":"Andy Novocin, B. David Saunders, Mark Giesbrecht, Mustafa Elsheikh","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-01-25T20:32:55Z","title":"Fast Computation of Smith Forms of Sparse Matrices Over Local Rings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5365","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:58a97ef44eefd7f67d842cc790978b88a62a12c311a40a534dbd1407330df7d6","target":"record","created_at":"2026-05-18T03:56:46Z","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":"93d98d131d413fee3e58ad851f5ca6721fa0171fa2a5d8741f51b51437f3ac6c","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2012-01-25T20:32:55Z","title_canon_sha256":"0723253cfc5454b9addd7cac8706a3f76bd9820c0f71f9a8368aa77ebb69d4e9"},"schema_version":"1.0","source":{"id":"1201.5365","kind":"arxiv","version":2}},"canonical_sha256":"de25a4b95b0ee3ac3680f4a4b7416d713a972f4a36c8656f4fb922c93db89000","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"de25a4b95b0ee3ac3680f4a4b7416d713a972f4a36c8656f4fb922c93db89000","first_computed_at":"2026-05-18T03:56:46.015945Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:46.015945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ga42/3pcxDiPhgXrsQ/r/MqCvLYe7IZ4+wwHxNYtBBJEI3Hz4NA3JcrzjLJ3iGEXSGxi+LQcRQJdN0ZyWecYDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:46.016617Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:58a97ef44eefd7f67d842cc790978b88a62a12c311a40a534dbd1407330df7d6","sha256:3226d398eb573c825be7df9c172f01b3a60bc99551a47388ce402f0a7cd983f7"],"state_sha256":"5cb95a7aff9986475186e250865b470a1135bca618d034eec1cb7dccca89750d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"plmBdMqdJopgxplRxUJATS4mds4Xb7GAAGRguRODs3KQBrLjTvSL3VIcRfHvlllVI7gil9j/0FBRHFYj7+6NDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T11:46:13.541683Z","bundle_sha256":"788d6e7a5954067e60923d2cd9bdda4e808599ea9dbfaa6470b2ff82294164b7"}}