{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:6LUG4CRURNDBTZN4L5BXI36JNW","short_pith_number":"pith:6LUG4CRU","canonical_record":{"source":{"id":"1201.6656","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-01-31T19:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"404c5dc20bb796208264e9d5d141bc0e6c57182a56381a5ae36b56ce7db18d88","abstract_canon_sha256":"545e983a7856f18a8d1e9f4dea04a725d27d3d9f56f52dc5152ca3ae6e044656"},"schema_version":"1.0"},"canonical_sha256":"f2e86e0a348b4619e5bc5f43746fc96db65198a74a827c27e9094a805bdd2999","source":{"kind":"arxiv","id":"1201.6656","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6656","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6656v4","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6656","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"6LUG4CRURNDB","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6LUG4CRURNDBTZN4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6LUG4CRU","created_at":"2026-05-18T12:26:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:6LUG4CRURNDBTZN4L5BXI36JNW","target":"record","payload":{"canonical_record":{"source":{"id":"1201.6656","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-01-31T19:37:03Z","cross_cats_sorted":[],"title_canon_sha256":"404c5dc20bb796208264e9d5d141bc0e6c57182a56381a5ae36b56ce7db18d88","abstract_canon_sha256":"545e983a7856f18a8d1e9f4dea04a725d27d3d9f56f52dc5152ca3ae6e044656"},"schema_version":"1.0"},"canonical_sha256":"f2e86e0a348b4619e5bc5f43746fc96db65198a74a827c27e9094a805bdd2999","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:48.624503Z","signature_b64":"W9e/dVDxL3JsMYX2KBcYz5Tr3paL2nOQyPRrte7uzCs61cvC8Ib2u3zMxjrmxCeP0K2EkqANz0V6/cDf4p31Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2e86e0a348b4619e5bc5f43746fc96db65198a74a827c27e9094a805bdd2999","last_reissued_at":"2026-05-18T03:51:48.623923Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:48.623923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.6656","source_version":4,"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-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OydHhnAZNrQEnxV5t5H47Uan+OT/L2Z5CycJ2GVWeD2pj8w8K8OcIG4eRHTehoMYZXWdyaL0HuqpNWGHPGA6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:42:33.943741Z"},"content_sha256":"fbcefc49ba1d5a3f6326f35911503747722e6d76153645bc3ea7f90e0f6ad4ff","schema_version":"1.0","event_id":"sha256:fbcefc49ba1d5a3f6326f35911503747722e6d76153645bc3ea7f90e0f6ad4ff"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:6LUG4CRURNDBTZN4L5BXI36JNW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Every odd number greater than 1 is the sum of at most five primes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Terence Tao","submitted_at":"2012-01-31T19:37:03Z","abstract_excerpt":"We prove that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle method of Hardy-Littlewood and Vinogradov, together with Vaughan's identity; our additional techniques, which may be of interest for other Goldbach-type problems, include the use of smoothed exponential sums and optimisation of the Vaughan identity parameters to save or reduce some logarithmic losses, the use of multiple scales following some ideas of Bourgain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6656","kind":"arxiv","version":4},"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-18T03:51:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oiqwe0p+udIky+xBtvGEygc+z7ribuMLH96D6KWUWvLd2KafGY+CJxnPRzRyp+V6aPdTxqkEWecLW2jeqCVuAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T21:42:33.944452Z"},"content_sha256":"6be54633d80f0dad432affcffa8e8b0a8e5535863c7adbfabd78667bd20fef1a","schema_version":"1.0","event_id":"sha256:6be54633d80f0dad432affcffa8e8b0a8e5535863c7adbfabd78667bd20fef1a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LUG4CRURNDBTZN4L5BXI36JNW/bundle.json","state_url":"https://pith.science/pith/6LUG4CRURNDBTZN4L5BXI36JNW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LUG4CRURNDBTZN4L5BXI36JNW/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-06T21:42:33Z","links":{"resolver":"https://pith.science/pith/6LUG4CRURNDBTZN4L5BXI36JNW","bundle":"https://pith.science/pith/6LUG4CRURNDBTZN4L5BXI36JNW/bundle.json","state":"https://pith.science/pith/6LUG4CRURNDBTZN4L5BXI36JNW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LUG4CRURNDBTZN4L5BXI36JNW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6LUG4CRURNDBTZN4L5BXI36JNW","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":"545e983a7856f18a8d1e9f4dea04a725d27d3d9f56f52dc5152ca3ae6e044656","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-01-31T19:37:03Z","title_canon_sha256":"404c5dc20bb796208264e9d5d141bc0e6c57182a56381a5ae36b56ce7db18d88"},"schema_version":"1.0","source":{"id":"1201.6656","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6656","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6656v4","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6656","created_at":"2026-05-18T03:51:48Z"},{"alias_kind":"pith_short_12","alias_value":"6LUG4CRURNDB","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6LUG4CRURNDBTZN4","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6LUG4CRU","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:6be54633d80f0dad432affcffa8e8b0a8e5535863c7adbfabd78667bd20fef1a","target":"graph","created_at":"2026-05-18T03:51:48Z","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 that every odd number $N$ greater than 1 can be expressed as the sum of at most five primes, improving the result of Ramar\\'e that every even natural number can be expressed as the sum of at most six primes. We follow the circle method of Hardy-Littlewood and Vinogradov, together with Vaughan's identity; our additional techniques, which may be of interest for other Goldbach-type problems, include the use of smoothed exponential sums and optimisation of the Vaughan identity parameters to save or reduce some logarithmic losses, the use of multiple scales following some ideas of Bourgain","authors_text":"Terence Tao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-01-31T19:37:03Z","title":"Every odd number greater than 1 is the sum of at most five primes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6656","kind":"arxiv","version":4},"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:fbcefc49ba1d5a3f6326f35911503747722e6d76153645bc3ea7f90e0f6ad4ff","target":"record","created_at":"2026-05-18T03:51:48Z","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":"545e983a7856f18a8d1e9f4dea04a725d27d3d9f56f52dc5152ca3ae6e044656","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2012-01-31T19:37:03Z","title_canon_sha256":"404c5dc20bb796208264e9d5d141bc0e6c57182a56381a5ae36b56ce7db18d88"},"schema_version":"1.0","source":{"id":"1201.6656","kind":"arxiv","version":4}},"canonical_sha256":"f2e86e0a348b4619e5bc5f43746fc96db65198a74a827c27e9094a805bdd2999","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2e86e0a348b4619e5bc5f43746fc96db65198a74a827c27e9094a805bdd2999","first_computed_at":"2026-05-18T03:51:48.623923Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:48.623923Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"W9e/dVDxL3JsMYX2KBcYz5Tr3paL2nOQyPRrte7uzCs61cvC8Ib2u3zMxjrmxCeP0K2EkqANz0V6/cDf4p31Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:48.624503Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6656","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fbcefc49ba1d5a3f6326f35911503747722e6d76153645bc3ea7f90e0f6ad4ff","sha256:6be54633d80f0dad432affcffa8e8b0a8e5535863c7adbfabd78667bd20fef1a"],"state_sha256":"fbed9c82ba2d3a825f532fee5755e05fb8b7c77b818e02af3212f239cd00f73c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ICSkdlKL8EbpG+SKOk7o5xhcFaKXtNpNCVCM6DjgGQLOxpWnEJgcsfNo0fqgtoJzt4Krwf9TlDRJss8sDcnqAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T21:42:33.947869Z","bundle_sha256":"a2f9e4df074fecbd717c6e7e158b03e93eb6e0c24fe5358f2fe5fcfeb25d1d03"}}