{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OQ7GIFU7VVVY7HJBFCUYN5PAIR","short_pith_number":"pith:OQ7GIFU7","schema_version":"1.0","canonical_sha256":"743e64169fad6b8f9d2128a986f5e044755b941a708d6e5282cf411925332ead","source":{"kind":"arxiv","id":"1712.04177","version":2},"attestation_state":"computed","paper":{"title":"Block-Krylov techniques in the context of sparse-FGLM algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Eric Schost, Hamid Rahkooy, Seung Gyu Hyun, Vincent Neiger","submitted_at":"2017-12-12T08:56:20Z","abstract_excerpt":"Consider a zero-dimensional ideal $I$ in $\\mathbb{K}[X_1,\\dots,X_n]$. Inspired by Faug\\`ere and Mou's Sparse FGLM algorithm, we use Krylov sequences based on multiplication matrices of $I$ in order to compute a description of its zero set by means of univariate polynomials.\n  Steel recently showed how to use Coppersmith's block-Wiedemann algorithm in this context; he describes an algorithm that can be easily parallelized, but only computes parts of the output in this manner. Using generating series expressions going back to work of Bostan, Salvy, and Schost, we show how to compute the entire 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":"1712.04177","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SC","submitted_at":"2017-12-12T08:56:20Z","cross_cats_sorted":[],"title_canon_sha256":"94a2bb444d1b511309a0edf839f3e016287fa8398ffac94c2787fa960b7e4157","abstract_canon_sha256":"e9e737809bafa7d40c692832e5a80d76f6a07a726aee05fc6c001b480d93b116"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:25.208972Z","signature_b64":"9mWg+FI2jCvuGNp3YrmZUiZa+MBqwfzIYnwr71ouZIPDrvi1eYaOCk3/17G6EcXMxPQwKdsw8halr+az/FuLDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"743e64169fad6b8f9d2128a986f5e044755b941a708d6e5282cf411925332ead","last_reissued_at":"2026-05-17T23:56:25.208549Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:25.208549Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Block-Krylov techniques in the context of sparse-FGLM algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.SC","authors_text":"Eric Schost, Hamid Rahkooy, Seung Gyu Hyun, Vincent Neiger","submitted_at":"2017-12-12T08:56:20Z","abstract_excerpt":"Consider a zero-dimensional ideal $I$ in $\\mathbb{K}[X_1,\\dots,X_n]$. Inspired by Faug\\`ere and Mou's Sparse FGLM algorithm, we use Krylov sequences based on multiplication matrices of $I$ in order to compute a description of its zero set by means of univariate polynomials.\n  Steel recently showed how to use Coppersmith's block-Wiedemann algorithm in this context; he describes an algorithm that can be easily parallelized, but only computes parts of the output in this manner. Using generating series expressions going back to work of Bostan, Salvy, and Schost, we show how to compute the entire o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04177","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":"1712.04177","created_at":"2026-05-17T23:56:25.208623+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04177v2","created_at":"2026-05-17T23:56:25.208623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04177","created_at":"2026-05-17T23:56:25.208623+00:00"},{"alias_kind":"pith_short_12","alias_value":"OQ7GIFU7VVVY","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OQ7GIFU7VVVY7HJB","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OQ7GIFU7","created_at":"2026-05-18T12:31:34.259226+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/OQ7GIFU7VVVY7HJBFCUYN5PAIR","json":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR.json","graph_json":"https://pith.science/api/pith-number/OQ7GIFU7VVVY7HJBFCUYN5PAIR/graph.json","events_json":"https://pith.science/api/pith-number/OQ7GIFU7VVVY7HJBFCUYN5PAIR/events.json","paper":"https://pith.science/paper/OQ7GIFU7"},"agent_actions":{"view_html":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR","download_json":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR.json","view_paper":"https://pith.science/paper/OQ7GIFU7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04177&json=true","fetch_graph":"https://pith.science/api/pith-number/OQ7GIFU7VVVY7HJBFCUYN5PAIR/graph.json","fetch_events":"https://pith.science/api/pith-number/OQ7GIFU7VVVY7HJBFCUYN5PAIR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR/action/storage_attestation","attest_author":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR/action/author_attestation","sign_citation":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR/action/citation_signature","submit_replication":"https://pith.science/pith/OQ7GIFU7VVVY7HJBFCUYN5PAIR/action/replication_record"}},"created_at":"2026-05-17T23:56:25.208623+00:00","updated_at":"2026-05-17T23:56:25.208623+00:00"}