{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:JTXVVP2QQ7HA6BJOIARIKRTVXF","short_pith_number":"pith:JTXVVP2Q","canonical_record":{"source":{"id":"2607.11113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-13T05:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"9643c3098841dd1eef5c951ebd1502e333bf67e32b1cb0847f8409055222a06b","abstract_canon_sha256":"ec94f28c7d0aada908106bf9d534afff4e398a3ad1acc55a4cc507055580ff84"},"schema_version":"1.0"},"canonical_sha256":"4cef5abf5087ce0f052e4022854675b94d50d77047fcdb6d6a7b17acd19dddaa","source":{"kind":"arxiv","id":"2607.11113","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11113","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11113v1","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11113","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"JTXVVP2QQ7HA","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"pith_short_16","alias_value":"JTXVVP2QQ7HA6BJO","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"pith_short_8","alias_value":"JTXVVP2Q","created_at":"2026-07-14T01:22:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:JTXVVP2QQ7HA6BJOIARIKRTVXF","target":"record","payload":{"canonical_record":{"source":{"id":"2607.11113","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-13T05:43:03Z","cross_cats_sorted":[],"title_canon_sha256":"9643c3098841dd1eef5c951ebd1502e333bf67e32b1cb0847f8409055222a06b","abstract_canon_sha256":"ec94f28c7d0aada908106bf9d534afff4e398a3ad1acc55a4cc507055580ff84"},"schema_version":"1.0"},"canonical_sha256":"4cef5abf5087ce0f052e4022854675b94d50d77047fcdb6d6a7b17acd19dddaa","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T01:22:17.109111Z","signature_b64":"lIdsTe0nVf/NcZW6zxlNwzVeUjXgdUod0wf9m33CJmD0cYde/2D+fyIddMP/Z0la3GdGCRiWqUL/jP8qkbXkBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cef5abf5087ce0f052e4022854675b94d50d77047fcdb6d6a7b17acd19dddaa","last_reissued_at":"2026-07-14T01:22:17.108236Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T01:22:17.108236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.11113","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-07-14T01:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cyNnMaE3IPV53OKFHJY/hEV6g/WQqaWwSx7UeAf8rOWopPKEKKEmu8/nVY+EEGi0XJlOs4JXuqrqfkC16h4sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:34:32.325438Z"},"content_sha256":"7db7d448dce18af3c2aa26f6268c920cf62b38c7fb5ac69dd19583d78af5ec77","schema_version":"1.0","event_id":"sha256:7db7d448dce18af3c2aa26f6268c920cf62b38c7fb5ac69dd19583d78af5ec77"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:JTXVVP2QQ7HA6BJOIARIKRTVXF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Higher-Order Congruence for Reciprocal Power Sums and Generalized Lehmer-Type Products","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Hao Zhong, Zhenming Tang","submitted_at":"2026-07-13T05:43:03Z","abstract_excerpt":"This paper investigates high-order congruences of reciprocal power sums and Lehmer-type products. Let $n\\geq 1$ with $(n,6)=1$ and $e\\in\\{2,3,4,6\\}$. For the reciprocal square sums \\begin{equation*}\n  S(n)=\\sum_{\\substack{r=1 \\\\ (r,n)=1}}^{\\lfloor n/e \\rfloor}\\frac{1}{r^2} \\end{equation*} we already know the form of the congruence modulo $n$. In this paper, motivated by the known congruences, we first extend these results to certain reciprocal sums of odd order and establish a uniform congruence modulo $n$ for \\begin{equation*}\n  S_m(n)=\\sum_{\\substack{r=1 \\\\ (r,n)=1}}^{\\lfloor n/e \\rfloor}\\fr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11113","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.11113/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-14T01:22:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0VTu316vcG8sN+51cp6OJ2nJvUihyOz79Ty3ji9N2kjzOoLu0eM/I0pRZS5kPieqPAtT/8VH9l3lbmWovHnWDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T19:34:32.325940Z"},"content_sha256":"dc1164228328b5f118ac218ed2de25e2f45c5d84993db53b5a2db022cd96be47","schema_version":"1.0","event_id":"sha256:dc1164228328b5f118ac218ed2de25e2f45c5d84993db53b5a2db022cd96be47"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF/bundle.json","state_url":"https://pith.science/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF/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-08-11T19:34:32Z","links":{"resolver":"https://pith.science/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF","bundle":"https://pith.science/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF/bundle.json","state":"https://pith.science/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTXVVP2QQ7HA6BJOIARIKRTVXF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:JTXVVP2QQ7HA6BJOIARIKRTVXF","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":"ec94f28c7d0aada908106bf9d534afff4e398a3ad1acc55a4cc507055580ff84","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-13T05:43:03Z","title_canon_sha256":"9643c3098841dd1eef5c951ebd1502e333bf67e32b1cb0847f8409055222a06b"},"schema_version":"1.0","source":{"id":"2607.11113","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.11113","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"arxiv_version","alias_value":"2607.11113v1","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11113","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"pith_short_12","alias_value":"JTXVVP2QQ7HA","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"pith_short_16","alias_value":"JTXVVP2QQ7HA6BJO","created_at":"2026-07-14T01:22:17Z"},{"alias_kind":"pith_short_8","alias_value":"JTXVVP2Q","created_at":"2026-07-14T01:22:17Z"}],"graph_snapshots":[{"event_id":"sha256:dc1164228328b5f118ac218ed2de25e2f45c5d84993db53b5a2db022cd96be47","target":"graph","created_at":"2026-07-14T01:22:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.11113/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper investigates high-order congruences of reciprocal power sums and Lehmer-type products. Let $n\\geq 1$ with $(n,6)=1$ and $e\\in\\{2,3,4,6\\}$. For the reciprocal square sums \\begin{equation*}\n  S(n)=\\sum_{\\substack{r=1 \\\\ (r,n)=1}}^{\\lfloor n/e \\rfloor}\\frac{1}{r^2} \\end{equation*} we already know the form of the congruence modulo $n$. In this paper, motivated by the known congruences, we first extend these results to certain reciprocal sums of odd order and establish a uniform congruence modulo $n$ for \\begin{equation*}\n  S_m(n)=\\sum_{\\substack{r=1 \\\\ (r,n)=1}}^{\\lfloor n/e \\rfloor}\\fr","authors_text":"Hao Zhong, Zhenming Tang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-13T05:43:03Z","title":"Higher-Order Congruence for Reciprocal Power Sums and Generalized Lehmer-Type Products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11113","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:7db7d448dce18af3c2aa26f6268c920cf62b38c7fb5ac69dd19583d78af5ec77","target":"record","created_at":"2026-07-14T01:22:17Z","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":"ec94f28c7d0aada908106bf9d534afff4e398a3ad1acc55a4cc507055580ff84","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-13T05:43:03Z","title_canon_sha256":"9643c3098841dd1eef5c951ebd1502e333bf67e32b1cb0847f8409055222a06b"},"schema_version":"1.0","source":{"id":"2607.11113","kind":"arxiv","version":1}},"canonical_sha256":"4cef5abf5087ce0f052e4022854675b94d50d77047fcdb6d6a7b17acd19dddaa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cef5abf5087ce0f052e4022854675b94d50d77047fcdb6d6a7b17acd19dddaa","first_computed_at":"2026-07-14T01:22:17.108236Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-14T01:22:17.108236Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"lIdsTe0nVf/NcZW6zxlNwzVeUjXgdUod0wf9m33CJmD0cYde/2D+fyIddMP/Z0la3GdGCRiWqUL/jP8qkbXkBg==","signature_status":"signed_v1","signed_at":"2026-07-14T01:22:17.109111Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.11113","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7db7d448dce18af3c2aa26f6268c920cf62b38c7fb5ac69dd19583d78af5ec77","sha256:dc1164228328b5f118ac218ed2de25e2f45c5d84993db53b5a2db022cd96be47"],"state_sha256":"5ea8f9e982009e0b3802cb2c73ee73bd9216d30d021ba3e2bc4a4463ce063916"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e2j4NtBINduezG3kXgt+n6Btu7C/GtVL5HX/lrA6DwOYq35z6z58/+Q3WEJZPLIFqYV9fXX9Rn3Tb9ABZ9W9BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T19:34:32.329763Z","bundle_sha256":"a721a37d123abe9a1c4491babb5c49588ce29462db4de9a4ab9935eb345d83cf"}}