{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:JHSEPYFTGAWDTOCGUS4MEX6U2Y","short_pith_number":"pith:JHSEPYFT","schema_version":"1.0","canonical_sha256":"49e447e0b3302c39b846a4b8c25fd4d6133be7f38293a26f83a71b8446fe39c3","source":{"kind":"arxiv","id":"1010.5442","version":2},"attestation_state":"computed","paper":{"title":"The number of solutions of lambda(x)=n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Kevin Ford","submitted_at":"2010-10-26T16:09:28Z","abstract_excerpt":"We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a \"near\" proof of the fact that this is the case unconditionally, and a complete conditional proof under the Extended Riemann Hypothesis. The main tool is a count of prime chains from paper arXiv:0906.3380."},"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":"1010.5442","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2010-10-26T16:09:28Z","cross_cats_sorted":[],"title_canon_sha256":"2578e71e303ebc826e7bcfeb0af9108ef6aabd979080fb0bb0d5fbda83d9bd0b","abstract_canon_sha256":"e7903478569718fd019c1867a52149e2e62b89ffb1deffd86657f79aeb9578a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:55:57.779628Z","signature_b64":"GECjzHXvh6XDOKyOAN9WFPJoPLom2Rigd2FBNA8UdJ8OsPqAPkMPycmbd4njtKgzEBvc8RataaCsxAMAEpH9DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49e447e0b3302c39b846a4b8c25fd4d6133be7f38293a26f83a71b8446fe39c3","last_reissued_at":"2026-05-18T02:55:57.779151Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:55:57.779151Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The number of solutions of lambda(x)=n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Florian Luca, Kevin Ford","submitted_at":"2010-10-26T16:09:28Z","abstract_excerpt":"We study the question of whether for each n there is another integer m with lambda(m)=lambda(n), where lambda is Carmichael's function. We give a \"near\" proof of the fact that this is the case unconditionally, and a complete conditional proof under the Extended Riemann Hypothesis. The main tool is a count of prime chains from paper arXiv:0906.3380."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.5442","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":"1010.5442","created_at":"2026-05-18T02:55:57.779230+00:00"},{"alias_kind":"arxiv_version","alias_value":"1010.5442v2","created_at":"2026-05-18T02:55:57.779230+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.5442","created_at":"2026-05-18T02:55:57.779230+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHSEPYFTGAWD","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHSEPYFTGAWDTOCG","created_at":"2026-05-18T12:26:09.077623+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHSEPYFT","created_at":"2026-05-18T12:26:09.077623+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/JHSEPYFTGAWDTOCGUS4MEX6U2Y","json":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y.json","graph_json":"https://pith.science/api/pith-number/JHSEPYFTGAWDTOCGUS4MEX6U2Y/graph.json","events_json":"https://pith.science/api/pith-number/JHSEPYFTGAWDTOCGUS4MEX6U2Y/events.json","paper":"https://pith.science/paper/JHSEPYFT"},"agent_actions":{"view_html":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y","download_json":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y.json","view_paper":"https://pith.science/paper/JHSEPYFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1010.5442&json=true","fetch_graph":"https://pith.science/api/pith-number/JHSEPYFTGAWDTOCGUS4MEX6U2Y/graph.json","fetch_events":"https://pith.science/api/pith-number/JHSEPYFTGAWDTOCGUS4MEX6U2Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y/action/storage_attestation","attest_author":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y/action/author_attestation","sign_citation":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y/action/citation_signature","submit_replication":"https://pith.science/pith/JHSEPYFTGAWDTOCGUS4MEX6U2Y/action/replication_record"}},"created_at":"2026-05-18T02:55:57.779230+00:00","updated_at":"2026-05-18T02:55:57.779230+00:00"}