{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:WRL276IHCYKCTMX4G4IS5SOOWW","short_pith_number":"pith:WRL276IH","canonical_record":{"source":{"id":"1805.02945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-05-08T11:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"12e224a285d23d18ed4c66f86740b687ac53b6cc8a90510b6707964e43e81cba","abstract_canon_sha256":"a09b1effe8e948293285d76eb13089fedb109a3f46bfdb02e18ff55e20dca766"},"schema_version":"1.0"},"canonical_sha256":"b457aff907161429b2fc37112ec9ceb591d34b94babd1ef1f11322467619edb3","source":{"kind":"arxiv","id":"1805.02945","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02945","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02945v1","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02945","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"WRL276IHCYKC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRL276IHCYKCTMX4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRL276IH","created_at":"2026-05-18T12:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:WRL276IHCYKCTMX4G4IS5SOOWW","target":"record","payload":{"canonical_record":{"source":{"id":"1805.02945","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-05-08T11:07:51Z","cross_cats_sorted":[],"title_canon_sha256":"12e224a285d23d18ed4c66f86740b687ac53b6cc8a90510b6707964e43e81cba","abstract_canon_sha256":"a09b1effe8e948293285d76eb13089fedb109a3f46bfdb02e18ff55e20dca766"},"schema_version":"1.0"},"canonical_sha256":"b457aff907161429b2fc37112ec9ceb591d34b94babd1ef1f11322467619edb3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:16:35.165248Z","signature_b64":"C8r6SdtLHzWt9NRkhP787Y/zlWqIagwNeEzx/9sa9cpRfXqc6vXGTDK9BMdNy0zngyrTcn5ffzS72djYs07eDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b457aff907161429b2fc37112ec9ceb591d34b94babd1ef1f11322467619edb3","last_reissued_at":"2026-05-18T00:16:35.164596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:16:35.164596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1805.02945","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-18T00:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WZ0ZThsfFJp4Y4RfiOkM2hmP26FzIJRXP8d8lsQeHPDakJF1QfF/DRcSdmTi8HJP5b4dIYFikkaYNSfw45rWAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:14:03.859133Z"},"content_sha256":"523fa27009d3b5136ad208795ce877ba71da92c39ab958cd953e774586fca02d","schema_version":"1.0","event_id":"sha256:523fa27009d3b5136ad208795ce877ba71da92c39ab958cd953e774586fca02d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:WRL276IHCYKCTMX4G4IS5SOOWW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The number of solutions of the Erd\\H{o}s-Straus Equation and sums of $k$ unit fractions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian Elsholtz, Stefan Planitzer","submitted_at":"2018-05-08T11:07:51Z","abstract_excerpt":"We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\\mathcal{O}_{\\epsilon}(n^{3/5+\\epsilon})$ solutions of $\\frac{m}{n}=\\frac{1}{a_1}+\\frac{1}{a_2}+\\frac{1}{a_3}$. This improves upon a result of Browning and Elsholtz (2011) and extends a result of Elsholtz and Tao (2013) who proved this when $m=4$ and $n$ is a prime. Moreover there exists an algorithm finding all solutions in expected running time $\\mathcal{O}_{\\epsilon}\\left(n^{\\epsilon}\\left(\\frac{n^3}{m^2}\\right)^{1/5}\\r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02945","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-18T00:16:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hJ45NIO8RDrK7NbV+9PyzcubLUn9RyPOs9PXgB2MHWeyVTZvvgIJWytyhck+xqzSzvFPEiGl5rPAptK06WBXAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T13:14:03.859758Z"},"content_sha256":"7c00178b8262486f0ba074d4ea0252640e292da342620cfae43786731ae7b0b0","schema_version":"1.0","event_id":"sha256:7c00178b8262486f0ba074d4ea0252640e292da342620cfae43786731ae7b0b0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WRL276IHCYKCTMX4G4IS5SOOWW/bundle.json","state_url":"https://pith.science/pith/WRL276IHCYKCTMX4G4IS5SOOWW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WRL276IHCYKCTMX4G4IS5SOOWW/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-09T13:14:03Z","links":{"resolver":"https://pith.science/pith/WRL276IHCYKCTMX4G4IS5SOOWW","bundle":"https://pith.science/pith/WRL276IHCYKCTMX4G4IS5SOOWW/bundle.json","state":"https://pith.science/pith/WRL276IHCYKCTMX4G4IS5SOOWW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WRL276IHCYKCTMX4G4IS5SOOWW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:WRL276IHCYKCTMX4G4IS5SOOWW","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":"a09b1effe8e948293285d76eb13089fedb109a3f46bfdb02e18ff55e20dca766","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-05-08T11:07:51Z","title_canon_sha256":"12e224a285d23d18ed4c66f86740b687ac53b6cc8a90510b6707964e43e81cba"},"schema_version":"1.0","source":{"id":"1805.02945","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.02945","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"arxiv_version","alias_value":"1805.02945v1","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.02945","created_at":"2026-05-18T00:16:35Z"},{"alias_kind":"pith_short_12","alias_value":"WRL276IHCYKC","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"WRL276IHCYKCTMX4","created_at":"2026-05-18T12:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"WRL276IH","created_at":"2026-05-18T12:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:7c00178b8262486f0ba074d4ea0252640e292da342620cfae43786731ae7b0b0","target":"graph","created_at":"2026-05-18T00:16:35Z","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":"We prove new upper bounds for the number of representations of an arbitrary rational number as a sum of three unit fractions. In particular, for fixed $m$ there are at most $\\mathcal{O}_{\\epsilon}(n^{3/5+\\epsilon})$ solutions of $\\frac{m}{n}=\\frac{1}{a_1}+\\frac{1}{a_2}+\\frac{1}{a_3}$. This improves upon a result of Browning and Elsholtz (2011) and extends a result of Elsholtz and Tao (2013) who proved this when $m=4$ and $n$ is a prime. Moreover there exists an algorithm finding all solutions in expected running time $\\mathcal{O}_{\\epsilon}\\left(n^{\\epsilon}\\left(\\frac{n^3}{m^2}\\right)^{1/5}\\r","authors_text":"Christian Elsholtz, Stefan Planitzer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-05-08T11:07:51Z","title":"The number of solutions of the Erd\\H{o}s-Straus Equation and sums of $k$ unit fractions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.02945","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:523fa27009d3b5136ad208795ce877ba71da92c39ab958cd953e774586fca02d","target":"record","created_at":"2026-05-18T00:16:35Z","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":"a09b1effe8e948293285d76eb13089fedb109a3f46bfdb02e18ff55e20dca766","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2018-05-08T11:07:51Z","title_canon_sha256":"12e224a285d23d18ed4c66f86740b687ac53b6cc8a90510b6707964e43e81cba"},"schema_version":"1.0","source":{"id":"1805.02945","kind":"arxiv","version":1}},"canonical_sha256":"b457aff907161429b2fc37112ec9ceb591d34b94babd1ef1f11322467619edb3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b457aff907161429b2fc37112ec9ceb591d34b94babd1ef1f11322467619edb3","first_computed_at":"2026-05-18T00:16:35.164596Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:16:35.164596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C8r6SdtLHzWt9NRkhP787Y/zlWqIagwNeEzx/9sa9cpRfXqc6vXGTDK9BMdNy0zngyrTcn5ffzS72djYs07eDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:16:35.165248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.02945","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:523fa27009d3b5136ad208795ce877ba71da92c39ab958cd953e774586fca02d","sha256:7c00178b8262486f0ba074d4ea0252640e292da342620cfae43786731ae7b0b0"],"state_sha256":"a36b694539a814b9363f6bcfcbec749f6e20d5c5dfb37b5d231cd04ea4648950"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dWnYCtCwogLm0fmOKPic4QXht3yGyG/nk9RErCqbTI1eVpBtzQ0NBHA4SQBRs+latvVPdWwfb+TtNOvkqR/NDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T13:14:03.862921Z","bundle_sha256":"9e097a632668885672fe70f13fb0a2e76cbfe07380693ae6c7ee1085035ba3b2"}}