{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:5HHCIS66MYTLDIZDRY4YNANRHI","short_pith_number":"pith:5HHCIS66","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"},"canonical_sha256":"e9ce244bde6626b1a3238e398681b13a10260d49888970d79342f8aad4c9ca4e","source":{"kind":"arxiv","id":"2603.10356","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.10356","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2603.10356v2","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.10356","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"5HHCIS66MYTL","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"5HHCIS66MYTLDIZD","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"5HHCIS66","created_at":"2026-05-20T01:05:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:5HHCIS66MYTLDIZDRY4YNANRHI","target":"record","payload":{"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"},"canonical_sha256":"e9ce244bde6626b1a3238e398681b13a10260d49888970d79342f8aad4c9ca4e","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"},"source_kind":"arxiv","source_id":"2603.10356","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XKgFJY+yxCn4KhBChX0nsjP5ydiOte0hhKa8aAvwJRszHjVnLb3MkuYWmF32gsD24m+2d8zUlrBVVlNJQ6N4CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:48:53.150890Z"},"content_sha256":"9f7e95089ac0998d57b5a1cc8ea7324310996316574e8a3e5bb083c7c4bedfbf","schema_version":"1.0","event_id":"sha256:9f7e95089ac0998d57b5a1cc8ea7324310996316574e8a3e5bb083c7c4bedfbf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:5HHCIS66MYTLDIZDRY4YNANRHI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T01:05:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"J67dOCvqe/mK6nLYDKt0+ahZokX7Dz4U5UjIUHsBU9+2lm+GB0dPeW44S6M7RQWe3hbq6tIQXXpwVF74l9MSDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T14:48:53.151546Z"},"content_sha256":"1244323207175a507e5d68e7b3a812a717720c35435bd3286e4a91ba35336a58","schema_version":"1.0","event_id":"sha256:1244323207175a507e5d68e7b3a812a717720c35435bd3286e4a91ba35336a58"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/bundle.json","state_url":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HHCIS66MYTLDIZDRY4YNANRHI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-22T14:48:53Z","links":{"resolver":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI","bundle":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/bundle.json","state":"https://pith.science/pith/5HHCIS66MYTLDIZDRY4YNANRHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HHCIS66MYTLDIZDRY4YNANRHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:5HHCIS66MYTLDIZDRY4YNANRHI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"913a018c64432c0a6febe31010f080bda731bf8527c6c46abfb031f58d90d95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-11T03:10:12Z","title_canon_sha256":"7391334930276f17d86dd1fd4ff8c7823990ddb9c1e886e12919eeece9157874"},"schema_version":"1.0","source":{"id":"2603.10356","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2603.10356","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"arxiv_version","alias_value":"2603.10356v2","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2603.10356","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"pith_short_12","alias_value":"5HHCIS66MYTL","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"pith_short_16","alias_value":"5HHCIS66MYTLDIZD","created_at":"2026-05-20T01:05:10Z"},{"alias_kind":"pith_short_8","alias_value":"5HHCIS66","created_at":"2026-05-20T01:05:10Z"}],"graph_snapshots":[{"event_id":"sha256:1244323207175a507e5d68e7b3a812a717720c35435bd3286e4a91ba35336a58","target":"graph","created_at":"2026-05-20T01:05:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2603.10356/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}$,","authors_text":"Peter J. Campbell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-11T03:10:12Z","title":"On the Existence of Integers with at Most 3 Prime Factors Between Every Pair of Consecutive Squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2603.10356","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9f7e95089ac0998d57b5a1cc8ea7324310996316574e8a3e5bb083c7c4bedfbf","target":"record","created_at":"2026-05-20T01:05:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"913a018c64432c0a6febe31010f080bda731bf8527c6c46abfb031f58d90d95a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2026-03-11T03:10:12Z","title_canon_sha256":"7391334930276f17d86dd1fd4ff8c7823990ddb9c1e886e12919eeece9157874"},"schema_version":"1.0","source":{"id":"2603.10356","kind":"arxiv","version":2}},"canonical_sha256":"e9ce244bde6626b1a3238e398681b13a10260d49888970d79342f8aad4c9ca4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9ce244bde6626b1a3238e398681b13a10260d49888970d79342f8aad4c9ca4e","first_computed_at":"2026-05-20T01:05:10.708505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T01:05:10.708505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bsZZo2NvuiMPOtzNZZijBCtL+agSjTsDKGoyOZKSNbl9X9VVxuShn96ixtFtEC5/HmZiX8MKOmQtZqCmI3oFCg==","signature_status":"signed_v1","signed_at":"2026-05-20T01:05:10.709579Z","signed_message":"canonical_sha256_bytes"},"source_id":"2603.10356","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9f7e95089ac0998d57b5a1cc8ea7324310996316574e8a3e5bb083c7c4bedfbf","sha256:1244323207175a507e5d68e7b3a812a717720c35435bd3286e4a91ba35336a58"],"state_sha256":"5f6db0ffb2aa454674f6097ed959df0ed772b898926017107945cd106fccb653"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZmXaAttOAl8vCT3Ao+JXHR9OCiKSMifTkQvdmCsqDgtD57wLAb7zohy7+ownEPEtdaaQIEB/67epqWT9oWQODw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T14:48:53.155079Z","bundle_sha256":"85a525b05e575db0139e38fdb10008dba81ccea8d916a4e8ee07851bfa61aa56"}}