{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FY44DMXAQKKLUYY65IMOZAXVFO","short_pith_number":"pith:FY44DMXA","schema_version":"1.0","canonical_sha256":"2e39c1b2e08294ba631eea18ec82f52b9ff5529af07ff669a4fff141de547ac0","source":{"kind":"arxiv","id":"1602.02049","version":1},"attestation_state":"computed","paper":{"title":"A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"George Labahn, Wei Zhou","submitted_at":"2016-02-05T14:59:34Z","abstract_excerpt":"Given a square, nonsingular matrix of univariate polynomials $\\mathbf{F} \\in \\mathbb{K}[x]^{n \\times n}$ over a field $\\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\\mathbf{F}$ with complexity $O^{\\sim}\\left(n^{\\omega}d\\right)$ where $d$ is the degree of $\\mathbf{F}$. Here soft-$O$ notation is Big-$O$ with log factors removed and $\\omega$ is the exponent of matrix multiplication. The method relies of a fast algorithm for determining the diagonal entries of its Hermite normal form, having as cost $O^{\\sim}\\left(n^{\\omega}s\\right)$ operations with $"},"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":"1602.02049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2016-02-05T14:59:34Z","cross_cats_sorted":[],"title_canon_sha256":"a9f642a298d98a3246e76f450d03d59edc82e12daa54f470adb28c3bc3aa6383","abstract_canon_sha256":"b352027b6fbaf1b891b74fdeafe395bb1742132f899b77892ceb1228ad143fc1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:21:14.666391Z","signature_b64":"OZkbi8bZ8TwdumEX63qqRb+KBBnhit3k1UR3JEmsp0J2RSB2IvHlxRdlzjLz9gKHwG7hw3F1jJ3bp215aEr4BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e39c1b2e08294ba631eea18ec82f52b9ff5529af07ff669a4fff141de547ac0","last_reissued_at":"2026-05-18T01:21:14.665655Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:21:14.665655Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast, deterministic algorithm for computing a Hermite Normal Form of a polynomial matrix","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"George Labahn, Wei Zhou","submitted_at":"2016-02-05T14:59:34Z","abstract_excerpt":"Given a square, nonsingular matrix of univariate polynomials $\\mathbf{F} \\in \\mathbb{K}[x]^{n \\times n}$ over a field $\\mathbb{K}$, we give a fast, deterministic algorithm for finding the Hermite normal form of $\\mathbf{F}$ with complexity $O^{\\sim}\\left(n^{\\omega}d\\right)$ where $d$ is the degree of $\\mathbf{F}$. Here soft-$O$ notation is Big-$O$ with log factors removed and $\\omega$ is the exponent of matrix multiplication. The method relies of a fast algorithm for determining the diagonal entries of its Hermite normal form, having as cost $O^{\\sim}\\left(n^{\\omega}s\\right)$ operations with $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.02049","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1602.02049","created_at":"2026-05-18T01:21:14.665772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.02049v1","created_at":"2026-05-18T01:21:14.665772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.02049","created_at":"2026-05-18T01:21:14.665772+00:00"},{"alias_kind":"pith_short_12","alias_value":"FY44DMXAQKKL","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FY44DMXAQKKLUYY6","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FY44DMXA","created_at":"2026-05-18T12:30:15.759754+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/FY44DMXAQKKLUYY65IMOZAXVFO","json":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO.json","graph_json":"https://pith.science/api/pith-number/FY44DMXAQKKLUYY65IMOZAXVFO/graph.json","events_json":"https://pith.science/api/pith-number/FY44DMXAQKKLUYY65IMOZAXVFO/events.json","paper":"https://pith.science/paper/FY44DMXA"},"agent_actions":{"view_html":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO","download_json":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO.json","view_paper":"https://pith.science/paper/FY44DMXA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.02049&json=true","fetch_graph":"https://pith.science/api/pith-number/FY44DMXAQKKLUYY65IMOZAXVFO/graph.json","fetch_events":"https://pith.science/api/pith-number/FY44DMXAQKKLUYY65IMOZAXVFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO/action/storage_attestation","attest_author":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO/action/author_attestation","sign_citation":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO/action/citation_signature","submit_replication":"https://pith.science/pith/FY44DMXAQKKLUYY65IMOZAXVFO/action/replication_record"}},"created_at":"2026-05-18T01:21:14.665772+00:00","updated_at":"2026-05-18T01:21:14.665772+00:00"}