{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:6UCOEN5BVC4YOAK5VKA53UJZKH","short_pith_number":"pith:6UCOEN5B","schema_version":"1.0","canonical_sha256":"f504e237a1a8b987015daa81ddd13951e9af8f06f6840bed2d822144f7d8cc79","source":{"kind":"arxiv","id":"1902.07201","version":1},"attestation_state":"computed","paper":{"title":"PIT for depth-$4$ circuits and Sylvester-Gallai conjecture for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexey Milovanov","submitted_at":"2019-02-19T18:58:43Z","abstract_excerpt":"This text is a development of a preprint of Ankit Gupta.\n  We present an approach for devising a deterministic polynomial time blackbox identity testing (PIT) algorithm for depth-$4$ circuits with bounded top fanin. This approach is similar to Kayal-Shubhangi approach for depth-$3$ circuits. Kayal and Shubhangi based their algorithm on Sylvester-Gallai-type theorem about linear polynomials. We show how it is possible to generalize this approach to depth-$4$ circuits. However we failed to implement this plan completely. We succeeded to construct a polynomial time deterministic algorithm for dep"},"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":"1902.07201","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T18:58:43Z","cross_cats_sorted":[],"title_canon_sha256":"72f2eca54b10784f7695d83dba68d518fb0954b51176b6fbbc16be060cf31169","abstract_canon_sha256":"77adc184cfc5b9db0d232559eea48e6532f130e8ae3ec7d700085a7ddac37105"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:39.632023Z","signature_b64":"PJEJQysCGnyRNTZC/DWEWIZdA6pY5ToQ67Ija8Gr+jyhix6SSxv0ujc+O46NV/ippAg7I2UCTnPYeLEs9N34Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f504e237a1a8b987015daa81ddd13951e9af8f06f6840bed2d822144f7d8cc79","last_reissued_at":"2026-05-17T23:53:39.631356Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:39.631356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PIT for depth-$4$ circuits and Sylvester-Gallai conjecture for polynomials","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexey Milovanov","submitted_at":"2019-02-19T18:58:43Z","abstract_excerpt":"This text is a development of a preprint of Ankit Gupta.\n  We present an approach for devising a deterministic polynomial time blackbox identity testing (PIT) algorithm for depth-$4$ circuits with bounded top fanin. This approach is similar to Kayal-Shubhangi approach for depth-$3$ circuits. Kayal and Shubhangi based their algorithm on Sylvester-Gallai-type theorem about linear polynomials. We show how it is possible to generalize this approach to depth-$4$ circuits. However we failed to implement this plan completely. We succeeded to construct a polynomial time deterministic algorithm for dep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07201","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":"1902.07201","created_at":"2026-05-17T23:53:39.631458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.07201v1","created_at":"2026-05-17T23:53:39.631458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07201","created_at":"2026-05-17T23:53:39.631458+00:00"},{"alias_kind":"pith_short_12","alias_value":"6UCOEN5BVC4Y","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"6UCOEN5BVC4YOAK5","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"6UCOEN5B","created_at":"2026-05-18T12:33:10.108867+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/6UCOEN5BVC4YOAK5VKA53UJZKH","json":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH.json","graph_json":"https://pith.science/api/pith-number/6UCOEN5BVC4YOAK5VKA53UJZKH/graph.json","events_json":"https://pith.science/api/pith-number/6UCOEN5BVC4YOAK5VKA53UJZKH/events.json","paper":"https://pith.science/paper/6UCOEN5B"},"agent_actions":{"view_html":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH","download_json":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH.json","view_paper":"https://pith.science/paper/6UCOEN5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.07201&json=true","fetch_graph":"https://pith.science/api/pith-number/6UCOEN5BVC4YOAK5VKA53UJZKH/graph.json","fetch_events":"https://pith.science/api/pith-number/6UCOEN5BVC4YOAK5VKA53UJZKH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/action/storage_attestation","attest_author":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/action/author_attestation","sign_citation":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/action/citation_signature","submit_replication":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/action/replication_record"}},"created_at":"2026-05-17T23:53:39.631458+00:00","updated_at":"2026-05-17T23:53:39.631458+00:00"}