{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:U6EMPYC2ISCMUXEH22KHOYSGTI","short_pith_number":"pith:U6EMPYC2","canonical_record":{"source":{"id":"2607.05823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-07T04:40:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e7b35370a1764f333851f54fed840b636eeb81e28057fb07a1a7852e6586d3cf","abstract_canon_sha256":"27c3afd47f44a6036b9db6aa6441d6b47f0e3e6613c13c684cdcc47ffad70ddb"},"schema_version":"1.0"},"canonical_sha256":"a788c7e05a4484ca5c87d6947762469a227d0f02ef78435601eb3d8455df1edf","source":{"kind":"arxiv","id":"2607.05823","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05823","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05823v1","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05823","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"U6EMPYC2ISCM","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"U6EMPYC2ISCMUXEH","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"U6EMPYC2","created_at":"2026-07-08T01:18:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:U6EMPYC2ISCMUXEH22KHOYSGTI","target":"record","payload":{"canonical_record":{"source":{"id":"2607.05823","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-07T04:40:06Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e7b35370a1764f333851f54fed840b636eeb81e28057fb07a1a7852e6586d3cf","abstract_canon_sha256":"27c3afd47f44a6036b9db6aa6441d6b47f0e3e6613c13c684cdcc47ffad70ddb"},"schema_version":"1.0"},"canonical_sha256":"a788c7e05a4484ca5c87d6947762469a227d0f02ef78435601eb3d8455df1edf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-08T01:18:47.060892Z","signature_b64":"6u4jBXYbbje5wlc/jWJ9MOrsr7QThhJaMTPAOCjop+c7ZSESEF0VbXYzzo7NLt80xg84TuadWwps60Z3U0zaAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a788c7e05a4484ca5c87d6947762469a227d0f02ef78435601eb3d8455df1edf","last_reissued_at":"2026-07-08T01:18:47.060176Z","signature_status":"signed_v1","first_computed_at":"2026-07-08T01:18:47.060176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2607.05823","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-07-08T01:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MWzcq4+RlagEqFfk/14aQKB1PLGTzWcTZhJL1opDGjYXcwcVTP0IWBsTd5CHAu839J+uhmv6bSnE3fyIeH9xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:58:40.485736Z"},"content_sha256":"e288d40d0ac6669214faf0ef35d6687d39a2b3875d18325db21c04c0e6474501","schema_version":"1.0","event_id":"sha256:e288d40d0ac6669214faf0ef35d6687d39a2b3875d18325db21c04c0e6474501"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:U6EMPYC2ISCMUXEH22KHOYSGTI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Large Sets of Integers with No Harmonic Triples","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.NT","authors_text":"Samuel Korsky","submitted_at":"2026-07-07T04:40:06Z","abstract_excerpt":"Let $f(N)$ denote the largest size of a set $A\\subseteq [N]=\\{1,\\ldots,N\\}$ containing no distinct $a,b,c$ such that \\[\n  \\frac2a=\\frac1b+\\frac1c . \\] We prove \\[\n  f(N)\\gg N\\exp\\!\\left(-(2\\sqrt{\\log(24/7)}+o(1))\\sqrt{\\log\\log N}\\right). \\] The construction filters the odd integers up to $N$ by a random affine image of a dense three-term-progression-free set in a prime field $\\mathbb{F}_q$ with $q\\asymp\\log N$, and then deletes a controlled family of collapsed triples."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05823","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.05823/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-08T01:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vzEBvNobQsqKlTK0vGP9zS569UtQKOYZSXMtCjUSN5FFWM0fVB4+p4um9oK56zDOFD8Gs/DrXGYgAPLQOtIJCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T10:58:40.486669Z"},"content_sha256":"25f53a91762e7f337ff01b0b6262cb9d4b89e1c12e24a5d966d2d3b7862bc39a","schema_version":"1.0","event_id":"sha256:25f53a91762e7f337ff01b0b6262cb9d4b89e1c12e24a5d966d2d3b7862bc39a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6EMPYC2ISCMUXEH22KHOYSGTI/bundle.json","state_url":"https://pith.science/pith/U6EMPYC2ISCMUXEH22KHOYSGTI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6EMPYC2ISCMUXEH22KHOYSGTI/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-08-13T10:58:40Z","links":{"resolver":"https://pith.science/pith/U6EMPYC2ISCMUXEH22KHOYSGTI","bundle":"https://pith.science/pith/U6EMPYC2ISCMUXEH22KHOYSGTI/bundle.json","state":"https://pith.science/pith/U6EMPYC2ISCMUXEH22KHOYSGTI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6EMPYC2ISCMUXEH22KHOYSGTI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:U6EMPYC2ISCMUXEH22KHOYSGTI","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":"27c3afd47f44a6036b9db6aa6441d6b47f0e3e6613c13c684cdcc47ffad70ddb","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-07T04:40:06Z","title_canon_sha256":"e7b35370a1764f333851f54fed840b636eeb81e28057fb07a1a7852e6586d3cf"},"schema_version":"1.0","source":{"id":"2607.05823","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.05823","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"2607.05823v1","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.05823","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"U6EMPYC2ISCM","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"pith_short_16","alias_value":"U6EMPYC2ISCMUXEH","created_at":"2026-07-08T01:18:47Z"},{"alias_kind":"pith_short_8","alias_value":"U6EMPYC2","created_at":"2026-07-08T01:18:47Z"}],"graph_snapshots":[{"event_id":"sha256:25f53a91762e7f337ff01b0b6262cb9d4b89e1c12e24a5d966d2d3b7862bc39a","target":"graph","created_at":"2026-07-08T01:18:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.05823/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Let $f(N)$ denote the largest size of a set $A\\subseteq [N]=\\{1,\\ldots,N\\}$ containing no distinct $a,b,c$ such that \\[\n  \\frac2a=\\frac1b+\\frac1c . \\] We prove \\[\n  f(N)\\gg N\\exp\\!\\left(-(2\\sqrt{\\log(24/7)}+o(1))\\sqrt{\\log\\log N}\\right). \\] The construction filters the odd integers up to $N$ by a random affine image of a dense three-term-progression-free set in a prime field $\\mathbb{F}_q$ with $q\\asymp\\log N$, and then deletes a controlled family of collapsed triples.","authors_text":"Samuel Korsky","cross_cats":["math.CO"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-07T04:40:06Z","title":"Large Sets of Integers with No Harmonic Triples"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.05823","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:e288d40d0ac6669214faf0ef35d6687d39a2b3875d18325db21c04c0e6474501","target":"record","created_at":"2026-07-08T01:18:47Z","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":"27c3afd47f44a6036b9db6aa6441d6b47f0e3e6613c13c684cdcc47ffad70ddb","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.NT","submitted_at":"2026-07-07T04:40:06Z","title_canon_sha256":"e7b35370a1764f333851f54fed840b636eeb81e28057fb07a1a7852e6586d3cf"},"schema_version":"1.0","source":{"id":"2607.05823","kind":"arxiv","version":1}},"canonical_sha256":"a788c7e05a4484ca5c87d6947762469a227d0f02ef78435601eb3d8455df1edf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a788c7e05a4484ca5c87d6947762469a227d0f02ef78435601eb3d8455df1edf","first_computed_at":"2026-07-08T01:18:47.060176Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-08T01:18:47.060176Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6u4jBXYbbje5wlc/jWJ9MOrsr7QThhJaMTPAOCjop+c7ZSESEF0VbXYzzo7NLt80xg84TuadWwps60Z3U0zaAQ==","signature_status":"signed_v1","signed_at":"2026-07-08T01:18:47.060892Z","signed_message":"canonical_sha256_bytes"},"source_id":"2607.05823","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e288d40d0ac6669214faf0ef35d6687d39a2b3875d18325db21c04c0e6474501","sha256:25f53a91762e7f337ff01b0b6262cb9d4b89e1c12e24a5d966d2d3b7862bc39a"],"state_sha256":"ccce30287efd49d0ab796eb3417095b9f683ffe5e4781859540204a2f845de23"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GJVsrPKqTSNEInCNcU2X/UgjhwuYPD9VsKdwshcLI7Iws5QnJV4O33KCIQ/rojMzekspmBdSDsOnWOAD9yPvDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T10:58:40.494624Z","bundle_sha256":"b7d2d274eb2780f603f06a2bf9ba6fd6e24c155807a7099b8adf0a0582427559"}}