{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:4YVE6UIEXM7X2QWFTRDZSD5C4J","short_pith_number":"pith:4YVE6UIE","canonical_record":{"source":{"id":"1109.0867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-09-05T12:02:55Z","cross_cats_sorted":[],"title_canon_sha256":"17d6c29e39811a1f4062c90a305a948a6cfb9ebc7bcf303ec6294a89760d42ab","abstract_canon_sha256":"4f922a822f6d8ba034e411f53274372c343edd36fcc2f9caf7743c529698e804"},"schema_version":"1.0"},"canonical_sha256":"e62a4f5104bb3f7d42c59c47990fa2e251ae937a312326eab87a28e94161aff2","source":{"kind":"arxiv","id":"1109.0867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0867","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0867v1","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0867","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"4YVE6UIEXM7X","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4YVE6UIEXM7X2QWF","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4YVE6UIE","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:4YVE6UIEXM7X2QWFTRDZSD5C4J","target":"record","payload":{"canonical_record":{"source":{"id":"1109.0867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-09-05T12:02:55Z","cross_cats_sorted":[],"title_canon_sha256":"17d6c29e39811a1f4062c90a305a948a6cfb9ebc7bcf303ec6294a89760d42ab","abstract_canon_sha256":"4f922a822f6d8ba034e411f53274372c343edd36fcc2f9caf7743c529698e804"},"schema_version":"1.0"},"canonical_sha256":"e62a4f5104bb3f7d42c59c47990fa2e251ae937a312326eab87a28e94161aff2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:14:06.498514Z","signature_b64":"cIBTqMAFafU+R+iMDZ/iVg5Ja2B48XmhbFUplOrln3gH0ie4LXUXYN06KWg36BuzaXUrfViPcx83gnW5OSVnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e62a4f5104bb3f7d42c59c47990fa2e251ae937a312326eab87a28e94161aff2","last_reissued_at":"2026-05-18T04:14:06.497936Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:14:06.497936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.0867","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-18T04:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8Xq42bPtmhmCGUniNPfNgx8JHhtwScR0PJi/sWGz0dLIl2EFBUzm+GqJQa/l6FV+Gi6sMQnw7RpePLk6Ts8zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:15:07.618657Z"},"content_sha256":"e67afcca3de95ebde0669ffe43f683f10744ef15c151a7e64a9ff9cb8675e995","schema_version":"1.0","event_id":"sha256:e67afcca3de95ebde0669ffe43f683f10744ef15c151a7e64a9ff9cb8675e995"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:4YVE6UIEXM7X2QWFTRDZSD5C4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mean Value from Representation of Rational Number as Sum of Two Egyptian Fractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chaohua Jia","submitted_at":"2011-09-05T12:02:55Z","abstract_excerpt":"For given positive integers $n$ and $a$, let $R(n;\\,a)$ denote the number of positive integer solutions $(x,\\,y)$ of the Diophantine equation $$ {a\\over n}={1\\over x}+{1\\over y}. $$ Write $$ S(N;\\,a)=\\sum_{\\substack{n\\leq N (n,\\,a)=1}}R(n;\\,a). $$ Recently Jingjing Huang and R. C. Vaughan proved that for $4\\leq N$ and $a\\leq 2N$, there is an asymptotic formula $$ S(N;\\,a)={3\\over \\pi^2a}\\prod_{p|a}{p-1\\over p+1}\\cdot N(\\log^2N+c_1(a) \\log N+c_0(a))+\\Delta(N;\\,a). $$ In this paper, we shall get a more explicit expression with better error term for $c_0(a)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0867","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-18T04:14:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ir2aHzO97AD4y1yXRWBGG9zWp8Y75eSiBeeGYE14klp6PuVmeG9qp9xjkZ0r/NNC52SGAUkK9N36a862t++YDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T22:15:07.619079Z"},"content_sha256":"dbee1cf449342a261e34162fb2f122caef0f10642e6a8f1883bc631c19e4a732","schema_version":"1.0","event_id":"sha256:dbee1cf449342a261e34162fb2f122caef0f10642e6a8f1883bc631c19e4a732"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J/bundle.json","state_url":"https://pith.science/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J/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-29T22:15:07Z","links":{"resolver":"https://pith.science/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J","bundle":"https://pith.science/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J/bundle.json","state":"https://pith.science/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4YVE6UIEXM7X2QWFTRDZSD5C4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:4YVE6UIEXM7X2QWFTRDZSD5C4J","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":"4f922a822f6d8ba034e411f53274372c343edd36fcc2f9caf7743c529698e804","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-09-05T12:02:55Z","title_canon_sha256":"17d6c29e39811a1f4062c90a305a948a6cfb9ebc7bcf303ec6294a89760d42ab"},"schema_version":"1.0","source":{"id":"1109.0867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.0867","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"arxiv_version","alias_value":"1109.0867v1","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.0867","created_at":"2026-05-18T04:14:06Z"},{"alias_kind":"pith_short_12","alias_value":"4YVE6UIEXM7X","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"4YVE6UIEXM7X2QWF","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"4YVE6UIE","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:dbee1cf449342a261e34162fb2f122caef0f10642e6a8f1883bc631c19e4a732","target":"graph","created_at":"2026-05-18T04:14:06Z","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":"For given positive integers $n$ and $a$, let $R(n;\\,a)$ denote the number of positive integer solutions $(x,\\,y)$ of the Diophantine equation $$ {a\\over n}={1\\over x}+{1\\over y}. $$ Write $$ S(N;\\,a)=\\sum_{\\substack{n\\leq N (n,\\,a)=1}}R(n;\\,a). $$ Recently Jingjing Huang and R. C. Vaughan proved that for $4\\leq N$ and $a\\leq 2N$, there is an asymptotic formula $$ S(N;\\,a)={3\\over \\pi^2a}\\prod_{p|a}{p-1\\over p+1}\\cdot N(\\log^2N+c_1(a) \\log N+c_0(a))+\\Delta(N;\\,a). $$ In this paper, we shall get a more explicit expression with better error term for $c_0(a)$.","authors_text":"Chaohua Jia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-09-05T12:02:55Z","title":"Mean Value from Representation of Rational Number as Sum of Two Egyptian Fractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.0867","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:e67afcca3de95ebde0669ffe43f683f10744ef15c151a7e64a9ff9cb8675e995","target":"record","created_at":"2026-05-18T04:14:06Z","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":"4f922a822f6d8ba034e411f53274372c343edd36fcc2f9caf7743c529698e804","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-09-05T12:02:55Z","title_canon_sha256":"17d6c29e39811a1f4062c90a305a948a6cfb9ebc7bcf303ec6294a89760d42ab"},"schema_version":"1.0","source":{"id":"1109.0867","kind":"arxiv","version":1}},"canonical_sha256":"e62a4f5104bb3f7d42c59c47990fa2e251ae937a312326eab87a28e94161aff2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e62a4f5104bb3f7d42c59c47990fa2e251ae937a312326eab87a28e94161aff2","first_computed_at":"2026-05-18T04:14:06.497936Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:14:06.497936Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cIBTqMAFafU+R+iMDZ/iVg5Ja2B48XmhbFUplOrln3gH0ie4LXUXYN06KWg36BuzaXUrfViPcx83gnW5OSVnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:14:06.498514Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.0867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e67afcca3de95ebde0669ffe43f683f10744ef15c151a7e64a9ff9cb8675e995","sha256:dbee1cf449342a261e34162fb2f122caef0f10642e6a8f1883bc631c19e4a732"],"state_sha256":"f02f791849df2850dbeec07f958e50b5c92d406dd937def5fef7c70ace2667c1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kAFjWxhcVEAcLIKwq4B5BwuOKDQ+/MSQkQM5WldJ9E4D2G7CG190+Rnje4zyR4nOUcL+ISBvqtXIR0TSUFyPDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T22:15:07.621178Z","bundle_sha256":"c055a169ccafd150e803c8cc9d0d050da891a1c35d434a9d629b54bb1172be77"}}