{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:LE4B23EHOKLRC6XDSBUCXCC2ZX","short_pith_number":"pith:LE4B23EH","canonical_record":{"source":{"id":"1610.03669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-10-12T11:07:28Z","cross_cats_sorted":[],"title_canon_sha256":"49648a2cf806300f9139b04143fa7c2d494ccb62bf5e5ad1ce2f3350485c57bd","abstract_canon_sha256":"139b4d155c0dfe4dcd78da22af05c90029a725db81d34e856db4cc82e5b10e4b"},"schema_version":"1.0"},"canonical_sha256":"59381d6c877297117ae390682b885acdc7609974f7e7670d61300d97653ea385","source":{"kind":"arxiv","id":"1610.03669","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03669","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03669v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03669","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"LE4B23EHOKLR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LE4B23EHOKLRC6XD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LE4B23EH","created_at":"2026-05-18T12:30:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:LE4B23EHOKLRC6XDSBUCXCC2ZX","target":"record","payload":{"canonical_record":{"source":{"id":"1610.03669","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-10-12T11:07:28Z","cross_cats_sorted":[],"title_canon_sha256":"49648a2cf806300f9139b04143fa7c2d494ccb62bf5e5ad1ce2f3350485c57bd","abstract_canon_sha256":"139b4d155c0dfe4dcd78da22af05c90029a725db81d34e856db4cc82e5b10e4b"},"schema_version":"1.0"},"canonical_sha256":"59381d6c877297117ae390682b885acdc7609974f7e7670d61300d97653ea385","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:29.619769Z","signature_b64":"B0s9iWmM5+Is76QxHIM1WDDJsxMDNZtkcmN4Ov2aoKKo0zbYVYluao4BTs88o8wZ2cu5cbpgWgTZoVcTRMceAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59381d6c877297117ae390682b885acdc7609974f7e7670d61300d97653ea385","last_reissued_at":"2026-05-18T01:02:29.619144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:29.619144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1610.03669","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-18T01:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YiCS+qIPH76lCwfaYIZm4H+5Fu6d1Xm3S5llP1tNTBgFyEc34D8hsEKUpDF+kcqznXrf/56Ljn3GN4SffkShBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:55:51.653994Z"},"content_sha256":"85e8dc4293fee9f114bea3e272a7572272096198160cb1cff17f82bf21e0906e","schema_version":"1.0","event_id":"sha256:85e8dc4293fee9f114bea3e272a7572272096198160cb1cff17f82bf21e0906e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:LE4B23EHOKLRC6XDSBUCXCC2ZX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An exact upper bound for sums of element orders in non-cyclic finite groups","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.GR","authors_text":"Marcel Herzog, Mercede Maj, Patrizia Longobardi","submitted_at":"2016-10-12T11:07:28Z","abstract_excerpt":"Denote the sum of element orders in a finite group $G$ by $\\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. Suppose that $G$ is a non-cyclic finite group of order $n$ and $q$ is the least prime divisor of $n$. We proved that $\\psi(G)\\leq\\frac 7{11}\\psi(C_n)$ and $\\psi(G)<\\frac 1{q-1}\\psi(C_n)$. The first result is best possible, since for each $n=4k$, $k$ odd, there exists a group $G$ of order $n$ satisfying $\\psi(G)=\\frac 7{11}\\psi(C_n)$ and the second result implies that if $G$ is of odd order, then $\\psi(G)<\\frac 12\\psi(C_n)$. Our results improve the inequality $\\psi(G)<\\psi(C_n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03669","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-18T01:02:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CLwJxQjwg100UuzIlPxyyaoh65SdCZBKFvIBguNVespvlNHH5dPIvPQJHTktxMY+NEWThWq2gBkm/szZgTFUCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T19:55:51.654353Z"},"content_sha256":"a806224b338a0d1e27e52b5ca80dfb1de94f4b57906caf40afed1bd1fd85738a","schema_version":"1.0","event_id":"sha256:a806224b338a0d1e27e52b5ca80dfb1de94f4b57906caf40afed1bd1fd85738a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX/bundle.json","state_url":"https://pith.science/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX/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-03T19:55:51Z","links":{"resolver":"https://pith.science/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX","bundle":"https://pith.science/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX/bundle.json","state":"https://pith.science/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LE4B23EHOKLRC6XDSBUCXCC2ZX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:LE4B23EHOKLRC6XDSBUCXCC2ZX","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":"139b4d155c0dfe4dcd78da22af05c90029a725db81d34e856db4cc82e5b10e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-10-12T11:07:28Z","title_canon_sha256":"49648a2cf806300f9139b04143fa7c2d494ccb62bf5e5ad1ce2f3350485c57bd"},"schema_version":"1.0","source":{"id":"1610.03669","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.03669","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"arxiv_version","alias_value":"1610.03669v1","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.03669","created_at":"2026-05-18T01:02:29Z"},{"alias_kind":"pith_short_12","alias_value":"LE4B23EHOKLR","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_16","alias_value":"LE4B23EHOKLRC6XD","created_at":"2026-05-18T12:30:29Z"},{"alias_kind":"pith_short_8","alias_value":"LE4B23EH","created_at":"2026-05-18T12:30:29Z"}],"graph_snapshots":[{"event_id":"sha256:a806224b338a0d1e27e52b5ca80dfb1de94f4b57906caf40afed1bd1fd85738a","target":"graph","created_at":"2026-05-18T01:02:29Z","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":"Denote the sum of element orders in a finite group $G$ by $\\psi(G)$ and let $C_n$ denote the cyclic group of order $n$. Suppose that $G$ is a non-cyclic finite group of order $n$ and $q$ is the least prime divisor of $n$. We proved that $\\psi(G)\\leq\\frac 7{11}\\psi(C_n)$ and $\\psi(G)<\\frac 1{q-1}\\psi(C_n)$. The first result is best possible, since for each $n=4k$, $k$ odd, there exists a group $G$ of order $n$ satisfying $\\psi(G)=\\frac 7{11}\\psi(C_n)$ and the second result implies that if $G$ is of odd order, then $\\psi(G)<\\frac 12\\psi(C_n)$. Our results improve the inequality $\\psi(G)<\\psi(C_n","authors_text":"Marcel Herzog, Mercede Maj, Patrizia Longobardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-10-12T11:07:28Z","title":"An exact upper bound for sums of element orders in non-cyclic finite groups"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.03669","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:85e8dc4293fee9f114bea3e272a7572272096198160cb1cff17f82bf21e0906e","target":"record","created_at":"2026-05-18T01:02:29Z","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":"139b4d155c0dfe4dcd78da22af05c90029a725db81d34e856db4cc82e5b10e4b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.GR","submitted_at":"2016-10-12T11:07:28Z","title_canon_sha256":"49648a2cf806300f9139b04143fa7c2d494ccb62bf5e5ad1ce2f3350485c57bd"},"schema_version":"1.0","source":{"id":"1610.03669","kind":"arxiv","version":1}},"canonical_sha256":"59381d6c877297117ae390682b885acdc7609974f7e7670d61300d97653ea385","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59381d6c877297117ae390682b885acdc7609974f7e7670d61300d97653ea385","first_computed_at":"2026-05-18T01:02:29.619144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:29.619144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B0s9iWmM5+Is76QxHIM1WDDJsxMDNZtkcmN4Ov2aoKKo0zbYVYluao4BTs88o8wZ2cu5cbpgWgTZoVcTRMceAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:29.619769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.03669","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:85e8dc4293fee9f114bea3e272a7572272096198160cb1cff17f82bf21e0906e","sha256:a806224b338a0d1e27e52b5ca80dfb1de94f4b57906caf40afed1bd1fd85738a"],"state_sha256":"109eb8437f0adc8313fbd7a72662a88df3874e933af248e7898c6a4ed357dced"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5tUSj1CSAYSryL4cXonA4UysqEu73TID/5z89Tr58FMnMEs3JPvYz5eFEmD72Dk47y934ZFEFL6eUULAmTm0AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T19:55:51.656358Z","bundle_sha256":"ce4fffc86c459d3d7f81b76e403c0d1f0c58315f1e530d080d0e781ad4a19cbc"}}