{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:YG7NHYETKQOQASAJIODJKTMTSS","short_pith_number":"pith:YG7NHYET","canonical_record":{"source":{"id":"1304.5910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T10:42:03Z","cross_cats_sorted":[],"title_canon_sha256":"1810996e8121d896228592da4f6b10b3c7fe2f14e74c5c776f70bad32e4d7c62","abstract_canon_sha256":"32babefd037acd5655f2fbe237186b44580ea31a68d9af5e3e1770bef269ea77"},"schema_version":"1.0"},"canonical_sha256":"c1bed3e093541d0048094386954d93948f7d032bb71df3cf60da3b08f41a6902","source":{"kind":"arxiv","id":"1304.5910","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5910","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5910v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5910","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"YG7NHYETKQOQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YG7NHYETKQOQASAJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YG7NHYET","created_at":"2026-05-18T12:28:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:YG7NHYETKQOQASAJIODJKTMTSS","target":"record","payload":{"canonical_record":{"source":{"id":"1304.5910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T10:42:03Z","cross_cats_sorted":[],"title_canon_sha256":"1810996e8121d896228592da4f6b10b3c7fe2f14e74c5c776f70bad32e4d7c62","abstract_canon_sha256":"32babefd037acd5655f2fbe237186b44580ea31a68d9af5e3e1770bef269ea77"},"schema_version":"1.0"},"canonical_sha256":"c1bed3e093541d0048094386954d93948f7d032bb71df3cf60da3b08f41a6902","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:23.795189Z","signature_b64":"OSj9HSwcgyOMMZqi4pKRCx0zpePqgERAAgkc8ddSRY1dwVanc7gWaUdGiNvr+obrOW81AyfdP9ZUTZypKmq/Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1bed3e093541d0048094386954d93948f7d032bb71df3cf60da3b08f41a6902","last_reissued_at":"2026-05-18T03:27:23.794648Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:23.794648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.5910","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9pLl6mqMv62XQOawPS6b1slOYxacyS/cjDCZKra8dMTPgH9F9Ky9OqShTLU6fVYtv4BJ3mnG4XWMCHXT+/n1Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:19:39.437936Z"},"content_sha256":"4ef6589d980a674b939c325dd46de99473dc60dc60b22af862dfb26cd5463468","schema_version":"1.0","event_id":"sha256:4ef6589d980a674b939c325dd46de99473dc60dc60b22af862dfb26cd5463468"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:YG7NHYETKQOQASAJIODJKTMTSS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Herv\\'e Fournier, R\\'emi de Verclos, Sylvain Perifel","submitted_at":"2013-04-22T10:42:03Z","abstract_excerpt":"Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build a family of polynomials that can be evaluated in AM having no arithmetic circuits of size O(n^k). Then we investigate the link between fixed-polynomial size circuit bounds in the Boolean and arithmetic settings. In characteristic zero, it is proved that $\\NP \\not\\subset \\size(n^k)$, or $\\MA \\subset \\size(n^k)$, or NP=MA imply lower bounds on the circuit siz"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5910","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-18T03:27:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+e4VAWoHyQK4WCIqQBdUBRF+0K15sief2SM9PpuZ1y9uy0cGdQuBJ4anzAbiob5sdP4aIDU5UCK40U7JRsBcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T12:19:39.438279Z"},"content_sha256":"d89c82721a6685bfa0b836b489a4c104ac3495a5ea32afeca70de6256fd9a4b9","schema_version":"1.0","event_id":"sha256:d89c82721a6685bfa0b836b489a4c104ac3495a5ea32afeca70de6256fd9a4b9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YG7NHYETKQOQASAJIODJKTMTSS/bundle.json","state_url":"https://pith.science/pith/YG7NHYETKQOQASAJIODJKTMTSS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YG7NHYETKQOQASAJIODJKTMTSS/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-24T12:19:39Z","links":{"resolver":"https://pith.science/pith/YG7NHYETKQOQASAJIODJKTMTSS","bundle":"https://pith.science/pith/YG7NHYETKQOQASAJIODJKTMTSS/bundle.json","state":"https://pith.science/pith/YG7NHYETKQOQASAJIODJKTMTSS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YG7NHYETKQOQASAJIODJKTMTSS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:YG7NHYETKQOQASAJIODJKTMTSS","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":"32babefd037acd5655f2fbe237186b44580ea31a68d9af5e3e1770bef269ea77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T10:42:03Z","title_canon_sha256":"1810996e8121d896228592da4f6b10b3c7fe2f14e74c5c776f70bad32e4d7c62"},"schema_version":"1.0","source":{"id":"1304.5910","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.5910","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"arxiv_version","alias_value":"1304.5910v1","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.5910","created_at":"2026-05-18T03:27:23Z"},{"alias_kind":"pith_short_12","alias_value":"YG7NHYETKQOQ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_16","alias_value":"YG7NHYETKQOQASAJ","created_at":"2026-05-18T12:28:06Z"},{"alias_kind":"pith_short_8","alias_value":"YG7NHYET","created_at":"2026-05-18T12:28:06Z"}],"graph_snapshots":[{"event_id":"sha256:d89c82721a6685bfa0b836b489a4c104ac3495a5ea32afeca70de6256fd9a4b9","target":"graph","created_at":"2026-05-18T03:27:23Z","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":"Assuming the Generalised Riemann Hypothesis (GRH), we show that for all k, there exist polynomials with coefficients in $\\MA$ having no arithmetic circuits of size O(n^k) over the complex field (allowing any complex constant). We also build a family of polynomials that can be evaluated in AM having no arithmetic circuits of size O(n^k). Then we investigate the link between fixed-polynomial size circuit bounds in the Boolean and arithmetic settings. In characteristic zero, it is proved that $\\NP \\not\\subset \\size(n^k)$, or $\\MA \\subset \\size(n^k)$, or NP=MA imply lower bounds on the circuit siz","authors_text":"Herv\\'e Fournier, R\\'emi de Verclos, Sylvain Perifel","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T10:42:03Z","title":"On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.5910","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:4ef6589d980a674b939c325dd46de99473dc60dc60b22af862dfb26cd5463468","target":"record","created_at":"2026-05-18T03:27:23Z","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":"32babefd037acd5655f2fbe237186b44580ea31a68d9af5e3e1770bef269ea77","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-04-22T10:42:03Z","title_canon_sha256":"1810996e8121d896228592da4f6b10b3c7fe2f14e74c5c776f70bad32e4d7c62"},"schema_version":"1.0","source":{"id":"1304.5910","kind":"arxiv","version":1}},"canonical_sha256":"c1bed3e093541d0048094386954d93948f7d032bb71df3cf60da3b08f41a6902","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c1bed3e093541d0048094386954d93948f7d032bb71df3cf60da3b08f41a6902","first_computed_at":"2026-05-18T03:27:23.794648Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:23.794648Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OSj9HSwcgyOMMZqi4pKRCx0zpePqgERAAgkc8ddSRY1dwVanc7gWaUdGiNvr+obrOW81AyfdP9ZUTZypKmq/Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:23.795189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.5910","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4ef6589d980a674b939c325dd46de99473dc60dc60b22af862dfb26cd5463468","sha256:d89c82721a6685bfa0b836b489a4c104ac3495a5ea32afeca70de6256fd9a4b9"],"state_sha256":"a1e3f1b2dd642273b701667194f81b38402330abcdcbcd2584d1e1f587cd1c5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kD7Ju+1O5nstRsKAmKqEtQsq134GRZ3pLeDti0FdHoVO8h2Z/cR9bfbd73u03XHIGn/UAEr4A6ZkbogLnCZdCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T12:19:39.440201Z","bundle_sha256":"7d0cc795b42cb55c591d15c5a5a6e586d6ae115272d9d1a4da2f018c8a3c802b"}}