{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JDS2MKLPP7HLIKWCV2FYOKZZTV","short_pith_number":"pith:JDS2MKLP","canonical_record":{"source":{"id":"1709.08792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-09-26T02:43:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e45f52e09a075e551ad665ca9b8d54729a08974ec0775c427b2589577bcd63aa","abstract_canon_sha256":"4ab891d9530048a8bf10dcb28d1707021f74b5efc0343e97ac620e9d33d25246"},"schema_version":"1.0"},"canonical_sha256":"48e5a6296f7fceb42ac2ae8b872b399d4c0041a338b90ecfe75baf8029f27fd9","source":{"kind":"arxiv","id":"1709.08792","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08792","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08792v1","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08792","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"pith_short_12","alias_value":"JDS2MKLPP7HL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JDS2MKLPP7HLIKWC","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JDS2MKLP","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JDS2MKLPP7HLIKWCV2FYOKZZTV","target":"record","payload":{"canonical_record":{"source":{"id":"1709.08792","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-09-26T02:43:01Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e45f52e09a075e551ad665ca9b8d54729a08974ec0775c427b2589577bcd63aa","abstract_canon_sha256":"4ab891d9530048a8bf10dcb28d1707021f74b5efc0343e97ac620e9d33d25246"},"schema_version":"1.0"},"canonical_sha256":"48e5a6296f7fceb42ac2ae8b872b399d4c0041a338b90ecfe75baf8029f27fd9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:21.866408Z","signature_b64":"baSVugBM3AML0ECI4GtPALit3Ujbx55E5uI5cSASk48ZQruyN98z/16MmBOueVHvHfqX1ke17mLc1vl44lC0Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48e5a6296f7fceb42ac2ae8b872b399d4c0041a338b90ecfe75baf8029f27fd9","last_reissued_at":"2026-05-18T00:34:21.865891Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:21.865891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.08792","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:34:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PaoW/yasS52aQvvgPWic53A8Acdk3D1OrG9TYkmd74h5eLCB2g16rpPu0nz9QEFZ7cy2WUwGyIfCJarumIyIAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:55:59.097746Z"},"content_sha256":"5bd07e1874cacf7e3b2950d121417df1f5c438e0f3e133f96afaeb134a81f26e","schema_version":"1.0","event_id":"sha256:5bd07e1874cacf7e3b2950d121417df1f5c438e0f3e133f96afaeb134a81f26e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JDS2MKLPP7HLIKWCV2FYOKZZTV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Closure of resource-bounded randomness notions under polynomial time permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"math.LO","authors_text":"Andre Nies, Frank Stephan","submitted_at":"2017-09-26T02:43:01Z","abstract_excerpt":"An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive randomness is closed under computable permutations. We investigate analogous statements for randomness notions defined by betting strategies that are computable within resource bounds. Suppose that S is a polynomial time computable permutation of the set of strings over the unary alphabet (identified with N). If the inverse of S is not polynomially bounded, it is easy to build a polynomial time random bit sequence Z su"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08792","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:34:21Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nhfjxfIsB1c5X0LFqiXwAwqMqLFSYq9F8XlFa9EnbwtFm/VopKOsDdHQ2GKhOLdXHz/Qt37eM3aPlmZ5Ch6RDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T21:55:59.098363Z"},"content_sha256":"919d51d97118eb2c9adabb48eb59433974933907e27b3206de805811e35413d5","schema_version":"1.0","event_id":"sha256:919d51d97118eb2c9adabb48eb59433974933907e27b3206de805811e35413d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV/bundle.json","state_url":"https://pith.science/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV/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-05-27T21:55:59Z","links":{"resolver":"https://pith.science/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV","bundle":"https://pith.science/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV/bundle.json","state":"https://pith.science/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDS2MKLPP7HLIKWCV2FYOKZZTV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JDS2MKLPP7HLIKWCV2FYOKZZTV","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":"4ab891d9530048a8bf10dcb28d1707021f74b5efc0343e97ac620e9d33d25246","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-09-26T02:43:01Z","title_canon_sha256":"e45f52e09a075e551ad665ca9b8d54729a08974ec0775c427b2589577bcd63aa"},"schema_version":"1.0","source":{"id":"1709.08792","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.08792","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"arxiv_version","alias_value":"1709.08792v1","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.08792","created_at":"2026-05-18T00:34:21Z"},{"alias_kind":"pith_short_12","alias_value":"JDS2MKLPP7HL","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JDS2MKLPP7HLIKWC","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JDS2MKLP","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:919d51d97118eb2c9adabb48eb59433974933907e27b3206de805811e35413d5","target":"graph","created_at":"2026-05-18T00:34:21Z","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":"An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is well-known that the property of recursive randomness is closed under computable permutations. We investigate analogous statements for randomness notions defined by betting strategies that are computable within resource bounds. Suppose that S is a polynomial time computable permutation of the set of strings over the unary alphabet (identified with N). If the inverse of S is not polynomially bounded, it is easy to build a polynomial time random bit sequence Z su","authors_text":"Andre Nies, Frank Stephan","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-09-26T02:43:01Z","title":"Closure of resource-bounded randomness notions under polynomial time permutations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.08792","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:5bd07e1874cacf7e3b2950d121417df1f5c438e0f3e133f96afaeb134a81f26e","target":"record","created_at":"2026-05-18T00:34:21Z","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":"4ab891d9530048a8bf10dcb28d1707021f74b5efc0343e97ac620e9d33d25246","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2017-09-26T02:43:01Z","title_canon_sha256":"e45f52e09a075e551ad665ca9b8d54729a08974ec0775c427b2589577bcd63aa"},"schema_version":"1.0","source":{"id":"1709.08792","kind":"arxiv","version":1}},"canonical_sha256":"48e5a6296f7fceb42ac2ae8b872b399d4c0041a338b90ecfe75baf8029f27fd9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48e5a6296f7fceb42ac2ae8b872b399d4c0041a338b90ecfe75baf8029f27fd9","first_computed_at":"2026-05-18T00:34:21.865891Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:34:21.865891Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"baSVugBM3AML0ECI4GtPALit3Ujbx55E5uI5cSASk48ZQruyN98z/16MmBOueVHvHfqX1ke17mLc1vl44lC0Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:34:21.866408Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.08792","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5bd07e1874cacf7e3b2950d121417df1f5c438e0f3e133f96afaeb134a81f26e","sha256:919d51d97118eb2c9adabb48eb59433974933907e27b3206de805811e35413d5"],"state_sha256":"2725e0960cb440fc775c0c8cd254d18099c1fac8e72ef919c912e7f693a3ba01"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Is27ap56N0NjvlIdRittxkVnLzv+rw7zkpJKA1hv1Goo/pSTv0ThBZF7Y126N0G0ngxuayY3YM91skRKw/4CAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T21:55:59.101642Z","bundle_sha256":"21574f7b948d9b4f363a2de3110ea804e0663968768df7c88106f78b3f8457d3"}}