{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G63JZLBNC5PAG4WWWGWAETXI6D","short_pith_number":"pith:G63JZLBN","canonical_record":{"source":{"id":"1901.00988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-04T05:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"8ee7f4e03f444a29f3e17b46256cd09dc818df2de743beca0f16d1d934a7c016","abstract_canon_sha256":"ae21670f50f725b3de33afe18daa53f45d341ceaa3df0e2983239b6258f26f6e"},"schema_version":"1.0"},"canonical_sha256":"37b69cac2d175e0372d6b1ac024ee8f0fe122e21af46c63d7f1eef56ff286bec","source":{"kind":"arxiv","id":"1901.00988","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00988","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00988v1","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00988","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"G63JZLBNC5PA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G63JZLBNC5PAG4WW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G63JZLBN","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G63JZLBNC5PAG4WWWGWAETXI6D","target":"record","payload":{"canonical_record":{"source":{"id":"1901.00988","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-04T05:45:03Z","cross_cats_sorted":[],"title_canon_sha256":"8ee7f4e03f444a29f3e17b46256cd09dc818df2de743beca0f16d1d934a7c016","abstract_canon_sha256":"ae21670f50f725b3de33afe18daa53f45d341ceaa3df0e2983239b6258f26f6e"},"schema_version":"1.0"},"canonical_sha256":"37b69cac2d175e0372d6b1ac024ee8f0fe122e21af46c63d7f1eef56ff286bec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:57.505904Z","signature_b64":"1UzgxFI35fli/d22fVcUG2IPbpp+i3F69pnJMZdF1p7PKX7ZuTC0LIgYtBlh0wslqREi5ElonQpVvvthBQc+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"37b69cac2d175e0372d6b1ac024ee8f0fe122e21af46c63d7f1eef56ff286bec","last_reissued_at":"2026-05-17T23:56:57.505277Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:57.505277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.00988","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:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0m5cus0JsF7d9UqVvDA4Z5bQuCH055oGo1XKf0yJAG8dtrlM18F21HEppzKUOBCIIwRhyGQ1qRMrrMTkhxSrBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:47:55.537623Z"},"content_sha256":"4a91353c6d2122cc60196bf444162c1f390212a0f7b0279c2a1bf1ecf36ec3b0","schema_version":"1.0","event_id":"sha256:4a91353c6d2122cc60196bf444162c1f390212a0f7b0279c2a1bf1ecf36ec3b0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G63JZLBNC5PAG4WWWGWAETXI6D","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander A. Sherstov, Pei Wu","submitted_at":"2019-01-04T05:45:03Z","abstract_excerpt":"The threshold degree of a Boolean function $f\\colon\\{0,1\\}^n\\to\\{0,1\\}$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $\\mathrm{sgn}\\; p(x)=(-1)^{f(x)}.$ A related notion is sign-rank, defined for a Boolean matrix $F=[F_{ij}]$ as the minimum rank of a real matrix $M$ with $\\mathrm{sgn}\\; M_{ij}=(-1)^{F_{ij}}$. Determining the maximum threshold degree and sign-rank achievable by constant-depth circuits ($\\text{AC}^{0}$) is a well-known and extensively studied open problem, with complexity-theoretic and algorithmic applications.\n  We give an essentially optimal solut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00988","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:56:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRAEmy1QKzzUiOTvEKxcsItV0cBj+DUPePMbmnk2Gcbca/OMj+x0B7tgfSNX4TOiFeZUFHg6qc87N0/yRjd5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T11:47:55.537976Z"},"content_sha256":"f0abd4bad15d020d63e44b95a27dc803d1838b8725521db8a809e21fc416ef44","schema_version":"1.0","event_id":"sha256:f0abd4bad15d020d63e44b95a27dc803d1838b8725521db8a809e21fc416ef44"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G63JZLBNC5PAG4WWWGWAETXI6D/bundle.json","state_url":"https://pith.science/pith/G63JZLBNC5PAG4WWWGWAETXI6D/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G63JZLBNC5PAG4WWWGWAETXI6D/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-05T11:47:55Z","links":{"resolver":"https://pith.science/pith/G63JZLBNC5PAG4WWWGWAETXI6D","bundle":"https://pith.science/pith/G63JZLBNC5PAG4WWWGWAETXI6D/bundle.json","state":"https://pith.science/pith/G63JZLBNC5PAG4WWWGWAETXI6D/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G63JZLBNC5PAG4WWWGWAETXI6D/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G63JZLBNC5PAG4WWWGWAETXI6D","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":"ae21670f50f725b3de33afe18daa53f45d341ceaa3df0e2983239b6258f26f6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-04T05:45:03Z","title_canon_sha256":"8ee7f4e03f444a29f3e17b46256cd09dc818df2de743beca0f16d1d934a7c016"},"schema_version":"1.0","source":{"id":"1901.00988","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.00988","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"arxiv_version","alias_value":"1901.00988v1","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.00988","created_at":"2026-05-17T23:56:57Z"},{"alias_kind":"pith_short_12","alias_value":"G63JZLBNC5PA","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G63JZLBNC5PAG4WW","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G63JZLBN","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:f0abd4bad15d020d63e44b95a27dc803d1838b8725521db8a809e21fc416ef44","target":"graph","created_at":"2026-05-17T23:56:57Z","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 threshold degree of a Boolean function $f\\colon\\{0,1\\}^n\\to\\{0,1\\}$ is the minimum degree of a real polynomial $p$ that represents $f$ in sign: $\\mathrm{sgn}\\; p(x)=(-1)^{f(x)}.$ A related notion is sign-rank, defined for a Boolean matrix $F=[F_{ij}]$ as the minimum rank of a real matrix $M$ with $\\mathrm{sgn}\\; M_{ij}=(-1)^{F_{ij}}$. Determining the maximum threshold degree and sign-rank achievable by constant-depth circuits ($\\text{AC}^{0}$) is a well-known and extensively studied open problem, with complexity-theoretic and algorithmic applications.\n  We give an essentially optimal solut","authors_text":"Alexander A. Sherstov, Pei Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-04T05:45:03Z","title":"Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.00988","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:4a91353c6d2122cc60196bf444162c1f390212a0f7b0279c2a1bf1ecf36ec3b0","target":"record","created_at":"2026-05-17T23:56:57Z","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":"ae21670f50f725b3de33afe18daa53f45d341ceaa3df0e2983239b6258f26f6e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-01-04T05:45:03Z","title_canon_sha256":"8ee7f4e03f444a29f3e17b46256cd09dc818df2de743beca0f16d1d934a7c016"},"schema_version":"1.0","source":{"id":"1901.00988","kind":"arxiv","version":1}},"canonical_sha256":"37b69cac2d175e0372d6b1ac024ee8f0fe122e21af46c63d7f1eef56ff286bec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"37b69cac2d175e0372d6b1ac024ee8f0fe122e21af46c63d7f1eef56ff286bec","first_computed_at":"2026-05-17T23:56:57.505277Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:56:57.505277Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1UzgxFI35fli/d22fVcUG2IPbpp+i3F69pnJMZdF1p7PKX7ZuTC0LIgYtBlh0wslqREi5ElonQpVvvthBQc+CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:56:57.505904Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.00988","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4a91353c6d2122cc60196bf444162c1f390212a0f7b0279c2a1bf1ecf36ec3b0","sha256:f0abd4bad15d020d63e44b95a27dc803d1838b8725521db8a809e21fc416ef44"],"state_sha256":"cd66a3dd05bdb38418bfb887ced004b0dd3ac25c4d444197cb4c67c24078b03e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rk22CxWEAzJG/yRgYQbJKhEc/JCj+kMODHKRSqeg3JWzrnO+UUwFC9reReexgcnLp3EkN6K09NYZOfeF8JIRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T11:47:55.539923Z","bundle_sha256":"637cf91d56c8b5c78d4bc8b1940055255daa678796d248a345c5cfe503002d47"}}