{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PSIGPLZFNHWBFHLEO6IGHK5ZT6","short_pith_number":"pith:PSIGPLZF","schema_version":"1.0","canonical_sha256":"7c9067af2569ec129d64779063abb99fb60d145dc5c9a689b75bc97abbde7917","source":{"kind":"arxiv","id":"1709.06337","version":1},"attestation_state":"computed","paper":{"title":"Perfect numbers and Fibonacci primes (III)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Hao Zhong, Tianxin Cai","submitted_at":"2017-09-19T10:38:25Z","abstract_excerpt":"In this article, we consider the Diophantine equation $\\sigma_{2}(n)-n^2=An+B$ with $A=P^2\\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\\leq(|A|+|B|)^{3}$, all the solutions are expressible in terms of Lucas sequences. Meanwhile, we obtain some results relating to other linear recurrent sequences."},"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":"1709.06337","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2017-09-19T10:38:25Z","cross_cats_sorted":[],"title_canon_sha256":"e2e6742648a6e421bc9fb7a4e7e882c406d8d4a2bd86983c019eb29c276f1c32","abstract_canon_sha256":"82672c7b8412fdf98f5360b600ce0a5ff2c692a099e9b9be49029929ff610c7a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:34:53.476786Z","signature_b64":"j3RfdIDzUZ3FkR94hwqLwkEqSfMex5FfYEMz21hwW0nQWh6JEz0yQ4wXAfSdOCdd/hULJUr+yPJHgWV+txsOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7c9067af2569ec129d64779063abb99fb60d145dc5c9a689b75bc97abbde7917","last_reissued_at":"2026-05-18T00:34:53.476115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:34:53.476115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect numbers and Fibonacci primes (III)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Hao Zhong, Tianxin Cai","submitted_at":"2017-09-19T10:38:25Z","abstract_excerpt":"In this article, we consider the Diophantine equation $\\sigma_{2}(n)-n^2=An+B$ with $A=P^2\\pm2$. For some $B$, we show that except for finitely many computable solutions in the range $n\\leq(|A|+|B|)^{3}$, all the solutions are expressible in terms of Lucas sequences. Meanwhile, we obtain some results relating to other linear recurrent sequences."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.06337","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":"1709.06337","created_at":"2026-05-18T00:34:53.476214+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.06337v1","created_at":"2026-05-18T00:34:53.476214+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.06337","created_at":"2026-05-18T00:34:53.476214+00:00"},{"alias_kind":"pith_short_12","alias_value":"PSIGPLZFNHWB","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PSIGPLZFNHWBFHLE","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PSIGPLZF","created_at":"2026-05-18T12:31:37.085036+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/PSIGPLZFNHWBFHLEO6IGHK5ZT6","json":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6.json","graph_json":"https://pith.science/api/pith-number/PSIGPLZFNHWBFHLEO6IGHK5ZT6/graph.json","events_json":"https://pith.science/api/pith-number/PSIGPLZFNHWBFHLEO6IGHK5ZT6/events.json","paper":"https://pith.science/paper/PSIGPLZF"},"agent_actions":{"view_html":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6","download_json":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6.json","view_paper":"https://pith.science/paper/PSIGPLZF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.06337&json=true","fetch_graph":"https://pith.science/api/pith-number/PSIGPLZFNHWBFHLEO6IGHK5ZT6/graph.json","fetch_events":"https://pith.science/api/pith-number/PSIGPLZFNHWBFHLEO6IGHK5ZT6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6/action/storage_attestation","attest_author":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6/action/author_attestation","sign_citation":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6/action/citation_signature","submit_replication":"https://pith.science/pith/PSIGPLZFNHWBFHLEO6IGHK5ZT6/action/replication_record"}},"created_at":"2026-05-18T00:34:53.476214+00:00","updated_at":"2026-05-18T00:34:53.476214+00:00"}