{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:BDQVMCGMYAYMQXXRWOLVCJG5TF","short_pith_number":"pith:BDQVMCGM","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"},"canonical_sha256":"08e15608ccc030c85ef1b3975124dd9965d74cc7dca1d6370fb02e96fedbdd71","source":{"kind":"arxiv","id":"2312.17380","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.17380","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2312.17380v2","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.17380","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"BDQVMCGMYAYM","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"BDQVMCGMYAYMQXXR","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"BDQVMCGM","created_at":"2026-07-05T10:19:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:BDQVMCGMYAYMQXXRWOLVCJG5TF","target":"record","payload":{"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"},"canonical_sha256":"08e15608ccc030c85ef1b3975124dd9965d74cc7dca1d6370fb02e96fedbdd71","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"},"source_kind":"arxiv","source_id":"2312.17380","source_version":2,"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-07-05T10:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OwkNGQSp9oaaWAEl0eU0nq5lMrBOPGdLgQXbk1/khD2s+2TJeQJyGAsZLOQhnuKKSWLwyH3a7jTVhiPIclCqAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:24:40.379015Z"},"content_sha256":"103323614954da74a255d1bae332d47f56978516b587e821c2ee236c192aecd6","schema_version":"1.0","event_id":"sha256:103323614954da74a255d1bae332d47f56978516b587e821c2ee236c192aecd6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:BDQVMCGMYAYMQXXRWOLVCJG5TF","target":"graph","payload":{"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"},"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-07-05T10:19:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rW3Fg+/7MBp6PDrAIKpYCToW/SGKTT+6JuudpDDhCunAqdIMzrJnqizyqdG61A11XL9O9w1mZiQOmjCKBmSIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T08:24:40.379808Z"},"content_sha256":"db6c22f4238fc344ce87eb918dc22fee9fa1b0461673d193b039f459e19be5c1","schema_version":"1.0","event_id":"sha256:db6c22f4238fc344ce87eb918dc22fee9fa1b0461673d193b039f459e19be5c1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/bundle.json","state_url":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/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-08-06T08:24:40Z","links":{"resolver":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF","bundle":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/bundle.json","state":"https://pith.science/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BDQVMCGMYAYMQXXRWOLVCJG5TF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:BDQVMCGMYAYMQXXRWOLVCJG5TF","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":"65562e23e59d4a853bdde3689841e5e1219a0822a5b0cf4ec89427cb6191e863","cross_cats_sorted":["math.AC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SC","submitted_at":"2023-12-28T22:06:11Z","title_canon_sha256":"593255277f3bd8b24eceb152a210473ff10a229737e4bf6b487f08c796fc8af7"},"schema_version":"1.0","source":{"id":"2312.17380","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2312.17380","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"arxiv_version","alias_value":"2312.17380v2","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2312.17380","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"pith_short_12","alias_value":"BDQVMCGMYAYM","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"pith_short_16","alias_value":"BDQVMCGMYAYMQXXR","created_at":"2026-07-05T10:19:21Z"},{"alias_kind":"pith_short_8","alias_value":"BDQVMCGM","created_at":"2026-07-05T10:19:21Z"}],"graph_snapshots":[{"event_id":"sha256:db6c22f4238fc344ce87eb918dc22fee9fa1b0461673d193b039f459e19be5c1","target":"graph","created_at":"2026-07-05T10:19:21Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2312.17380/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Alexander Demin, Joris van der Hoeven","cross_cats":["math.AC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SC","submitted_at":"2023-12-28T22:06:11Z","title":"Factoring sparse polynomials fast"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2312.17380","kind":"arxiv","version":2},"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:103323614954da74a255d1bae332d47f56978516b587e821c2ee236c192aecd6","target":"record","created_at":"2026-07-05T10:19:21Z","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":"65562e23e59d4a853bdde3689841e5e1219a0822a5b0cf4ec89427cb6191e863","cross_cats_sorted":["math.AC"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.SC","submitted_at":"2023-12-28T22:06:11Z","title_canon_sha256":"593255277f3bd8b24eceb152a210473ff10a229737e4bf6b487f08c796fc8af7"},"schema_version":"1.0","source":{"id":"2312.17380","kind":"arxiv","version":2}},"canonical_sha256":"08e15608ccc030c85ef1b3975124dd9965d74cc7dca1d6370fb02e96fedbdd71","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"08e15608ccc030c85ef1b3975124dd9965d74cc7dca1d6370fb02e96fedbdd71","first_computed_at":"2026-07-05T10:19:21.611277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:19:21.611277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"M8xmKEh55zvlrAs3ZhqmtmnB4x8+Hvi/dcAIJ/gtCKIF6eYG22oiwRf6co3BMARBi/qjCQnuijCAT7nR3gE1CQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:19:21.611832Z","signed_message":"canonical_sha256_bytes"},"source_id":"2312.17380","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:103323614954da74a255d1bae332d47f56978516b587e821c2ee236c192aecd6","sha256:db6c22f4238fc344ce87eb918dc22fee9fa1b0461673d193b039f459e19be5c1"],"state_sha256":"ce06d7888c5a46062bf36f2fae0d014dab7097704ad0fddba8a0dfb22b7e0bbf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ye+iJSnm1aRf5S8oUzvmL5Bn4M+Sq6LpX1bIC14LcOUbUWophinj0zf1CpXiUg1Wo4doEp6TYZjT92/SEhfcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T08:24:40.386326Z","bundle_sha256":"06657397955cdf32f9215c7d9a9bf3ddb091e6a1e936b23f2489a233062033e8"}}