{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:PKUTVZDGSWCAT7KIP3O75YK4G2","short_pith_number":"pith:PKUTVZDG","schema_version":"1.0","canonical_sha256":"7aa93ae466958409fd487eddfee15c368f8855d0798214ca1ae077e695fd2798","source":{"kind":"arxiv","id":"1005.1533","version":1},"attestation_state":"computed","paper":{"title":"On the largest prime factor of $x^2-1$","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Filip Najman, Florian Luca","submitted_at":"2010-05-10T13:22:04Z","abstract_excerpt":"In this paper, we find all integers $x$ such that $x^{2}-1$ has only prime factors smaller than 100. This gives some interesting numerical corollaries. For example, for any positive integer $n$ we can find the largest positive integer $x$ such that all prime factors of each of $x, x+1,..., x+n$ are less than 100."},"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.1533","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NT","submitted_at":"2010-05-10T13:22:04Z","cross_cats_sorted":[],"title_canon_sha256":"db44fd7cc667e46e2286fe19418ce8cc71d5701d839df55d649c3209e93e6b33","abstract_canon_sha256":"6a463e398fe0f6bda1aa865083319cbe43b22ac2cbfcbe5d3d18f6e55a83d894"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.774919Z","signature_b64":"NvksdP7PpLUvEdlGMQGzczG7AVt2EiHzv5eniQovTq9Pfw4qGloKhalmMhI4kyHTT40TKarLXHsFYL3YVi0HDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7aa93ae466958409fd487eddfee15c368f8855d0798214ca1ae077e695fd2798","last_reissued_at":"2026-05-18T04:07:52.774292Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.774292Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the largest prime factor of $x^2-1$","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Filip Najman, Florian Luca","submitted_at":"2010-05-10T13:22:04Z","abstract_excerpt":"In this paper, we find all integers $x$ such that $x^{2}-1$ has only prime factors smaller than 100. This gives some interesting numerical corollaries. For example, for any positive integer $n$ we can find the largest positive integer $x$ such that all prime factors of each of $x, x+1,..., x+n$ are less than 100."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1005.1533","kind":"arxiv","version":1},"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.1533","created_at":"2026-05-18T04:07:52.774372+00:00"},{"alias_kind":"arxiv_version","alias_value":"1005.1533v1","created_at":"2026-05-18T04:07:52.774372+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1005.1533","created_at":"2026-05-18T04:07:52.774372+00:00"},{"alias_kind":"pith_short_12","alias_value":"PKUTVZDGSWCA","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_16","alias_value":"PKUTVZDGSWCAT7KI","created_at":"2026-05-18T12:26:12.377268+00:00"},{"alias_kind":"pith_short_8","alias_value":"PKUTVZDG","created_at":"2026-05-18T12:26:12.377268+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/PKUTVZDGSWCAT7KIP3O75YK4G2","json":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2.json","graph_json":"https://pith.science/api/pith-number/PKUTVZDGSWCAT7KIP3O75YK4G2/graph.json","events_json":"https://pith.science/api/pith-number/PKUTVZDGSWCAT7KIP3O75YK4G2/events.json","paper":"https://pith.science/paper/PKUTVZDG"},"agent_actions":{"view_html":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2","download_json":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2.json","view_paper":"https://pith.science/paper/PKUTVZDG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1005.1533&json=true","fetch_graph":"https://pith.science/api/pith-number/PKUTVZDGSWCAT7KIP3O75YK4G2/graph.json","fetch_events":"https://pith.science/api/pith-number/PKUTVZDGSWCAT7KIP3O75YK4G2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2/action/storage_attestation","attest_author":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2/action/author_attestation","sign_citation":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2/action/citation_signature","submit_replication":"https://pith.science/pith/PKUTVZDGSWCAT7KIP3O75YK4G2/action/replication_record"}},"created_at":"2026-05-18T04:07:52.774372+00:00","updated_at":"2026-05-18T04:07:52.774372+00:00"}