{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RCY7A3L24DFLSH2WJMRKUH35HL","short_pith_number":"pith:RCY7A3L2","schema_version":"1.0","canonical_sha256":"88b1f06d7ae0cab91f564b22aa1f7d3ae8f520ce43093b257d3ca4937df4f5a9","source":{"kind":"arxiv","id":"2503.02100","version":1},"attestation_state":"computed","paper":{"title":"A remark on the independence number of sparse random Cayley sum graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rajko Nenadov","submitted_at":"2025-03-03T22:34:13Z","abstract_excerpt":"The Cayley sum graph $\\Gamma_S$ of a set $S \\subseteq \\mathbb{Z}_n$ is defined on the vertex set $\\mathbb{Z}_n$, with an edge between distinct $x, y \\in \\mathbb{Z}_n$ if $x + y \\in S$. Campos, Dahia, and Marciano have recently shown that if $S$ is formed by taking each element in $\\mathbb{Z}_n$ independently with probability $p$, for $p > (\\log n)^{-1/80}$, then with high probability the largest independent set in $\\Gamma_S$ is of size $$\n  (2 + o(1)) \\log_{1/(1-p)}(n). $$ This extends a result of Green and Morris, who considered the case $p = 1/2$, and asymptotically matches the independence "},"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":"2503.02100","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-03-03T22:34:13Z","cross_cats_sorted":[],"title_canon_sha256":"9257d7cb241a7239008dc19a76be537281ca6f0ac03f3cd7c6525e5d2b9299aa","abstract_canon_sha256":"83bb80303c89f5bb6976ea34c37968d7f47d8b9ceab7660e924098c21424499e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:23:36.485002Z","signature_b64":"f9H3Vbp+s2jTknK8hwsSra1Ou1M17+jA3hw1sZvLyfjQl4SZnAr1aFTlCA93plKcaiKq9M2LTOEKJ/vZDpyKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88b1f06d7ae0cab91f564b22aa1f7d3ae8f520ce43093b257d3ca4937df4f5a9","last_reissued_at":"2026-07-05T10:23:36.484570Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:23:36.484570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A remark on the independence number of sparse random Cayley sum graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Rajko Nenadov","submitted_at":"2025-03-03T22:34:13Z","abstract_excerpt":"The Cayley sum graph $\\Gamma_S$ of a set $S \\subseteq \\mathbb{Z}_n$ is defined on the vertex set $\\mathbb{Z}_n$, with an edge between distinct $x, y \\in \\mathbb{Z}_n$ if $x + y \\in S$. Campos, Dahia, and Marciano have recently shown that if $S$ is formed by taking each element in $\\mathbb{Z}_n$ independently with probability $p$, for $p > (\\log n)^{-1/80}$, then with high probability the largest independent set in $\\Gamma_S$ is of size $$\n  (2 + o(1)) \\log_{1/(1-p)}(n). $$ This extends a result of Green and Morris, who considered the case $p = 1/2$, and asymptotically matches the independence "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2503.02100","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/2503.02100/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":"2503.02100","created_at":"2026-07-05T10:23:36.484630+00:00"},{"alias_kind":"arxiv_version","alias_value":"2503.02100v1","created_at":"2026-07-05T10:23:36.484630+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2503.02100","created_at":"2026-07-05T10:23:36.484630+00:00"},{"alias_kind":"pith_short_12","alias_value":"RCY7A3L24DFL","created_at":"2026-07-05T10:23:36.484630+00:00"},{"alias_kind":"pith_short_16","alias_value":"RCY7A3L24DFLSH2W","created_at":"2026-07-05T10:23:36.484630+00:00"},{"alias_kind":"pith_short_8","alias_value":"RCY7A3L2","created_at":"2026-07-05T10:23:36.484630+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.23762","citing_title":"Coloring sparse random Cayley graphs","ref_index":13,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL","json":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL.json","graph_json":"https://pith.science/api/pith-number/RCY7A3L24DFLSH2WJMRKUH35HL/graph.json","events_json":"https://pith.science/api/pith-number/RCY7A3L24DFLSH2WJMRKUH35HL/events.json","paper":"https://pith.science/paper/RCY7A3L2"},"agent_actions":{"view_html":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL","download_json":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL.json","view_paper":"https://pith.science/paper/RCY7A3L2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2503.02100&json=true","fetch_graph":"https://pith.science/api/pith-number/RCY7A3L24DFLSH2WJMRKUH35HL/graph.json","fetch_events":"https://pith.science/api/pith-number/RCY7A3L24DFLSH2WJMRKUH35HL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL/action/storage_attestation","attest_author":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL/action/author_attestation","sign_citation":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL/action/citation_signature","submit_replication":"https://pith.science/pith/RCY7A3L24DFLSH2WJMRKUH35HL/action/replication_record"}},"created_at":"2026-07-05T10:23:36.484630+00:00","updated_at":"2026-07-05T10:23:36.484630+00:00"}