{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:G2QZMLTNN6FJJ654PHYNMR44T2","short_pith_number":"pith:G2QZMLTN","schema_version":"1.0","canonical_sha256":"36a1962e6d6f8a94fbbc79f0d6479c9e97ca7d9be826a271b885e05984e5730a","source":{"kind":"arxiv","id":"1005.4703","version":2},"attestation_state":"computed","paper":{"title":"Strings of congruent primes in short intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Tristan Freiberg","submitted_at":"2010-05-25T21:09:05Z","abstract_excerpt":"Fix \\epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \\equiv p_{r+1} \\equiv a \\mod q and p_{r+1} - p_r < \\epsilon\\log p_r. The proof combines the ideas of Shiu and Goldston-Pintz-Yildirim."},"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":"1005.4703","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-05-25T21:09:05Z","cross_cats_sorted":[],"title_canon_sha256":"f14b4b3e0486882671a90ef40c3ce0c0d766fba47e29d223116626c01dd38fa0","abstract_canon_sha256":"dff1e4aa6db2a8098f083602fa9bdea3cd620320675bcd8850d84a511b6d905b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:02.126603Z","signature_b64":"Bz92M57Ktl8LmwOlOW0AgoN2bJ/zE4IaxU0GLZpGRaMctTAn1G0i+rx/nAntr1BT06G8UWFQ62H0gz+HoYzgAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36a1962e6d6f8a94fbbc79f0d6479c9e97ca7d9be826a271b885e05984e5730a","last_reissued_at":"2026-05-18T02:58:02.126005Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:02.126005Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Strings of congruent primes in short intervals","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Tristan Freiberg","submitted_at":"2010-05-25T21:09:05Z","abstract_excerpt":"Fix \\epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \\equiv p_{r+1} \\equiv a \\mod q and p_{r+1} - p_r < \\epsilon\\log p_r. The proof combines the ideas of Shiu and Goldston-Pintz-Yildirim."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.4703","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1005.4703","created_at":"2026-05-18T02:58:02.126095+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.4703v2","created_at":"2026-05-18T02:58:02.126095+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.4703","created_at":"2026-05-18T02:58:02.126095+00:00"},{"alias_kind":"pith_short_12","alias_value":"G2QZMLTNN6FJ","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_16","alias_value":"G2QZMLTNN6FJJ654","created_at":"2026-05-18T12:26:07.630475+00:00"},{"alias_kind":"pith_short_8","alias_value":"G2QZMLTN","created_at":"2026-05-18T12:26:07.630475+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2","json":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2.json","graph_json":"https://pith.science/api/pith-number/G2QZMLTNN6FJJ654PHYNMR44T2/graph.json","events_json":"https://pith.science/api/pith-number/G2QZMLTNN6FJJ654PHYNMR44T2/events.json","paper":"https://pith.science/paper/G2QZMLTN"},"agent_actions":{"view_html":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2","download_json":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2.json","view_paper":"https://pith.science/paper/G2QZMLTN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.4703&json=true","fetch_graph":"https://pith.science/api/pith-number/G2QZMLTNN6FJJ654PHYNMR44T2/graph.json","fetch_events":"https://pith.science/api/pith-number/G2QZMLTNN6FJJ654PHYNMR44T2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2/action/storage_attestation","attest_author":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2/action/author_attestation","sign_citation":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2/action/citation_signature","submit_replication":"https://pith.science/pith/G2QZMLTNN6FJJ654PHYNMR44T2/action/replication_record"}},"created_at":"2026-05-18T02:58:02.126095+00:00","updated_at":"2026-05-18T02:58:02.126095+00:00"}