{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5HHCIS66MYTLDIZDRY4YNANRHI","short_pith_number":"pith:5HHCIS66","schema_version":"1.0","canonical_sha256":"e9ce244bde6626b1a3238e398681b13a10260d49888970d79342f8aad4c9ca4e","source":{"kind":"arxiv","id":"2603.10356","version":2},"attestation_state":"computed","paper":{"title":"On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Peter J. Campbell","submitted_at":"2026-03-11T03:10:12Z","abstract_excerpt":"We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \\geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the previous best result of Dudek and Johnston, who showed that every such interval contains an integer with at most $4$ prime factors. The proof is divided into two ranges. For $n^2 \\leq 10^{31}$, we use prior computational results on primes in short intervals between consecutive squares, together with explicit bounds on maximal prime gaps. For $n^2 > 10^{31}$,"},"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":"2603.10356","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-11T03:10:12Z","cross_cats_sorted":[],"title_canon_sha256":"7391334930276f17d86dd1fd4ff8c7823990ddb9c1e886e12919eeece9157874","abstract_canon_sha256":"913a018c64432c0a6febe31010f080bda731bf8527c6c46abfb031f58d90d95a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:05:10.709579Z","signature_b64":"bsZZo2NvuiMPOtzNZZijBCtL+agSjTsDKGoyOZKSNbl9X9VVxuShn96ixtFtEC5/HmZiX8MKOmQtZqCmI3oFCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9ce244bde6626b1a3238e398681b13a10260d49888970d79342f8aad4c9ca4e","last_reissued_at":"2026-05-20T01:05:10.708505Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:05:10.708505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Peter J. Campbell","submitted_at":"2026-03-11T03:10:12Z","abstract_excerpt":"We prove an explicit analogue of Legendre's conjecture for almost primes. Namely, for every integer $n \\geq 1$, the interval $(n^2,(n+1)^2)$ contains an integer having at most $3$ prime factors, counted with multiplicity. This improves the previous best result of Dudek and Johnston, who showed that every such interval contains an integer with at most $4$ prime factors. The proof is divided into two ranges. For $n^2 \\leq 10^{31}$, we use prior computational results on primes in short intervals between consecutive squares, together with explicit bounds on maximal prime gaps. For $n^2 > 10^{31}$,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.10356","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2603.10356/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2603.10356","created_at":"2026-05-20T01:05:10.708688+00:00"},{"alias_kind":"arxiv_version","alias_value":"2603.10356v2","created_at":"2026-05-20T01:05:10.708688+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.10356","created_at":"2026-05-20T01:05:10.708688+00:00"},{"alias_kind":"pith_short_12","alias_value":"5HHCIS66MYTL","created_at":"2026-05-20T01:05:10.708688+00:00"},{"alias_kind":"pith_short_16","alias_value":"5HHCIS66MYTLDIZD","created_at":"2026-05-20T01:05:10.708688+00:00"},{"alias_kind":"pith_short_8","alias_value":"5HHCIS66","created_at":"2026-05-20T01:05:10.708688+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.21529","citing_title":"A Matrix-Theoretic Exact Formula for Counting Primes in Intervals Between Consecutive Odd Squares","ref_index":6,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI","json":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI.json","graph_json":"https://pith.science/api/pith-number/5HHCIS66MYTLDIZDRY4YNANRHI/graph.json","events_json":"https://pith.science/api/pith-number/5HHCIS66MYTLDIZDRY4YNANRHI/events.json","paper":"https://pith.science/paper/5HHCIS66"},"agent_actions":{"view_html":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI","download_json":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI.json","view_paper":"https://pith.science/paper/5HHCIS66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2603.10356&json=true","fetch_graph":"https://pith.science/api/pith-number/5HHCIS66MYTLDIZDRY4YNANRHI/graph.json","fetch_events":"https://pith.science/api/pith-number/5HHCIS66MYTLDIZDRY4YNANRHI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/action/storage_attestation","attest_author":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/action/author_attestation","sign_citation":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/action/citation_signature","submit_replication":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/action/replication_record"}},"created_at":"2026-05-20T01:05:10.708688+00:00","updated_at":"2026-05-20T01:05:10.708688+00:00"}