{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:NIQUCT4ISR4DLLTFVID4GEAFEW","short_pith_number":"pith:NIQUCT4I","schema_version":"1.0","canonical_sha256":"6a21414f88947835ae65aa07c3100525a57bca25e932058af75453ec7bbd7769","source":{"kind":"arxiv","id":"1705.10649","version":1},"attestation_state":"computed","paper":{"title":"Computing Canonical Bases of Modules of Univariate Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Thi Xuan Vu, Vincent Neiger","submitted_at":"2017-05-30T13:56:27Z","abstract_excerpt":"We study the computation of canonical bases of sets of univariate relations $(p_1,\\ldots,p_m) \\in \\mathbb{K}[x]^{m}$ such that $p_1 f_1 + \\cdots + p_m f_m = 0$; here, the input elements $f_1,\\ldots,f_m$ are from a quotient $\\mathbb{K}[x]^n/\\mathcal{M}$, where $\\mathcal{M}$ is a $\\mathbb{K}[x]$-module of rank $n$ given by a basis $\\mathbf{M}\\in\\mathbb{K}[x]^{n\\times n}$ in Hermite form. We exploit the triangular shape of $\\mathbf{M}$ to generalize a divide-and-conquer approach which originates from fast minimal approximant basis algorithms. Besides recent techniques for this approach, we rely o"},"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":"1705.10649","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T13:56:27Z","cross_cats_sorted":[],"title_canon_sha256":"a41fe3dd043ee6b1716d2c6a5f3c3ec823b6a91b34fe345b58383b85db3ff5a3","abstract_canon_sha256":"acbc3906664827b087909befa4133afa2689fcfd6db67501bc5dede5a6dfa8cc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:23.921512Z","signature_b64":"tSKt0XBTwKGuhBRZQgrQpM+x35yjyHvSfPXU5J4OkR5XdhySiAmOl5FxWBjYnf4ecTA1s9DiPrpW110XMq/oAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a21414f88947835ae65aa07c3100525a57bca25e932058af75453ec7bbd7769","last_reissued_at":"2026-05-18T00:43:23.920901Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:23.920901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Canonical Bases of Modules of Univariate Relations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Thi Xuan Vu, Vincent Neiger","submitted_at":"2017-05-30T13:56:27Z","abstract_excerpt":"We study the computation of canonical bases of sets of univariate relations $(p_1,\\ldots,p_m) \\in \\mathbb{K}[x]^{m}$ such that $p_1 f_1 + \\cdots + p_m f_m = 0$; here, the input elements $f_1,\\ldots,f_m$ are from a quotient $\\mathbb{K}[x]^n/\\mathcal{M}$, where $\\mathcal{M}$ is a $\\mathbb{K}[x]$-module of rank $n$ given by a basis $\\mathbf{M}\\in\\mathbb{K}[x]^{n\\times n}$ in Hermite form. We exploit the triangular shape of $\\mathbf{M}$ to generalize a divide-and-conquer approach which originates from fast minimal approximant basis algorithms. Besides recent techniques for this approach, we rely o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10649","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":"1705.10649","created_at":"2026-05-18T00:43:23.920991+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10649v1","created_at":"2026-05-18T00:43:23.920991+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10649","created_at":"2026-05-18T00:43:23.920991+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIQUCT4ISR4D","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIQUCT4ISR4DLLTF","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIQUCT4I","created_at":"2026-05-18T12:31:31.346846+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/NIQUCT4ISR4DLLTFVID4GEAFEW","json":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW.json","graph_json":"https://pith.science/api/pith-number/NIQUCT4ISR4DLLTFVID4GEAFEW/graph.json","events_json":"https://pith.science/api/pith-number/NIQUCT4ISR4DLLTFVID4GEAFEW/events.json","paper":"https://pith.science/paper/NIQUCT4I"},"agent_actions":{"view_html":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW","download_json":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW.json","view_paper":"https://pith.science/paper/NIQUCT4I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10649&json=true","fetch_graph":"https://pith.science/api/pith-number/NIQUCT4ISR4DLLTFVID4GEAFEW/graph.json","fetch_events":"https://pith.science/api/pith-number/NIQUCT4ISR4DLLTFVID4GEAFEW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/action/storage_attestation","attest_author":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/action/author_attestation","sign_citation":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/action/citation_signature","submit_replication":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/action/replication_record"}},"created_at":"2026-05-18T00:43:23.920991+00:00","updated_at":"2026-05-18T00:43:23.920991+00:00"}