{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:6FDUIBVD6RM2G66HJY3RJHOZTA","short_pith_number":"pith:6FDUIBVD","schema_version":"1.0","canonical_sha256":"f1474406a3f459a37bc74e37149dd9981d8a6baae56ad3743567f44c191b4a4e","source":{"kind":"arxiv","id":"1409.5462","version":1},"attestation_state":"computed","paper":{"title":"Fast and deterministic computation of the determinant 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":"2014-09-18T20:55:37Z","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 deterministic algorithm for finding the determinant of $\\mathbf{F}$. The complexity of the algorithm is $\\bigO \\left(n^{\\omega}s\\right)$ field operations where $s$ is the average column degree or the average row degree of $\\mathbf{F}$. Here $\\bigO$ notation is Big-$O$ with log factors omitted and $\\omega$ is the exponent of matrix multiplication."},"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":"1409.5462","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2014-09-18T20:55:37Z","cross_cats_sorted":[],"title_canon_sha256":"8281c4385e8788f3934b8a2c095c60358690c8041b26824af7def53136a4187a","abstract_canon_sha256":"58f7b85d1619e33fb1a39fdd407d1f532f0d369ef16c7eabb6ad00d868552381"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:27.538559Z","signature_b64":"XEgZnwFHSJgmOI80MKQWKPFF8OHAMNACvgjcaaY59mU9ekyGjQqCGO4zbtrB47Ewl9jQ09kTR0K2Au1/1SevCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f1474406a3f459a37bc74e37149dd9981d8a6baae56ad3743567f44c191b4a4e","last_reissued_at":"2026-05-18T02:42:27.537838Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:27.537838Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and deterministic computation of the determinant 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":"2014-09-18T20:55:37Z","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 deterministic algorithm for finding the determinant of $\\mathbf{F}$. The complexity of the algorithm is $\\bigO \\left(n^{\\omega}s\\right)$ field operations where $s$ is the average column degree or the average row degree of $\\mathbf{F}$. Here $\\bigO$ notation is Big-$O$ with log factors omitted and $\\omega$ is the exponent of matrix multiplication."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.5462","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":"1409.5462","created_at":"2026-05-18T02:42:27.537964+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.5462v1","created_at":"2026-05-18T02:42:27.537964+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.5462","created_at":"2026-05-18T02:42:27.537964+00:00"},{"alias_kind":"pith_short_12","alias_value":"6FDUIBVD6RM2","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"6FDUIBVD6RM2G66H","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"6FDUIBVD","created_at":"2026-05-18T12:28:16.859392+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/6FDUIBVD6RM2G66HJY3RJHOZTA","json":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA.json","graph_json":"https://pith.science/api/pith-number/6FDUIBVD6RM2G66HJY3RJHOZTA/graph.json","events_json":"https://pith.science/api/pith-number/6FDUIBVD6RM2G66HJY3RJHOZTA/events.json","paper":"https://pith.science/paper/6FDUIBVD"},"agent_actions":{"view_html":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA","download_json":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA.json","view_paper":"https://pith.science/paper/6FDUIBVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.5462&json=true","fetch_graph":"https://pith.science/api/pith-number/6FDUIBVD6RM2G66HJY3RJHOZTA/graph.json","fetch_events":"https://pith.science/api/pith-number/6FDUIBVD6RM2G66HJY3RJHOZTA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA/action/storage_attestation","attest_author":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA/action/author_attestation","sign_citation":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA/action/citation_signature","submit_replication":"https://pith.science/pith/6FDUIBVD6RM2G66HJY3RJHOZTA/action/replication_record"}},"created_at":"2026-05-18T02:42:27.537964+00:00","updated_at":"2026-05-18T02:42:27.537964+00:00"}