{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HYOWWEPYKZGFN4H5PS7YPKC233","short_pith_number":"pith:HYOWWEPY","canonical_record":{"source":{"id":"2601.22822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-01-30T10:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"bb0be3600fa6e60819f4d3012112a1ea30be0f10b810b9845effe71ba5f1c17a","abstract_canon_sha256":"40ac21c7e8d49a777b4010abef68405c930e232ab5b6118afb5339426a53260b"},"schema_version":"1.0"},"canonical_sha256":"3e1d6b11f8564c56f0fd7cbf87a85adee84639cb78e44078aa6739203f9877fc","source":{"kind":"arxiv","id":"2601.22822","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.22822","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"2601.22822v2","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22822","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"HYOWWEPYKZGF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"HYOWWEPYKZGFN4H5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"HYOWWEPY","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HYOWWEPYKZGFN4H5PS7YPKC233","target":"record","payload":{"canonical_record":{"source":{"id":"2601.22822","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-01-30T10:47:09Z","cross_cats_sorted":[],"title_canon_sha256":"bb0be3600fa6e60819f4d3012112a1ea30be0f10b810b9845effe71ba5f1c17a","abstract_canon_sha256":"40ac21c7e8d49a777b4010abef68405c930e232ab5b6118afb5339426a53260b"},"schema_version":"1.0"},"canonical_sha256":"3e1d6b11f8564c56f0fd7cbf87a85adee84639cb78e44078aa6739203f9877fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:05.667869Z","signature_b64":"S2oDC1ww3VXS71IhpoywGjhEtFk/AAEHpqSw4xygihE5txTpTtBMcpTPnmogM0r36YATPkd/PbiFvwggXGvnBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e1d6b11f8564c56f0fd7cbf87a85adee84639cb78e44078aa6739203f9877fc","last_reissued_at":"2026-05-18T02:45:05.667209Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:05.667209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2601.22822","source_version":2,"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-18T02:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9dRRJPXKMoFw6zVLeqHGpv1Z4LK3XSpWArDV9LfFV876zcdzokpuYaIAloEfjJCjG6zLaTMohczOJlhpdAuWDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:27.668048Z"},"content_sha256":"6401af3e38a229c079ba6ef8c29b88bb33ed6ab1f5cf19a3a9e18189be329281","schema_version":"1.0","event_id":"sha256:6401af3e38a229c079ba6ef8c29b88bb33ed6ab1f5cf19a3a9e18189be329281"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HYOWWEPYKZGFN4H5PS7YPKC233","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the average number of representations of an integer as a sum of polynomials computed at prime values","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"The average number of representations of an integer as a sum of j values of a degree-k polynomial at prime powers follows a positive asymptotic for j at least k.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Alessandra Migliaccio, Alessandro Zaccagnini","submitted_at":"2026-01-30T10:47:09Z","abstract_excerpt":"We study the average number of representations of an integer $n$ as $n = \\phi(n_{1}) + \\dots + \\phi(n_{j})$, for polynomials $\\phi \\in \\mathbb{Z}[n]$ with $\\partial\\phi = k\\ge 1$, $\\operatorname{lead}(\\phi) = 1$, $j \\ge k$, where $n_{i}$ is a prime power for each $i \\in \\{1, \\dots, j\\}$. We extend the results of Languasco and Zaccagnini (2019), for $k=3$ and $j=4$, and of Cantarini, Gambini and Zaccagnini (2020), where they focused on monomials $\\phi(n) = n^k$, $k\\ge 2$ and $j=k, k + 1$."},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We study the average number of representations of an integer n as n = φ(n1) + … + φ(nj), for polynomials φ ∈ ℤ[n] with ∂φ = k ≥ 1, lead(φ) = 1, j ≥ k, where ni is a prime power for each i.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the analytic machinery (likely circle method or Vinogradov-type estimates) from the cited prior works extends uniformly to arbitrary k and all j ≥ k without additional restrictions on the polynomial or error terms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Asymptotic formulas are established for the average number of ways to write n as sum of j monic polynomial values at prime powers, generalizing earlier cases for cubics and monomials.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The average number of representations of an integer as a sum of j values of a degree-k polynomial at prime powers follows a positive asymptotic for j at least k.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"08e97b2f0c4ea66a84fa19d73f5d34c0097b7437587724e5d69454ddcbeb67e2"},"source":{"id":"2601.22822","kind":"arxiv","version":2},"verdict":{"id":"9bdbfbce-2aa6-41f0-8191-c916423476cd","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T09:39:37.534738Z","strongest_claim":"We study the average number of representations of an integer n as n = φ(n1) + … + φ(nj), for polynomials φ ∈ ℤ[n] with ∂φ = k ≥ 1, lead(φ) = 1, j ≥ k, where ni is a prime power for each i.","one_line_summary":"Asymptotic formulas are established for the average number of ways to write n as sum of j monic polynomial values at prime powers, generalizing earlier cases for cubics and monomials.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the analytic machinery (likely circle method or Vinogradov-type estimates) from the cited prior works extends uniformly to arbitrary k and all j ≥ k without additional restrictions on the polynomial or error terms.","pith_extraction_headline":"The average number of representations of an integer as a sum of j values of a degree-k polynomial at prime powers follows a positive asymptotic for j at least k."},"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":"9bdbfbce-2aa6-41f0-8191-c916423476cd"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:45:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XPKMu+XJ/qzaKIq+SLgqBKxmkiGEBiNx+E2a76nuG0ZWtXKSeiLXb8aZL1www9bv8f3uBRdrYDkZBnoxzjzJAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T12:13:27.668586Z"},"content_sha256":"0af904417a504ef3181a8c4d9039d058a65e459678020bf387e4bd2b22d9af3b","schema_version":"1.0","event_id":"sha256:0af904417a504ef3181a8c4d9039d058a65e459678020bf387e4bd2b22d9af3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HYOWWEPYKZGFN4H5PS7YPKC233/bundle.json","state_url":"https://pith.science/pith/HYOWWEPYKZGFN4H5PS7YPKC233/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HYOWWEPYKZGFN4H5PS7YPKC233/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-11T12:13:27Z","links":{"resolver":"https://pith.science/pith/HYOWWEPYKZGFN4H5PS7YPKC233","bundle":"https://pith.science/pith/HYOWWEPYKZGFN4H5PS7YPKC233/bundle.json","state":"https://pith.science/pith/HYOWWEPYKZGFN4H5PS7YPKC233/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HYOWWEPYKZGFN4H5PS7YPKC233/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HYOWWEPYKZGFN4H5PS7YPKC233","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":"40ac21c7e8d49a777b4010abef68405c930e232ab5b6118afb5339426a53260b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-01-30T10:47:09Z","title_canon_sha256":"bb0be3600fa6e60819f4d3012112a1ea30be0f10b810b9845effe71ba5f1c17a"},"schema_version":"1.0","source":{"id":"2601.22822","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2601.22822","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"arxiv_version","alias_value":"2601.22822v2","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.22822","created_at":"2026-05-18T02:45:05Z"},{"alias_kind":"pith_short_12","alias_value":"HYOWWEPYKZGF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"HYOWWEPYKZGFN4H5","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"HYOWWEPY","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0af904417a504ef3181a8c4d9039d058a65e459678020bf387e4bd2b22d9af3b","target":"graph","created_at":"2026-05-18T02:45:05Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"We study the average number of representations of an integer n as n = φ(n1) + … + φ(nj), for polynomials φ ∈ ℤ[n] with ∂φ = k ≥ 1, lead(φ) = 1, j ≥ k, where ni is a prime power for each i."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the analytic machinery (likely circle method or Vinogradov-type estimates) from the cited prior works extends uniformly to arbitrary k and all j ≥ k without additional restrictions on the polynomial or error terms."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Asymptotic formulas are established for the average number of ways to write n as sum of j monic polynomial values at prime powers, generalizing earlier cases for cubics and monomials."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The average number of representations of an integer as a sum of j values of a degree-k polynomial at prime powers follows a positive asymptotic for j at least k."}],"snapshot_sha256":"08e97b2f0c4ea66a84fa19d73f5d34c0097b7437587724e5d69454ddcbeb67e2"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study the average number of representations of an integer $n$ as $n = \\phi(n_{1}) + \\dots + \\phi(n_{j})$, for polynomials $\\phi \\in \\mathbb{Z}[n]$ with $\\partial\\phi = k\\ge 1$, $\\operatorname{lead}(\\phi) = 1$, $j \\ge k$, where $n_{i}$ is a prime power for each $i \\in \\{1, \\dots, j\\}$. We extend the results of Languasco and Zaccagnini (2019), for $k=3$ and $j=4$, and of Cantarini, Gambini and Zaccagnini (2020), where they focused on monomials $\\phi(n) = n^k$, $k\\ge 2$ and $j=k, k + 1$.","authors_text":"Alessandra Migliaccio, Alessandro Zaccagnini","cross_cats":[],"headline":"The average number of representations of an integer as a sum of j values of a degree-k polynomial at prime powers follows a positive asymptotic for j at least k.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-01-30T10:47:09Z","title":"On the average number of representations of an integer as a sum of polynomials computed at prime values"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.22822","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T09:39:37.534738Z","id":"9bdbfbce-2aa6-41f0-8191-c916423476cd","model_set":{"reader":"grok-4.3"},"one_line_summary":"Asymptotic formulas are established for the average number of ways to write n as sum of j monic polynomial values at prime powers, generalizing earlier cases for cubics and monomials.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The average number of representations of an integer as a sum of j values of a degree-k polynomial at prime powers follows a positive asymptotic for j at least k.","strongest_claim":"We study the average number of representations of an integer n as n = φ(n1) + … + φ(nj), for polynomials φ ∈ ℤ[n] with ∂φ = k ≥ 1, lead(φ) = 1, j ≥ k, where ni is a prime power for each i.","weakest_assumption":"That the analytic machinery (likely circle method or Vinogradov-type estimates) from the cited prior works extends uniformly to arbitrary k and all j ≥ k without additional restrictions on the polynomial or error terms."}},"verdict_id":"9bdbfbce-2aa6-41f0-8191-c916423476cd"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:6401af3e38a229c079ba6ef8c29b88bb33ed6ab1f5cf19a3a9e18189be329281","target":"record","created_at":"2026-05-18T02:45:05Z","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":"40ac21c7e8d49a777b4010abef68405c930e232ab5b6118afb5339426a53260b","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NT","submitted_at":"2026-01-30T10:47:09Z","title_canon_sha256":"bb0be3600fa6e60819f4d3012112a1ea30be0f10b810b9845effe71ba5f1c17a"},"schema_version":"1.0","source":{"id":"2601.22822","kind":"arxiv","version":2}},"canonical_sha256":"3e1d6b11f8564c56f0fd7cbf87a85adee84639cb78e44078aa6739203f9877fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e1d6b11f8564c56f0fd7cbf87a85adee84639cb78e44078aa6739203f9877fc","first_computed_at":"2026-05-18T02:45:05.667209Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:05.667209Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S2oDC1ww3VXS71IhpoywGjhEtFk/AAEHpqSw4xygihE5txTpTtBMcpTPnmogM0r36YATPkd/PbiFvwggXGvnBA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:05.667869Z","signed_message":"canonical_sha256_bytes"},"source_id":"2601.22822","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6401af3e38a229c079ba6ef8c29b88bb33ed6ab1f5cf19a3a9e18189be329281","sha256:0af904417a504ef3181a8c4d9039d058a65e459678020bf387e4bd2b22d9af3b"],"state_sha256":"a4c237535eefc7daf301a4827a933365c8680407a731ce0678b26bb9babe1047"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VBk5yyofsUoiSaeLRrTr044Q0B1vKoIy5A4AwiXh9Tf3H6fMY2fYcwbGxJj06zcNdnnxN7okdAHpinxzDsvAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T12:13:27.671056Z","bundle_sha256":"cc3799196fab394139a5c72ff8389e5309fd9593f7cb41aed0ef0fa7f26c2238"}}