{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:PJOUM3DTDNEKOOYJFKEHPBT3YX","short_pith_number":"pith:PJOUM3DT","schema_version":"1.0","canonical_sha256":"7a5d466c731b48a73b092a8877867bc5d95626c70a612bf46213f264c4d4f7f3","source":{"kind":"arxiv","id":"2506.19604","version":2},"attestation_state":"computed","paper":{"title":"A primer on the closure of algebraic complexity classes under factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"C. S. Bhargav, Nitin Saxena, Prateek Dwivedi","submitted_at":"2025-06-24T13:17:37Z","abstract_excerpt":"Polynomial factorisation is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity theory classifies polynomials into complexity classes based on their computational hardness. This raises a natural question: Are these complexity classes closed under factorisation?\n  In this survey, we revisit pivotal techniques in polynomial factorisation: Hensel lifting, Newton iteration, and Lagrange inversion. These techniques have played an essential r"},"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.19604","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2025-06-24T13:17:37Z","cross_cats_sorted":[],"title_canon_sha256":"4f0ea43e6f5a24fe08e3377b58070ee41db03fff9bd72ae8d60613b6dc2abf7e","abstract_canon_sha256":"279dd54612a0fb7e70e2989b2c16d8b14e7eafc546fada2a4cbaa38edc1ce1c2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:10.728920Z","signature_b64":"0B5lnrQprjJrcHbthhBSFPu1PF9zfGvR3zFY+v8b+i1GXLOiHIFiWE3u8Wpaq12XISEzp4SMeonKOst5opuiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a5d466c731b48a73b092a8877867bc5d95626c70a612bf46213f264c4d4f7f3","last_reissued_at":"2026-06-11T00:08:10.727865Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:10.727865Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A primer on the closure of algebraic complexity classes under factoring","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"C. S. Bhargav, Nitin Saxena, Prateek Dwivedi","submitted_at":"2025-06-24T13:17:37Z","abstract_excerpt":"Polynomial factorisation is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity theory classifies polynomials into complexity classes based on their computational hardness. This raises a natural question: Are these complexity classes closed under factorisation?\n  In this survey, we revisit pivotal techniques in polynomial factorisation: Hensel lifting, Newton iteration, and Lagrange inversion. These techniques have played an essential r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.19604","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/2506.19604/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.19604","created_at":"2026-06-11T00:08:10.728055+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.19604v2","created_at":"2026-06-11T00:08:10.728055+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.19604","created_at":"2026-06-11T00:08:10.728055+00:00"},{"alias_kind":"pith_short_12","alias_value":"PJOUM3DTDNEK","created_at":"2026-06-11T00:08:10.728055+00:00"},{"alias_kind":"pith_short_16","alias_value":"PJOUM3DTDNEKOOYJ","created_at":"2026-06-11T00:08:10.728055+00:00"},{"alias_kind":"pith_short_8","alias_value":"PJOUM3DT","created_at":"2026-06-11T00:08:10.728055+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2606.27293","citing_title":"Deterministic Algorithms for Low Individual Degree Factors of Sparse Polynomials","ref_index":2,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX","json":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX.json","graph_json":"https://pith.science/api/pith-number/PJOUM3DTDNEKOOYJFKEHPBT3YX/graph.json","events_json":"https://pith.science/api/pith-number/PJOUM3DTDNEKOOYJFKEHPBT3YX/events.json","paper":"https://pith.science/paper/PJOUM3DT"},"agent_actions":{"view_html":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX","download_json":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX.json","view_paper":"https://pith.science/paper/PJOUM3DT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.19604&json=true","fetch_graph":"https://pith.science/api/pith-number/PJOUM3DTDNEKOOYJFKEHPBT3YX/graph.json","fetch_events":"https://pith.science/api/pith-number/PJOUM3DTDNEKOOYJFKEHPBT3YX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX/action/storage_attestation","attest_author":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX/action/author_attestation","sign_citation":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX/action/citation_signature","submit_replication":"https://pith.science/pith/PJOUM3DTDNEKOOYJFKEHPBT3YX/action/replication_record"}},"created_at":"2026-06-11T00:08:10.728055+00:00","updated_at":"2026-06-11T00:08:10.728055+00:00"}