{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZMB4FXNVOXNSTJWGKB57AHI7UB","short_pith_number":"pith:ZMB4FXNV","canonical_record":{"source":{"id":"1108.6118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-31T03:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"21735d599f4be1c5fae3f85a7d3cdf6fc160796fd4050b179601878edadfa90d","abstract_canon_sha256":"ea9941a0ae64686d381c540365a51835768f65135ddc37332fec9e6bbefba4b4"},"schema_version":"1.0"},"canonical_sha256":"cb03c2ddb575db29a6c6507bf01d1fa052c0b6139ab3cf35d6dc73abcd75efe0","source":{"kind":"arxiv","id":"1108.6118","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.6118","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.6118v1","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6118","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZMB4FXNVOXNS","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZMB4FXNVOXNSTJWG","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZMB4FXNV","created_at":"2026-05-18T12:26:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZMB4FXNVOXNSTJWGKB57AHI7UB","target":"record","payload":{"canonical_record":{"source":{"id":"1108.6118","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-31T03:08:56Z","cross_cats_sorted":[],"title_canon_sha256":"21735d599f4be1c5fae3f85a7d3cdf6fc160796fd4050b179601878edadfa90d","abstract_canon_sha256":"ea9941a0ae64686d381c540365a51835768f65135ddc37332fec9e6bbefba4b4"},"schema_version":"1.0"},"canonical_sha256":"cb03c2ddb575db29a6c6507bf01d1fa052c0b6139ab3cf35d6dc73abcd75efe0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:42:54.390382Z","signature_b64":"SDUYcOYxlewKzm7tTmp3nFoNlbzDEmr0AeLy87SPG/xULg7rTg7ocsIucGPZ1vQz4Z4lwU3/dLu/Z+C3MimvDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cb03c2ddb575db29a6c6507bf01d1fa052c0b6139ab3cf35d6dc73abcd75efe0","last_reissued_at":"2026-05-18T02:42:54.389988Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:42:54.389988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1108.6118","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-18T02:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c22r6a+ncQuxzeDXT9hitjD/ZKLyJfYT/PA8ESrrwW/0SCduEJQgmlHD9lfyYSDtWMyQYyicgHMrZbY8Q824AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:54:54.887992Z"},"content_sha256":"8eae5cba1dc87c0c1c90df71ad7ba665baabe9bbeb983005e93fd2e86d6c8b99","schema_version":"1.0","event_id":"sha256:8eae5cba1dc87c0c1c90df71ad7ba665baabe9bbeb983005e93fd2e86d6c8b99"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZMB4FXNVOXNSTJWGKB57AHI7UB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Egyptian Fractions with Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Christian Elsholtz, Li-Li Jiang, Yong-Gao Chen","submitted_at":"2011-08-31T03:08:56Z","abstract_excerpt":"Let $T_o(k)$ denote the number of solutions of $\\sum_{i=1}^k\\frac 1{x_i}=1$ in odd numbers $1<x_1<x_2<...<x_k$. It is clear that $T_o(2k)=0$. For distinct primes $p_1, p_2,..., p_t$, let $S(p_1, p_2,..., p_t)=\\{p_1^{\\alpha_1}...p_t^{\\alpha_t}\\mid \\alpha_i\\in \\mathbb{N}_0, i=1,2,..., t}$. Let $T_k(p_1,..., p_t)$ be the number of solutions $\\sum_{i=1}^{k}\\frac 1{x_i}=1$ with $1<x_1<x_2<...<x_{k}$ and $x_i\\in S(p_1, p_2,..., p_t)$. It is clear that if $T_k(p_1,..., p_t)\\not= 0$ for some $k$, then the inverse sum of all elements $s_j>1$ in $S(p_1, p_2,..., p_t)$ is more than 1.\n  In this paper we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6118","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-18T02:42:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yaxTJtw/FCv2IenVrqap77bcO0PXKP+PXRI1qZzVXez/xcv9Q7u/xh3I6b8Ru2Mk0gRcdTqQ4Td2a5gwdsVwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-28T21:54:54.888349Z"},"content_sha256":"77c60ceb120b3f6c1ee77fbb7e5ea1d3f40c0710a309c4cb8202b1995b45a671","schema_version":"1.0","event_id":"sha256:77c60ceb120b3f6c1ee77fbb7e5ea1d3f40c0710a309c4cb8202b1995b45a671"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB/bundle.json","state_url":"https://pith.science/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB/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-28T21:54:54Z","links":{"resolver":"https://pith.science/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB","bundle":"https://pith.science/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB/bundle.json","state":"https://pith.science/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZMB4FXNVOXNSTJWGKB57AHI7UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZMB4FXNVOXNSTJWGKB57AHI7UB","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":"ea9941a0ae64686d381c540365a51835768f65135ddc37332fec9e6bbefba4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-31T03:08:56Z","title_canon_sha256":"21735d599f4be1c5fae3f85a7d3cdf6fc160796fd4050b179601878edadfa90d"},"schema_version":"1.0","source":{"id":"1108.6118","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1108.6118","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1108.6118v1","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1108.6118","created_at":"2026-05-18T02:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"ZMB4FXNVOXNS","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_16","alias_value":"ZMB4FXNVOXNSTJWG","created_at":"2026-05-18T12:26:47Z"},{"alias_kind":"pith_short_8","alias_value":"ZMB4FXNV","created_at":"2026-05-18T12:26:47Z"}],"graph_snapshots":[{"event_id":"sha256:77c60ceb120b3f6c1ee77fbb7e5ea1d3f40c0710a309c4cb8202b1995b45a671","target":"graph","created_at":"2026-05-18T02:42:54Z","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":"Let $T_o(k)$ denote the number of solutions of $\\sum_{i=1}^k\\frac 1{x_i}=1$ in odd numbers $1<x_1<x_2<...<x_k$. It is clear that $T_o(2k)=0$. For distinct primes $p_1, p_2,..., p_t$, let $S(p_1, p_2,..., p_t)=\\{p_1^{\\alpha_1}...p_t^{\\alpha_t}\\mid \\alpha_i\\in \\mathbb{N}_0, i=1,2,..., t}$. Let $T_k(p_1,..., p_t)$ be the number of solutions $\\sum_{i=1}^{k}\\frac 1{x_i}=1$ with $1<x_1<x_2<...<x_{k}$ and $x_i\\in S(p_1, p_2,..., p_t)$. It is clear that if $T_k(p_1,..., p_t)\\not= 0$ for some $k$, then the inverse sum of all elements $s_j>1$ in $S(p_1, p_2,..., p_t)$ is more than 1.\n  In this paper we ","authors_text":"Christian Elsholtz, Li-Li Jiang, Yong-Gao Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-31T03:08:56Z","title":"Egyptian Fractions with Restrictions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1108.6118","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:8eae5cba1dc87c0c1c90df71ad7ba665baabe9bbeb983005e93fd2e86d6c8b99","target":"record","created_at":"2026-05-18T02:42:54Z","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":"ea9941a0ae64686d381c540365a51835768f65135ddc37332fec9e6bbefba4b4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2011-08-31T03:08:56Z","title_canon_sha256":"21735d599f4be1c5fae3f85a7d3cdf6fc160796fd4050b179601878edadfa90d"},"schema_version":"1.0","source":{"id":"1108.6118","kind":"arxiv","version":1}},"canonical_sha256":"cb03c2ddb575db29a6c6507bf01d1fa052c0b6139ab3cf35d6dc73abcd75efe0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cb03c2ddb575db29a6c6507bf01d1fa052c0b6139ab3cf35d6dc73abcd75efe0","first_computed_at":"2026-05-18T02:42:54.389988Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:42:54.389988Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDUYcOYxlewKzm7tTmp3nFoNlbzDEmr0AeLy87SPG/xULg7rTg7ocsIucGPZ1vQz4Z4lwU3/dLu/Z+C3MimvDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:42:54.390382Z","signed_message":"canonical_sha256_bytes"},"source_id":"1108.6118","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8eae5cba1dc87c0c1c90df71ad7ba665baabe9bbeb983005e93fd2e86d6c8b99","sha256:77c60ceb120b3f6c1ee77fbb7e5ea1d3f40c0710a309c4cb8202b1995b45a671"],"state_sha256":"a0a4ef12fa6b8abab3054999d62f93d94c4e6c891f9994faf16be4a308543729"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aZoo6KxFXom/5KaFqjgSUeCq7vPF7wVyzujffe5mtYpVGEFgxf5DDWO/25WFa2wf5tun0mfRYUrVNhATqDSaAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-28T21:54:54.890239Z","bundle_sha256":"96f691dc0c4f781c1e4249785a4ecbec492a54ff183679185fe661de60cdd584"}}