{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6UCOEN5BVC4YOAK5VKA53UJZKH","short_pith_number":"pith:6UCOEN5B","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"},"canonical_sha256":"f504e237a1a8b987015daa81ddd13951e9af8f06f6840bed2d822144f7d8cc79","source":{"kind":"arxiv","id":"1902.07201","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07201","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07201v1","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07201","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"6UCOEN5BVC4Y","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6UCOEN5BVC4YOAK5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6UCOEN5B","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6UCOEN5BVC4YOAK5VKA53UJZKH","target":"record","payload":{"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"},"canonical_sha256":"f504e237a1a8b987015daa81ddd13951e9af8f06f6840bed2d822144f7d8cc79","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"},"source_kind":"arxiv","source_id":"1902.07201","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ecXv7XVkaZlWwBISRdW+6JTFBCwe+jM5v7KCPP3lXBq+kvSyQlOV1Ppb95va9qpSB1j9TqyBmqJeevebKvJyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:13:34.519469Z"},"content_sha256":"a8c5904ca2ad89951d9d7fd84b85dc483f137b7b2e2126a29b926dc7994a8390","schema_version":"1.0","event_id":"sha256:a8c5904ca2ad89951d9d7fd84b85dc483f137b7b2e2126a29b926dc7994a8390"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6UCOEN5BVC4YOAK5VKA53UJZKH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rXQFTXd2iU1KU7oqvaYiAlhBdbnsrpyR5qc+izphCin2NR5Y0J7RCwmgNI9BL++HxSHgHAN9zrUuo/c2FTZQDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T20:13:34.520220Z"},"content_sha256":"a36461f186ff2683fea9686b4fa44de441514079ecf66013bcfe7ebdc1ebc0de","schema_version":"1.0","event_id":"sha256:a36461f186ff2683fea9686b4fa44de441514079ecf66013bcfe7ebdc1ebc0de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/bundle.json","state_url":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T20:13:34Z","links":{"resolver":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH","bundle":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/bundle.json","state":"https://pith.science/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6UCOEN5BVC4YOAK5VKA53UJZKH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6UCOEN5BVC4YOAK5VKA53UJZKH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"77adc184cfc5b9db0d232559eea48e6532f130e8ae3ec7d700085a7ddac37105","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T18:58:43Z","title_canon_sha256":"72f2eca54b10784f7695d83dba68d518fb0954b51176b6fbbc16be060cf31169"},"schema_version":"1.0","source":{"id":"1902.07201","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.07201","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"arxiv_version","alias_value":"1902.07201v1","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.07201","created_at":"2026-05-17T23:53:39Z"},{"alias_kind":"pith_short_12","alias_value":"6UCOEN5BVC4Y","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6UCOEN5BVC4YOAK5","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6UCOEN5B","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:a36461f186ff2683fea9686b4fa44de441514079ecf66013bcfe7ebdc1ebc0de","target":"graph","created_at":"2026-05-17T23:53:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Alexey Milovanov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T18:58:43Z","title":"PIT for depth-$4$ circuits and Sylvester-Gallai conjecture for polynomials"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.07201","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:a8c5904ca2ad89951d9d7fd84b85dc483f137b7b2e2126a29b926dc7994a8390","target":"record","created_at":"2026-05-17T23:53:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"77adc184cfc5b9db0d232559eea48e6532f130e8ae3ec7d700085a7ddac37105","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-02-19T18:58:43Z","title_canon_sha256":"72f2eca54b10784f7695d83dba68d518fb0954b51176b6fbbc16be060cf31169"},"schema_version":"1.0","source":{"id":"1902.07201","kind":"arxiv","version":1}},"canonical_sha256":"f504e237a1a8b987015daa81ddd13951e9af8f06f6840bed2d822144f7d8cc79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f504e237a1a8b987015daa81ddd13951e9af8f06f6840bed2d822144f7d8cc79","first_computed_at":"2026-05-17T23:53:39.631356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:39.631356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJEJQysCGnyRNTZC/DWEWIZdA6pY5ToQ67Ija8Gr+jyhix6SSxv0ujc+O46NV/ippAg7I2UCTnPYeLEs9N34Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:39.632023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.07201","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8c5904ca2ad89951d9d7fd84b85dc483f137b7b2e2126a29b926dc7994a8390","sha256:a36461f186ff2683fea9686b4fa44de441514079ecf66013bcfe7ebdc1ebc0de"],"state_sha256":"33d73e12947f99357b363e1c30b2a526ad5426bb8b82e452b397202891dffb26"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tf42EKik/zOs7FENE+5oJ1+7y3EWRPJiM1P3FfJXLPF9GR6ctSnqIorFBV5tsVvxXUZqljLmrjrZecPAjgbjCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T20:13:34.524704Z","bundle_sha256":"de2900c7752a71f2eb8d8d61e2459f7d082d22b4920121d0154dfbfe39506fad"}}