{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:OFF5HUYSM37W3TRSQCTQZTBNRQ","short_pith_number":"pith:OFF5HUYS","canonical_record":{"source":{"id":"1011.3234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-14T16:50:51Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"a7560efbb4dbe90ffbc11eeebc55b22b5fb0396fea9b7a0868d189259cc92d50","abstract_canon_sha256":"b839814e67bad78ecc6c13d1a6de5ffed51d0b4cc83ce389a887527b618cdd7c"},"schema_version":"1.0"},"canonical_sha256":"714bd3d31266ff6dce3280a70ccc2d8c218a6483aba2115350b8da275e4cf4cf","source":{"kind":"arxiv","id":"1011.3234","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3234","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3234v1","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3234","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"pith_short_12","alias_value":"OFF5HUYSM37W","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OFF5HUYSM37W3TRS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OFF5HUYS","created_at":"2026-05-18T12:26:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:OFF5HUYSM37W3TRSQCTQZTBNRQ","target":"record","payload":{"canonical_record":{"source":{"id":"1011.3234","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-14T16:50:51Z","cross_cats_sorted":["math.AC"],"title_canon_sha256":"a7560efbb4dbe90ffbc11eeebc55b22b5fb0396fea9b7a0868d189259cc92d50","abstract_canon_sha256":"b839814e67bad78ecc6c13d1a6de5ffed51d0b4cc83ce389a887527b618cdd7c"},"schema_version":"1.0"},"canonical_sha256":"714bd3d31266ff6dce3280a70ccc2d8c218a6483aba2115350b8da275e4cf4cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:36.777220Z","signature_b64":"XmMk1h/acr6GNzs8t9KdJejth+n2KGLSZY8uAh16iorpzaiTercaV29hHSCMHqpc8naB6R5UlAZsFSFcQicxCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"714bd3d31266ff6dce3280a70ccc2d8c218a6483aba2115350b8da275e4cf4cf","last_reissued_at":"2026-05-18T02:23:36.776508Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:36.776508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1011.3234","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-18T02:23:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C3RFLOEuk66Jll+jgRe5jVbHkJeSh0x0L0QiiWG/zTOnrtrB3ECkSaCK6clUxR2GCWTSatxfwB703shkeLcvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:55:26.667704Z"},"content_sha256":"b3fdabd882eb449baf4f264d540f3a5456cfc1e314f82958850018b9cc3aacdd","schema_version":"1.0","event_id":"sha256:b3fdabd882eb449baf4f264d540f3a5456cfc1e314f82958850018b9cc3aacdd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:OFF5HUYSM37W3TRSQCTQZTBNRQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AC"],"primary_cat":"cs.CC","authors_text":"C. Seshadhri, Nitin Saxena","submitted_at":"2010-11-14T16:50:51Z","abstract_excerpt":"Let C be a depth-3 circuit with n variables, degree d and top fanin k (called sps(k,d,n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically zero. Klivans & Spielman (STOC 2001) observed that the problem is open even when k is a constant. This case has been subjected to a serious study over the past few years, starting from the work of Dvir & Shpilka (STOC 2005).\n  We give the first polynomial time blackbox algorithm for this problem. Our algorithm runs in time poly(nd^k), regardless of the base fie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3234","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-18T02:23:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+UCBGen5OjRGzRVutc2DTVRUWHyeT9sjhRRHeBdKjYQ4H1pFBCiGLLTy8e8Yet8W8UQ6On19F+fiEW/sNv5CDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:55:26.668266Z"},"content_sha256":"0ab035946fe4bcd1318efe92730acfc8315ab936928d31e79880681dc2ac98dd","schema_version":"1.0","event_id":"sha256:0ab035946fe4bcd1318efe92730acfc8315ab936928d31e79880681dc2ac98dd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ/bundle.json","state_url":"https://pith.science/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ/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-01T12:55:26Z","links":{"resolver":"https://pith.science/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ","bundle":"https://pith.science/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ/bundle.json","state":"https://pith.science/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OFF5HUYSM37W3TRSQCTQZTBNRQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:OFF5HUYSM37W3TRSQCTQZTBNRQ","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":"b839814e67bad78ecc6c13d1a6de5ffed51d0b4cc83ce389a887527b618cdd7c","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-14T16:50:51Z","title_canon_sha256":"a7560efbb4dbe90ffbc11eeebc55b22b5fb0396fea9b7a0868d189259cc92d50"},"schema_version":"1.0","source":{"id":"1011.3234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1011.3234","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"arxiv_version","alias_value":"1011.3234v1","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.3234","created_at":"2026-05-18T02:23:36Z"},{"alias_kind":"pith_short_12","alias_value":"OFF5HUYSM37W","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_16","alias_value":"OFF5HUYSM37W3TRS","created_at":"2026-05-18T12:26:12Z"},{"alias_kind":"pith_short_8","alias_value":"OFF5HUYS","created_at":"2026-05-18T12:26:12Z"}],"graph_snapshots":[{"event_id":"sha256:0ab035946fe4bcd1318efe92730acfc8315ab936928d31e79880681dc2ac98dd","target":"graph","created_at":"2026-05-18T02:23:36Z","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":"Let C be a depth-3 circuit with n variables, degree d and top fanin k (called sps(k,d,n) circuits) over base field F. It is a major open problem to design a deterministic polynomial time blackbox algorithm that tests if C is identically zero. Klivans & Spielman (STOC 2001) observed that the problem is open even when k is a constant. This case has been subjected to a serious study over the past few years, starting from the work of Dvir & Shpilka (STOC 2005).\n  We give the first polynomial time blackbox algorithm for this problem. Our algorithm runs in time poly(nd^k), regardless of the base fie","authors_text":"C. Seshadhri, Nitin Saxena","cross_cats":["math.AC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-14T16:50:51Z","title":"Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.3234","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:b3fdabd882eb449baf4f264d540f3a5456cfc1e314f82958850018b9cc3aacdd","target":"record","created_at":"2026-05-18T02:23:36Z","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":"b839814e67bad78ecc6c13d1a6de5ffed51d0b4cc83ce389a887527b618cdd7c","cross_cats_sorted":["math.AC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-11-14T16:50:51Z","title_canon_sha256":"a7560efbb4dbe90ffbc11eeebc55b22b5fb0396fea9b7a0868d189259cc92d50"},"schema_version":"1.0","source":{"id":"1011.3234","kind":"arxiv","version":1}},"canonical_sha256":"714bd3d31266ff6dce3280a70ccc2d8c218a6483aba2115350b8da275e4cf4cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"714bd3d31266ff6dce3280a70ccc2d8c218a6483aba2115350b8da275e4cf4cf","first_computed_at":"2026-05-18T02:23:36.776508Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:36.776508Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XmMk1h/acr6GNzs8t9KdJejth+n2KGLSZY8uAh16iorpzaiTercaV29hHSCMHqpc8naB6R5UlAZsFSFcQicxCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:36.777220Z","signed_message":"canonical_sha256_bytes"},"source_id":"1011.3234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3fdabd882eb449baf4f264d540f3a5456cfc1e314f82958850018b9cc3aacdd","sha256:0ab035946fe4bcd1318efe92730acfc8315ab936928d31e79880681dc2ac98dd"],"state_sha256":"c4f7707c4b8089abad6653de16a7fb91f6de050eb8c18a30f780de44073cc8d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+Mc0Wh0k0QX5XZHbpEXwmI1kk9ZQgfGaN/nsk2faLIBI/GY4GHb7OgTCqdTdWV5Ad6JY9C8CdIfJENe3ZPhmBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:55:26.671049Z","bundle_sha256":"8ffa8260902fe2a481d2928353b72c50f10378c0414ac85ebc1de616e792bebf"}}