{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:EK6GUDUMZWRYLZVB7EG6HYQFO4","short_pith_number":"pith:EK6GUDUM","canonical_record":{"source":{"id":"1412.4719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T18:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"b3edafb055e52223976022d27579f139e9ba0972252f4b1fa172a261c4003229","abstract_canon_sha256":"552861cd03507fbbeab7440ada4aee925f655e2dd8201c658d892366032bb213"},"schema_version":"1.0"},"canonical_sha256":"22bc6a0e8ccda385e6a1f90de3e205773b43f4e28dd04e3b81ba3befcba9a434","source":{"kind":"arxiv","id":"1412.4719","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4719","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4719v1","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4719","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"EK6GUDUMZWRY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EK6GUDUMZWRYLZVB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EK6GUDUM","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:EK6GUDUMZWRYLZVB7EG6HYQFO4","target":"record","payload":{"canonical_record":{"source":{"id":"1412.4719","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T18:51:06Z","cross_cats_sorted":[],"title_canon_sha256":"b3edafb055e52223976022d27579f139e9ba0972252f4b1fa172a261c4003229","abstract_canon_sha256":"552861cd03507fbbeab7440ada4aee925f655e2dd8201c658d892366032bb213"},"schema_version":"1.0"},"canonical_sha256":"22bc6a0e8ccda385e6a1f90de3e205773b43f4e28dd04e3b81ba3befcba9a434","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:18.444585Z","signature_b64":"2uAyTEFO+shRN2ssK6OP+3+66+hAF2V+YVfanbF/TEtsT92HgNi7EwJaFXw0E8SOY8+wS4VpgvcSqYbK6sLBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22bc6a0e8ccda385e6a1f90de3e205773b43f4e28dd04e3b81ba3befcba9a434","last_reissued_at":"2026-05-18T02:31:18.443990Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:18.443990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1412.4719","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:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3yIkOHkeQFD2b4kg0IKe87GdPvIVHuUS1KQASb8QxmKg6SYi06FJXvjP2gpFaCB98Ody3B+xzi71Lq0tul1pDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:31:26.327310Z"},"content_sha256":"3e2744c18f99880605ac5822df061f8d2ddd5a84fdb5cce8533b6f9c0095bfc7","schema_version":"1.0","event_id":"sha256:3e2744c18f99880605ac5822df061f8d2ddd5a84fdb5cce8533b6f9c0095bfc7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:EK6GUDUMZWRYLZVB7EG6HYQFO4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonclassical polynomials as a barrier to polynomial lower bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Abhishek Bhowmick, Shachar Lovett","submitted_at":"2014-12-15T18:51:06Z","abstract_excerpt":"The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness, constructions of Ramsey graphs and locally decodable codes. Still, most of the known lower bounds become trivial for polynomials of super-logarithmic degree. Here, we suggest a new barrier explaining this phenomenon. We show that many of the existing lower bound proof techniques extend to nonclassical polynomials, an extension of classical polynomials which arose in h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4719","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:31:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wui7Sv1KLwUbKTvf9ByoOBF6Kkpb2NvSE7Vfst83ZoEsN1d0ae3N8LZZLgrKskedEPGnaK6d1KtkhF3xvZXBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T01:31:26.327763Z"},"content_sha256":"d84b8ea29d005445003740c2b9eb30160839a13f6ec18fcedb10edd3d52e1af6","schema_version":"1.0","event_id":"sha256:d84b8ea29d005445003740c2b9eb30160839a13f6ec18fcedb10edd3d52e1af6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4/bundle.json","state_url":"https://pith.science/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4/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-05-27T01:31:26Z","links":{"resolver":"https://pith.science/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4","bundle":"https://pith.science/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4/bundle.json","state":"https://pith.science/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EK6GUDUMZWRYLZVB7EG6HYQFO4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:EK6GUDUMZWRYLZVB7EG6HYQFO4","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":"552861cd03507fbbeab7440ada4aee925f655e2dd8201c658d892366032bb213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T18:51:06Z","title_canon_sha256":"b3edafb055e52223976022d27579f139e9ba0972252f4b1fa172a261c4003229"},"schema_version":"1.0","source":{"id":"1412.4719","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.4719","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"arxiv_version","alias_value":"1412.4719v1","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.4719","created_at":"2026-05-18T02:31:18Z"},{"alias_kind":"pith_short_12","alias_value":"EK6GUDUMZWRY","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"EK6GUDUMZWRYLZVB","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"EK6GUDUM","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:d84b8ea29d005445003740c2b9eb30160839a13f6ec18fcedb10edd3d52e1af6","target":"graph","created_at":"2026-05-18T02:31:18Z","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":"The problem of constructing explicit functions which cannot be approximated by low degree polynomials has been extensively studied in computational complexity, motivated by applications in circuit lower bounds, pseudo-randomness, constructions of Ramsey graphs and locally decodable codes. Still, most of the known lower bounds become trivial for polynomials of super-logarithmic degree. Here, we suggest a new barrier explaining this phenomenon. We show that many of the existing lower bound proof techniques extend to nonclassical polynomials, an extension of classical polynomials which arose in h","authors_text":"Abhishek Bhowmick, Shachar Lovett","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T18:51:06Z","title":"Nonclassical polynomials as a barrier to polynomial lower bounds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.4719","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:3e2744c18f99880605ac5822df061f8d2ddd5a84fdb5cce8533b6f9c0095bfc7","target":"record","created_at":"2026-05-18T02:31:18Z","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":"552861cd03507fbbeab7440ada4aee925f655e2dd8201c658d892366032bb213","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2014-12-15T18:51:06Z","title_canon_sha256":"b3edafb055e52223976022d27579f139e9ba0972252f4b1fa172a261c4003229"},"schema_version":"1.0","source":{"id":"1412.4719","kind":"arxiv","version":1}},"canonical_sha256":"22bc6a0e8ccda385e6a1f90de3e205773b43f4e28dd04e3b81ba3befcba9a434","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22bc6a0e8ccda385e6a1f90de3e205773b43f4e28dd04e3b81ba3befcba9a434","first_computed_at":"2026-05-18T02:31:18.443990Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:18.443990Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2uAyTEFO+shRN2ssK6OP+3+66+hAF2V+YVfanbF/TEtsT92HgNi7EwJaFXw0E8SOY8+wS4VpgvcSqYbK6sLBDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:18.444585Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.4719","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3e2744c18f99880605ac5822df061f8d2ddd5a84fdb5cce8533b6f9c0095bfc7","sha256:d84b8ea29d005445003740c2b9eb30160839a13f6ec18fcedb10edd3d52e1af6"],"state_sha256":"c5da2d0e78b6d463319d7d2b835fabec5ec061c988816228a48c19df951912c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6k6CEcxG1Kx8ORgvkGx0YMdRWXBGeUmei8YnqleNTVxnXeubSvcoPWLWfQhkJAAjKBvOuL0THYIm1eeuecadCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T01:31:26.330630Z","bundle_sha256":"16c1f7216b7dc6019d306c5ee8f762a106b2dceb3f1c2aa32409a8bca9cd41d9"}}