{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:WTDQNCLTSJUUEVRPPVGE5PXAVM","short_pith_number":"pith:WTDQNCLT","schema_version":"1.0","canonical_sha256":"b4c7068973926942562f7d4c4ebee0ab22711054eba1677b5606e2fcdcd117f0","source":{"kind":"arxiv","id":"1107.1458","version":9},"attestation_state":"computed","paper":{"title":"Sets Have Simple Members","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Leonid A. Levin, Samuel Epstein","submitted_at":"2011-07-07T17:19:53Z","abstract_excerpt":"The combined Universal Probability M(D) of strings x in sets D is close to max M({x}) over x in D: their ~logs differ by at most D's information j=I(D:H) about the halting sequence H. Thus if all x have complexity K(x) >k, D carries >i bits of information on each its x where i+j ~ k. Note that there are no ways to generate D with significant I(D:H)."},"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":"1107.1458","kind":"arxiv","version":9},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2011-07-07T17:19:53Z","cross_cats_sorted":[],"title_canon_sha256":"1892642d9afcade7d292e65ff45d589183442007932ac2cdaa48ac966d64c15b","abstract_canon_sha256":"4b832049cfbe8ba4f73be4b2ceb67ac59f4bf5ac1cfb054d990658fcac433bd9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:04.165558Z","signature_b64":"LONmnTKjMAg8fJ0wTyxcQcsEw1+DAvKQGRYl+ljF5gat0gGE+j/QHbimZ4dKFOmPnmzAtdFCrlCpmFeorsNQBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4c7068973926942562f7d4c4ebee0ab22711054eba1677b5606e2fcdcd117f0","last_reissued_at":"2026-05-18T02:56:04.164993Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:04.164993Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sets Have Simple Members","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Leonid A. Levin, Samuel Epstein","submitted_at":"2011-07-07T17:19:53Z","abstract_excerpt":"The combined Universal Probability M(D) of strings x in sets D is close to max M({x}) over x in D: their ~logs differ by at most D's information j=I(D:H) about the halting sequence H. Thus if all x have complexity K(x) >k, D carries >i bits of information on each its x where i+j ~ k. Note that there are no ways to generate D with significant I(D:H)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.1458","kind":"arxiv","version":9},"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":"1107.1458","created_at":"2026-05-18T02:56:04.165104+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.1458v9","created_at":"2026-05-18T02:56:04.165104+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.1458","created_at":"2026-05-18T02:56:04.165104+00:00"},{"alias_kind":"pith_short_12","alias_value":"WTDQNCLTSJUU","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"WTDQNCLTSJUUEVRP","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"WTDQNCLT","created_at":"2026-05-18T12:26:44.992195+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/WTDQNCLTSJUUEVRPPVGE5PXAVM","json":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM.json","graph_json":"https://pith.science/api/pith-number/WTDQNCLTSJUUEVRPPVGE5PXAVM/graph.json","events_json":"https://pith.science/api/pith-number/WTDQNCLTSJUUEVRPPVGE5PXAVM/events.json","paper":"https://pith.science/paper/WTDQNCLT"},"agent_actions":{"view_html":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM","download_json":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM.json","view_paper":"https://pith.science/paper/WTDQNCLT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.1458&json=true","fetch_graph":"https://pith.science/api/pith-number/WTDQNCLTSJUUEVRPPVGE5PXAVM/graph.json","fetch_events":"https://pith.science/api/pith-number/WTDQNCLTSJUUEVRPPVGE5PXAVM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM/action/storage_attestation","attest_author":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM/action/author_attestation","sign_citation":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM/action/citation_signature","submit_replication":"https://pith.science/pith/WTDQNCLTSJUUEVRPPVGE5PXAVM/action/replication_record"}},"created_at":"2026-05-18T02:56:04.165104+00:00","updated_at":"2026-05-18T02:56:04.165104+00:00"}