{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:NIQUCT4ISR4DLLTFVID4GEAFEW","short_pith_number":"pith:NIQUCT4I","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"},"canonical_sha256":"6a21414f88947835ae65aa07c3100525a57bca25e932058af75453ec7bbd7769","source":{"kind":"arxiv","id":"1705.10649","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10649","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10649v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10649","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"NIQUCT4ISR4D","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NIQUCT4ISR4DLLTF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NIQUCT4I","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:NIQUCT4ISR4DLLTFVID4GEAFEW","target":"record","payload":{"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"},"canonical_sha256":"6a21414f88947835ae65aa07c3100525a57bca25e932058af75453ec7bbd7769","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"},"source_kind":"arxiv","source_id":"1705.10649","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4dFpQdRLz2NbuPs5C/w5nYjTeFOH6TC9XYXTNyKb6fkbJyOxW16iFxzkHjL4GHi8hDt6Ta92Jz3sARcG6HwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:40:41.412717Z"},"content_sha256":"86edd56135db99b6253906062ebc73a18efd06cde11e69496aec0e79cdd10f51","schema_version":"1.0","event_id":"sha256:86edd56135db99b6253906062ebc73a18efd06cde11e69496aec0e79cdd10f51"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:NIQUCT4ISR4DLLTFVID4GEAFEW","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:43:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MTgOwp3WacAEvABk8r3RcurSEWKus3jGrVEY1nMcvB2KB6GGf4iUeth9JFYfUm5l5zrGz3bOpr94y4EWBK9JDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:40:41.413064Z"},"content_sha256":"a54962bfe29d4f51c29e93639ddecf5fd04c92279a0d5a7fdacb6d78cc45eafc","schema_version":"1.0","event_id":"sha256:a54962bfe29d4f51c29e93639ddecf5fd04c92279a0d5a7fdacb6d78cc45eafc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/bundle.json","state_url":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T12:40:41Z","links":{"resolver":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW","bundle":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/bundle.json","state":"https://pith.science/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NIQUCT4ISR4DLLTFVID4GEAFEW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:NIQUCT4ISR4DLLTFVID4GEAFEW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"acbc3906664827b087909befa4133afa2689fcfd6db67501bc5dede5a6dfa8cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T13:56:27Z","title_canon_sha256":"a41fe3dd043ee6b1716d2c6a5f3c3ec823b6a91b34fe345b58383b85db3ff5a3"},"schema_version":"1.0","source":{"id":"1705.10649","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.10649","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"arxiv_version","alias_value":"1705.10649v1","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10649","created_at":"2026-05-18T00:43:23Z"},{"alias_kind":"pith_short_12","alias_value":"NIQUCT4ISR4D","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"NIQUCT4ISR4DLLTF","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"NIQUCT4I","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:a54962bfe29d4f51c29e93639ddecf5fd04c92279a0d5a7fdacb6d78cc45eafc","target":"graph","created_at":"2026-05-18T00:43:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Thi Xuan Vu, Vincent Neiger","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T13:56:27Z","title":"Computing Canonical Bases of Modules of Univariate Relations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10649","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:86edd56135db99b6253906062ebc73a18efd06cde11e69496aec0e79cdd10f51","target":"record","created_at":"2026-05-18T00:43:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"acbc3906664827b087909befa4133afa2689fcfd6db67501bc5dede5a6dfa8cc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-05-30T13:56:27Z","title_canon_sha256":"a41fe3dd043ee6b1716d2c6a5f3c3ec823b6a91b34fe345b58383b85db3ff5a3"},"schema_version":"1.0","source":{"id":"1705.10649","kind":"arxiv","version":1}},"canonical_sha256":"6a21414f88947835ae65aa07c3100525a57bca25e932058af75453ec7bbd7769","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a21414f88947835ae65aa07c3100525a57bca25e932058af75453ec7bbd7769","first_computed_at":"2026-05-18T00:43:23.920901Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:23.920901Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tSKt0XBTwKGuhBRZQgrQpM+x35yjyHvSfPXU5J4OkR5XdhySiAmOl5FxWBjYnf4ecTA1s9DiPrpW110XMq/oAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:23.921512Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.10649","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86edd56135db99b6253906062ebc73a18efd06cde11e69496aec0e79cdd10f51","sha256:a54962bfe29d4f51c29e93639ddecf5fd04c92279a0d5a7fdacb6d78cc45eafc"],"state_sha256":"51f9e7bee121a879c42d0a34842d1e23b9702f83c81928c2009bc9fced777ba9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3lKNWHH8E56Rk0rDPSdBLuhqVTUzB+fWcVIEOVxMKVTSt6asFyvcwQRp9Ql83mSWJAeh1P9TSfSW/aNLtYvDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:40:41.415007Z","bundle_sha256":"ebe515dcd505c652c2aac2f74fb164b7d63856b4b8669f2f9c14f2f5938375a1"}}