{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FF7MLZI6AWZWF67IXQES6G25CX","short_pith_number":"pith:FF7MLZI6","schema_version":"1.0","canonical_sha256":"297ec5e51e05b362fbe8bc092f1b5d15ed70eeb1e2efe06f368a126b0c15cd9f","source":{"kind":"arxiv","id":"1903.02366","version":2},"attestation_state":"computed","paper":{"title":"Closure of VP under taking factors: a short and simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chi-Ning Chou, Mrinal Kumar, Noam Solomon","submitted_at":"2019-03-06T13:31:46Z","abstract_excerpt":"In this note, we give a short, simple and almost completely self contained proof of a classical result of Kaltofen [Kal86, Kal87, Kal89] which shows that if an $n$ variate degree $d$ polynomial $f$ can be computed by an arithmetic circuit of size $s$, then each of its factors can be computed by an arithmetic circuit of size at most $\\textsf{poly}\\left(s, n, d\\right)$.\n  However, unlike Kaltofen's argument, our proof does not directly give an efficient algorithm for computing the circuits for the factors of $f$."},"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":"1903.02366","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-03-06T13:31:46Z","cross_cats_sorted":[],"title_canon_sha256":"2ba130805513df505fffbc4bb632b5c85b283dfb0b911538c02d2c69a80e7e65","abstract_canon_sha256":"27267639f5f614fedd845f1b517bc0d212a263410f617f73cb2766594998fc73"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:09.118898Z","signature_b64":"GlDp+hIxBwTKPDaUj3oRruuf76aRxnIHG4Blax0KBCvJL7ELLWucXg2UTGzWg4rGGjG93eYbDx765yOtw268Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"297ec5e51e05b362fbe8bc092f1b5d15ed70eeb1e2efe06f368a126b0c15cd9f","last_reissued_at":"2026-05-17T23:48:09.118349Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:09.118349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Closure of VP under taking factors: a short and simple proof","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Chi-Ning Chou, Mrinal Kumar, Noam Solomon","submitted_at":"2019-03-06T13:31:46Z","abstract_excerpt":"In this note, we give a short, simple and almost completely self contained proof of a classical result of Kaltofen [Kal86, Kal87, Kal89] which shows that if an $n$ variate degree $d$ polynomial $f$ can be computed by an arithmetic circuit of size $s$, then each of its factors can be computed by an arithmetic circuit of size at most $\\textsf{poly}\\left(s, n, d\\right)$.\n  However, unlike Kaltofen's argument, our proof does not directly give an efficient algorithm for computing the circuits for the factors of $f$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.02366","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":""},"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":"1903.02366","created_at":"2026-05-17T23:48:09.118439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.02366v2","created_at":"2026-05-17T23:48:09.118439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.02366","created_at":"2026-05-17T23:48:09.118439+00:00"},{"alias_kind":"pith_short_12","alias_value":"FF7MLZI6AWZW","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"FF7MLZI6AWZWF67I","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"FF7MLZI6","created_at":"2026-05-18T12:33:15.570797+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/FF7MLZI6AWZWF67IXQES6G25CX","json":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX.json","graph_json":"https://pith.science/api/pith-number/FF7MLZI6AWZWF67IXQES6G25CX/graph.json","events_json":"https://pith.science/api/pith-number/FF7MLZI6AWZWF67IXQES6G25CX/events.json","paper":"https://pith.science/paper/FF7MLZI6"},"agent_actions":{"view_html":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX","download_json":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX.json","view_paper":"https://pith.science/paper/FF7MLZI6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.02366&json=true","fetch_graph":"https://pith.science/api/pith-number/FF7MLZI6AWZWF67IXQES6G25CX/graph.json","fetch_events":"https://pith.science/api/pith-number/FF7MLZI6AWZWF67IXQES6G25CX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX/action/storage_attestation","attest_author":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX/action/author_attestation","sign_citation":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX/action/citation_signature","submit_replication":"https://pith.science/pith/FF7MLZI6AWZWF67IXQES6G25CX/action/replication_record"}},"created_at":"2026-05-17T23:48:09.118439+00:00","updated_at":"2026-05-17T23:48:09.118439+00:00"}