{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:S52HFGCUQ3TKEVZJMYKBEKRNO7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"fc94d9b21bbb5f2802695fe3a3771dee2ad19303693d5cd2c9dbc762f560d8af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-19T21:14:54Z","title_canon_sha256":"67935a1753bffd202821bf716a3fb3220f3b69fdb8413863381838ec7b8b968f"},"schema_version":"1.0","source":{"id":"1001.3413","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.3413","created_at":"2026-05-18T04:07:16Z"},{"alias_kind":"arxiv_version","alias_value":"1001.3413v3","created_at":"2026-05-18T04:07:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.3413","created_at":"2026-05-18T04:07:16Z"},{"alias_kind":"pith_short_12","alias_value":"S52HFGCUQ3TK","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"S52HFGCUQ3TKEVZJ","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"S52HFGCU","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:d361477dcab8e9b02c1b7664a95422e0ec1d744f487a6894e71006aaf524ccb1","target":"graph","created_at":"2026-05-18T04:07:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. We prove if $G$ is a connected strongly $r$-regular graph and $r\\geq 600$, then $rc(G)\\leq3$. Specially, there is a constant $c$ such that $rc(G)\\leq c$ for any connected strongly regular graph $G$.","authors_text":"Ali Dehghan, Arash Ahadi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-19T21:14:54Z","title":"On Rainbow Connection of Strongly Regular Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.3413","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:430c554f70a2a30e6021fbd60e18ec8d0b21809ed3113258f9f2fc415fd2c710","target":"record","created_at":"2026-05-18T04:07:16Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"fc94d9b21bbb5f2802695fe3a3771dee2ad19303693d5cd2c9dbc762f560d8af","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-01-19T21:14:54Z","title_canon_sha256":"67935a1753bffd202821bf716a3fb3220f3b69fdb8413863381838ec7b8b968f"},"schema_version":"1.0","source":{"id":"1001.3413","kind":"arxiv","version":3}},"canonical_sha256":"977472985486e6a257296614122a2d77c9716aeb2af96c53ef83e8f8a1e64270","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"977472985486e6a257296614122a2d77c9716aeb2af96c53ef83e8f8a1e64270","first_computed_at":"2026-05-18T04:07:16.086343Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:16.086343Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QUh7kjVLJkZuqF0SqLu8aEV1DWbsSeDTpBd5H4l6u2y/obKy6HJ/00my3dPRib9Ip3TnyIRN8/nBvUbCxctDDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:16.087048Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.3413","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:430c554f70a2a30e6021fbd60e18ec8d0b21809ed3113258f9f2fc415fd2c710","sha256:d361477dcab8e9b02c1b7664a95422e0ec1d744f487a6894e71006aaf524ccb1"],"state_sha256":"ce59808ded39a37eb0c6571a8416bf65bad7ca10727e0770b2fb68f598bf124d"}