{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AVIG37RHZVGCTGM625534LUVB4","short_pith_number":"pith:AVIG37RH","schema_version":"1.0","canonical_sha256":"05506dfe27cd4c29999ed77bbe2e950f23471e3d13da2370dee9b25319e6f7e2","source":{"kind":"arxiv","id":"1704.00007","version":2},"attestation_state":"computed","paper":{"title":"The Repeated Divisor Function and Possible Correlation with Highly Composite Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Arghya Dutta, Sayak Chakrabarty","submitted_at":"2017-03-31T17:44:41Z","abstract_excerpt":"Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \\leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \\geq 2$ and in this paper we try to find the smallest $k$ such that $d(d(...d(n)...)) = 2$ where the divisor function is applied $k$ times. At the end of the paper we make a conjecture based on some observations."},"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":"1704.00007","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-03-31T17:44:41Z","cross_cats_sorted":[],"title_canon_sha256":"8c5c24ed5d86877ab06f89ea7811ed321338f1d17e7ebbe1d9753567a7dd71ed","abstract_canon_sha256":"2851c28fcfeafd1eb5e03e601f57787dad765a0b78fc7eee2e53b1565a467566"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:44.545667Z","signature_b64":"iZ2h+AvkNV1R1YPGbcR+uQ6b4E1AdS1BfdtE9DsXZx2dl4MPCy5cvEQzDn488UxPeZQejOprDH67fgwrlwATAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05506dfe27cd4c29999ed77bbe2e950f23471e3d13da2370dee9b25319e6f7e2","last_reissued_at":"2026-05-17T23:53:44.545198Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:44.545198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Repeated Divisor Function and Possible Correlation with Highly Composite Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GM","authors_text":"Arghya Dutta, Sayak Chakrabarty","submitted_at":"2017-03-31T17:44:41Z","abstract_excerpt":"Let n be a non-null positive integer and $d(n)$ is the number of positive divisors of n, called the divisor function. Of course, $d(n) \\leq n$. $d(n) = 1$ if and only if $n = 1$. For $n > 2$ we have $d(n) \\geq 2$ and in this paper we try to find the smallest $k$ such that $d(d(...d(n)...)) = 2$ where the divisor function is applied $k$ times. At the end of the paper we make a conjecture based on some observations."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00007","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":"1704.00007","created_at":"2026-05-17T23:53:44.545278+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.00007v2","created_at":"2026-05-17T23:53:44.545278+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00007","created_at":"2026-05-17T23:53:44.545278+00:00"},{"alias_kind":"pith_short_12","alias_value":"AVIG37RHZVGC","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_16","alias_value":"AVIG37RHZVGCTGM6","created_at":"2026-05-18T12:31:08.081275+00:00"},{"alias_kind":"pith_short_8","alias_value":"AVIG37RH","created_at":"2026-05-18T12:31:08.081275+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/AVIG37RHZVGCTGM625534LUVB4","json":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4.json","graph_json":"https://pith.science/api/pith-number/AVIG37RHZVGCTGM625534LUVB4/graph.json","events_json":"https://pith.science/api/pith-number/AVIG37RHZVGCTGM625534LUVB4/events.json","paper":"https://pith.science/paper/AVIG37RH"},"agent_actions":{"view_html":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4","download_json":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4.json","view_paper":"https://pith.science/paper/AVIG37RH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.00007&json=true","fetch_graph":"https://pith.science/api/pith-number/AVIG37RHZVGCTGM625534LUVB4/graph.json","fetch_events":"https://pith.science/api/pith-number/AVIG37RHZVGCTGM625534LUVB4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4/action/storage_attestation","attest_author":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4/action/author_attestation","sign_citation":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4/action/citation_signature","submit_replication":"https://pith.science/pith/AVIG37RHZVGCTGM625534LUVB4/action/replication_record"}},"created_at":"2026-05-17T23:53:44.545278+00:00","updated_at":"2026-05-17T23:53:44.545278+00:00"}