{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HLFF4KN7NTXZUNCCYMEHEBD75E","short_pith_number":"pith:HLFF4KN7","schema_version":"1.0","canonical_sha256":"3aca5e29bf6cef9a3442c30872047fe93d74fdfd7c08ced1caf0e420cccafa37","source":{"kind":"arxiv","id":"1310.0898","version":2},"attestation_state":"computed","paper":{"title":"Perfect numbers and Fibonacci primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Deyi Chen, Tianxin Cai, Yong Zhang","submitted_at":"2013-10-03T05:08:44Z","abstract_excerpt":"In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and $F_{2k+1}$ are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers."},"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":"1310.0898","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2013-10-03T05:08:44Z","cross_cats_sorted":[],"title_canon_sha256":"fb5ad5ff0c9e3b1c5ee08b45d96d6de378a93fbaff61eb936bf2c83a2d9f0932","abstract_canon_sha256":"e7c8e321c27327f803095ffdfb4a654194032c0df1d48797d22e1cce673f583c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:00.775447Z","signature_b64":"Ri95M8Dzx4vGSLd5eOVZCKxylKZZT/1dZ4Nk2Qw/iraVQ7MmPVXQJ8QDf0ejIsM0ALKHTdxHkxWc41orFUluCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3aca5e29bf6cef9a3442c30872047fe93d74fdfd7c08ced1caf0e420cccafa37","last_reissued_at":"2026-05-18T02:50:00.774945Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:00.774945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect numbers and Fibonacci primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Deyi Chen, Tianxin Cai, Yong Zhang","submitted_at":"2013-10-03T05:08:44Z","abstract_excerpt":"In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and $F_{2k+1}$ are Fibonacci primes. Moreover, we obtain other interesting results and raise a new conjecture on perfect numbers."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.0898","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":"1310.0898","created_at":"2026-05-18T02:50:00.775015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1310.0898v2","created_at":"2026-05-18T02:50:00.775015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.0898","created_at":"2026-05-18T02:50:00.775015+00:00"},{"alias_kind":"pith_short_12","alias_value":"HLFF4KN7NTXZ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HLFF4KN7NTXZUNCC","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HLFF4KN7","created_at":"2026-05-18T12:27:46.883200+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/HLFF4KN7NTXZUNCCYMEHEBD75E","json":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E.json","graph_json":"https://pith.science/api/pith-number/HLFF4KN7NTXZUNCCYMEHEBD75E/graph.json","events_json":"https://pith.science/api/pith-number/HLFF4KN7NTXZUNCCYMEHEBD75E/events.json","paper":"https://pith.science/paper/HLFF4KN7"},"agent_actions":{"view_html":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E","download_json":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E.json","view_paper":"https://pith.science/paper/HLFF4KN7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1310.0898&json=true","fetch_graph":"https://pith.science/api/pith-number/HLFF4KN7NTXZUNCCYMEHEBD75E/graph.json","fetch_events":"https://pith.science/api/pith-number/HLFF4KN7NTXZUNCCYMEHEBD75E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E/action/storage_attestation","attest_author":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E/action/author_attestation","sign_citation":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E/action/citation_signature","submit_replication":"https://pith.science/pith/HLFF4KN7NTXZUNCCYMEHEBD75E/action/replication_record"}},"created_at":"2026-05-18T02:50:00.775015+00:00","updated_at":"2026-05-18T02:50:00.775015+00:00"}