{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AVIG37RHZVGCTGM625534LUVB4","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"2851c28fcfeafd1eb5e03e601f57787dad765a0b78fc7eee2e53b1565a467566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-03-31T17:44:41Z","title_canon_sha256":"8c5c24ed5d86877ab06f89ea7811ed321338f1d17e7ebbe1d9753567a7dd71ed"},"schema_version":"1.0","source":{"id":"1704.00007","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.00007","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"arxiv_version","alias_value":"1704.00007v2","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.00007","created_at":"2026-05-17T23:53:44Z"},{"alias_kind":"pith_short_12","alias_value":"AVIG37RHZVGC","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_16","alias_value":"AVIG37RHZVGCTGM6","created_at":"2026-05-18T12:31:08Z"},{"alias_kind":"pith_short_8","alias_value":"AVIG37RH","created_at":"2026-05-18T12:31:08Z"}],"graph_snapshots":[{"event_id":"sha256:0d89f01fa93493fe62ba47a888064bec5f8ee79e66da366da86ae82a3a2bef2c","target":"graph","created_at":"2026-05-17T23:53:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Arghya Dutta, Sayak Chakrabarty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-03-31T17:44:41Z","title":"The Repeated Divisor Function and Possible Correlation with Highly Composite Numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.00007","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:01c3a3d693735a021b5ebc92a24548c11f9188b545bf9c5ba1085e0c76bee5ee","target":"record","created_at":"2026-05-17T23:53:44Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"2851c28fcfeafd1eb5e03e601f57787dad765a0b78fc7eee2e53b1565a467566","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GM","submitted_at":"2017-03-31T17:44:41Z","title_canon_sha256":"8c5c24ed5d86877ab06f89ea7811ed321338f1d17e7ebbe1d9753567a7dd71ed"},"schema_version":"1.0","source":{"id":"1704.00007","kind":"arxiv","version":2}},"canonical_sha256":"05506dfe27cd4c29999ed77bbe2e950f23471e3d13da2370dee9b25319e6f7e2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"05506dfe27cd4c29999ed77bbe2e950f23471e3d13da2370dee9b25319e6f7e2","first_computed_at":"2026-05-17T23:53:44.545198Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:44.545198Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iZ2h+AvkNV1R1YPGbcR+uQ6b4E1AdS1BfdtE9DsXZx2dl4MPCy5cvEQzDn488UxPeZQejOprDH67fgwrlwATAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:44.545667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.00007","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:01c3a3d693735a021b5ebc92a24548c11f9188b545bf9c5ba1085e0c76bee5ee","sha256:0d89f01fa93493fe62ba47a888064bec5f8ee79e66da366da86ae82a3a2bef2c"],"state_sha256":"d07dfa3818b410acbe850f15493b2ebb0103f787ccc229b5a2e36130f6eab381"}