{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:3YS2JOK3B3R2YNUA6SSLOQLNOE","short_pith_number":"pith:3YS2JOK3","schema_version":"1.0","canonical_sha256":"de25a4b95b0ee3ac3680f4a4b7416d713a972f4a36c8656f4fb922c93db89000","source":{"kind":"arxiv","id":"1201.5365","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1201.5365","created_at":"2026-05-18T03:56:46.016050+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.5365v2","created_at":"2026-05-18T03:56:46.016050+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5365","created_at":"2026-05-18T03:56:46.016050+00:00"},{"alias_kind":"pith_short_12","alias_value":"3YS2JOK3B3R2","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"3YS2JOK3B3R2YNUA","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"3YS2JOK3","created_at":"2026-05-18T12:26:53.410803+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE","json":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE.json","graph_json":"https://pith.science/api/pith-number/3YS2JOK3B3R2YNUA6SSLOQLNOE/graph.json","events_json":"https://pith.science/api/pith-number/3YS2JOK3B3R2YNUA6SSLOQLNOE/events.json","paper":"https://pith.science/paper/3YS2JOK3"},"agent_actions":{"view_html":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE","download_json":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE.json","view_paper":"https://pith.science/paper/3YS2JOK3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.5365&json=true","fetch_graph":"https://pith.science/api/pith-number/3YS2JOK3B3R2YNUA6SSLOQLNOE/graph.json","fetch_events":"https://pith.science/api/pith-number/3YS2JOK3B3R2YNUA6SSLOQLNOE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/action/storage_attestation","attest_author":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/action/author_attestation","sign_citation":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/action/citation_signature","submit_replication":"https://pith.science/pith/3YS2JOK3B3R2YNUA6SSLOQLNOE/action/replication_record"}},"created_at":"2026-05-18T03:56:46.016050+00:00","updated_at":"2026-05-18T03:56:46.016050+00:00"}