{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IGEWY6K4LWWMP4PXWY2E7FUML4","short_pith_number":"pith:IGEWY6K4","canonical_record":{"source":{"id":"1612.08722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-27T20:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"a4d7eb8c1a92af7675d72a98dd2951e07afdd887d35f95cfcbedc76712e5e99f","abstract_canon_sha256":"c3349d35ab9cd81ea95e3895af5cca9f9bcee100e4f1189a347f7119d75af1df"},"schema_version":"1.0"},"canonical_sha256":"41896c795c5dacc7f1f7b6344f968c5f2f01a70fe5c5f767b1727f25ec85ebc3","source":{"kind":"arxiv","id":"1612.08722","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08722","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08722v1","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08722","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"IGEWY6K4LWWM","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IGEWY6K4LWWMP4PX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IGEWY6K4","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IGEWY6K4LWWMP4PXWY2E7FUML4","target":"record","payload":{"canonical_record":{"source":{"id":"1612.08722","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-27T20:06:13Z","cross_cats_sorted":[],"title_canon_sha256":"a4d7eb8c1a92af7675d72a98dd2951e07afdd887d35f95cfcbedc76712e5e99f","abstract_canon_sha256":"c3349d35ab9cd81ea95e3895af5cca9f9bcee100e4f1189a347f7119d75af1df"},"schema_version":"1.0"},"canonical_sha256":"41896c795c5dacc7f1f7b6344f968c5f2f01a70fe5c5f767b1727f25ec85ebc3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:52.278357Z","signature_b64":"Ba21ppTim79jlLVB1B+LRi2azzXq2MxOOBs2w2oXH7HouLxuSlBjlAZl+he82swbBpNXR9rdBnqeDnx06pVECg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41896c795c5dacc7f1f7b6344f968c5f2f01a70fe5c5f767b1727f25ec85ebc3","last_reissued_at":"2026-05-18T00:53:52.277906Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:52.277906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.08722","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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8tG++6hBwuHAFBLLDbVennXh0TwRv5mHpEz5yGakLIZqjHKqmVBldxZTcSnc56V9IA8jPB9LzsXNgmKEgCZ7Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:51:41.555168Z"},"content_sha256":"de6adbb0e4d5f5679d5431c0ef42c3b9cdb53ac5a2f5d57ebbf97f3b5bce9cb4","schema_version":"1.0","event_id":"sha256:de6adbb0e4d5f5679d5431c0ef42c3b9cdb53ac5a2f5d57ebbf97f3b5bce9cb4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IGEWY6K4LWWMP4PXWY2E7FUML4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A lower bound of Ruzsa's number related to the Erd\\H{o}s-Tur\\'an conjecture","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NT","authors_text":"Csaba S\\'andor, Quan-Hui Yang","submitted_at":"2016-12-27T20:06:13Z","abstract_excerpt":"For a set $A\\subseteq \\mathbb{N}$ and $n\\in \\mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\\in A\\times A$ such that $a+a'=n$. The celebrated Erd\\H{o}s-Tur\\'{a}n conjecture says that, if $R_A(n)\\ge 1$ for all sufficiently large integers $n$, then the representation function $R_A(n)$ cannot be bounded. For any positive integer $m$, Ruzsa's number $R_m$ is defined to be the least positive integer $r$ such that there exists a set $A\\subseteq \\mathbb{Z}_m$ with $1\\le R_A(n)\\le r$ for all $n\\in \\mathbb{Z}_m$. In 2008, Chen proved that $R_{m}\\le 288$ for all positive integers $m$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08722","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:53:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NAQsIBx9KunvldsKjRn30o1vXgdkhVc0V+Oq827QVTSq5r2oiKbFBAw+qnshJmuzu9x+A0Ct8eZh2cFcMNydCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:51:41.555688Z"},"content_sha256":"94f39071bf2a3ee28bedb760737ecff6128f897e58dc14e7c23e3031b3b9e919","schema_version":"1.0","event_id":"sha256:94f39071bf2a3ee28bedb760737ecff6128f897e58dc14e7c23e3031b3b9e919"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IGEWY6K4LWWMP4PXWY2E7FUML4/bundle.json","state_url":"https://pith.science/pith/IGEWY6K4LWWMP4PXWY2E7FUML4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IGEWY6K4LWWMP4PXWY2E7FUML4/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-27T03:51:41Z","links":{"resolver":"https://pith.science/pith/IGEWY6K4LWWMP4PXWY2E7FUML4","bundle":"https://pith.science/pith/IGEWY6K4LWWMP4PXWY2E7FUML4/bundle.json","state":"https://pith.science/pith/IGEWY6K4LWWMP4PXWY2E7FUML4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IGEWY6K4LWWMP4PXWY2E7FUML4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IGEWY6K4LWWMP4PXWY2E7FUML4","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":"c3349d35ab9cd81ea95e3895af5cca9f9bcee100e4f1189a347f7119d75af1df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-27T20:06:13Z","title_canon_sha256":"a4d7eb8c1a92af7675d72a98dd2951e07afdd887d35f95cfcbedc76712e5e99f"},"schema_version":"1.0","source":{"id":"1612.08722","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.08722","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"arxiv_version","alias_value":"1612.08722v1","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.08722","created_at":"2026-05-18T00:53:52Z"},{"alias_kind":"pith_short_12","alias_value":"IGEWY6K4LWWM","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IGEWY6K4LWWMP4PX","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IGEWY6K4","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:94f39071bf2a3ee28bedb760737ecff6128f897e58dc14e7c23e3031b3b9e919","target":"graph","created_at":"2026-05-18T00:53:52Z","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":"For a set $A\\subseteq \\mathbb{N}$ and $n\\in \\mathbb{N}$, let $R_A(n)$ denote the number of ordered pairs $(a,a')\\in A\\times A$ such that $a+a'=n$. The celebrated Erd\\H{o}s-Tur\\'{a}n conjecture says that, if $R_A(n)\\ge 1$ for all sufficiently large integers $n$, then the representation function $R_A(n)$ cannot be bounded. For any positive integer $m$, Ruzsa's number $R_m$ is defined to be the least positive integer $r$ such that there exists a set $A\\subseteq \\mathbb{Z}_m$ with $1\\le R_A(n)\\le r$ for all $n\\in \\mathbb{Z}_m$. In 2008, Chen proved that $R_{m}\\le 288$ for all positive integers $m$","authors_text":"Csaba S\\'andor, Quan-Hui Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-27T20:06:13Z","title":"A lower bound of Ruzsa's number related to the Erd\\H{o}s-Tur\\'an conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.08722","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:de6adbb0e4d5f5679d5431c0ef42c3b9cdb53ac5a2f5d57ebbf97f3b5bce9cb4","target":"record","created_at":"2026-05-18T00:53:52Z","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":"c3349d35ab9cd81ea95e3895af5cca9f9bcee100e4f1189a347f7119d75af1df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NT","submitted_at":"2016-12-27T20:06:13Z","title_canon_sha256":"a4d7eb8c1a92af7675d72a98dd2951e07afdd887d35f95cfcbedc76712e5e99f"},"schema_version":"1.0","source":{"id":"1612.08722","kind":"arxiv","version":1}},"canonical_sha256":"41896c795c5dacc7f1f7b6344f968c5f2f01a70fe5c5f767b1727f25ec85ebc3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41896c795c5dacc7f1f7b6344f968c5f2f01a70fe5c5f767b1727f25ec85ebc3","first_computed_at":"2026-05-18T00:53:52.277906Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:52.277906Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ba21ppTim79jlLVB1B+LRi2azzXq2MxOOBs2w2oXH7HouLxuSlBjlAZl+he82swbBpNXR9rdBnqeDnx06pVECg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:52.278357Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.08722","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:de6adbb0e4d5f5679d5431c0ef42c3b9cdb53ac5a2f5d57ebbf97f3b5bce9cb4","sha256:94f39071bf2a3ee28bedb760737ecff6128f897e58dc14e7c23e3031b3b9e919"],"state_sha256":"c373a89f43b6c8464efd5a490729915a3f67e75c20e4640c21522537c7b1f172"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RZPyuEFxOZVw1sdkVOow0yHFrvWjUJnkb0arZPvyAsUOBFq69kZAZwlfXgO2OjHvb5WKusFvGue9gQlmEUK9CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:51:41.558449Z","bundle_sha256":"2f8b8f4478322892165616f7dca1950e1316c9774b24b6fb728d952ee78235cc"}}