{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:2JY5HECCEVRZQMLH77HYOGV53H","short_pith_number":"pith:2JY5HECC","canonical_record":{"source":{"id":"1512.03213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-10T11:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"560436d71fe3ee4feaa475cc2cfc9189245ed67877741e538482fd46b7839de9","abstract_canon_sha256":"5a1525ed657ea83771225cdb140e69ba62d8d7c02f5e7d81a41a6d6192bf3339"},"schema_version":"1.0"},"canonical_sha256":"d271d390422563983167ffcf871abdd9d20d85bdafc74f2d1eb2ac088df6038a","source":{"kind":"arxiv","id":"1512.03213","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03213","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03213v2","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03213","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"pith_short_12","alias_value":"2JY5HECCEVRZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JY5HECCEVRZQMLH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JY5HECC","created_at":"2026-05-18T12:28:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:2JY5HECCEVRZQMLH77HYOGV53H","target":"record","payload":{"canonical_record":{"source":{"id":"1512.03213","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-10T11:08:16Z","cross_cats_sorted":[],"title_canon_sha256":"560436d71fe3ee4feaa475cc2cfc9189245ed67877741e538482fd46b7839de9","abstract_canon_sha256":"5a1525ed657ea83771225cdb140e69ba62d8d7c02f5e7d81a41a6d6192bf3339"},"schema_version":"1.0"},"canonical_sha256":"d271d390422563983167ffcf871abdd9d20d85bdafc74f2d1eb2ac088df6038a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:13.479463Z","signature_b64":"ZNPG1actUPr7DtcU6kFvwoXdQZh+OWWZUcFJ1h6Oiv8ju9XVW1rExEhkTlYZJ/mh9fufXsvij/ZgKQC88BOdDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d271d390422563983167ffcf871abdd9d20d85bdafc74f2d1eb2ac088df6038a","last_reissued_at":"2026-05-17T23:53:13.478707Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:13.478707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1512.03213","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-17T23:53:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yrSJ8pCmHxVyIcgPnx+RB4bL1QvztW/eX1IZltBXr4YPU02vUytPaKoWlZWUCfxuAg/ie3oGZ10ZFSDdJcMWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:44:12.682895Z"},"content_sha256":"700ffc42463e28a1cededeae7605839e1f840e22dbd79cd08dcfb0a0b5b421d3","schema_version":"1.0","event_id":"sha256:700ffc42463e28a1cededeae7605839e1f840e22dbd79cd08dcfb0a0b5b421d3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:2JY5HECCEVRZQMLH77HYOGV53H","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Vinogradov's three primes theorem with almost twin primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Kaisa Matom\\\"aki, Xuancheng Shao","submitted_at":"2015-12-10T11:08:16Z","abstract_excerpt":"In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1, p_2$ and $p_3$ such that, for each $i \\in \\{1,2,3\\}$, the interval $[p_i, p_i + H]$ contains at least $m$ primes, for some $H = H(m)$. Second, every sufficiently large integer $N \\equiv 3 \\pmod{6}$ can be written as a sum of three primes $p_1, p_2$ and $p_3$ such that, for each $i \\in \\{1,2,3\\}$, $p_i + 2$ has at most two prime factors."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03213","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":""},"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-17T23:53:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E9R3TR3NV2X70xHC9wlBZXZ3+J4I6tXCctkZkpBB6HlIKEcGVFdh3qt0qHGcDkT/Urx5nl94P+zZJTe27sE0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T13:44:12.683595Z"},"content_sha256":"1bc92a58b9661e1e67e0cfa6680a9b522aeeedffa123b9fa582ab9bbcab83982","schema_version":"1.0","event_id":"sha256:1bc92a58b9661e1e67e0cfa6680a9b522aeeedffa123b9fa582ab9bbcab83982"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2JY5HECCEVRZQMLH77HYOGV53H/bundle.json","state_url":"https://pith.science/pith/2JY5HECCEVRZQMLH77HYOGV53H/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2JY5HECCEVRZQMLH77HYOGV53H/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-25T13:44:12Z","links":{"resolver":"https://pith.science/pith/2JY5HECCEVRZQMLH77HYOGV53H","bundle":"https://pith.science/pith/2JY5HECCEVRZQMLH77HYOGV53H/bundle.json","state":"https://pith.science/pith/2JY5HECCEVRZQMLH77HYOGV53H/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2JY5HECCEVRZQMLH77HYOGV53H/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:2JY5HECCEVRZQMLH77HYOGV53H","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":"5a1525ed657ea83771225cdb140e69ba62d8d7c02f5e7d81a41a6d6192bf3339","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-10T11:08:16Z","title_canon_sha256":"560436d71fe3ee4feaa475cc2cfc9189245ed67877741e538482fd46b7839de9"},"schema_version":"1.0","source":{"id":"1512.03213","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1512.03213","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"arxiv_version","alias_value":"1512.03213v2","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.03213","created_at":"2026-05-17T23:53:13Z"},{"alias_kind":"pith_short_12","alias_value":"2JY5HECCEVRZ","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_16","alias_value":"2JY5HECCEVRZQMLH","created_at":"2026-05-18T12:28:59Z"},{"alias_kind":"pith_short_8","alias_value":"2JY5HECC","created_at":"2026-05-18T12:28:59Z"}],"graph_snapshots":[{"event_id":"sha256:1bc92a58b9661e1e67e0cfa6680a9b522aeeedffa123b9fa582ab9bbcab83982","target":"graph","created_at":"2026-05-17T23:53:13Z","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"},"paper":{"abstract_excerpt":"In this paper we prove two results concerning Vinogradov's three primes theorem with primes that can be called almost twin primes. First, for any $m$, every sufficiently large odd integer $N$ can be written as a sum of three primes $p_1, p_2$ and $p_3$ such that, for each $i \\in \\{1,2,3\\}$, the interval $[p_i, p_i + H]$ contains at least $m$ primes, for some $H = H(m)$. Second, every sufficiently large integer $N \\equiv 3 \\pmod{6}$ can be written as a sum of three primes $p_1, p_2$ and $p_3$ such that, for each $i \\in \\{1,2,3\\}$, $p_i + 2$ has at most two prime factors.","authors_text":"Kaisa Matom\\\"aki, Xuancheng Shao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-10T11:08:16Z","title":"Vinogradov's three primes theorem with almost twin primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.03213","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:700ffc42463e28a1cededeae7605839e1f840e22dbd79cd08dcfb0a0b5b421d3","target":"record","created_at":"2026-05-17T23:53:13Z","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":"5a1525ed657ea83771225cdb140e69ba62d8d7c02f5e7d81a41a6d6192bf3339","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-10T11:08:16Z","title_canon_sha256":"560436d71fe3ee4feaa475cc2cfc9189245ed67877741e538482fd46b7839de9"},"schema_version":"1.0","source":{"id":"1512.03213","kind":"arxiv","version":2}},"canonical_sha256":"d271d390422563983167ffcf871abdd9d20d85bdafc74f2d1eb2ac088df6038a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d271d390422563983167ffcf871abdd9d20d85bdafc74f2d1eb2ac088df6038a","first_computed_at":"2026-05-17T23:53:13.478707Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:13.478707Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZNPG1actUPr7DtcU6kFvwoXdQZh+OWWZUcFJ1h6Oiv8ju9XVW1rExEhkTlYZJ/mh9fufXsvij/ZgKQC88BOdDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:13.479463Z","signed_message":"canonical_sha256_bytes"},"source_id":"1512.03213","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:700ffc42463e28a1cededeae7605839e1f840e22dbd79cd08dcfb0a0b5b421d3","sha256:1bc92a58b9661e1e67e0cfa6680a9b522aeeedffa123b9fa582ab9bbcab83982"],"state_sha256":"87e82b0a76a7250da4acbb024f1bdc81cd459df7970965fac76df09ca7f2b34a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+qgMs/OoFt2QZLyxvrXeD52l/BUnw9+7bZKW/05tlR6NlTBC4EgDmhhuqzVQVVTs/c9VaGC75jf/saw7RSUpDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T13:44:12.687496Z","bundle_sha256":"3530ae597d7529a7190789ac51c6360b25578f21d6b954707f828f1c0a581fb7"}}