{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:BDQVMCGMYAYMQXXRWOLVCJG5TF","short_pith_number":"pith:BDQVMCGM","schema_version":"1.0","canonical_sha256":"08e15608ccc030c85ef1b3975124dd9965d74cc7dca1d6370fb02e96fedbdd71","source":{"kind":"arxiv","id":"2312.17380","version":2},"attestation_state":"computed","paper":{"title":"Factoring sparse polynomials fast","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.SC","authors_text":"Alexander Demin, Joris van der Hoeven","submitted_at":"2023-12-28T22:06:11Z","abstract_excerpt":"Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as gcd computation, square-free factorization, content-free factorization, and root extraction). Our methods are all based on sparse interpolation, but follow two main lines of attack: iteration on the number of variables and more direct reductions to the univariate or bivariate case. We present detailed probabilistic complexity bounds in terms of the complexity "},"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":"2312.17380","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SC","submitted_at":"2023-12-28T22:06:11Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"593255277f3bd8b24eceb152a210473ff10a229737e4bf6b487f08c796fc8af7","abstract_canon_sha256":"65562e23e59d4a853bdde3689841e5e1219a0822a5b0cf4ec89427cb6191e863"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:21.611832Z","signature_b64":"M8xmKEh55zvlrAs3ZhqmtmnB4x8+Hvi/dcAIJ/gtCKIF6eYG22oiwRf6co3BMARBi/qjCQnuijCAT7nR3gE1CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"08e15608ccc030c85ef1b3975124dd9965d74cc7dca1d6370fb02e96fedbdd71","last_reissued_at":"2026-07-05T10:19:21.611277Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:21.611277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Factoring sparse polynomials fast","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.SC","authors_text":"Alexander Demin, Joris van der Hoeven","submitted_at":"2023-12-28T22:06:11Z","abstract_excerpt":"Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as gcd computation, square-free factorization, content-free factorization, and root extraction). Our methods are all based on sparse interpolation, but follow two main lines of attack: iteration on the number of variables and more direct reductions to the univariate or bivariate case. We present detailed probabilistic complexity bounds in terms of the complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.17380","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2312.17380/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2312.17380","created_at":"2026-07-05T10:19:21.611347+00:00"},{"alias_kind":"arxiv_version","alias_value":"2312.17380v2","created_at":"2026-07-05T10:19:21.611347+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.17380","created_at":"2026-07-05T10:19:21.611347+00:00"},{"alias_kind":"pith_short_12","alias_value":"BDQVMCGMYAYM","created_at":"2026-07-05T10:19:21.611347+00:00"},{"alias_kind":"pith_short_16","alias_value":"BDQVMCGMYAYMQXXR","created_at":"2026-07-05T10:19:21.611347+00:00"},{"alias_kind":"pith_short_8","alias_value":"BDQVMCGM","created_at":"2026-07-05T10:19:21.611347+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/BDQVMCGMYAYMQXXRWOLVCJG5TF","json":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF.json","graph_json":"https://pith.science/api/pith-number/BDQVMCGMYAYMQXXRWOLVCJG5TF/graph.json","events_json":"https://pith.science/api/pith-number/BDQVMCGMYAYMQXXRWOLVCJG5TF/events.json","paper":"https://pith.science/paper/BDQVMCGM"},"agent_actions":{"view_html":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF","download_json":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF.json","view_paper":"https://pith.science/paper/BDQVMCGM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2312.17380&json=true","fetch_graph":"https://pith.science/api/pith-number/BDQVMCGMYAYMQXXRWOLVCJG5TF/graph.json","fetch_events":"https://pith.science/api/pith-number/BDQVMCGMYAYMQXXRWOLVCJG5TF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/action/storage_attestation","attest_author":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/action/author_attestation","sign_citation":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/action/citation_signature","submit_replication":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/action/replication_record"}},"created_at":"2026-07-05T10:19:21.611347+00:00","updated_at":"2026-07-05T10:19:21.611347+00:00"}