{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:LHE2WGOURN4APOXTJHPVQLKC3P","short_pith_number":"pith:LHE2WGOU","schema_version":"1.0","canonical_sha256":"59c9ab19d48b7807baf349df582d42dbdaa117974278842444da7b93fa504122","source":{"kind":"arxiv","id":"2201.05704","version":1},"attestation_state":"computed","paper":{"title":"Erd\\H{o}s' minimum overlap problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT","math.OC"],"primary_cat":"math.CO","authors_text":"Ethan Patrick White","submitted_at":"2022-01-14T23:03:26Z","abstract_excerpt":"We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2201.05704","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2022-01-14T23:03:26Z","cross_cats_sorted":["math.NT","math.OC"],"title_canon_sha256":"29a119a601a8bd7581cbde0350a72c7f811ed9c9434d63d191bc7f9fe8d40caf","abstract_canon_sha256":"8cd6d8418c96875a2963ca1b8b2da634372adb3db4d392b555492614514b8434"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:48:50.595245Z","signature_b64":"atLISqQ4EXvCKtjx638EZMSZ7FKP9neWiKeI7XqDUoWdIr9rS6cwOQG4QMu6MVR6Zu3jgvjyo6mVEWnDVFi/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c9ab19d48b7807baf349df582d42dbdaa117974278842444da7b93fa504122","last_reissued_at":"2026-07-05T03:48:50.594897Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:48:50.594897Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Erd\\H{o}s' minimum overlap problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["math.NT","math.OC"],"primary_cat":"math.CO","authors_text":"Ethan Patrick White","submitted_at":"2022-01-14T23:03:26Z","abstract_excerpt":"We obtain a substantially improved lower bound for the minimum overlap problem asked by Erd\\H{o}s. Our approach uses elementary Fourier analysis to translate the problem to a convex optimization program."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2201.05704","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/2201.05704/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2201.05704","created_at":"2026-07-05T03:48:50.594954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2201.05704v1","created_at":"2026-07-05T03:48:50.594954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2201.05704","created_at":"2026-07-05T03:48:50.594954+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHE2WGOURN4A","created_at":"2026-07-05T03:48:50.594954+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHE2WGOURN4APOXT","created_at":"2026-07-05T03:48:50.594954+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHE2WGOU","created_at":"2026-07-05T03:48:50.594954+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.08728","citing_title":"Artificial Intelligence for Mathematical Reasoning: An Integrated Survey of Language Models, Neuro-symbolic Systems, and Verified Discovery","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2606.31182","citing_title":"AI-Assisted Discovery of Convex Relaxations via Dual Agents","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P","json":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P.json","graph_json":"https://pith.science/api/pith-number/LHE2WGOURN4APOXTJHPVQLKC3P/graph.json","events_json":"https://pith.science/api/pith-number/LHE2WGOURN4APOXTJHPVQLKC3P/events.json","paper":"https://pith.science/paper/LHE2WGOU"},"agent_actions":{"view_html":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P","download_json":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P.json","view_paper":"https://pith.science/paper/LHE2WGOU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2201.05704&json=true","fetch_graph":"https://pith.science/api/pith-number/LHE2WGOURN4APOXTJHPVQLKC3P/graph.json","fetch_events":"https://pith.science/api/pith-number/LHE2WGOURN4APOXTJHPVQLKC3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P/action/storage_attestation","attest_author":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P/action/author_attestation","sign_citation":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P/action/citation_signature","submit_replication":"https://pith.science/pith/LHE2WGOURN4APOXTJHPVQLKC3P/action/replication_record"}},"created_at":"2026-07-05T03:48:50.594954+00:00","updated_at":"2026-07-05T03:48:50.594954+00:00"}