{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AN7UVT6WOTNVDPCDMF5KDTTB5R","short_pith_number":"pith:AN7UVT6W","canonical_record":{"source":{"id":"1511.08784","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-27T20:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"bf7818327400f3ed9f621df23207c456afb9673f922481773bfda735502ab54b","abstract_canon_sha256":"2520d6692643821038826a5de41b8927d9a10b0e606f13372630f2ecc4453b3b"},"schema_version":"1.0"},"canonical_sha256":"037f4acfd674db51bc43617aa1ce61ec613673c327a82ddaa7fef7b869af2a2d","source":{"kind":"arxiv","id":"1511.08784","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08784","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08784v3","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08784","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"AN7UVT6WOTNV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AN7UVT6WOTNVDPCD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AN7UVT6W","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AN7UVT6WOTNVDPCDMF5KDTTB5R","target":"record","payload":{"canonical_record":{"source":{"id":"1511.08784","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-27T20:20:31Z","cross_cats_sorted":[],"title_canon_sha256":"bf7818327400f3ed9f621df23207c456afb9673f922481773bfda735502ab54b","abstract_canon_sha256":"2520d6692643821038826a5de41b8927d9a10b0e606f13372630f2ecc4453b3b"},"schema_version":"1.0"},"canonical_sha256":"037f4acfd674db51bc43617aa1ce61ec613673c327a82ddaa7fef7b869af2a2d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:09.866643Z","signature_b64":"ki/A8mticaqCoZnYlHJxg9bP7PY/TuK5PTDiK3bAS6i9ZTJJe9FDBQAhGkj72KDUl0PPAEB0mR3wzUg2S/wrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"037f4acfd674db51bc43617aa1ce61ec613673c327a82ddaa7fef7b869af2a2d","last_reissued_at":"2026-05-18T00:16:09.865968Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:09.865968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1511.08784","source_version":3,"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-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cDHzFcP2uHhB/w8T0CtuvFz/qODx9yN1mZ6OHTVszkhc3iGBi+c/OhfR1k/AnXjzbYy9dZ8qrly8hJxgXV99Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:43:45.206016Z"},"content_sha256":"6bb6e170f6ffb1a7d8adc6d215d7386047da3aa33f55c8255bfb8074c0cced58","schema_version":"1.0","event_id":"sha256:6bb6e170f6ffb1a7d8adc6d215d7386047da3aa33f55c8255bfb8074c0cced58"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AN7UVT6WOTNVDPCDMF5KDTTB5R","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the number of distinct prime factors of a sum of super-powers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Paolo Leonetti, Salvatore Tringali","submitted_at":"2015-11-27T20:20:31Z","abstract_excerpt":"Given $k, \\ell \\in {\\bf N}^+$, let $x_{i,j}$ be, for $1 \\le i \\le k$ and $0 \\le j \\le \\ell$, some fixed integers, and define, for every $n \\in {\\bf N}^+$, $s_n := \\sum_{i=1}^k \\prod_{j=0}^\\ell x_{i,j}^{n^j}$. We prove that the following are equivalent:\n  (a) There are a real $\\theta > 1$ and infinitely many indices $n$ for which the number of distinct prime factors of $s_n$ is greater than the super-logarithm of $n$ to base $\\theta$.\n  (b) There do not exist non-zero integers $a_0,b_0,\\ldots,a_\\ell,b_\\ell $ such that $s_{2n}=\\prod_{i=0}^\\ell a_i^{(2n)^i}$ and $s_{2n-1}=\\prod_{i=0}^\\ell b_i^{(2"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08784","kind":"arxiv","version":3},"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-18T00:16:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJRD9kUCPO5CWqH+5U+PReMs7SOmko8teXJEIHJyrcX0x5juUUhXQcFiL0Eb2udFcP5x3fKciFA6KsgMuJj5Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-01T13:43:45.206525Z"},"content_sha256":"5358baf82acc1ccc3cf3de104c781611272f420893deb466ef8ce422ca22fc0c","schema_version":"1.0","event_id":"sha256:5358baf82acc1ccc3cf3de104c781611272f420893deb466ef8ce422ca22fc0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R/bundle.json","state_url":"https://pith.science/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R/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-07-01T13:43:45Z","links":{"resolver":"https://pith.science/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R","bundle":"https://pith.science/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R/bundle.json","state":"https://pith.science/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AN7UVT6WOTNVDPCDMF5KDTTB5R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AN7UVT6WOTNVDPCDMF5KDTTB5R","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":"2520d6692643821038826a5de41b8927d9a10b0e606f13372630f2ecc4453b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-27T20:20:31Z","title_canon_sha256":"bf7818327400f3ed9f621df23207c456afb9673f922481773bfda735502ab54b"},"schema_version":"1.0","source":{"id":"1511.08784","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1511.08784","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"arxiv_version","alias_value":"1511.08784v3","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.08784","created_at":"2026-05-18T00:16:09Z"},{"alias_kind":"pith_short_12","alias_value":"AN7UVT6WOTNV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AN7UVT6WOTNVDPCD","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AN7UVT6W","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:5358baf82acc1ccc3cf3de104c781611272f420893deb466ef8ce422ca22fc0c","target":"graph","created_at":"2026-05-18T00:16:09Z","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":"Given $k, \\ell \\in {\\bf N}^+$, let $x_{i,j}$ be, for $1 \\le i \\le k$ and $0 \\le j \\le \\ell$, some fixed integers, and define, for every $n \\in {\\bf N}^+$, $s_n := \\sum_{i=1}^k \\prod_{j=0}^\\ell x_{i,j}^{n^j}$. We prove that the following are equivalent:\n  (a) There are a real $\\theta > 1$ and infinitely many indices $n$ for which the number of distinct prime factors of $s_n$ is greater than the super-logarithm of $n$ to base $\\theta$.\n  (b) There do not exist non-zero integers $a_0,b_0,\\ldots,a_\\ell,b_\\ell $ such that $s_{2n}=\\prod_{i=0}^\\ell a_i^{(2n)^i}$ and $s_{2n-1}=\\prod_{i=0}^\\ell b_i^{(2","authors_text":"Paolo Leonetti, Salvatore Tringali","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-27T20:20:31Z","title":"On the number of distinct prime factors of a sum of super-powers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.08784","kind":"arxiv","version":3},"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:6bb6e170f6ffb1a7d8adc6d215d7386047da3aa33f55c8255bfb8074c0cced58","target":"record","created_at":"2026-05-18T00:16:09Z","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":"2520d6692643821038826a5de41b8927d9a10b0e606f13372630f2ecc4453b3b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2015-11-27T20:20:31Z","title_canon_sha256":"bf7818327400f3ed9f621df23207c456afb9673f922481773bfda735502ab54b"},"schema_version":"1.0","source":{"id":"1511.08784","kind":"arxiv","version":3}},"canonical_sha256":"037f4acfd674db51bc43617aa1ce61ec613673c327a82ddaa7fef7b869af2a2d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"037f4acfd674db51bc43617aa1ce61ec613673c327a82ddaa7fef7b869af2a2d","first_computed_at":"2026-05-18T00:16:09.865968Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:09.865968Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ki/A8mticaqCoZnYlHJxg9bP7PY/TuK5PTDiK3bAS6i9ZTJJe9FDBQAhGkj72KDUl0PPAEB0mR3wzUg2S/wrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:09.866643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1511.08784","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6bb6e170f6ffb1a7d8adc6d215d7386047da3aa33f55c8255bfb8074c0cced58","sha256:5358baf82acc1ccc3cf3de104c781611272f420893deb466ef8ce422ca22fc0c"],"state_sha256":"c5aa59677c9dd424db4125d3b78401acc6a1da4d30489f488e9da9f30bb385f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P9AKcRQBVw0bv0NnMa3qNTjjkA/dsXZRuPYK6T82u4lns301EUB5jiWZ7thSc/3o5hcg8LeEdmurcLsUOfbcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-01T13:43:45.209123Z","bundle_sha256":"5573639b120e05dcfb65d76723ed17a4aa61abd0ed17e381e3b9fee8dbc4b803"}}