{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:5LQ63BH5KTR4CECH6UNJAXF5YV","short_pith_number":"pith:5LQ63BH5","schema_version":"1.0","canonical_sha256":"eae1ed84fd54e3c11047f51a905cbdc56fc061c55e32ed690d46aac47cb05d9f","source":{"kind":"arxiv","id":"2606.23762","version":1},"attestation_state":"computed","paper":{"title":"Coloring sparse random Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Tung","submitted_at":"2026-06-22T13:46:32Z","abstract_excerpt":"It is shown that there exists $c > 0$ so that the Cayley graph over any finite abelian group $Z$ generated by $c \\log |Z|$ random elements is properly 3-colorable with high probability (as $|Z| \\to \\infty$). This is asymptotically tight and improves the best-known bound due to Alon of $\\frac{1}{4}\\log \\log |Z|$ elements. It also makes progress toward Alon's suggestion that a bound of $c \\log |G|$ may hold for any finite solvable group $G$."},"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":"2606.23762","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T13:46:32Z","cross_cats_sorted":[],"title_canon_sha256":"f56ec0157174a712f1fdcc80a59648ab1ae1653af147805ce4e2addde13418c5","abstract_canon_sha256":"f298ea577fd14546b63adbf5bd60efcf342a4ef4aabb5eab9279a3fdc1a3efbe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-24T00:14:25.320136Z","signature_b64":"lmMoFeGpTfeJ0rHoqVvLcGpcnZYeKaLYPkbGsZFGMqzz9A2mXnhbGbg5uj3nT7OlqiWN3MYtJYISEibpIRPVBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eae1ed84fd54e3c11047f51a905cbdc56fc061c55e32ed690d46aac47cb05d9f","last_reissued_at":"2026-06-24T00:14:25.319744Z","signature_status":"signed_v1","first_computed_at":"2026-06-24T00:14:25.319744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coloring sparse random Cayley graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Nathan Tung","submitted_at":"2026-06-22T13:46:32Z","abstract_excerpt":"It is shown that there exists $c > 0$ so that the Cayley graph over any finite abelian group $Z$ generated by $c \\log |Z|$ random elements is properly 3-colorable with high probability (as $|Z| \\to \\infty$). This is asymptotically tight and improves the best-known bound due to Alon of $\\frac{1}{4}\\log \\log |Z|$ elements. It also makes progress toward Alon's suggestion that a bound of $c \\log |G|$ may hold for any finite solvable group $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23762","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/2606.23762/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":"2606.23762","created_at":"2026-06-24T00:14:25.319801+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23762v1","created_at":"2026-06-24T00:14:25.319801+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23762","created_at":"2026-06-24T00:14:25.319801+00:00"},{"alias_kind":"pith_short_12","alias_value":"5LQ63BH5KTR4","created_at":"2026-06-24T00:14:25.319801+00:00"},{"alias_kind":"pith_short_16","alias_value":"5LQ63BH5KTR4CECH","created_at":"2026-06-24T00:14:25.319801+00:00"},{"alias_kind":"pith_short_8","alias_value":"5LQ63BH5","created_at":"2026-06-24T00:14:25.319801+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2606.30767","citing_title":"Linear equations and chromatic thresholds in $B_h$ sets","ref_index":20,"is_internal_anchor":true},{"citing_arxiv_id":"2606.30767","citing_title":"Linear equations and chromatic thresholds in $B_h$ sets","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV","json":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV.json","graph_json":"https://pith.science/api/pith-number/5LQ63BH5KTR4CECH6UNJAXF5YV/graph.json","events_json":"https://pith.science/api/pith-number/5LQ63BH5KTR4CECH6UNJAXF5YV/events.json","paper":"https://pith.science/paper/5LQ63BH5"},"agent_actions":{"view_html":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV","download_json":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV.json","view_paper":"https://pith.science/paper/5LQ63BH5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23762&json=true","fetch_graph":"https://pith.science/api/pith-number/5LQ63BH5KTR4CECH6UNJAXF5YV/graph.json","fetch_events":"https://pith.science/api/pith-number/5LQ63BH5KTR4CECH6UNJAXF5YV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV/action/storage_attestation","attest_author":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV/action/author_attestation","sign_citation":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV/action/citation_signature","submit_replication":"https://pith.science/pith/5LQ63BH5KTR4CECH6UNJAXF5YV/action/replication_record"}},"created_at":"2026-06-24T00:14:25.319801+00:00","updated_at":"2026-06-24T00:14:25.319801+00:00"}