{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:3IM36K6XWBOF4B24JFPSHIZ2MZ","short_pith_number":"pith:3IM36K6X","schema_version":"1.0","canonical_sha256":"da19bf2bd7b05c5e075c495f23a33a66516706e8cf96b7cbe4b34938c6ee37c0","source":{"kind":"arxiv","id":"1312.3068","version":1},"attestation_state":"computed","paper":{"title":"Characterize graphs with rainbow connection number $m-2$ and $m-3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yan Zhao, Yuefang Sun","submitted_at":"2013-12-11T08:13:18Z","abstract_excerpt":"A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if there is a rainbow path connecting any two vertices, and the rainbow connection number of $G$, denoted by $rc(G)$, is the minimum number of colors that are needed in order to make $G$ rainbow connected. Chartrand et al. obtained that $G$ is a tree if and only if $rc(G)=m$, and it is easy to see that $G$ is not a tree if and only if $rc(G)\\leq m-2$, where $m$ is the number of edge of $G$. So there is"},"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":"1312.3068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:13:18Z","cross_cats_sorted":[],"title_canon_sha256":"ce53c8e1a21ccabb5f0d9c1da552969afd3bb12c03a7d0c4ca6bd16bf554ccda","abstract_canon_sha256":"f799c5dbe2f518b3dd359fe25ee6f581ee73223b333543ca4f3e1dd664b568f1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:00.567040Z","signature_b64":"Bc4Xbt+XDWY7Tb0MTIIkEtCPLu/zO5Do2wvcCiul9gj5HJAEts9ZGz3w7eyK4n9XPjpknNGlqkqGCWHUk82mBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"da19bf2bd7b05c5e075c495f23a33a66516706e8cf96b7cbe4b34938c6ee37c0","last_reissued_at":"2026-05-18T03:05:00.566057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:00.566057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Characterize graphs with rainbow connection number $m-2$ and $m-3$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xueliang Li, Yan Zhao, Yuefang Sun","submitted_at":"2013-12-11T08:13:18Z","abstract_excerpt":"A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. A nontrivial connected graph $G$ is rainbow connected if there is a rainbow path connecting any two vertices, and the rainbow connection number of $G$, denoted by $rc(G)$, is the minimum number of colors that are needed in order to make $G$ rainbow connected. Chartrand et al. obtained that $G$ is a tree if and only if $rc(G)=m$, and it is easy to see that $G$ is not a tree if and only if $rc(G)\\leq m-2$, where $m$ is the number of edge of $G$. So there is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3068","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":"1312.3068","created_at":"2026-05-18T03:05:00.566208+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.3068v1","created_at":"2026-05-18T03:05:00.566208+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3068","created_at":"2026-05-18T03:05:00.566208+00:00"},{"alias_kind":"pith_short_12","alias_value":"3IM36K6XWBOF","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"3IM36K6XWBOF4B24","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"3IM36K6X","created_at":"2026-05-18T12:27:32.513160+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/3IM36K6XWBOF4B24JFPSHIZ2MZ","json":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ.json","graph_json":"https://pith.science/api/pith-number/3IM36K6XWBOF4B24JFPSHIZ2MZ/graph.json","events_json":"https://pith.science/api/pith-number/3IM36K6XWBOF4B24JFPSHIZ2MZ/events.json","paper":"https://pith.science/paper/3IM36K6X"},"agent_actions":{"view_html":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ","download_json":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ.json","view_paper":"https://pith.science/paper/3IM36K6X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.3068&json=true","fetch_graph":"https://pith.science/api/pith-number/3IM36K6XWBOF4B24JFPSHIZ2MZ/graph.json","fetch_events":"https://pith.science/api/pith-number/3IM36K6XWBOF4B24JFPSHIZ2MZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/action/storage_attestation","attest_author":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/action/author_attestation","sign_citation":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/action/citation_signature","submit_replication":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/action/replication_record"}},"created_at":"2026-05-18T03:05:00.566208+00:00","updated_at":"2026-05-18T03:05:00.566208+00:00"}