{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:D5V4NGOEMR4AGVBFIKO5KYELFP","short_pith_number":"pith:D5V4NGOE","canonical_record":{"source":{"id":"1801.01813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2017-12-29T03:16:47Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6d1f7966c10c770a0935e17596f590b84697549af8dce4de54104f533fdc32f5","abstract_canon_sha256":"0289135547511ff6728a696479abcdfd7a591e401ff877466beeeb0528c49fa5"},"schema_version":"1.0"},"canonical_sha256":"1f6bc699c46478035425429dd5608b2bd901c313196652fcd2e2a04e2b739dcb","source":{"kind":"arxiv","id":"1801.01813","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01813","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01813v1","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01813","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"D5V4NGOEMR4A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D5V4NGOEMR4AGVBF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D5V4NGOE","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:D5V4NGOEMR4AGVBFIKO5KYELFP","target":"record","payload":{"canonical_record":{"source":{"id":"1801.01813","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2017-12-29T03:16:47Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"6d1f7966c10c770a0935e17596f590b84697549af8dce4de54104f533fdc32f5","abstract_canon_sha256":"0289135547511ff6728a696479abcdfd7a591e401ff877466beeeb0528c49fa5"},"schema_version":"1.0"},"canonical_sha256":"1f6bc699c46478035425429dd5608b2bd901c313196652fcd2e2a04e2b739dcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:40.919915Z","signature_b64":"LvoELGxVU8FoL5ygODJ6+MUUliPATmzy7hD7CtSkBPxgdAnbmsvdczpCWX1oqq79WVxqGYlUZiGP1gNa2ZuRAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f6bc699c46478035425429dd5608b2bd901c313196652fcd2e2a04e2b739dcb","last_reissued_at":"2026-05-18T00:26:40.919214Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:40.919214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1801.01813","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tbdYFo9IDVPIVPMd8dPAb4K/1ORKy+Wp6y/pvxKIhNsGVG0mEJIJdRMNfeRSiCSOZJxcYbdX1idHEAICuFG5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:52:48.797547Z"},"content_sha256":"b82816e7dac2f437ddb3ccdb059f164aff57df38de437d36001cf400af0698ee","schema_version":"1.0","event_id":"sha256:b82816e7dac2f437ddb3ccdb059f164aff57df38de437d36001cf400af0698ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:D5V4NGOEMR4AGVBFIKO5KYELFP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On a numerical upper bound for the extended Goldbach conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.HO","authors_text":"David Quarel","submitted_at":"2017-12-29T03:16:47Z","abstract_excerpt":"The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let $D(N)$ denote the number of such prime decompositions for an even $N$. It is known that $D(N)$ can be bounded above by $$ D(N) \\leq C^* \\Theta(N), \\quad \\Theta(N):= \\frac{N}{\\log^2 N}\\prod_{\\substack{p|N p>2}} \\left( 1 + \\frac{1}{p-2}\\right)\\prod_{p>2}\\left(1-\\frac{1}{(p-1)^2}\\right) $$ where $C^*$ denotes Chen's constant. It is conjectured that $C^*=2$. In 2004, Wu showed that $C^* \\leq 7.8209$. We attempted to replicate his work in computing Chen's constant, and in doing so we provide an imp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01813","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:26:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Z4khqeIH0x8MhNKCFjFmpL/AUTw0xBzSHQDH4HssdPv/5uVcMkDgV5wV3bYtEKT04F6Se9PDkOx2nzLfTmqMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T23:52:48.798352Z"},"content_sha256":"5544af180a9f893822da39d0c56dbd5e6349a84ffb066f13d4f269d56630e979","schema_version":"1.0","event_id":"sha256:5544af180a9f893822da39d0c56dbd5e6349a84ffb066f13d4f269d56630e979"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D5V4NGOEMR4AGVBFIKO5KYELFP/bundle.json","state_url":"https://pith.science/pith/D5V4NGOEMR4AGVBFIKO5KYELFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D5V4NGOEMR4AGVBFIKO5KYELFP/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-05-31T23:52:48Z","links":{"resolver":"https://pith.science/pith/D5V4NGOEMR4AGVBFIKO5KYELFP","bundle":"https://pith.science/pith/D5V4NGOEMR4AGVBFIKO5KYELFP/bundle.json","state":"https://pith.science/pith/D5V4NGOEMR4AGVBFIKO5KYELFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D5V4NGOEMR4AGVBFIKO5KYELFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:D5V4NGOEMR4AGVBFIKO5KYELFP","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":"0289135547511ff6728a696479abcdfd7a591e401ff877466beeeb0528c49fa5","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2017-12-29T03:16:47Z","title_canon_sha256":"6d1f7966c10c770a0935e17596f590b84697549af8dce4de54104f533fdc32f5"},"schema_version":"1.0","source":{"id":"1801.01813","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.01813","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"arxiv_version","alias_value":"1801.01813v1","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.01813","created_at":"2026-05-18T00:26:40Z"},{"alias_kind":"pith_short_12","alias_value":"D5V4NGOEMR4A","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"D5V4NGOEMR4AGVBF","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"D5V4NGOE","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:5544af180a9f893822da39d0c56dbd5e6349a84ffb066f13d4f269d56630e979","target":"graph","created_at":"2026-05-18T00:26:40Z","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":"The Goldbach conjecture states that every even number can be decomposed as the sum of two primes. Let $D(N)$ denote the number of such prime decompositions for an even $N$. It is known that $D(N)$ can be bounded above by $$ D(N) \\leq C^* \\Theta(N), \\quad \\Theta(N):= \\frac{N}{\\log^2 N}\\prod_{\\substack{p|N p>2}} \\left( 1 + \\frac{1}{p-2}\\right)\\prod_{p>2}\\left(1-\\frac{1}{(p-1)^2}\\right) $$ where $C^*$ denotes Chen's constant. It is conjectured that $C^*=2$. In 2004, Wu showed that $C^* \\leq 7.8209$. We attempted to replicate his work in computing Chen's constant, and in doing so we provide an imp","authors_text":"David Quarel","cross_cats":["math.NT"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2017-12-29T03:16:47Z","title":"On a numerical upper bound for the extended Goldbach conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.01813","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:b82816e7dac2f437ddb3ccdb059f164aff57df38de437d36001cf400af0698ee","target":"record","created_at":"2026-05-18T00:26:40Z","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":"0289135547511ff6728a696479abcdfd7a591e401ff877466beeeb0528c49fa5","cross_cats_sorted":["math.NT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.HO","submitted_at":"2017-12-29T03:16:47Z","title_canon_sha256":"6d1f7966c10c770a0935e17596f590b84697549af8dce4de54104f533fdc32f5"},"schema_version":"1.0","source":{"id":"1801.01813","kind":"arxiv","version":1}},"canonical_sha256":"1f6bc699c46478035425429dd5608b2bd901c313196652fcd2e2a04e2b739dcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1f6bc699c46478035425429dd5608b2bd901c313196652fcd2e2a04e2b739dcb","first_computed_at":"2026-05-18T00:26:40.919214Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:40.919214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LvoELGxVU8FoL5ygODJ6+MUUliPATmzy7hD7CtSkBPxgdAnbmsvdczpCWX1oqq79WVxqGYlUZiGP1gNa2ZuRAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:40.919915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.01813","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b82816e7dac2f437ddb3ccdb059f164aff57df38de437d36001cf400af0698ee","sha256:5544af180a9f893822da39d0c56dbd5e6349a84ffb066f13d4f269d56630e979"],"state_sha256":"3e44b83574837c58df7e494cb3c3a218a606ac113bec17b6b76d7ec6b699b9f2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zslQftlcL5dbcpRcItgDYvy+G21IXsuy5MPJLaqkYWv5+zCxXm+Inxc2uvpDtkwJ2VEW5PRaXmtpkbkzRda0Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T23:52:48.802742Z","bundle_sha256":"1cf901e3a635de70e20579871c6f134e28f148c8746c010660f108c79ab71e62"}}