{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:UQBMLX5NTGFYENCS23NVSVBYUO","short_pith_number":"pith:UQBMLX5N","canonical_record":{"source":{"id":"1109.6749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-09-30T08:34:31Z","cross_cats_sorted":[],"title_canon_sha256":"be53897732d560113ec5a80650430be232903d7f4e59ac03c69bc24a64b5b580","abstract_canon_sha256":"6d7c24ece2fa7ab52a4ecc474e664d76535379c0b7626e309e1742f1177bd9c9"},"schema_version":"1.0"},"canonical_sha256":"a402c5dfad998b823452d6db595438a3989a479925b229929c7267d49c47de2f","source":{"kind":"arxiv","id":"1109.6749","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6749","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6749v1","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6749","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"UQBMLX5NTGFY","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UQBMLX5NTGFYENCS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UQBMLX5N","created_at":"2026-05-18T12:26:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:UQBMLX5NTGFYENCS23NVSVBYUO","target":"record","payload":{"canonical_record":{"source":{"id":"1109.6749","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-09-30T08:34:31Z","cross_cats_sorted":[],"title_canon_sha256":"be53897732d560113ec5a80650430be232903d7f4e59ac03c69bc24a64b5b580","abstract_canon_sha256":"6d7c24ece2fa7ab52a4ecc474e664d76535379c0b7626e309e1742f1177bd9c9"},"schema_version":"1.0"},"canonical_sha256":"a402c5dfad998b823452d6db595438a3989a479925b229929c7267d49c47de2f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:52.556172Z","signature_b64":"yDSQuortg2nSwUVcaDw+Y47KhKiz5kBPlfpb3YFI74vLdqKaqhKIMxYU++mGbpOJLlqx0EtUFJAVYcKkBh0zCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a402c5dfad998b823452d6db595438a3989a479925b229929c7267d49c47de2f","last_reissued_at":"2026-05-18T04:11:52.555500Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:52.555500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.6749","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-18T04:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o2W4R01gBph1BL8UpJ8riE9xne/UBYphMZwvwcvhEH+RDrbRZ/WRluNmFyFGnwuZ6wW3UizHat09WLGqgB69BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:56:09.807644Z"},"content_sha256":"9a58301c0e2f3ea4de990f6a8162f71f6fed5efa39608be4d3321fedf1e3974b","schema_version":"1.0","event_id":"sha256:9a58301c0e2f3ea4de990f6a8162f71f6fed5efa39608be4d3321fedf1e3974b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:UQBMLX5NTGFYENCS23NVSVBYUO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Characterizing the strongly jump-traceable sets via randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Andre Nies, Denis Hirschfeldt, Noam Greenberg","submitted_at":"2011-09-30T08:34:31Z","abstract_excerpt":"We show that if a set $A$ is computable from every superlow 1-random set, then $A$ is strongly jump-traceable. This theorem shows that the computably enumerable (c.e.) strongly jump-traceable sets are exactly the c.e.\\ sets computable from every superlow 1-random set.\n  We also prove the analogous result for superhighness: a c.e.\\ set is strongly jump-traceable if and only if it is computable from every superhigh 1-random set.\n  Finally, we show that for each cost function $c$ with the limit condition there is a 1-random $\\Delta^0_2$ set $Y$ such that every c.e.\\ set $A \\le_T Y$ obeys $c$. To "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6749","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-18T04:11:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"R/EvroE5oKBUsZSYilS1aG1aaDJ1+XjIaLlpbB5OjwEzYzMlC2D3VVBsvwjEyfy0funYqIn7kQ1eySLvqiT9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:56:09.807981Z"},"content_sha256":"cb6ac4086579a5a3d0d70bbf783a8dbfa50e8cc04ccc1a365bd667ddb9e3ddd6","schema_version":"1.0","event_id":"sha256:cb6ac4086579a5a3d0d70bbf783a8dbfa50e8cc04ccc1a365bd667ddb9e3ddd6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQBMLX5NTGFYENCS23NVSVBYUO/bundle.json","state_url":"https://pith.science/pith/UQBMLX5NTGFYENCS23NVSVBYUO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQBMLX5NTGFYENCS23NVSVBYUO/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-01T15:56:09Z","links":{"resolver":"https://pith.science/pith/UQBMLX5NTGFYENCS23NVSVBYUO","bundle":"https://pith.science/pith/UQBMLX5NTGFYENCS23NVSVBYUO/bundle.json","state":"https://pith.science/pith/UQBMLX5NTGFYENCS23NVSVBYUO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQBMLX5NTGFYENCS23NVSVBYUO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:UQBMLX5NTGFYENCS23NVSVBYUO","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":"6d7c24ece2fa7ab52a4ecc474e664d76535379c0b7626e309e1742f1177bd9c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-09-30T08:34:31Z","title_canon_sha256":"be53897732d560113ec5a80650430be232903d7f4e59ac03c69bc24a64b5b580"},"schema_version":"1.0","source":{"id":"1109.6749","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.6749","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"arxiv_version","alias_value":"1109.6749v1","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6749","created_at":"2026-05-18T04:11:52Z"},{"alias_kind":"pith_short_12","alias_value":"UQBMLX5NTGFY","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_16","alias_value":"UQBMLX5NTGFYENCS","created_at":"2026-05-18T12:26:42Z"},{"alias_kind":"pith_short_8","alias_value":"UQBMLX5N","created_at":"2026-05-18T12:26:42Z"}],"graph_snapshots":[{"event_id":"sha256:cb6ac4086579a5a3d0d70bbf783a8dbfa50e8cc04ccc1a365bd667ddb9e3ddd6","target":"graph","created_at":"2026-05-18T04:11:52Z","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 show that if a set $A$ is computable from every superlow 1-random set, then $A$ is strongly jump-traceable. This theorem shows that the computably enumerable (c.e.) strongly jump-traceable sets are exactly the c.e.\\ sets computable from every superlow 1-random set.\n  We also prove the analogous result for superhighness: a c.e.\\ set is strongly jump-traceable if and only if it is computable from every superhigh 1-random set.\n  Finally, we show that for each cost function $c$ with the limit condition there is a 1-random $\\Delta^0_2$ set $Y$ such that every c.e.\\ set $A \\le_T Y$ obeys $c$. To ","authors_text":"Andre Nies, Denis Hirschfeldt, Noam Greenberg","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-09-30T08:34:31Z","title":"Characterizing the strongly jump-traceable sets via randomness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6749","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:9a58301c0e2f3ea4de990f6a8162f71f6fed5efa39608be4d3321fedf1e3974b","target":"record","created_at":"2026-05-18T04:11:52Z","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":"6d7c24ece2fa7ab52a4ecc474e664d76535379c0b7626e309e1742f1177bd9c9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2011-09-30T08:34:31Z","title_canon_sha256":"be53897732d560113ec5a80650430be232903d7f4e59ac03c69bc24a64b5b580"},"schema_version":"1.0","source":{"id":"1109.6749","kind":"arxiv","version":1}},"canonical_sha256":"a402c5dfad998b823452d6db595438a3989a479925b229929c7267d49c47de2f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a402c5dfad998b823452d6db595438a3989a479925b229929c7267d49c47de2f","first_computed_at":"2026-05-18T04:11:52.555500Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:11:52.555500Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yDSQuortg2nSwUVcaDw+Y47KhKiz5kBPlfpb3YFI74vLdqKaqhKIMxYU++mGbpOJLlqx0EtUFJAVYcKkBh0zCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:11:52.556172Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.6749","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9a58301c0e2f3ea4de990f6a8162f71f6fed5efa39608be4d3321fedf1e3974b","sha256:cb6ac4086579a5a3d0d70bbf783a8dbfa50e8cc04ccc1a365bd667ddb9e3ddd6"],"state_sha256":"c28877b791730dd0503408316ff51db3f7b67423edbcb37d1dae913d21e73fb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TClPjl3WR5jmMC1PkqdUwHCEKqISBvDcNURp60wHxWjs0TlEbQRja9cxi1FnsHY/vf4eYWMsItwix/8N77tYBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:56:09.809821Z","bundle_sha256":"24ade5f608b6f295f992bfc3ecfb734dd27705ba8e5a793bd4b4a4506d5913e0"}}