{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:IPFAWTLATDUEDWI5IB6ASWCSTX","short_pith_number":"pith:IPFAWTLA","canonical_record":{"source":{"id":"2501.16723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-01-28T06:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"d07b02733ca1b545e199f10d88c53a2c3435dc0a7852ab659146eec15b6bde3d","abstract_canon_sha256":"b4921308fe8cc725bfcefe54bdeb1aad058cb9a77f98c086cf0b8bfff666a820"},"schema_version":"1.0"},"canonical_sha256":"43ca0b4d6098e841d91d407c0958529de404a3d344fefabb7259421e35cef3d1","source":{"kind":"arxiv","id":"2501.16723","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16723","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16723v2","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16723","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"pith_short_12","alias_value":"IPFAWTLATDUE","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"pith_short_16","alias_value":"IPFAWTLATDUEDWI5","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"pith_short_8","alias_value":"IPFAWTLA","created_at":"2026-07-05T10:21:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:IPFAWTLATDUEDWI5IB6ASWCSTX","target":"record","payload":{"canonical_record":{"source":{"id":"2501.16723","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-01-28T06:01:44Z","cross_cats_sorted":[],"title_canon_sha256":"d07b02733ca1b545e199f10d88c53a2c3435dc0a7852ab659146eec15b6bde3d","abstract_canon_sha256":"b4921308fe8cc725bfcefe54bdeb1aad058cb9a77f98c086cf0b8bfff666a820"},"schema_version":"1.0"},"canonical_sha256":"43ca0b4d6098e841d91d407c0958529de404a3d344fefabb7259421e35cef3d1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:21:06.577733Z","signature_b64":"/4LWKuB4C6x6OJeylWtzVEHvEEphP/ekwbECJN97qUQTUD3U1sId+zWaZk8sk3PJaYgnqUWHIX+nuL6iplwMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43ca0b4d6098e841d91d407c0958529de404a3d344fefabb7259421e35cef3d1","last_reissued_at":"2026-07-05T10:21:06.577211Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:21:06.577211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2501.16723","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-07-05T10:21:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dd/2gT4CFFivutx06hsJa8ap6ftxT0J1nKLGBPJmtHSS3fIWcCiQnaElAd1R0BeP0oB7pqTlO/G7esPGX3OGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:53:06.877998Z"},"content_sha256":"abd7d371affae736c8b7058cb61f415a596103adec471c0d03768a33e76a5099","schema_version":"1.0","event_id":"sha256:abd7d371affae736c8b7058cb61f415a596103adec471c0d03768a33e76a5099"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:IPFAWTLATDUEDWI5IB6ASWCSTX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Almost primes and primes that are sums of two squares plus one","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Kunjakanan Nath, Likun Xie","submitted_at":"2025-01-28T06:01:44Z","abstract_excerpt":"In this paper, we obtain a lower bound for the number of primes $p\\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and a linear sieve."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16723","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/2501.16723/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-07-05T10:21:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaf8yZMmh8/LN5FZh2ktCWht1HGK0D3FpZkdYSBA+KUNekN9LQujPfZ6cpkMoAXuA57ixLNrPICbEgEFBj+FDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T12:53:06.879176Z"},"content_sha256":"446296cda4ef503f97fefabde819ffa4aeef851b0495d020a61be4db71b03deb","schema_version":"1.0","event_id":"sha256:446296cda4ef503f97fefabde819ffa4aeef851b0495d020a61be4db71b03deb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IPFAWTLATDUEDWI5IB6ASWCSTX/bundle.json","state_url":"https://pith.science/pith/IPFAWTLATDUEDWI5IB6ASWCSTX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IPFAWTLATDUEDWI5IB6ASWCSTX/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-08-11T12:53:06Z","links":{"resolver":"https://pith.science/pith/IPFAWTLATDUEDWI5IB6ASWCSTX","bundle":"https://pith.science/pith/IPFAWTLATDUEDWI5IB6ASWCSTX/bundle.json","state":"https://pith.science/pith/IPFAWTLATDUEDWI5IB6ASWCSTX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IPFAWTLATDUEDWI5IB6ASWCSTX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:IPFAWTLATDUEDWI5IB6ASWCSTX","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":"b4921308fe8cc725bfcefe54bdeb1aad058cb9a77f98c086cf0b8bfff666a820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-01-28T06:01:44Z","title_canon_sha256":"d07b02733ca1b545e199f10d88c53a2c3435dc0a7852ab659146eec15b6bde3d"},"schema_version":"1.0","source":{"id":"2501.16723","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2501.16723","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"arxiv_version","alias_value":"2501.16723v2","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.16723","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"pith_short_12","alias_value":"IPFAWTLATDUE","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"pith_short_16","alias_value":"IPFAWTLATDUEDWI5","created_at":"2026-07-05T10:21:06Z"},{"alias_kind":"pith_short_8","alias_value":"IPFAWTLA","created_at":"2026-07-05T10:21:06Z"}],"graph_snapshots":[{"event_id":"sha256:446296cda4ef503f97fefabde819ffa4aeef851b0495d020a61be4db71b03deb","target":"graph","created_at":"2026-07-05T10:21:06Z","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/2501.16723/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In this paper, we obtain a lower bound for the number of primes $p\\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and a linear sieve.","authors_text":"Kunjakanan Nath, Likun Xie","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-01-28T06:01:44Z","title":"Almost primes and primes that are sums of two squares plus one"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.16723","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:abd7d371affae736c8b7058cb61f415a596103adec471c0d03768a33e76a5099","target":"record","created_at":"2026-07-05T10:21:06Z","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":"b4921308fe8cc725bfcefe54bdeb1aad058cb9a77f98c086cf0b8bfff666a820","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2025-01-28T06:01:44Z","title_canon_sha256":"d07b02733ca1b545e199f10d88c53a2c3435dc0a7852ab659146eec15b6bde3d"},"schema_version":"1.0","source":{"id":"2501.16723","kind":"arxiv","version":2}},"canonical_sha256":"43ca0b4d6098e841d91d407c0958529de404a3d344fefabb7259421e35cef3d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"43ca0b4d6098e841d91d407c0958529de404a3d344fefabb7259421e35cef3d1","first_computed_at":"2026-07-05T10:21:06.577211Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:21:06.577211Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/4LWKuB4C6x6OJeylWtzVEHvEEphP/ekwbECJN97qUQTUD3U1sId+zWaZk8sk3PJaYgnqUWHIX+nuL6iplwMDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T10:21:06.577733Z","signed_message":"canonical_sha256_bytes"},"source_id":"2501.16723","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:abd7d371affae736c8b7058cb61f415a596103adec471c0d03768a33e76a5099","sha256:446296cda4ef503f97fefabde819ffa4aeef851b0495d020a61be4db71b03deb"],"state_sha256":"7008597b45551266e2906310ea5d73392ae311bef3cefa3c1ba199b47d508749"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sn/Z0z7xpjraiZAdK2cXgcvVpUZ1T7nKWJW8kKBMX/F+q955Tmy51kZILyGUEFor+K8yXAcndcgYXMS1yschAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T12:53:06.888782Z","bundle_sha256":"31f1d1989c6591a9e7294f13def5a2376ce95e8d7f549147703a201c59fd07ed"}}