{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GAZ5WXAVAHODRFQTDZR5SCHKDU","short_pith_number":"pith:GAZ5WXAV","schema_version":"1.0","canonical_sha256":"3033db5c1501dc3896131e63d908ea1d29c91b6532385aa43aef0e081e8dd692","source":{"kind":"arxiv","id":"1410.6179","version":1},"attestation_state":"computed","paper":{"title":"Evaluating Prime Power Gauss and Jacobi Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christopher Pinner, Misty Long, Vincent Pigno","submitted_at":"2014-10-22T20:23:19Z","abstract_excerpt":"We show that for any mod $p^m$ characters, $\\chi_1, \\dots, \\chi_k,$ the Jacobi sum, $$ \\sum_{x_1=1}^{p^m}\\dots \\sum_{\\substack{x_k=1\\\\x_1+\\dots+x_k=B}}^{p^m}\\chi_1(x_1)\\dots \\chi_k(x_k), $$ has a simple evaluation when $m$ is sufficiently large (for $m\\geq 2$ if $p\\nmid B$). As part of the proof we give a simple evaluation of the mod $p^m$ Gauss sums when $m\\geq 2$."},"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":"1410.6179","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2014-10-22T20:23:19Z","cross_cats_sorted":[],"title_canon_sha256":"7a6e26d5878e5998c44c622be9fa5587f0b5cb8115a0bbbb468a33866bd131b8","abstract_canon_sha256":"3075ea871a19b7096ee8284bc8101414adfc2aaa74c61ad879ec6e2749119449"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:31.440612Z","signature_b64":"qMQMn6ynsS+IbBYcZDExH380TNP5l8EVmpA0J+9oTERXktIut3S3tTy3nL/iEiOyBibRRwNBmTKEzvobYjEBCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3033db5c1501dc3896131e63d908ea1d29c91b6532385aa43aef0e081e8dd692","last_reissued_at":"2026-05-18T02:39:31.440099Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:31.440099Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Evaluating Prime Power Gauss and Jacobi Sums","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christopher Pinner, Misty Long, Vincent Pigno","submitted_at":"2014-10-22T20:23:19Z","abstract_excerpt":"We show that for any mod $p^m$ characters, $\\chi_1, \\dots, \\chi_k,$ the Jacobi sum, $$ \\sum_{x_1=1}^{p^m}\\dots \\sum_{\\substack{x_k=1\\\\x_1+\\dots+x_k=B}}^{p^m}\\chi_1(x_1)\\dots \\chi_k(x_k), $$ has a simple evaluation when $m$ is sufficiently large (for $m\\geq 2$ if $p\\nmid B$). As part of the proof we give a simple evaluation of the mod $p^m$ Gauss sums when $m\\geq 2$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.6179","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1410.6179","created_at":"2026-05-18T02:39:31.440171+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.6179v1","created_at":"2026-05-18T02:39:31.440171+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.6179","created_at":"2026-05-18T02:39:31.440171+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAZ5WXAVAHOD","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAZ5WXAVAHODRFQT","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAZ5WXAV","created_at":"2026-05-18T12:28:30.664211+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/GAZ5WXAVAHODRFQTDZR5SCHKDU","json":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU.json","graph_json":"https://pith.science/api/pith-number/GAZ5WXAVAHODRFQTDZR5SCHKDU/graph.json","events_json":"https://pith.science/api/pith-number/GAZ5WXAVAHODRFQTDZR5SCHKDU/events.json","paper":"https://pith.science/paper/GAZ5WXAV"},"agent_actions":{"view_html":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU","download_json":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU.json","view_paper":"https://pith.science/paper/GAZ5WXAV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.6179&json=true","fetch_graph":"https://pith.science/api/pith-number/GAZ5WXAVAHODRFQTDZR5SCHKDU/graph.json","fetch_events":"https://pith.science/api/pith-number/GAZ5WXAVAHODRFQTDZR5SCHKDU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU/action/storage_attestation","attest_author":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU/action/author_attestation","sign_citation":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU/action/citation_signature","submit_replication":"https://pith.science/pith/GAZ5WXAVAHODRFQTDZR5SCHKDU/action/replication_record"}},"created_at":"2026-05-18T02:39:31.440171+00:00","updated_at":"2026-05-18T02:39:31.440171+00:00"}