{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:VDKRUZ6YZXJEF4G3LZIFPLWBP3","short_pith_number":"pith:VDKRUZ6Y","canonical_record":{"source":{"id":"2009.11514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-09-24T06:50:27Z","cross_cats_sorted":[],"title_canon_sha256":"6cbf0b57a16b5d907f8f9d7bfef506f412ea432b96559da711841d7e99511be4","abstract_canon_sha256":"4ef1fdb472391f4044cdcb74cdf5b77d0b81448ebd73174f1ead83c07304e8dd"},"schema_version":"1.0"},"canonical_sha256":"a8d51a67d8cdd242f0db5e5057aec17ece8cf9aca10722a23592b5e44448dd2f","source":{"kind":"arxiv","id":"2009.11514","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11514","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11514v1","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11514","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_12","alias_value":"VDKRUZ6YZXJE","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_16","alias_value":"VDKRUZ6YZXJEF4G3","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_8","alias_value":"VDKRUZ6Y","created_at":"2026-07-05T01:37:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:VDKRUZ6YZXJEF4G3LZIFPLWBP3","target":"record","payload":{"canonical_record":{"source":{"id":"2009.11514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-09-24T06:50:27Z","cross_cats_sorted":[],"title_canon_sha256":"6cbf0b57a16b5d907f8f9d7bfef506f412ea432b96559da711841d7e99511be4","abstract_canon_sha256":"4ef1fdb472391f4044cdcb74cdf5b77d0b81448ebd73174f1ead83c07304e8dd"},"schema_version":"1.0"},"canonical_sha256":"a8d51a67d8cdd242f0db5e5057aec17ece8cf9aca10722a23592b5e44448dd2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:37:46.493503Z","signature_b64":"TSbuGDDHW7eWpO03PdVxOPzONXLpYoKELJAonRSsPEzItb9trAhkU3CaOqBdg/967/XhRN59p2EGlFr8XNQ5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8d51a67d8cdd242f0db5e5057aec17ece8cf9aca10722a23592b5e44448dd2f","last_reissued_at":"2026-07-05T01:37:46.493033Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:37:46.493033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2009.11514","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-07-05T01:37:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+TmHHeBeEdi9rdaIFHT4cyK4w04Nrj66ysDHcLHDt6DGIdfXad8c2SAto4++ILK+Brx33V1XFxJpaa5vPZswBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:18:14.811758Z"},"content_sha256":"d32c3059fd6ff5b5998f4004174d567f3898fc90eed4a7d419078084373d847f","schema_version":"1.0","event_id":"sha256:d32c3059fd6ff5b5998f4004174d567f3898fc90eed4a7d419078084373d847f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:VDKRUZ6YZXJEF4G3LZIFPLWBP3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On One-way Functions and Kolmogorov Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Rafael Pass, Yanyi Liu","submitted_at":"2020-09-24T06:50:27Z","abstract_excerpt":"We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial $t(n)\\geq (1+\\varepsilon)n, \\varepsilon>0$, the following are equivalent:\n  - One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more);\n  - $t$-time bounded Kolmogorov Complexity, $K^t$, is mildly hard-on-average (i.e., there exists a polynomial $p(n)>0$ such that no PPT algorithm can compute $K^t$, for more than a $1-\\frac{1}{p(n)}$ fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11514","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.11514/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:37:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dMqZ+tylvdqOprELlaOMGO2r3AI/VnNEerIBDS1kZvcMk00B9uibb4QwxIdZlpY4Vfqk9OTPlsaehWTYH18GDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T06:18:14.812128Z"},"content_sha256":"b076bc7ee1efa68c8b69968903a50a519e1383b713222a10bf97511b589367b7","schema_version":"1.0","event_id":"sha256:b076bc7ee1efa68c8b69968903a50a519e1383b713222a10bf97511b589367b7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3/bundle.json","state_url":"https://pith.science/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3/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-07-07T06:18:14Z","links":{"resolver":"https://pith.science/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3","bundle":"https://pith.science/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3/bundle.json","state":"https://pith.science/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VDKRUZ6YZXJEF4G3LZIFPLWBP3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:VDKRUZ6YZXJEF4G3LZIFPLWBP3","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":"4ef1fdb472391f4044cdcb74cdf5b77d0b81448ebd73174f1ead83c07304e8dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-09-24T06:50:27Z","title_canon_sha256":"6cbf0b57a16b5d907f8f9d7bfef506f412ea432b96559da711841d7e99511be4"},"schema_version":"1.0","source":{"id":"2009.11514","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2009.11514","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"arxiv_version","alias_value":"2009.11514v1","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.11514","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_12","alias_value":"VDKRUZ6YZXJE","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_16","alias_value":"VDKRUZ6YZXJEF4G3","created_at":"2026-07-05T01:37:46Z"},{"alias_kind":"pith_short_8","alias_value":"VDKRUZ6Y","created_at":"2026-07-05T01:37:46Z"}],"graph_snapshots":[{"event_id":"sha256:b076bc7ee1efa68c8b69968903a50a519e1383b713222a10bf97511b589367b7","target":"graph","created_at":"2026-07-05T01:37:46Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2009.11514/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial $t(n)\\geq (1+\\varepsilon)n, \\varepsilon>0$, the following are equivalent:\n  - One-way functions exists (which in turn is equivalent to the existence of secure private-key encryption schemes, digital signatures, pseudorandom generators, pseudorandom functions, commitment schemes, and more);\n  - $t$-time bounded Kolmogorov Complexity, $K^t$, is mildly hard-on-average (i.e., there exists a polynomial $p(n)>0$ such that no PPT algorithm can compute $K^t$, for more than a $1-\\frac{1}{p(n)}$ fr","authors_text":"Rafael Pass, Yanyi Liu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-09-24T06:50:27Z","title":"On One-way Functions and Kolmogorov Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.11514","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:d32c3059fd6ff5b5998f4004174d567f3898fc90eed4a7d419078084373d847f","target":"record","created_at":"2026-07-05T01:37:46Z","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":"4ef1fdb472391f4044cdcb74cdf5b77d0b81448ebd73174f1ead83c07304e8dd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2020-09-24T06:50:27Z","title_canon_sha256":"6cbf0b57a16b5d907f8f9d7bfef506f412ea432b96559da711841d7e99511be4"},"schema_version":"1.0","source":{"id":"2009.11514","kind":"arxiv","version":1}},"canonical_sha256":"a8d51a67d8cdd242f0db5e5057aec17ece8cf9aca10722a23592b5e44448dd2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a8d51a67d8cdd242f0db5e5057aec17ece8cf9aca10722a23592b5e44448dd2f","first_computed_at":"2026-07-05T01:37:46.493033Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:37:46.493033Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TSbuGDDHW7eWpO03PdVxOPzONXLpYoKELJAonRSsPEzItb9trAhkU3CaOqBdg/967/XhRN59p2EGlFr8XNQ5Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:37:46.493503Z","signed_message":"canonical_sha256_bytes"},"source_id":"2009.11514","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d32c3059fd6ff5b5998f4004174d567f3898fc90eed4a7d419078084373d847f","sha256:b076bc7ee1efa68c8b69968903a50a519e1383b713222a10bf97511b589367b7"],"state_sha256":"34e9a710c68c5a1e15450366a1aa95923475f5fa82ec990b047eabe08bc73efc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fx5+/MToLESFuY1Eo5Bxu7Mu6IsBTFLPYPIpAgMVQrHW10lY9lISeo4QBAb6/CnjWiNpNHT4RP9HAwYJpLZIDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T06:18:14.814288Z","bundle_sha256":"e6158d9ed805b01550b46caee30000e004e885fffb35b4072c1c6038cfab97c3"}}