{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:RF6ZE7JSQFR2XTRLQHKBT7VVGE","short_pith_number":"pith:RF6ZE7JS","canonical_record":{"source":{"id":"1907.09923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-07-23T14:52:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3b36c06820945b6f5a55654540d9262fd38b3435b49099f619241a01d750c06a","abstract_canon_sha256":"6aab0aa65430d9a3cccf00d3f63c55d89f89f679c3709488a43361ff601b61f7"},"schema_version":"1.0"},"canonical_sha256":"897d927d328163abce2b81d419feb5312090ee7bd7eb6aab2739616fa464c956","source":{"kind":"arxiv","id":"1907.09923","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09923","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09923v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09923","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"RF6ZE7JSQFR2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RF6ZE7JSQFR2XTRL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RF6ZE7JS","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:RF6ZE7JSQFR2XTRLQHKBT7VVGE","target":"record","payload":{"canonical_record":{"source":{"id":"1907.09923","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-07-23T14:52:34Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3b36c06820945b6f5a55654540d9262fd38b3435b49099f619241a01d750c06a","abstract_canon_sha256":"6aab0aa65430d9a3cccf00d3f63c55d89f89f679c3709488a43361ff601b61f7"},"schema_version":"1.0"},"canonical_sha256":"897d927d328163abce2b81d419feb5312090ee7bd7eb6aab2739616fa464c956","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:49.693006Z","signature_b64":"JW0RkHAsjSimNYt7NwmHZxM03lhpTFTzyJb+/7u1PEpXu1F565KTSdygq5PNfbr9c1u8sPq5jqXo+8L2s5l/Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"897d927d328163abce2b81d419feb5312090ee7bd7eb6aab2739616fa464c956","last_reissued_at":"2026-05-17T23:39:49.692307Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:49.692307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.09923","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dATAfKvPGPurMY6V0+YCPBH+Vez9d8fxyCiyChhscbNUMouez5rdcdxHmRLTKYVR6uSyoxu4+0cjPiODo8HWBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:29:37.890637Z"},"content_sha256":"46dc9ce088463733b2cafa40f7833482fda09460617c4a8a071da2f02ec3f914","schema_version":"1.0","event_id":"sha256:46dc9ce088463733b2cafa40f7833482fda09460617c4a8a071da2f02ec3f914"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:RF6ZE7JSQFR2XTRLQHKBT7VVGE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Combinatorial properties of sparsely totient numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Bhuwanesh Rao Patil, Mithun Kumar Das, Pramod Eyyunni","submitted_at":"2019-07-23T14:52:34Z","abstract_excerpt":"Let $N_1(m)=\\max\\{n \\colon \\phi(n) \\leq m\\}$ and $N_1 = \\{N_1(m) \\colon m \\in \\phi(\\mathbb{N})\\}$ where $\\phi(n)$ denotes the Euler's totient function. Masser and Shiu \\cite{masser} call the elements of $N_1$ as `sparsely totient numbers' and initiated the study of these numbers. In this article, we establish several results for sparsely totient numbers. First, we show that a squarefree integer divides all sufficiently large sparsely totient numbers and a non-squarefree integer divides infinitely many sparsely totient numbers. Next, we construct explicit infinite families of sparsely totient n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09923","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c8R2hEh/hBX+9pXjMoQ0g/bp8iaWHR9kZbFfKSE4suH5NHfwWluFKoEsp+mNByTG4eQPDXf+ljFx+z5WFDlhAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:29:37.891279Z"},"content_sha256":"2ca49da7ba3b2cbf5fbbd3d3f11a854edfcd49ea5ee6e2d83a5257fcfd7c7cde","schema_version":"1.0","event_id":"sha256:2ca49da7ba3b2cbf5fbbd3d3f11a854edfcd49ea5ee6e2d83a5257fcfd7c7cde"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE/bundle.json","state_url":"https://pith.science/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-08T20:29:37Z","links":{"resolver":"https://pith.science/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE","bundle":"https://pith.science/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE/bundle.json","state":"https://pith.science/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RF6ZE7JSQFR2XTRLQHKBT7VVGE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:RF6ZE7JSQFR2XTRLQHKBT7VVGE","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":"6aab0aa65430d9a3cccf00d3f63c55d89f89f679c3709488a43361ff601b61f7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-07-23T14:52:34Z","title_canon_sha256":"3b36c06820945b6f5a55654540d9262fd38b3435b49099f619241a01d750c06a"},"schema_version":"1.0","source":{"id":"1907.09923","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.09923","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"1907.09923v1","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.09923","created_at":"2026-05-17T23:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"RF6ZE7JSQFR2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"RF6ZE7JSQFR2XTRL","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"RF6ZE7JS","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:2ca49da7ba3b2cbf5fbbd3d3f11a854edfcd49ea5ee6e2d83a5257fcfd7c7cde","target":"graph","created_at":"2026-05-17T23:39:49Z","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_1(m)=\\max\\{n \\colon \\phi(n) \\leq m\\}$ and $N_1 = \\{N_1(m) \\colon m \\in \\phi(\\mathbb{N})\\}$ where $\\phi(n)$ denotes the Euler's totient function. Masser and Shiu \\cite{masser} call the elements of $N_1$ as `sparsely totient numbers' and initiated the study of these numbers. In this article, we establish several results for sparsely totient numbers. First, we show that a squarefree integer divides all sufficiently large sparsely totient numbers and a non-squarefree integer divides infinitely many sparsely totient numbers. Next, we construct explicit infinite families of sparsely totient n","authors_text":"Bhuwanesh Rao Patil, Mithun Kumar Das, Pramod Eyyunni","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-07-23T14:52:34Z","title":"Combinatorial properties of sparsely totient numbers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.09923","kind":"arxiv","version":1},"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:46dc9ce088463733b2cafa40f7833482fda09460617c4a8a071da2f02ec3f914","target":"record","created_at":"2026-05-17T23:39:49Z","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":"6aab0aa65430d9a3cccf00d3f63c55d89f89f679c3709488a43361ff601b61f7","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2019-07-23T14:52:34Z","title_canon_sha256":"3b36c06820945b6f5a55654540d9262fd38b3435b49099f619241a01d750c06a"},"schema_version":"1.0","source":{"id":"1907.09923","kind":"arxiv","version":1}},"canonical_sha256":"897d927d328163abce2b81d419feb5312090ee7bd7eb6aab2739616fa464c956","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"897d927d328163abce2b81d419feb5312090ee7bd7eb6aab2739616fa464c956","first_computed_at":"2026-05-17T23:39:49.692307Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:49.692307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JW0RkHAsjSimNYt7NwmHZxM03lhpTFTzyJb+/7u1PEpXu1F565KTSdygq5PNfbr9c1u8sPq5jqXo+8L2s5l/Dw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:49.693006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.09923","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46dc9ce088463733b2cafa40f7833482fda09460617c4a8a071da2f02ec3f914","sha256:2ca49da7ba3b2cbf5fbbd3d3f11a854edfcd49ea5ee6e2d83a5257fcfd7c7cde"],"state_sha256":"50730f28e3dcb5aaaeff7650194805e30dd60b40fb8ab27bd681499a4c5a0489"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"htIMBkuVmHBw/aGSBU/lMGmxw7LFDOTDLSDpbOzblEdKmlTf1q7eow268fQEZ1FNIYu9iaJI4wXdx+/nYSeBBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:29:37.894817Z","bundle_sha256":"3087030406873f366454427704aedecded7c04cd278a2bb04000649ea9d9462e"}}