{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U6UZ5WWRUMGD2EJXXNMNP7QLFO","short_pith_number":"pith:U6UZ5WWR","schema_version":"1.0","canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","source":{"kind":"arxiv","id":"1808.06655","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.AC","authors_text":"Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava","submitted_at":"2018-08-20T19:10:39Z","abstract_excerpt":"In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \\in \\mathbb{F}[x_{1},x_{2},\\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by $d$, then $f$ can be deterministically factored in time $s^{\\mathrm{poly}(d) \\log n}$. Prior to our work, the only efficient factoring algorithms known for this class of polynomials were randomized, and other than for the cases of $d=1$ and $d=2$, only exponential time deterministic factoring algorithms were known.\n  A crucial ingredient in our proof is a qua"},"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":"1808.06655","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.AC","submitted_at":"2018-08-20T19:10:39Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"a4836ea715abb3262255f00dcd79e9528894c9e1a29d03ab4fa8777991fd0153","abstract_canon_sha256":"2809601800fd00927407c1d07a8dbf738e2239fd286574e27f652b9c89b4f877"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:39.504066Z","signature_b64":"XoK91LqvKrERPqMpPPMzpwbxjaef+/r8zUHjrABTHjHagR+aHJbP4o4V7G7LQeFMgU9Jvpdjhe3TCwagxv9RCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7a99edad1a30c3d1137bb58d7fe0b2baf4c30f8693682f14d1a96a0c770509b","last_reissued_at":"2026-05-18T00:07:39.503402Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:39.503402Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Factorization of Sparse Polynomials with Bounded Individual Degree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.AC","authors_text":"Ilya Volkovich, Shubhangi Saraf, Vishwas Bhargava","submitted_at":"2018-08-20T19:10:39Z","abstract_excerpt":"In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \\in \\mathbb{F}[x_{1},x_{2},\\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by $d$, then $f$ can be deterministically factored in time $s^{\\mathrm{poly}(d) \\log n}$. Prior to our work, the only efficient factoring algorithms known for this class of polynomials were randomized, and other than for the cases of $d=1$ and $d=2$, only exponential time deterministic factoring algorithms were known.\n  A crucial ingredient in our proof is a qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.06655","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":"1808.06655","created_at":"2026-05-18T00:07:39.503511+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.06655v1","created_at":"2026-05-18T00:07:39.503511+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.06655","created_at":"2026-05-18T00:07:39.503511+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6UZ5WWRUMGD","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6UZ5WWRUMGD2EJX","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6UZ5WWR","created_at":"2026-05-18T12:32:56.356000+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/U6UZ5WWRUMGD2EJXXNMNP7QLFO","json":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO.json","graph_json":"https://pith.science/api/pith-number/U6UZ5WWRUMGD2EJXXNMNP7QLFO/graph.json","events_json":"https://pith.science/api/pith-number/U6UZ5WWRUMGD2EJXXNMNP7QLFO/events.json","paper":"https://pith.science/paper/U6UZ5WWR"},"agent_actions":{"view_html":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO","download_json":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO.json","view_paper":"https://pith.science/paper/U6UZ5WWR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.06655&json=true","fetch_graph":"https://pith.science/api/pith-number/U6UZ5WWRUMGD2EJXXNMNP7QLFO/graph.json","fetch_events":"https://pith.science/api/pith-number/U6UZ5WWRUMGD2EJXXNMNP7QLFO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/action/storage_attestation","attest_author":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/action/author_attestation","sign_citation":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/action/citation_signature","submit_replication":"https://pith.science/pith/U6UZ5WWRUMGD2EJXXNMNP7QLFO/action/replication_record"}},"created_at":"2026-05-18T00:07:39.503511+00:00","updated_at":"2026-05-18T00:07:39.503511+00:00"}