{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:7TBQLMGWCOYLFPLLSNEYTGBNH2","short_pith_number":"pith:7TBQLMGW","canonical_record":{"source":{"id":"1908.06161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-16T20:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"1343e389094189807843adb3df1484ff579fabc2e9ac00985a7ed85a903acf6a","abstract_canon_sha256":"330116a9991893c03e43b6efc8072f15b1bc3f13f571576da6fa9d8d34a6288a"},"schema_version":"1.0"},"canonical_sha256":"fcc305b0d613b0b2bd6b934989982d3e8b19be60ff43e07111dc353346d18ea6","source":{"kind":"arxiv","id":"1908.06161","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06161","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06161v2","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06161","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"7TBQLMGWCOYL","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"pith_short_16","alias_value":"7TBQLMGWCOYLFPLL","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"pith_short_8","alias_value":"7TBQLMGW","created_at":"2026-07-04T23:59:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:7TBQLMGWCOYLFPLLSNEYTGBNH2","target":"record","payload":{"canonical_record":{"source":{"id":"1908.06161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-16T20:51:49Z","cross_cats_sorted":[],"title_canon_sha256":"1343e389094189807843adb3df1484ff579fabc2e9ac00985a7ed85a903acf6a","abstract_canon_sha256":"330116a9991893c03e43b6efc8072f15b1bc3f13f571576da6fa9d8d34a6288a"},"schema_version":"1.0"},"canonical_sha256":"fcc305b0d613b0b2bd6b934989982d3e8b19be60ff43e07111dc353346d18ea6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:59:34.702606Z","signature_b64":"fsWqMCAr5FMqwmd6HcC3wI0eb38Dqb88pZWObMtvhLx+JONOYa7FCico/XO2owQBK7JnyXg4REJy6AMBGArmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fcc305b0d613b0b2bd6b934989982d3e8b19be60ff43e07111dc353346d18ea6","last_reissued_at":"2026-07-04T23:59:34.702246Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:59:34.702246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1908.06161","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-04T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4SRMcFB53zB4HqiFt21jntZVFWP1tRgRdF1VCu+N0FZ5pY+Gy4NQO8mAr+9djFPnEh0sj85SOjjgFu492nJpDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:37:31.548952Z"},"content_sha256":"c4b8c82b67bde15488c004175291bec545e67f999894b231dcd669a01f7c2841","schema_version":"1.0","event_id":"sha256:c4b8c82b67bde15488c004175291bec545e67f999894b231dcd669a01f7c2841"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:7TBQLMGWCOYLFPLLSNEYTGBNH2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symmetric primes revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Carl Pomerance, Paul Pollack, William Banks","submitted_at":"2019-08-16T20:51:49Z","abstract_excerpt":"A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a symmetric pair. In the present paper, that theorem is improved to what is likely to be the best possible result. We also establish that there exist infinitely many symmetric pairs of primes. In fact, we show that for every integer m at least 2 there is a string of m consecutive primes, any two of which form a symmetric pair."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06161","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/1908.06161/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-04T23:59:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TqM3zndmVw+uqKyPwXsOwhDuO0U4nnVBxe2B0iZi34ufSHLodmd+EABLVNVU6KnE8NV6HlapjcA06iYmz3H0Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T06:37:31.549845Z"},"content_sha256":"63b869352b6da50535549dc804aff6e1a612a07362ca218a2f08957c78445c25","schema_version":"1.0","event_id":"sha256:63b869352b6da50535549dc804aff6e1a612a07362ca218a2f08957c78445c25"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2/bundle.json","state_url":"https://pith.science/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2/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-16T06:37:31Z","links":{"resolver":"https://pith.science/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2","bundle":"https://pith.science/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2/bundle.json","state":"https://pith.science/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7TBQLMGWCOYLFPLLSNEYTGBNH2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:7TBQLMGWCOYLFPLLSNEYTGBNH2","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":"330116a9991893c03e43b6efc8072f15b1bc3f13f571576da6fa9d8d34a6288a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-16T20:51:49Z","title_canon_sha256":"1343e389094189807843adb3df1484ff579fabc2e9ac00985a7ed85a903acf6a"},"schema_version":"1.0","source":{"id":"1908.06161","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.06161","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"arxiv_version","alias_value":"1908.06161v2","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.06161","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"pith_short_12","alias_value":"7TBQLMGWCOYL","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"pith_short_16","alias_value":"7TBQLMGWCOYLFPLL","created_at":"2026-07-04T23:59:34Z"},{"alias_kind":"pith_short_8","alias_value":"7TBQLMGW","created_at":"2026-07-04T23:59:34Z"}],"graph_snapshots":[{"event_id":"sha256:63b869352b6da50535549dc804aff6e1a612a07362ca218a2f08957c78445c25","target":"graph","created_at":"2026-07-04T23:59:34Z","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/1908.06161/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a symmetric pair. In the present paper, that theorem is improved to what is likely to be the best possible result. We also establish that there exist infinitely many symmetric pairs of primes. In fact, we show that for every integer m at least 2 there is a string of m consecutive primes, any two of which form a symmetric pair.","authors_text":"Carl Pomerance, Paul Pollack, William Banks","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-16T20:51:49Z","title":"Symmetric primes revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.06161","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:c4b8c82b67bde15488c004175291bec545e67f999894b231dcd669a01f7c2841","target":"record","created_at":"2026-07-04T23:59:34Z","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":"330116a9991893c03e43b6efc8072f15b1bc3f13f571576da6fa9d8d34a6288a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-08-16T20:51:49Z","title_canon_sha256":"1343e389094189807843adb3df1484ff579fabc2e9ac00985a7ed85a903acf6a"},"schema_version":"1.0","source":{"id":"1908.06161","kind":"arxiv","version":2}},"canonical_sha256":"fcc305b0d613b0b2bd6b934989982d3e8b19be60ff43e07111dc353346d18ea6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fcc305b0d613b0b2bd6b934989982d3e8b19be60ff43e07111dc353346d18ea6","first_computed_at":"2026-07-04T23:59:34.702246Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T23:59:34.702246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fsWqMCAr5FMqwmd6HcC3wI0eb38Dqb88pZWObMtvhLx+JONOYa7FCico/XO2owQBK7JnyXg4REJy6AMBGArmDg==","signature_status":"signed_v1","signed_at":"2026-07-04T23:59:34.702606Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.06161","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c4b8c82b67bde15488c004175291bec545e67f999894b231dcd669a01f7c2841","sha256:63b869352b6da50535549dc804aff6e1a612a07362ca218a2f08957c78445c25"],"state_sha256":"6752372b0e0f7219908bdae35d05ed71b16d5d85f57548da789620dffb83af08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NFMgtUMma+j+9HY7V/X+8b95TjUhpBxESlQiTIwdv8NIklnThJk+EbtiiYYE0HdiZSo1PXqpuS8++Egom8F9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T06:37:31.616485Z","bundle_sha256":"877047ae94c3f603869bf07be26cc73fd37a00cfb60a5fd45cdc662a45341466"}}