{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:ZMLJHR4SL53SJSP2LFN4724CII","short_pith_number":"pith:ZMLJHR4S","schema_version":"1.0","canonical_sha256":"cb1693c7925f7724c9fa595bcfeb82423dc3ecb5ec1a642051e663c3f68a565d","source":{"kind":"arxiv","id":"2605.15758","version":1},"attestation_state":"computed","paper":{"title":"Positive density for Sun's $2^k+m$ conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Natural numbers n that can be written as n = k + m with 2^k + m prime have positive asymptotic density at least 0.0734.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jinbo Yu, Songlin Han","submitted_at":"2026-05-15T09:18:26Z","abstract_excerpt":"In 2013, Zhi-Wei Sun proposed a Romanov-type conjecture stating that every integer $n > 1$ can be written as $n = k + m$ with $k, m \\ge 1$ such that $2^k + m$ is a prime. In this paper, we unconditionally prove that the natural numbers satisfying this property have a positive density. We compute this density to be at least $0.0734$. We also discuss the limitations of our method. Under a uniform Hardy-Littlewood prime pairs conjecture, we show that the lower bound of density obtained by this method cannot exceed $1/(\\log 2 + 1) \\approx 0.5906$."},"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":true,"formal_links_present":true},"canonical_record":{"source":{"id":"2605.15758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-05-15T09:18:26Z","cross_cats_sorted":[],"title_canon_sha256":"bd2144c4ad2c2dd4edae3ad8b936467f207459fb7535ddf5a0ff72a5426d2331","abstract_canon_sha256":"6cb171a026a822a9fc015b52c8dd4683213998c75a2f13a0e32c1a3e391b3961"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:16.693872Z","signature_b64":"XMITkL4EJSu8syUoNszq8523M027bfcKtpfH3yS8+xxSo5PXHchdMOMOinwhBwzCjyc36AXkgK7ypb+HL4kiCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb1693c7925f7724c9fa595bcfeb82423dc3ecb5ec1a642051e663c3f68a565d","last_reissued_at":"2026-05-20T00:01:16.693091Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:16.693091Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Positive density for Sun's $2^k+m$ conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Natural numbers n that can be written as n = k + m with 2^k + m prime have positive asymptotic density at least 0.0734.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Jinbo Yu, Songlin Han","submitted_at":"2026-05-15T09:18:26Z","abstract_excerpt":"In 2013, Zhi-Wei Sun proposed a Romanov-type conjecture stating that every integer $n > 1$ can be written as $n = k + m$ with $k, m \\ge 1$ such that $2^k + m$ is a prime. In this paper, we unconditionally prove that the natural numbers satisfying this property have a positive density. We compute this density to be at least $0.0734$. We also discuss the limitations of our method. Under a uniform Hardy-Littlewood prime pairs conjecture, we show that the lower bound of density obtained by this method cannot exceed $1/(\\log 2 + 1) \\approx 0.5906$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We unconditionally prove that the natural numbers satisfying this property have a positive density. We compute this density to be at least 0.0734.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analytic or sieve estimates used to obtain the unconditional lower bound of 0.0734 are valid and produce a strictly positive quantity (as asserted in the unconditional claim).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The set of n > 1 satisfying Sun's 2^k + m representation property has positive lower density at least 0.0734.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Natural numbers n that can be written as n = k + m with 2^k + m prime have positive asymptotic density at least 0.0734.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"03a467313349dc1d9322dece639bf17278bcedc7831ec53b4f4a82c8f22c8d57"},"source":{"id":"2605.15758","kind":"arxiv","version":1},"verdict":{"id":"d203b7e9-4f19-40bc-89e6-65066988d055","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:06:02.726941Z","strongest_claim":"We unconditionally prove that the natural numbers satisfying this property have a positive density. We compute this density to be at least 0.0734.","one_line_summary":"The set of n > 1 satisfying Sun's 2^k + m representation property has positive lower density at least 0.0734.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analytic or sieve estimates used to obtain the unconditional lower bound of 0.0734 are valid and produce a strictly positive quantity (as asserted in the unconditional claim).","pith_extraction_headline":"Natural numbers n that can be written as n = k + m with 2^k + m prime have positive asymptotic density at least 0.0734."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15758/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T22:31:19.659511Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:13:09.955034Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T17:33:48.764686Z","status":"skipped","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T17:21:55.958289Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"5386d899cd80e723f0a06eef40432a5856ecf068da21a764ab7fc7e2695ceff2"},"references":{"count":16,"sample":[{"doi":"","year":2021,"title":"Kevin Broughan,Bounded gaps between primes: The epic breakthroughs of the early twenty-first century, Cambridge University Press, Cambridge, 2021. MR 4412547","work_id":"6bb255c3-8745-47cb-9b3e-ffd68d52554d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2004,"title":"Yong-Gao Chen and Xue-Gong Sun,On Romanoff’s constant, Journal of Number Theory106(2004), no. 2, 275–284","work_id":"7639ff02-ab68-4deb-a6cf-e6b4507f8ea2","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1971,"title":"Roger Crocker,On the sum of a prime and of two powers of two, Pacific Journal of Mathematics36 (1971), no. 1, 103–107","work_id":"89d7d704-dab8-470b-889c-d167985ad149","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Christian Elsholtz and Jan-Christoph Schlage-Puchta,On Romanov’s constant, Mathematische Zeitschrift288(2018), no. 3-4, 713–724","work_id":"ab2f48b5-06fd-4e0c-85e7-9db48259a353","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1950,"title":"Paul Erdős,On integers of the form2k +pand some related problems, Summa Brasiliensis Mathe- maticae2(1950), no. 8, 113–123","work_id":"c79a5198-1447-44a1-a9ae-6d7e93201211","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":16,"snapshot_sha256":"7c47bde3cb03df284de408cd5b978b45f8e583e8fb2c2c21d78dc24871a7e5a4","internal_anchors":1},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0538f45964d83531bfd40988ce014841c66df39534eb14e855444d8823ed4e42"},"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":"2605.15758","created_at":"2026-05-20T00:01:16.693219+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.15758v1","created_at":"2026-05-20T00:01:16.693219+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15758","created_at":"2026-05-20T00:01:16.693219+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZMLJHR4SL53S","created_at":"2026-05-20T00:01:16.693219+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZMLJHR4SL53SJSP2","created_at":"2026-05-20T00:01:16.693219+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZMLJHR4S","created_at":"2026-05-20T00:01:16.693219+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":2,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII","json":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII.json","graph_json":"https://pith.science/api/pith-number/ZMLJHR4SL53SJSP2LFN4724CII/graph.json","events_json":"https://pith.science/api/pith-number/ZMLJHR4SL53SJSP2LFN4724CII/events.json","paper":"https://pith.science/paper/ZMLJHR4S"},"agent_actions":{"view_html":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII","download_json":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII.json","view_paper":"https://pith.science/paper/ZMLJHR4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.15758&json=true","fetch_graph":"https://pith.science/api/pith-number/ZMLJHR4SL53SJSP2LFN4724CII/graph.json","fetch_events":"https://pith.science/api/pith-number/ZMLJHR4SL53SJSP2LFN4724CII/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII/action/storage_attestation","attest_author":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII/action/author_attestation","sign_citation":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII/action/citation_signature","submit_replication":"https://pith.science/pith/ZMLJHR4SL53SJSP2LFN4724CII/action/replication_record"}},"created_at":"2026-05-20T00:01:16.693219+00:00","updated_at":"2026-05-20T00:01:16.693219+00:00"}