{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:6Y2QQD5BJVMYCVYASCFP6U5NWX","short_pith_number":"pith:6Y2QQD5B","schema_version":"1.0","canonical_sha256":"f635080fa14d59815700908aff53adb5cc8172f964d03febdae54fe4f1997972","source":{"kind":"arxiv","id":"math/0610893","version":1},"attestation_state":"computed","paper":{"title":"On Snevily's conjecture and restricted sumsets","license":"","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Zhi-Wei Sun","submitted_at":"2006-10-29T14:01:46Z","abstract_excerpt":"Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every positive integer m\\leq (k-1)/(n-1) there are more than (k-1)n-(m+1)n(n-1)/2 sets {a_1,...,a_n} such that a_1\\in A_1,..., a_n\\in A_n, and both a_i\\not=a_j and ma_i+b_i\\not=ma_j+b_j (or both ma_i\\not=ma_j and a_i+b_i\\not=a_j+b_j) for all 1\\leq i<j\\leq n.\n This extends a recent result of Dasgupta, K\\'arolyi, Serra and\n Szegedy on Snevily's conjecture. Actually stron"},"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":"math/0610893","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2006-10-29T14:01:46Z","cross_cats_sorted":["math.NT"],"title_canon_sha256":"406900962a4141ff50e28f2a6119a8d673adc63a4b563f97349cc4189b083068","abstract_canon_sha256":"a22f32041e7d5c612ac0579ba851ec974f6bb5b3493e0060b613a8338a67dc4f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:05:22.534260Z","signature_b64":"ryOvFtVpNY3XCUlYoDdqFLMQwOAc3riVLrWLA9Bgweizcd5n4PCorhoBPE432P6HBxjiBS3Y7aXNebqBbf2qCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f635080fa14d59815700908aff53adb5cc8172f964d03febdae54fe4f1997972","last_reissued_at":"2026-05-18T01:05:22.533511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:05:22.533511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Snevily's conjecture and restricted sumsets","license":"","headline":"","cross_cats":["math.NT"],"primary_cat":"math.CO","authors_text":"Zhi-Wei Sun","submitted_at":"2006-10-29T14:01:46Z","abstract_excerpt":"Let G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every positive integer m\\leq (k-1)/(n-1) there are more than (k-1)n-(m+1)n(n-1)/2 sets {a_1,...,a_n} such that a_1\\in A_1,..., a_n\\in A_n, and both a_i\\not=a_j and ma_i+b_i\\not=ma_j+b_j (or both ma_i\\not=ma_j and a_i+b_i\\not=a_j+b_j) for all 1\\leq i<j\\leq n.\n This extends a recent result of Dasgupta, K\\'arolyi, Serra and\n Szegedy on Snevily's conjecture. Actually stron"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0610893","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"math/0610893","created_at":"2026-05-18T01:05:22.533626+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0610893v1","created_at":"2026-05-18T01:05:22.533626+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0610893","created_at":"2026-05-18T01:05:22.533626+00:00"},{"alias_kind":"pith_short_12","alias_value":"6Y2QQD5BJVMY","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"6Y2QQD5BJVMYCVYA","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"6Y2QQD5B","created_at":"2026-05-18T12:25:53.939244+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX","json":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX.json","graph_json":"https://pith.science/api/pith-number/6Y2QQD5BJVMYCVYASCFP6U5NWX/graph.json","events_json":"https://pith.science/api/pith-number/6Y2QQD5BJVMYCVYASCFP6U5NWX/events.json","paper":"https://pith.science/paper/6Y2QQD5B"},"agent_actions":{"view_html":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX","download_json":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX.json","view_paper":"https://pith.science/paper/6Y2QQD5B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0610893&json=true","fetch_graph":"https://pith.science/api/pith-number/6Y2QQD5BJVMYCVYASCFP6U5NWX/graph.json","fetch_events":"https://pith.science/api/pith-number/6Y2QQD5BJVMYCVYASCFP6U5NWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX/action/storage_attestation","attest_author":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX/action/author_attestation","sign_citation":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX/action/citation_signature","submit_replication":"https://pith.science/pith/6Y2QQD5BJVMYCVYASCFP6U5NWX/action/replication_record"}},"created_at":"2026-05-18T01:05:22.533626+00:00","updated_at":"2026-05-18T01:05:22.533626+00:00"}