{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:S46IZI7GR4ELMMXEWTFNBVUZQD","short_pith_number":"pith:S46IZI7G","schema_version":"1.0","canonical_sha256":"973c8ca3e68f08b632e4b4cad0d69980c3aa075f8975bb7af40426af868cc65b","source":{"kind":"arxiv","id":"1107.5394","version":1},"attestation_state":"computed","paper":{"title":"A Note on Terence Tao's Paper \"On the Number of Solutions to 4/p=1/n_1+1/n_2+1/n_3\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chaohua Jia","submitted_at":"2011-07-27T05:55:52Z","abstract_excerpt":"For the positive integer $n$, let $f(n)$ denote the number of positive integer solutions $(n_1,\\,n_2,\\,n_3)$ of the Diophantine equation $$ {4\\over n}={1\\over n_1}+{1\\over n_2}+{1\\over n_3}. $$ For the prime number $p$, $f(p)$ can be split into $f_1(p)+f_2(p),$ where $f_i(p)(i=1,\\,2)$ counts those solutions with exactly $i$ of denominators$n_1,\\,n_2,\\,n_3$ divisible by $p.$\n  Recently Terence Tao proved that $$ \\sum_{p< x}f_2(p)\\ll x\\log^2x\\log\\log x $$ with other results. But actually only the upper bound $x\\log^2x\\log\\log^2x$ can be obtained in his discussion. In this note we shall use an el"},"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":"1107.5394","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-07-27T05:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"19725d4be0c7f22f269781aace1a85ba521bd81a5a1303ccbaf1585dd90614c6","abstract_canon_sha256":"92e581cb396f3abedcdc45e85644115e33a4a78c1bf76586a8da2450c100b2f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:16:52.126361Z","signature_b64":"3q1bYbcGPMchh20Rvjed8RgCwrueg0bxtL5eukguP1Puz4av1ySo5fERvsk3P6n1RyvQLjoE8W9L/fXZ0JRqAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"973c8ca3e68f08b632e4b4cad0d69980c3aa075f8975bb7af40426af868cc65b","last_reissued_at":"2026-05-18T04:16:52.125795Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:16:52.125795Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Note on Terence Tao's Paper \"On the Number of Solutions to 4/p=1/n_1+1/n_2+1/n_3\"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Chaohua Jia","submitted_at":"2011-07-27T05:55:52Z","abstract_excerpt":"For the positive integer $n$, let $f(n)$ denote the number of positive integer solutions $(n_1,\\,n_2,\\,n_3)$ of the Diophantine equation $$ {4\\over n}={1\\over n_1}+{1\\over n_2}+{1\\over n_3}. $$ For the prime number $p$, $f(p)$ can be split into $f_1(p)+f_2(p),$ where $f_i(p)(i=1,\\,2)$ counts those solutions with exactly $i$ of denominators$n_1,\\,n_2,\\,n_3$ divisible by $p.$\n  Recently Terence Tao proved that $$ \\sum_{p< x}f_2(p)\\ll x\\log^2x\\log\\log x $$ with other results. But actually only the upper bound $x\\log^2x\\log\\log^2x$ can be obtained in his discussion. In this note we shall use an el"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1107.5394","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":"1107.5394","created_at":"2026-05-18T04:16:52.125873+00:00"},{"alias_kind":"arxiv_version","alias_value":"1107.5394v1","created_at":"2026-05-18T04:16:52.125873+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1107.5394","created_at":"2026-05-18T04:16:52.125873+00:00"},{"alias_kind":"pith_short_12","alias_value":"S46IZI7GR4EL","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_16","alias_value":"S46IZI7GR4ELMMXE","created_at":"2026-05-18T12:26:41.206345+00:00"},{"alias_kind":"pith_short_8","alias_value":"S46IZI7G","created_at":"2026-05-18T12:26:41.206345+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/S46IZI7GR4ELMMXEWTFNBVUZQD","json":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD.json","graph_json":"https://pith.science/api/pith-number/S46IZI7GR4ELMMXEWTFNBVUZQD/graph.json","events_json":"https://pith.science/api/pith-number/S46IZI7GR4ELMMXEWTFNBVUZQD/events.json","paper":"https://pith.science/paper/S46IZI7G"},"agent_actions":{"view_html":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD","download_json":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD.json","view_paper":"https://pith.science/paper/S46IZI7G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1107.5394&json=true","fetch_graph":"https://pith.science/api/pith-number/S46IZI7GR4ELMMXEWTFNBVUZQD/graph.json","fetch_events":"https://pith.science/api/pith-number/S46IZI7GR4ELMMXEWTFNBVUZQD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD/action/storage_attestation","attest_author":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD/action/author_attestation","sign_citation":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD/action/citation_signature","submit_replication":"https://pith.science/pith/S46IZI7GR4ELMMXEWTFNBVUZQD/action/replication_record"}},"created_at":"2026-05-18T04:16:52.125873+00:00","updated_at":"2026-05-18T04:16:52.125873+00:00"}