{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:DOFUSFNAKQX4JESDWORRRJZUZT","short_pith_number":"pith:DOFUSFNA","canonical_record":{"source":{"id":"1509.08896","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-29T19:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"02597bf1ebf39e3583b9f8b98694c8a8a7c65a5721a60903abbc56df513ff98e","abstract_canon_sha256":"dbed1b076aad62fb07256272c3e27a850da61ec48fbce101feb1a0a486b79875"},"schema_version":"1.0"},"canonical_sha256":"1b8b4915a0542fc49243b3a318a734ccf9516adf181217fd1eeb5d2dd4dc4cbc","source":{"kind":"arxiv","id":"1509.08896","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08896","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08896v2","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08896","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"DOFUSFNAKQX4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DOFUSFNAKQX4JESD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DOFUSFNA","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:DOFUSFNAKQX4JESDWORRRJZUZT","target":"record","payload":{"canonical_record":{"source":{"id":"1509.08896","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-29T19:24:51Z","cross_cats_sorted":[],"title_canon_sha256":"02597bf1ebf39e3583b9f8b98694c8a8a7c65a5721a60903abbc56df513ff98e","abstract_canon_sha256":"dbed1b076aad62fb07256272c3e27a850da61ec48fbce101feb1a0a486b79875"},"schema_version":"1.0"},"canonical_sha256":"1b8b4915a0542fc49243b3a318a734ccf9516adf181217fd1eeb5d2dd4dc4cbc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:27:07.308473Z","signature_b64":"DCLVfpFbfsSo5iiRdHWMhFia1tV/8N1L3lF9ozM8v56b9bYW3rLuePrKarCyGzmDrlJ+FESUe/nfdfQlTDBQBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1b8b4915a0542fc49243b3a318a734ccf9516adf181217fd1eeb5d2dd4dc4cbc","last_reissued_at":"2026-05-18T01:27:07.307757Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:27:07.307757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.08896","source_version":2,"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-18T01:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9HhYchRi97ijLU7f5Xlt7LIstIZ8PK3OWdsDsbAUF3EeLQYZbqoynlxQTE1mNLz/EdlR3ZQoIp67b4++CV/8DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:12.972413Z"},"content_sha256":"5ecc595554f921d755a437f3cd9e8996f446494f561b582cd1b4f0126cdb33c8","schema_version":"1.0","event_id":"sha256:5ecc595554f921d755a437f3cd9e8996f446494f561b582cd1b4f0126cdb33c8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:DOFUSFNAKQX4JESDWORRRJZUZT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic polynomials of small modulus cannot represent OR","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Holden Lee","submitted_at":"2015-09-29T19:24:51Z","abstract_excerpt":"An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\\text{MOD}_m$ gates where $m$ is composite. The OR function is of particular interest because it is the simplest function not amenable to bounds from communication complexity. Tardos and Barrington established a lower bound of $\\Omega((\\log n)^{O_m(1)})$, and Barrington, Beigel, and Rudich established an upper bound of $n^{O_m(1)}$. No progress has been made on closing this gap for twen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08896","kind":"arxiv","version":2},"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-18T01:27:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sz5hA1o9Q+FGbocoYR8CbiAk7RwZXQ3tnNJc9UJax+YF8RPc6Ypcsnw900mG5Wj2YZmWzvfue2hbs8Hfg9ALDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T13:10:12.972765Z"},"content_sha256":"d639ed0cef2bc72328bf4da09df10891b69265da5071935491f8cf98aeb8fe0b","schema_version":"1.0","event_id":"sha256:d639ed0cef2bc72328bf4da09df10891b69265da5071935491f8cf98aeb8fe0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOFUSFNAKQX4JESDWORRRJZUZT/bundle.json","state_url":"https://pith.science/pith/DOFUSFNAKQX4JESDWORRRJZUZT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOFUSFNAKQX4JESDWORRRJZUZT/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-11T13:10:12Z","links":{"resolver":"https://pith.science/pith/DOFUSFNAKQX4JESDWORRRJZUZT","bundle":"https://pith.science/pith/DOFUSFNAKQX4JESDWORRRJZUZT/bundle.json","state":"https://pith.science/pith/DOFUSFNAKQX4JESDWORRRJZUZT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOFUSFNAKQX4JESDWORRRJZUZT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:DOFUSFNAKQX4JESDWORRRJZUZT","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":"dbed1b076aad62fb07256272c3e27a850da61ec48fbce101feb1a0a486b79875","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-29T19:24:51Z","title_canon_sha256":"02597bf1ebf39e3583b9f8b98694c8a8a7c65a5721a60903abbc56df513ff98e"},"schema_version":"1.0","source":{"id":"1509.08896","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08896","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08896v2","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08896","created_at":"2026-05-18T01:27:07Z"},{"alias_kind":"pith_short_12","alias_value":"DOFUSFNAKQX4","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"DOFUSFNAKQX4JESD","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"DOFUSFNA","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:d639ed0cef2bc72328bf4da09df10891b69265da5071935491f8cf98aeb8fe0b","target":"graph","created_at":"2026-05-18T01:27:07Z","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":"An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\\text{MOD}_m$ gates where $m$ is composite. The OR function is of particular interest because it is the simplest function not amenable to bounds from communication complexity. Tardos and Barrington established a lower bound of $\\Omega((\\log n)^{O_m(1)})$, and Barrington, Beigel, and Rudich established an upper bound of $n^{O_m(1)}$. No progress has been made on closing this gap for twen","authors_text":"Holden Lee","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-29T19:24:51Z","title":"Quadratic polynomials of small modulus cannot represent OR"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08896","kind":"arxiv","version":2},"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:5ecc595554f921d755a437f3cd9e8996f446494f561b582cd1b4f0126cdb33c8","target":"record","created_at":"2026-05-18T01:27:07Z","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":"dbed1b076aad62fb07256272c3e27a850da61ec48fbce101feb1a0a486b79875","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2015-09-29T19:24:51Z","title_canon_sha256":"02597bf1ebf39e3583b9f8b98694c8a8a7c65a5721a60903abbc56df513ff98e"},"schema_version":"1.0","source":{"id":"1509.08896","kind":"arxiv","version":2}},"canonical_sha256":"1b8b4915a0542fc49243b3a318a734ccf9516adf181217fd1eeb5d2dd4dc4cbc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1b8b4915a0542fc49243b3a318a734ccf9516adf181217fd1eeb5d2dd4dc4cbc","first_computed_at":"2026-05-18T01:27:07.307757Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:27:07.307757Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DCLVfpFbfsSo5iiRdHWMhFia1tV/8N1L3lF9ozM8v56b9bYW3rLuePrKarCyGzmDrlJ+FESUe/nfdfQlTDBQBA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:27:07.308473Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08896","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5ecc595554f921d755a437f3cd9e8996f446494f561b582cd1b4f0126cdb33c8","sha256:d639ed0cef2bc72328bf4da09df10891b69265da5071935491f8cf98aeb8fe0b"],"state_sha256":"20a3f4d6f1aa040a00db0f66b9e3013257c5dda07210476201c4cf78a5210563"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e8eK55PtDbRV+kN8X3IgyuWDuPhbCPpmeFCKi2YMCLhyqUZ8k8k/WAbs1yOZ+qrV3HzKWJbIOhdyCdmJDqPECA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T13:10:12.974910Z","bundle_sha256":"93029ffdd04dd2f11bb22ae276dc2e820deff2b25639404f145a756828a9d45d"}}