{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QFP3M7BB6HV2VMOAAKK7J7YJLG","short_pith_number":"pith:QFP3M7BB","canonical_record":{"source":{"id":"1805.10698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-27T21:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"b4736816e257af005a476ff2d35cb322dee019ea09254cf15dfd4ebc4b4529c0","abstract_canon_sha256":"57e36335d2f733b6dba65adb7817459d24c9fc6f084ffc828d31efc1ae46f111"},"schema_version":"1.0"},"canonical_sha256":"815fb67c21f1ebaab1c00295f4ff0959986bcb17ff7aa7e09d53d2031a2cdf3a","source":{"kind":"arxiv","id":"1805.10698","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10698","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10698v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10698","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"QFP3M7BB6HV2","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QFP3M7BB6HV2VMOA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QFP3M7BB","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QFP3M7BB6HV2VMOAAKK7J7YJLG","target":"record","payload":{"canonical_record":{"source":{"id":"1805.10698","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-27T21:52:03Z","cross_cats_sorted":[],"title_canon_sha256":"b4736816e257af005a476ff2d35cb322dee019ea09254cf15dfd4ebc4b4529c0","abstract_canon_sha256":"57e36335d2f733b6dba65adb7817459d24c9fc6f084ffc828d31efc1ae46f111"},"schema_version":"1.0"},"canonical_sha256":"815fb67c21f1ebaab1c00295f4ff0959986bcb17ff7aa7e09d53d2031a2cdf3a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:51.689746Z","signature_b64":"r6S0tDAN0kPu0ppFmNdfrnikiQLAPI828/6whIatnXUqtzoQ2vYlRI1XMOEstpzTE7bfXKa8ov6ECtRZzi27DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"815fb67c21f1ebaab1c00295f4ff0959986bcb17ff7aa7e09d53d2031a2cdf3a","last_reissued_at":"2026-05-18T00:14:51.688993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:51.688993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.10698","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-18T00:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"37c7WPYVaTokXu6Z3DmZotGe8XagyudjC+uhfGXyEfNumVv4+9eVrvHHzgx4+K3u1IrRAC1IgxeGKD+PmZghAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:19:43.891936Z"},"content_sha256":"dec4944187b8ec4d90c7f184c7105549789536f166185ecbc898d8948ecaa48e","schema_version":"1.0","event_id":"sha256:dec4944187b8ec4d90c7f184c7105549789536f166185ecbc898d8948ecaa48e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QFP3M7BB6HV2VMOAAKK7J7YJLG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Lijie Chen","submitted_at":"2018-05-27T21:52:03Z","abstract_excerpt":"Proving super-polynomial size lower bounds for $\\textsf{TC}^0$, the class of constant-depth, polynomial-size circuits of Majority gates, is a notorious open problem in complexity theory. A major frontier is to prove that $\\textsf{NEXP}$ does not have poly-size $\\textsf{THR} \\circ \\textsf{THR}$ circuit (depth-two circuits with linear threshold gates).\n  In recent years, R.~Williams proposed a program to prove circuit lower bounds via improved algorithms. In this paper, following Williams' framework, we show that the above frontier question can be resolved by devising slightly faster algorithms "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10698","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-18T00:14:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s2xpWw0K5MysHFVLedVshWKq7AQBWU3dZ9AbKTYwEow+911vUPZwFHdWuKvJ7ef774cH2iSqvcGbl9PKEYZlCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T04:19:43.892283Z"},"content_sha256":"6066fe32d8a653cbe1ec6e9db96c96e903ec8e2732ed242d9975220b51a270ae","schema_version":"1.0","event_id":"sha256:6066fe32d8a653cbe1ec6e9db96c96e903ec8e2732ed242d9975220b51a270ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG/bundle.json","state_url":"https://pith.science/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG/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-01T04:19:43Z","links":{"resolver":"https://pith.science/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG","bundle":"https://pith.science/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG/bundle.json","state":"https://pith.science/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFP3M7BB6HV2VMOAAKK7J7YJLG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QFP3M7BB6HV2VMOAAKK7J7YJLG","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":"57e36335d2f733b6dba65adb7817459d24c9fc6f084ffc828d31efc1ae46f111","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-27T21:52:03Z","title_canon_sha256":"b4736816e257af005a476ff2d35cb322dee019ea09254cf15dfd4ebc4b4529c0"},"schema_version":"1.0","source":{"id":"1805.10698","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.10698","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"arxiv_version","alias_value":"1805.10698v1","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.10698","created_at":"2026-05-18T00:14:51Z"},{"alias_kind":"pith_short_12","alias_value":"QFP3M7BB6HV2","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QFP3M7BB6HV2VMOA","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QFP3M7BB","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:6066fe32d8a653cbe1ec6e9db96c96e903ec8e2732ed242d9975220b51a270ae","target":"graph","created_at":"2026-05-18T00:14:51Z","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":"Proving super-polynomial size lower bounds for $\\textsf{TC}^0$, the class of constant-depth, polynomial-size circuits of Majority gates, is a notorious open problem in complexity theory. A major frontier is to prove that $\\textsf{NEXP}$ does not have poly-size $\\textsf{THR} \\circ \\textsf{THR}$ circuit (depth-two circuits with linear threshold gates).\n  In recent years, R.~Williams proposed a program to prove circuit lower bounds via improved algorithms. In this paper, following Williams' framework, we show that the above frontier question can be resolved by devising slightly faster algorithms ","authors_text":"Lijie Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-27T21:52:03Z","title":"Toward Super-Polynomial Size Lower Bounds for Depth-Two Threshold Circuits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.10698","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:dec4944187b8ec4d90c7f184c7105549789536f166185ecbc898d8948ecaa48e","target":"record","created_at":"2026-05-18T00:14:51Z","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":"57e36335d2f733b6dba65adb7817459d24c9fc6f084ffc828d31efc1ae46f111","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-05-27T21:52:03Z","title_canon_sha256":"b4736816e257af005a476ff2d35cb322dee019ea09254cf15dfd4ebc4b4529c0"},"schema_version":"1.0","source":{"id":"1805.10698","kind":"arxiv","version":1}},"canonical_sha256":"815fb67c21f1ebaab1c00295f4ff0959986bcb17ff7aa7e09d53d2031a2cdf3a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"815fb67c21f1ebaab1c00295f4ff0959986bcb17ff7aa7e09d53d2031a2cdf3a","first_computed_at":"2026-05-18T00:14:51.688993Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:14:51.688993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6S0tDAN0kPu0ppFmNdfrnikiQLAPI828/6whIatnXUqtzoQ2vYlRI1XMOEstpzTE7bfXKa8ov6ECtRZzi27DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:14:51.689746Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.10698","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dec4944187b8ec4d90c7f184c7105549789536f166185ecbc898d8948ecaa48e","sha256:6066fe32d8a653cbe1ec6e9db96c96e903ec8e2732ed242d9975220b51a270ae"],"state_sha256":"2a7a7837a037184e0aa100984529b14b8249ede31fd119032aff1ceacadcdf3b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oDl9IYPkWwZgO8SGqUK+8ny/KRF1AlV2PmLVLXmJRrZNRWf3eoDVHnrpC2JoxuzBfAFB8LdtWvWUuqOAJRiXBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T04:19:43.894292Z","bundle_sha256":"5918d9dea866c037d2d8ebc79168a03c38d342f36a74e96099d7edb5aff5e87f"}}