{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:7BHJP6ZM7VUBBVUXVPID2DJXSS","short_pith_number":"pith:7BHJP6ZM","schema_version":"1.0","canonical_sha256":"f84e97fb2cfd6810d697abd03d0d3794829d9357f324500eaef0797d412e2468","source":{"kind":"arxiv","id":"2506.23220","version":1},"attestation_state":"computed","paper":{"title":"Constant-depth circuits for polynomial GCD over any characteristic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mrinal Kumar, Ramprasad Saptharishi, Shanthanu Rai, Shubhangi Saraf, Somnath Bhattacharjee, Varun Ramanathan","submitted_at":"2025-06-29T13:04:49Z","abstract_excerpt":"We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of Andrews & Wigderson who showed such an upper bound over fields of zero or large characteristic.\n  Our proofs are based on a recent work of Bhattacharjee, Kumar, Rai, Ramanathan, Saptharishi \\& Saraf that shows closure of constant depth algebraic circuits under factorization. On our way to the proof, we show that any $n$-variate symmetric polynomial $P$ that"},"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":"2506.23220","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2025-06-29T13:04:49Z","cross_cats_sorted":[],"title_canon_sha256":"e1f3f055924eb3fc16afbd3730315001990fdf6072bb4258ddeeba3cafe64fc4","abstract_canon_sha256":"dc223f22f78610a5966acf658cbe4d51809053aa7e320778abebfec4d7867993"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:29:18.103765Z","signature_b64":"YnSNpDFHj0w89XMZ4NMgw2kQqAHqHQzLg1nEbz0lpF0sgqkj2u/Bfd9OcETu20t47leBaVxE2z6ZiL124/L6BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f84e97fb2cfd6810d697abd03d0d3794829d9357f324500eaef0797d412e2468","last_reissued_at":"2026-07-05T11:29:18.103264Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:29:18.103264Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Constant-depth circuits for polynomial GCD over any characteristic","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Mrinal Kumar, Ramprasad Saptharishi, Shanthanu Rai, Shubhangi Saraf, Somnath Bhattacharjee, Varun Ramanathan","submitted_at":"2025-06-29T13:04:49Z","abstract_excerpt":"We show that the GCD of two univariate polynomials can be computed by (piece-wise) algebraic circuits of constant depth and polynomial size over any sufficiently large field, regardless of the characteristic. This extends a recent result of Andrews & Wigderson who showed such an upper bound over fields of zero or large characteristic.\n  Our proofs are based on a recent work of Bhattacharjee, Kumar, Rai, Ramanathan, Saptharishi \\& Saraf that shows closure of constant depth algebraic circuits under factorization. On our way to the proof, we show that any $n$-variate symmetric polynomial $P$ that"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.23220","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/2506.23220/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":"2506.23220","created_at":"2026-07-05T11:29:18.103324+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.23220v1","created_at":"2026-07-05T11:29:18.103324+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.23220","created_at":"2026-07-05T11:29:18.103324+00:00"},{"alias_kind":"pith_short_12","alias_value":"7BHJP6ZM7VUB","created_at":"2026-07-05T11:29:18.103324+00:00"},{"alias_kind":"pith_short_16","alias_value":"7BHJP6ZM7VUBBVUX","created_at":"2026-07-05T11:29:18.103324+00:00"},{"alias_kind":"pith_short_8","alias_value":"7BHJP6ZM","created_at":"2026-07-05T11:29:18.103324+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27293","citing_title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","ref_index":4,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS","json":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS.json","graph_json":"https://pith.science/api/pith-number/7BHJP6ZM7VUBBVUXVPID2DJXSS/graph.json","events_json":"https://pith.science/api/pith-number/7BHJP6ZM7VUBBVUXVPID2DJXSS/events.json","paper":"https://pith.science/paper/7BHJP6ZM"},"agent_actions":{"view_html":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS","download_json":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS.json","view_paper":"https://pith.science/paper/7BHJP6ZM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.23220&json=true","fetch_graph":"https://pith.science/api/pith-number/7BHJP6ZM7VUBBVUXVPID2DJXSS/graph.json","fetch_events":"https://pith.science/api/pith-number/7BHJP6ZM7VUBBVUXVPID2DJXSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS/action/storage_attestation","attest_author":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS/action/author_attestation","sign_citation":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS/action/citation_signature","submit_replication":"https://pith.science/pith/7BHJP6ZM7VUBBVUXVPID2DJXSS/action/replication_record"}},"created_at":"2026-07-05T11:29:18.103324+00:00","updated_at":"2026-07-05T11:29:18.103324+00:00"}