{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1996:HFQPFKEMJGWWYE4G6R3JMDZVDF","short_pith_number":"pith:HFQPFKEM","schema_version":"1.0","canonical_sha256":"3960f2a88c49ad6c1386f476960f351943844734d87261012f087d3412fde827","source":{"kind":"arxiv","id":"math/9608203","version":1},"attestation_state":"computed","paper":{"title":"Determinacy and \\Delta^1_3-degrees","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Philip Welch","submitted_at":"1996-08-06T00:00:00Z","abstract_excerpt":"Let D = { d_n } be a countable collection of Delta^1_3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have ``sharps''), we prove that either D has  a Delta^1_3-minimal upper bound, or that for any n, and for every real r recursive in d_n, games in the pointclasses Delta^1_2(r) are determined. This is proven using Core Model theory."},"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":"math/9608203","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.LO","submitted_at":"1996-08-06T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"30a21c17cde4430344329a6c7614582e99aa7fcf59be5d1152d11601bae912f8","abstract_canon_sha256":"3058565f928fcac85b79d51af38a22fcbb06c12a777bb1f10431d7ef1817a098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:47.134923Z","signature_b64":"TstfloKm9KaYIot7Lw7vDj7vsttedU0TleH+ioAf4YhmZNXhTjZGwjE3bP/zpFUyM66VUg3X9ZPTgHGUmqLaDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3960f2a88c49ad6c1386f476960f351943844734d87261012f087d3412fde827","last_reissued_at":"2026-05-18T01:05:47.134378Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:47.134378Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Determinacy and \\Delta^1_3-degrees","license":"","headline":"","cross_cats":[],"primary_cat":"math.LO","authors_text":"Philip Welch","submitted_at":"1996-08-06T00:00:00Z","abstract_excerpt":"Let D = { d_n } be a countable collection of Delta^1_3 degrees. Assuming that all co-analytic games on integers are determined (or equivalently that all reals have ``sharps''), we prove that either D has  a Delta^1_3-minimal upper bound, or that for any n, and for every real r recursive in d_n, games in the pointclasses Delta^1_2(r) are determined. This is proven using Core Model theory."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9608203","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":"math/9608203","created_at":"2026-05-18T01:05:47.134459+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9608203v1","created_at":"2026-05-18T01:05:47.134459+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9608203","created_at":"2026-05-18T01:05:47.134459+00:00"},{"alias_kind":"pith_short_12","alias_value":"HFQPFKEMJGWW","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_16","alias_value":"HFQPFKEMJGWWYE4G","created_at":"2026-05-18T12:25:47.700082+00:00"},{"alias_kind":"pith_short_8","alias_value":"HFQPFKEM","created_at":"2026-05-18T12:25:47.700082+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/HFQPFKEMJGWWYE4G6R3JMDZVDF","json":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF.json","graph_json":"https://pith.science/api/pith-number/HFQPFKEMJGWWYE4G6R3JMDZVDF/graph.json","events_json":"https://pith.science/api/pith-number/HFQPFKEMJGWWYE4G6R3JMDZVDF/events.json","paper":"https://pith.science/paper/HFQPFKEM"},"agent_actions":{"view_html":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF","download_json":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF.json","view_paper":"https://pith.science/paper/HFQPFKEM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9608203&json=true","fetch_graph":"https://pith.science/api/pith-number/HFQPFKEMJGWWYE4G6R3JMDZVDF/graph.json","fetch_events":"https://pith.science/api/pith-number/HFQPFKEMJGWWYE4G6R3JMDZVDF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF/action/storage_attestation","attest_author":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF/action/author_attestation","sign_citation":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF/action/citation_signature","submit_replication":"https://pith.science/pith/HFQPFKEMJGWWYE4G6R3JMDZVDF/action/replication_record"}},"created_at":"2026-05-18T01:05:47.134459+00:00","updated_at":"2026-05-18T01:05:47.134459+00:00"}