{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FNJOWWSYEMC4EPUPEFCDGFKW6A","short_pith_number":"pith:FNJOWWSY","schema_version":"1.0","canonical_sha256":"2b52eb5a582305c23e8f2144331556f02fdf6d91d2711e5fd331e0bf42b895c1","source":{"kind":"arxiv","id":"2509.02561","version":1},"attestation_state":"computed","paper":{"title":"Random Cayley graphs and random sumsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Huy Tuan Pham, Noga Alon","submitted_at":"2025-09-02T17:56:07Z","abstract_excerpt":"We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in the sumset $A+A$ and is not much smaller than it. Using this result we obtain improved bounds for the problem of estimating the typical independence number of sparse random Cayley or Cayley-sum graphs, and for the problem of estimating the smallest size of a subset of $G$ which is not a sumset. We also obtain tight bounds for the typical maximum length of a"},"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":"2509.02561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-09-02T17:56:07Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"d43516c5d4f83ccd846aaca6076fc9b1a3fc174539f029367a8dcc476e1bd56f","abstract_canon_sha256":"ec3df329b022df9215b7ce0ce0c1d9f4131cf4459e183854c88675ba736559b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:03:41.058347Z","signature_b64":"oFlXsGy4jEuBpqsuERy0aiJ6DI982mvW5jpEijJnQWWkvE970iWBPytsdUwYxlIcENyZGj2MPbmY57/VxN0cAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2b52eb5a582305c23e8f2144331556f02fdf6d91d2711e5fd331e0bf42b895c1","last_reissued_at":"2026-07-05T12:03:41.057875Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:03:41.057875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Cayley graphs and random sumsets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Huy Tuan Pham, Noga Alon","submitted_at":"2025-09-02T17:56:07Z","abstract_excerpt":"We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in the sumset $A+A$ and is not much smaller than it. Using this result we obtain improved bounds for the problem of estimating the typical independence number of sparse random Cayley or Cayley-sum graphs, and for the problem of estimating the smallest size of a subset of $G$ which is not a sumset. We also obtain tight bounds for the typical maximum length of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.02561","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/2509.02561/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":"2509.02561","created_at":"2026-07-05T12:03:41.057931+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.02561v1","created_at":"2026-07-05T12:03:41.057931+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.02561","created_at":"2026-07-05T12:03:41.057931+00:00"},{"alias_kind":"pith_short_12","alias_value":"FNJOWWSYEMC4","created_at":"2026-07-05T12:03:41.057931+00:00"},{"alias_kind":"pith_short_16","alias_value":"FNJOWWSYEMC4EPUP","created_at":"2026-07-05T12:03:41.057931+00:00"},{"alias_kind":"pith_short_8","alias_value":"FNJOWWSY","created_at":"2026-07-05T12:03:41.057931+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23762","citing_title":"Coloring sparse random Cayley graphs","ref_index":3,"is_internal_anchor":false},{"citing_arxiv_id":"2605.29680","citing_title":"Sumsets of random sets","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A","json":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A.json","graph_json":"https://pith.science/api/pith-number/FNJOWWSYEMC4EPUPEFCDGFKW6A/graph.json","events_json":"https://pith.science/api/pith-number/FNJOWWSYEMC4EPUPEFCDGFKW6A/events.json","paper":"https://pith.science/paper/FNJOWWSY"},"agent_actions":{"view_html":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A","download_json":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A.json","view_paper":"https://pith.science/paper/FNJOWWSY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.02561&json=true","fetch_graph":"https://pith.science/api/pith-number/FNJOWWSYEMC4EPUPEFCDGFKW6A/graph.json","fetch_events":"https://pith.science/api/pith-number/FNJOWWSYEMC4EPUPEFCDGFKW6A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A/action/storage_attestation","attest_author":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A/action/author_attestation","sign_citation":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A/action/citation_signature","submit_replication":"https://pith.science/pith/FNJOWWSYEMC4EPUPEFCDGFKW6A/action/replication_record"}},"created_at":"2026-07-05T12:03:41.057931+00:00","updated_at":"2026-07-05T12:03:41.057931+00:00"}