{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:AB5RKMH3ZAW3TWS5XIU4UMJLNV","short_pith_number":"pith:AB5RKMH3","schema_version":"1.0","canonical_sha256":"007b1530fbc82db9da5dba29ca312b6d7ee265bb2037f19eb9a17030854a5e6f","source":{"kind":"arxiv","id":"2606.27293","version":1},"attestation_state":"computed","paper":{"title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rishabh Kothary, Shanthanu S. Rai, Shubhangi Saraf, Somnath Bhattacharjee","submitted_at":"2026-06-25T17:12:57Z","abstract_excerpt":"We study factoring algorithms for general sparse polynomials and sparse polynomials of bounded individual degree and prove the following results.\n  1. We give a deterministic polynomial-time algorithm which takes as input an $n$-variate $s$-sparse polynomial $f$ of bounded individual degree $d$ and outputs a list of circuits which contains all factors of $f$, although there might be additional spurious circuits in the list. The algorithm runs in time $\\operatorname{poly}(n, s^d)$. Additionally, every circuit in the list has constant depth. Our algorithm works over all fields of characteristic "},"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":"2606.27293","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2026-06-25T17:12:57Z","cross_cats_sorted":[],"title_canon_sha256":"637187b284a3ca526eb16c386f47f82d5a6cc378ddf597cfd91d8a867f2346f7","abstract_canon_sha256":"52493a48fc2340a68e99266bfbd68ab4bc1ed14673c5848f2710aece054928e5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-26T01:16:17.943278Z","signature_b64":"OosvpTfOPnfws+fqnbK4gN/sK/6ouZ/LG/RMZnY+vcFlnCnpKzd5JzD2iyi4hGHLFVGk23gXqCp7hMUi59GLAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"007b1530fbc82db9da5dba29ca312b6d7ee265bb2037f19eb9a17030854a5e6f","last_reissued_at":"2026-06-26T01:16:17.942911Z","signature_status":"signed_v1","first_computed_at":"2026-06-26T01:16:17.942911Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rishabh Kothary, Shanthanu S. Rai, Shubhangi Saraf, Somnath Bhattacharjee","submitted_at":"2026-06-25T17:12:57Z","abstract_excerpt":"We study factoring algorithms for general sparse polynomials and sparse polynomials of bounded individual degree and prove the following results.\n  1. We give a deterministic polynomial-time algorithm which takes as input an $n$-variate $s$-sparse polynomial $f$ of bounded individual degree $d$ and outputs a list of circuits which contains all factors of $f$, although there might be additional spurious circuits in the list. The algorithm runs in time $\\operatorname{poly}(n, s^d)$. Additionally, every circuit in the list has constant depth. Our algorithm works over all fields of characteristic "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.27293","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.27293/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":"2606.27293","created_at":"2026-06-26T01:16:17.942967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.27293v1","created_at":"2026-06-26T01:16:17.942967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.27293","created_at":"2026-06-26T01:16:17.942967+00:00"},{"alias_kind":"pith_short_12","alias_value":"AB5RKMH3ZAW3","created_at":"2026-06-26T01:16:17.942967+00:00"},{"alias_kind":"pith_short_16","alias_value":"AB5RKMH3ZAW3TWS5","created_at":"2026-06-26T01:16:17.942967+00:00"},{"alias_kind":"pith_short_8","alias_value":"AB5RKMH3","created_at":"2026-06-26T01:16:17.942967+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/AB5RKMH3ZAW3TWS5XIU4UMJLNV","json":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV.json","graph_json":"https://pith.science/api/pith-number/AB5RKMH3ZAW3TWS5XIU4UMJLNV/graph.json","events_json":"https://pith.science/api/pith-number/AB5RKMH3ZAW3TWS5XIU4UMJLNV/events.json","paper":"https://pith.science/paper/AB5RKMH3"},"agent_actions":{"view_html":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV","download_json":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV.json","view_paper":"https://pith.science/paper/AB5RKMH3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.27293&json=true","fetch_graph":"https://pith.science/api/pith-number/AB5RKMH3ZAW3TWS5XIU4UMJLNV/graph.json","fetch_events":"https://pith.science/api/pith-number/AB5RKMH3ZAW3TWS5XIU4UMJLNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV/action/storage_attestation","attest_author":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV/action/author_attestation","sign_citation":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV/action/citation_signature","submit_replication":"https://pith.science/pith/AB5RKMH3ZAW3TWS5XIU4UMJLNV/action/replication_record"}},"created_at":"2026-06-26T01:16:17.942967+00:00","updated_at":"2026-06-26T01:16:17.942967+00:00"}