{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:PYIMLMCT23NW5ZKBTJFINDJZVB","short_pith_number":"pith:PYIMLMCT","schema_version":"1.0","canonical_sha256":"7e10c5b053d6db6ee5419a4a868d39a865cf64ffa4418eef29e63cac7928c4a4","source":{"kind":"arxiv","id":"1305.5514","version":1},"attestation_state":"computed","paper":{"title":"Computing K-Trivial Sets by Incomplete Random Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Adam R. Day, Andr\\'e Nies, Anton\\'in Ku\\v{c}era, Dan Turetsky, Joseph S. Miller, Laurent Bienvenu, Noam Greenberg","submitted_at":"2013-05-23T18:38:54Z","abstract_excerpt":"Every K-trivial set is computable from an incomplete Martin-L\\\"of random set, i.e., a Martin-L\\\"of random set that does not compute 0'."},"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":"1305.5514","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2013-05-23T18:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"a11bdfa6e6a68389b0ed752a18b5258d0bd26b02edbc023d4a31b7e72c2e4071","abstract_canon_sha256":"530483e0fbe414bf99189c1b7a1937ffeb20a1e9e077bacc63d40a1f31ddc4ac"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:25:04.598942Z","signature_b64":"NYkxtN2Uk41DDSXgrKqtiYLOZCsW8GtRouLvty+ILhq9bOYdBzCu2ggmJfFRPipNRvHNIWevidE8DNvplFOlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e10c5b053d6db6ee5419a4a868d39a865cf64ffa4418eef29e63cac7928c4a4","last_reissued_at":"2026-05-18T03:25:04.598196Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:25:04.598196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing K-Trivial Sets by Incomplete Random Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Adam R. Day, Andr\\'e Nies, Anton\\'in Ku\\v{c}era, Dan Turetsky, Joseph S. Miller, Laurent Bienvenu, Noam Greenberg","submitted_at":"2013-05-23T18:38:54Z","abstract_excerpt":"Every K-trivial set is computable from an incomplete Martin-L\\\"of random set, i.e., a Martin-L\\\"of random set that does not compute 0'."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5514","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1305.5514","created_at":"2026-05-18T03:25:04.598298+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5514v1","created_at":"2026-05-18T03:25:04.598298+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5514","created_at":"2026-05-18T03:25:04.598298+00:00"},{"alias_kind":"pith_short_12","alias_value":"PYIMLMCT23NW","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"PYIMLMCT23NW5ZKB","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"PYIMLMCT","created_at":"2026-05-18T12:27:57.521954+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/PYIMLMCT23NW5ZKBTJFINDJZVB","json":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB.json","graph_json":"https://pith.science/api/pith-number/PYIMLMCT23NW5ZKBTJFINDJZVB/graph.json","events_json":"https://pith.science/api/pith-number/PYIMLMCT23NW5ZKBTJFINDJZVB/events.json","paper":"https://pith.science/paper/PYIMLMCT"},"agent_actions":{"view_html":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB","download_json":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB.json","view_paper":"https://pith.science/paper/PYIMLMCT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5514&json=true","fetch_graph":"https://pith.science/api/pith-number/PYIMLMCT23NW5ZKBTJFINDJZVB/graph.json","fetch_events":"https://pith.science/api/pith-number/PYIMLMCT23NW5ZKBTJFINDJZVB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB/action/storage_attestation","attest_author":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB/action/author_attestation","sign_citation":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB/action/citation_signature","submit_replication":"https://pith.science/pith/PYIMLMCT23NW5ZKBTJFINDJZVB/action/replication_record"}},"created_at":"2026-05-18T03:25:04.598298+00:00","updated_at":"2026-05-18T03:25:04.598298+00:00"}