{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VDZMSPH2GG3SWLLNCAYZIITKUV","short_pith_number":"pith:VDZMSPH2","schema_version":"1.0","canonical_sha256":"a8f2c93cfa31b72b2d6d103194226aa563c1aeaa5f19b4b6e3d1bc7521379e96","source":{"kind":"arxiv","id":"1310.6383","version":2},"attestation_state":"computed","paper":{"title":"The Frequent Paucity of Trivial Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jack H. Lutz","submitted_at":"2013-10-23T20:33:14Z","abstract_excerpt":"A 1976 theorem of Chaitin can be used to show that arbitrarily dense sets of lengths n have a paucity of trivial strings (only a bounded number of strings of length n having trivially low plain Kolmogorov complexities). We use the probabilistic method to give a new proof of this fact. This proof is much simpler than previously published proofs, and it gives a tighter paucity bound."},"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":"1310.6383","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-10-23T20:33:14Z","cross_cats_sorted":[],"title_canon_sha256":"666c91f424c24ad8bd1a15eec3188d573ef49216134ed273d458ae19236e9cd4","abstract_canon_sha256":"b0bfd26f6cd595d84fb701d8da91c98c2f8247a5e4a58fb8460b1f023f448ac3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:52:32.204058Z","signature_b64":"pE5PPUvT6z10JIoRdjClSe6gQVPeNvdB5ouiFFY7VrzSaSEqTJf4UsWCDWfNYTYs/aycPHHTjZVgoPsZyGzUCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8f2c93cfa31b72b2d6d103194226aa563c1aeaa5f19b4b6e3d1bc7521379e96","last_reissued_at":"2026-05-18T02:52:32.203207Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:52:32.203207Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Frequent Paucity of Trivial Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Jack H. Lutz","submitted_at":"2013-10-23T20:33:14Z","abstract_excerpt":"A 1976 theorem of Chaitin can be used to show that arbitrarily dense sets of lengths n have a paucity of trivial strings (only a bounded number of strings of length n having trivially low plain Kolmogorov complexities). We use the probabilistic method to give a new proof of this fact. This proof is much simpler than previously published proofs, and it gives a tighter paucity bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.6383","kind":"arxiv","version":2},"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":"1310.6383","created_at":"2026-05-18T02:52:32.203348+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.6383v2","created_at":"2026-05-18T02:52:32.203348+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.6383","created_at":"2026-05-18T02:52:32.203348+00:00"},{"alias_kind":"pith_short_12","alias_value":"VDZMSPH2GG3S","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VDZMSPH2GG3SWLLN","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VDZMSPH2","created_at":"2026-05-18T12:28:04.890932+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/VDZMSPH2GG3SWLLNCAYZIITKUV","json":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV.json","graph_json":"https://pith.science/api/pith-number/VDZMSPH2GG3SWLLNCAYZIITKUV/graph.json","events_json":"https://pith.science/api/pith-number/VDZMSPH2GG3SWLLNCAYZIITKUV/events.json","paper":"https://pith.science/paper/VDZMSPH2"},"agent_actions":{"view_html":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV","download_json":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV.json","view_paper":"https://pith.science/paper/VDZMSPH2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.6383&json=true","fetch_graph":"https://pith.science/api/pith-number/VDZMSPH2GG3SWLLNCAYZIITKUV/graph.json","fetch_events":"https://pith.science/api/pith-number/VDZMSPH2GG3SWLLNCAYZIITKUV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV/action/storage_attestation","attest_author":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV/action/author_attestation","sign_citation":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV/action/citation_signature","submit_replication":"https://pith.science/pith/VDZMSPH2GG3SWLLNCAYZIITKUV/action/replication_record"}},"created_at":"2026-05-18T02:52:32.203348+00:00","updated_at":"2026-05-18T02:52:32.203348+00:00"}