{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:NSE7CPSGFJUA472MS4Z4GCF4CY","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":"13ec4d1e730652c70591b37b4770bdd0ed3700880560cf84f7dcaac603ca362b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T06:07:10Z","title_canon_sha256":"48ce721195dd97b8bbe0dc6c1cff549dbcb9753b56e84903a52318e51b53e298"},"schema_version":"1.0","source":{"id":"1010.6131","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.6131","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"arxiv_version","alias_value":"1010.6131v1","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.6131","created_at":"2026-05-18T04:38:07Z"},{"alias_kind":"pith_short_12","alias_value":"NSE7CPSGFJUA","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"NSE7CPSGFJUA472M","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"NSE7CPSG","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:16686021acd3014ed7746ceaff3b426809f40103b9c36a43ba8cbc6e9e662bb2","target":"graph","created_at":"2026-05-18T04:38:07Z","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 by $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. In this paper, we proved that $rc(G)\\leq 3(n+1)/5$ for all $3$-connected graphs.","authors_text":"Xueliang Li, Yongtang Shi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T06:07:10Z","title":"Rainbow connection in $3$-connected graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.6131","kind":"arxiv","version":1},"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:243af9bb5b004dcd3241d4c42a0527e038a6b2e2648ff545dc7646a442628f73","target":"record","created_at":"2026-05-18T04:38:07Z","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":"13ec4d1e730652c70591b37b4770bdd0ed3700880560cf84f7dcaac603ca362b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-29T06:07:10Z","title_canon_sha256":"48ce721195dd97b8bbe0dc6c1cff549dbcb9753b56e84903a52318e51b53e298"},"schema_version":"1.0","source":{"id":"1010.6131","kind":"arxiv","version":1}},"canonical_sha256":"6c89f13e462a680e7f4c9733c308bc16197c8c29ccb4220ac5e60de1e54ce49d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c89f13e462a680e7f4c9733c308bc16197c8c29ccb4220ac5e60de1e54ce49d","first_computed_at":"2026-05-18T04:38:07.426428Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:38:07.426428Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S29uhm5rowgkkhtQzdjKI4QuFZ3IurbpVffB0x4OWWUy2MKo4lig0bSJ5zenzxvJ6ozedtsBmtv3jBiBdq+lAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:38:07.426813Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.6131","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:243af9bb5b004dcd3241d4c42a0527e038a6b2e2648ff545dc7646a442628f73","sha256:16686021acd3014ed7746ceaff3b426809f40103b9c36a43ba8cbc6e9e662bb2"],"state_sha256":"165405811c176078254420a926da53577e3f7bed107e08dba20a80ba4a22cef2"}