{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QY4DM7U4W4KTCNF7HBKPE3KMEH","short_pith_number":"pith:QY4DM7U4","schema_version":"1.0","canonical_sha256":"8638367e9cb7153134bf3854f26d4c21c1864045c4498a9365bdb8baad2f5ca2","source":{"kind":"arxiv","id":"1903.05023","version":1},"attestation_state":"computed","paper":{"title":"Repeatedly Appending Any Digit to Generate Composite Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"John Rickert, Jon Grantham, Stan Wagon, Witold Jarnicki","submitted_at":"2019-03-12T16:26:42Z","abstract_excerpt":"We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits such that repeatedly appending {\\it any} digit yields a composite number."},"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":"1903.05023","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-03-12T16:26:42Z","cross_cats_sorted":[],"title_canon_sha256":"0c76573e0a18e4773e4cefab24ae3d647794e2323daa2b1d6add1e800a273165","abstract_canon_sha256":"6f0e0490e11c138802eeea9e11f2405d622c74f41e3414bb810a46771806dbe5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:26.505777Z","signature_b64":"Oznk72FwTklL9ZJQLDb8qEfKO1NrDYrnXPZiy9YpnS+g6fEhSgl/a69U1s+u6fCVpBkfbW/gWmBNkXw40y/yBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8638367e9cb7153134bf3854f26d4c21c1864045c4498a9365bdb8baad2f5ca2","last_reissued_at":"2026-05-17T23:51:26.505187Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:26.505187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Repeatedly Appending Any Digit to Generate Composite Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"John Rickert, Jon Grantham, Stan Wagon, Witold Jarnicki","submitted_at":"2019-03-12T16:26:42Z","abstract_excerpt":"We investigate the problem of finding integers $k$ such that appending any number of copies of the base-ten digit $d$ to $k$ yields a composite number. In particular, we prove that there exist infinitely many integers coprime to all digits such that repeatedly appending {\\it any} digit yields a composite number."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.05023","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":"1903.05023","created_at":"2026-05-17T23:51:26.505290+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.05023v1","created_at":"2026-05-17T23:51:26.505290+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.05023","created_at":"2026-05-17T23:51:26.505290+00:00"},{"alias_kind":"pith_short_12","alias_value":"QY4DM7U4W4KT","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QY4DM7U4W4KTCNF7","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QY4DM7U4","created_at":"2026-05-18T12:33:27.125529+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/QY4DM7U4W4KTCNF7HBKPE3KMEH","json":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH.json","graph_json":"https://pith.science/api/pith-number/QY4DM7U4W4KTCNF7HBKPE3KMEH/graph.json","events_json":"https://pith.science/api/pith-number/QY4DM7U4W4KTCNF7HBKPE3KMEH/events.json","paper":"https://pith.science/paper/QY4DM7U4"},"agent_actions":{"view_html":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH","download_json":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH.json","view_paper":"https://pith.science/paper/QY4DM7U4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.05023&json=true","fetch_graph":"https://pith.science/api/pith-number/QY4DM7U4W4KTCNF7HBKPE3KMEH/graph.json","fetch_events":"https://pith.science/api/pith-number/QY4DM7U4W4KTCNF7HBKPE3KMEH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH/action/storage_attestation","attest_author":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH/action/author_attestation","sign_citation":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH/action/citation_signature","submit_replication":"https://pith.science/pith/QY4DM7U4W4KTCNF7HBKPE3KMEH/action/replication_record"}},"created_at":"2026-05-17T23:51:26.505290+00:00","updated_at":"2026-05-17T23:51:26.505290+00:00"}