{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:HDV6I6JKQO7T4EBZL6473NCCCV","short_pith_number":"pith:HDV6I6JK","schema_version":"1.0","canonical_sha256":"38ebe4792a83bf3e10395fb9fdb44215677c124ec218de9da006b9af868cbe01","source":{"kind":"arxiv","id":"1512.08382","version":2},"attestation_state":"computed","paper":{"title":"The Least Prime Number in a Beatty Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J\\\"orn Steuding, Marc Technau","submitted_at":"2015-12-28T12:01:09Z","abstract_excerpt":"We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression."},"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":"1512.08382","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-12-28T12:01:09Z","cross_cats_sorted":[],"title_canon_sha256":"b7e62dc262c9ede8f1015649b4f18d406fafb0540988aed29a2f3ee5174800da","abstract_canon_sha256":"74ccc8c98216eaa25b69fff2a922c9a209537f62abe055d8df1a85ae49088286"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:38.104575Z","signature_b64":"dqDiQpEfsZsf0VAc+FvgLcZjkHewi7oqPTgQCSYUO9alaouuEsgphCYYb+Q9BxtpCMihMiw9rXennN1SGkVlBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"38ebe4792a83bf3e10395fb9fdb44215677c124ec218de9da006b9af868cbe01","last_reissued_at":"2026-05-18T01:10:38.104071Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:38.104071Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Least Prime Number in a Beatty Sequence","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"J\\\"orn Steuding, Marc Technau","submitted_at":"2015-12-28T12:01:09Z","abstract_excerpt":"We prove an upper bound for the least prime in an irrational Beatty sequence. This result may be compared with Linnik's theorem on the least prime in an arithmetic progression."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1512.08382","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":"1512.08382","created_at":"2026-05-18T01:10:38.104156+00:00"},{"alias_kind":"arxiv_version","alias_value":"1512.08382v2","created_at":"2026-05-18T01:10:38.104156+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1512.08382","created_at":"2026-05-18T01:10:38.104156+00:00"},{"alias_kind":"pith_short_12","alias_value":"HDV6I6JKQO7T","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"HDV6I6JKQO7T4EBZ","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"HDV6I6JK","created_at":"2026-05-18T12:29:25.134429+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/HDV6I6JKQO7T4EBZL6473NCCCV","json":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV.json","graph_json":"https://pith.science/api/pith-number/HDV6I6JKQO7T4EBZL6473NCCCV/graph.json","events_json":"https://pith.science/api/pith-number/HDV6I6JKQO7T4EBZL6473NCCCV/events.json","paper":"https://pith.science/paper/HDV6I6JK"},"agent_actions":{"view_html":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV","download_json":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV.json","view_paper":"https://pith.science/paper/HDV6I6JK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1512.08382&json=true","fetch_graph":"https://pith.science/api/pith-number/HDV6I6JKQO7T4EBZL6473NCCCV/graph.json","fetch_events":"https://pith.science/api/pith-number/HDV6I6JKQO7T4EBZL6473NCCCV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV/action/storage_attestation","attest_author":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV/action/author_attestation","sign_citation":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV/action/citation_signature","submit_replication":"https://pith.science/pith/HDV6I6JKQO7T4EBZL6473NCCCV/action/replication_record"}},"created_at":"2026-05-18T01:10:38.104156+00:00","updated_at":"2026-05-18T01:10:38.104156+00:00"}