{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:URN7KZ6IEYOQW3UVYLHKQ5QOV7","short_pith_number":"pith:URN7KZ6I","schema_version":"1.0","canonical_sha256":"a45bf567c8261d0b6e95c2cea8760eafccfa1784d906b3f835b7793a32029593","source":{"kind":"arxiv","id":"1611.01190","version":1},"attestation_state":"computed","paper":{"title":"Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Igor C. Oliveira, Rahul Santhanam","submitted_at":"2016-11-03T21:08:38Z","abstract_excerpt":"We prove several results giving new and stronger connections between learning, circuit lower bounds and pseudorandomness. Among other results, we show a generic learning speedup lemma, equivalences between various learning models in the exponential time and subexponential time regimes, a dichotomy between learning and pseudorandomness, consequences of non-trivial learning for circuit lower bounds, Karp-Lipton theorems for probabilistic exponential time, and NC$^1$-hardness for the Minimum Circuit Size Problem."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1611.01190","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T21:08:38Z","cross_cats_sorted":["cs.CR","cs.DS","cs.LG"],"title_canon_sha256":"818a96e6a03cda27157e33b8a4f0e0d505dcea1a148bd2ac862ddb243595e710","abstract_canon_sha256":"901c87c927dae145309cdd86df609067d57063c6123b5e87db47d171f3a932e0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:00:11.738951Z","signature_b64":"WlYNU/COS6b56r3eVBqiPZM8YfuFDFxx0QPNoycXpN2HD69Un7BlvAwdHfSkHMxwju4uq3DQgwTefOu42iBkDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a45bf567c8261d0b6e95c2cea8760eafccfa1784d906b3f835b7793a32029593","last_reissued_at":"2026-05-18T01:00:11.738230Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:00:11.738230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR","cs.DS","cs.LG"],"primary_cat":"cs.CC","authors_text":"Igor C. Oliveira, Rahul Santhanam","submitted_at":"2016-11-03T21:08:38Z","abstract_excerpt":"We prove several results giving new and stronger connections between learning, circuit lower bounds and pseudorandomness. Among other results, we show a generic learning speedup lemma, equivalences between various learning models in the exponential time and subexponential time regimes, a dichotomy between learning and pseudorandomness, consequences of non-trivial learning for circuit lower bounds, Karp-Lipton theorems for probabilistic exponential time, and NC$^1$-hardness for the Minimum Circuit Size Problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01190","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1611.01190","created_at":"2026-05-18T01:00:11.738354+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.01190v1","created_at":"2026-05-18T01:00:11.738354+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01190","created_at":"2026-05-18T01:00:11.738354+00:00"},{"alias_kind":"pith_short_12","alias_value":"URN7KZ6IEYOQ","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_16","alias_value":"URN7KZ6IEYOQW3UV","created_at":"2026-05-18T12:30:46.583412+00:00"},{"alias_kind":"pith_short_8","alias_value":"URN7KZ6I","created_at":"2026-05-18T12:30:46.583412+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7","json":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7.json","graph_json":"https://pith.science/api/pith-number/URN7KZ6IEYOQW3UVYLHKQ5QOV7/graph.json","events_json":"https://pith.science/api/pith-number/URN7KZ6IEYOQW3UVYLHKQ5QOV7/events.json","paper":"https://pith.science/paper/URN7KZ6I"},"agent_actions":{"view_html":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7","download_json":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7.json","view_paper":"https://pith.science/paper/URN7KZ6I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.01190&json=true","fetch_graph":"https://pith.science/api/pith-number/URN7KZ6IEYOQW3UVYLHKQ5QOV7/graph.json","fetch_events":"https://pith.science/api/pith-number/URN7KZ6IEYOQW3UVYLHKQ5QOV7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/action/storage_attestation","attest_author":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/action/author_attestation","sign_citation":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/action/citation_signature","submit_replication":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/action/replication_record"}},"created_at":"2026-05-18T01:00:11.738354+00:00","updated_at":"2026-05-18T01:00:11.738354+00:00"}