{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:G2QIEA7ARWDAWVDRSUCC37XPLG","short_pith_number":"pith:G2QIEA7A","schema_version":"1.0","canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","source":{"kind":"arxiv","id":"1603.04813","version":2},"attestation_state":"computed","paper":{"title":"Algorithm for computing $\\mu$-bases of univariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC"],"primary_cat":"math.AG","authors_text":"Hoon Hong, Irina A. Kogan, Zachary Hough","submitted_at":"2016-03-15T18:46:15Z","abstract_excerpt":"We present a new algorithm for computing a $\\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox, Sederberg, Chen, Zheng, and Wang for $n=3$, and by Song and Goldman for an arbitrary $n$. It involves computing a \"partial\" reduced row-echelon form of a $ (2d+1)\\times n(d+1)$ matrix over $\\mathbb{K}$, where $d$ is the maximum degree of the input polynomials. The proof of the algorithm is based on standard linear algebra and is completely self-contained. It i"},"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":"1603.04813","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AG","submitted_at":"2016-03-15T18:46:15Z","cross_cats_sorted":["cs.SC","math.AC"],"title_canon_sha256":"2c9d5aa2b650e3a0993e5c65f0d440441426f548d914bbdeab9f66c9e78ddc13","abstract_canon_sha256":"3219ade6211cf01c950b50c1a112dcd6864f6dca73df065721fa9d81a6ee77cf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:06.847804Z","signature_b64":"zriQn2MKkNvR76E849UY198k5vYnqPb4v7Xkr/fdQ2LnkwfsaZ1jT+nQAxgnXBHbASwJ+Wn+HPJMPDm7IAsXBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a08203e08d860b547195042dfeef5983db57c3bb67b0299cd537e0a9e9e0ae","last_reissued_at":"2026-05-18T00:49:06.847371Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:06.847371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm for computing $\\mu$-bases of univariate polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SC","math.AC"],"primary_cat":"math.AG","authors_text":"Hoon Hong, Irina A. Kogan, Zachary Hough","submitted_at":"2016-03-15T18:46:15Z","abstract_excerpt":"We present a new algorithm for computing a $\\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox, Sederberg, Chen, Zheng, and Wang for $n=3$, and by Song and Goldman for an arbitrary $n$. It involves computing a \"partial\" reduced row-echelon form of a $ (2d+1)\\times n(d+1)$ matrix over $\\mathbb{K}$, where $d$ is the maximum degree of the input polynomials. The proof of the algorithm is based on standard linear algebra and is completely self-contained. It i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.04813","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":"1603.04813","created_at":"2026-05-18T00:49:06.847437+00:00"},{"alias_kind":"arxiv_version","alias_value":"1603.04813v2","created_at":"2026-05-18T00:49:06.847437+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.04813","created_at":"2026-05-18T00:49:06.847437+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2QIEA7ARWDA","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2QIEA7ARWDAWVDR","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2QIEA7A","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/G2QIEA7ARWDAWVDRSUCC37XPLG","json":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG.json","graph_json":"https://pith.science/api/pith-number/G2QIEA7ARWDAWVDRSUCC37XPLG/graph.json","events_json":"https://pith.science/api/pith-number/G2QIEA7ARWDAWVDRSUCC37XPLG/events.json","paper":"https://pith.science/paper/G2QIEA7A"},"agent_actions":{"view_html":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG","download_json":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG.json","view_paper":"https://pith.science/paper/G2QIEA7A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1603.04813&json=true","fetch_graph":"https://pith.science/api/pith-number/G2QIEA7ARWDAWVDRSUCC37XPLG/graph.json","fetch_events":"https://pith.science/api/pith-number/G2QIEA7ARWDAWVDRSUCC37XPLG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/action/storage_attestation","attest_author":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/action/author_attestation","sign_citation":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/action/citation_signature","submit_replication":"https://pith.science/pith/G2QIEA7ARWDAWVDRSUCC37XPLG/action/replication_record"}},"created_at":"2026-05-18T00:49:06.847437+00:00","updated_at":"2026-05-18T00:49:06.847437+00:00"}