{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:URN7KZ6IEYOQW3UVYLHKQ5QOV7","short_pith_number":"pith:URN7KZ6I","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"},"canonical_sha256":"a45bf567c8261d0b6e95c2cea8760eafccfa1784d906b3f835b7793a32029593","source":{"kind":"arxiv","id":"1611.01190","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01190","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01190v1","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01190","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"URN7KZ6IEYOQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"URN7KZ6IEYOQW3UV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"URN7KZ6I","created_at":"2026-05-18T12:30:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:URN7KZ6IEYOQW3UVYLHKQ5QOV7","target":"record","payload":{"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"},"canonical_sha256":"a45bf567c8261d0b6e95c2cea8760eafccfa1784d906b3f835b7793a32029593","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"},"source_kind":"arxiv","source_id":"1611.01190","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-18T01:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+kFo3BsGqjhFBRpFbyY5XFHge1xaznk7rA5ws0em59K4hi1e9/S2TEjhRMvnmitWSN/1X+f9dYquErkOo89NBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:18:58.681147Z"},"content_sha256":"6e70653cf7f38600bbc72d862d0f91091004f9646e882094fafc85a6cbe724ff","schema_version":"1.0","event_id":"sha256:6e70653cf7f38600bbc72d862d0f91091004f9646e882094fafc85a6cbe724ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:URN7KZ6IEYOQW3UVYLHKQ5QOV7","target":"graph","payload":{"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"},"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:00:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p1ZuEhbu4lAnR2eUfcEbGZo/mdbDnqv+XOKRTccX8DuB2VVbHbkb0mzrVAUSLHuArp37DdKYJITD0JJAu2dgBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T14:18:58.681515Z"},"content_sha256":"304979319381328859a2d2d91fb03147dba95519db60b6f5a16d56a567650941","schema_version":"1.0","event_id":"sha256:304979319381328859a2d2d91fb03147dba95519db60b6f5a16d56a567650941"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/bundle.json","state_url":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/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-26T14:18:58Z","links":{"resolver":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7","bundle":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/bundle.json","state":"https://pith.science/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/URN7KZ6IEYOQW3UVYLHKQ5QOV7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:URN7KZ6IEYOQW3UVYLHKQ5QOV7","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":"901c87c927dae145309cdd86df609067d57063c6123b5e87db47d171f3a932e0","cross_cats_sorted":["cs.CR","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T21:08:38Z","title_canon_sha256":"818a96e6a03cda27157e33b8a4f0e0d505dcea1a148bd2ac862ddb243595e710"},"schema_version":"1.0","source":{"id":"1611.01190","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.01190","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"arxiv_version","alias_value":"1611.01190v1","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.01190","created_at":"2026-05-18T01:00:11Z"},{"alias_kind":"pith_short_12","alias_value":"URN7KZ6IEYOQ","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_16","alias_value":"URN7KZ6IEYOQW3UV","created_at":"2026-05-18T12:30:46Z"},{"alias_kind":"pith_short_8","alias_value":"URN7KZ6I","created_at":"2026-05-18T12:30:46Z"}],"graph_snapshots":[{"event_id":"sha256:304979319381328859a2d2d91fb03147dba95519db60b6f5a16d56a567650941","target":"graph","created_at":"2026-05-18T01:00:11Z","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":"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.","authors_text":"Igor C. Oliveira, Rahul Santhanam","cross_cats":["cs.CR","cs.DS","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T21:08:38Z","title":"Conspiracies between Learning Algorithms, Circuit Lower Bounds and Pseudorandomness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.01190","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:6e70653cf7f38600bbc72d862d0f91091004f9646e882094fafc85a6cbe724ff","target":"record","created_at":"2026-05-18T01:00:11Z","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":"901c87c927dae145309cdd86df609067d57063c6123b5e87db47d171f3a932e0","cross_cats_sorted":["cs.CR","cs.DS","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-03T21:08:38Z","title_canon_sha256":"818a96e6a03cda27157e33b8a4f0e0d505dcea1a148bd2ac862ddb243595e710"},"schema_version":"1.0","source":{"id":"1611.01190","kind":"arxiv","version":1}},"canonical_sha256":"a45bf567c8261d0b6e95c2cea8760eafccfa1784d906b3f835b7793a32029593","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a45bf567c8261d0b6e95c2cea8760eafccfa1784d906b3f835b7793a32029593","first_computed_at":"2026-05-18T01:00:11.738230Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:00:11.738230Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WlYNU/COS6b56r3eVBqiPZM8YfuFDFxx0QPNoycXpN2HD69Un7BlvAwdHfSkHMxwju4uq3DQgwTefOu42iBkDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:00:11.738951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.01190","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6e70653cf7f38600bbc72d862d0f91091004f9646e882094fafc85a6cbe724ff","sha256:304979319381328859a2d2d91fb03147dba95519db60b6f5a16d56a567650941"],"state_sha256":"cff57315aba9fea2da8fcae838d11f9ed286b2b0ce39446392e3ca93193b27e5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sy5JtO/L/+GvJwFGu4Tu8pbdfm0w8pzLOknLMK9MmEqzxaRP0dMXlphvqfsv1OFbPKQhqQpNeLUlT7e8OctRBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T14:18:58.683500Z","bundle_sha256":"786992534eb2965979e7610077f57023f8074ee272c12d45d7b3d2c0747e4c11"}}