{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3IM36K6XWBOF4B24JFPSHIZ2MZ","short_pith_number":"pith:3IM36K6X","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"},"canonical_sha256":"da19bf2bd7b05c5e075c495f23a33a66516706e8cf96b7cbe4b34938c6ee37c0","source":{"kind":"arxiv","id":"1312.3068","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3068","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3068v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3068","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"3IM36K6XWBOF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3IM36K6XWBOF4B24","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3IM36K6X","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3IM36K6XWBOF4B24JFPSHIZ2MZ","target":"record","payload":{"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"},"canonical_sha256":"da19bf2bd7b05c5e075c495f23a33a66516706e8cf96b7cbe4b34938c6ee37c0","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"},"source_kind":"arxiv","source_id":"1312.3068","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NvIdx3ITazNHrn1qwvgtclPpueTadSqWAAb/LyVPj23/ClKil+M2tHzscOQTFPf5/x09med5rLg6CZOG+9RHAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:32:13.038597Z"},"content_sha256":"18162a6933e6912fe9d2550db2efab1048346a9585002037023171b771d9850b","schema_version":"1.0","event_id":"sha256:18162a6933e6912fe9d2550db2efab1048346a9585002037023171b771d9850b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3IM36K6XWBOF4B24JFPSHIZ2MZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:05:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Upb/Uvg96L0hDzZkd4mywHpU2wTI/IXPU8RsHgcNE4hBYUlV3uvSuRDClhUYqo9ZRN26esXxppnm62iMgLmFAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T23:32:13.038956Z"},"content_sha256":"bf2f8c76360a392109b99044fe59beedd5a8203fb08fc2a4b7dadd0539c732b3","schema_version":"1.0","event_id":"sha256:bf2f8c76360a392109b99044fe59beedd5a8203fb08fc2a4b7dadd0539c732b3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/bundle.json","state_url":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-01T23:32:13Z","links":{"resolver":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ","bundle":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/bundle.json","state":"https://pith.science/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3IM36K6XWBOF4B24JFPSHIZ2MZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3IM36K6XWBOF4B24JFPSHIZ2MZ","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":"f799c5dbe2f518b3dd359fe25ee6f581ee73223b333543ca4f3e1dd664b568f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:13:18Z","title_canon_sha256":"ce53c8e1a21ccabb5f0d9c1da552969afd3bb12c03a7d0c4ca6bd16bf554ccda"},"schema_version":"1.0","source":{"id":"1312.3068","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.3068","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"arxiv_version","alias_value":"1312.3068v1","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.3068","created_at":"2026-05-18T03:05:00Z"},{"alias_kind":"pith_short_12","alias_value":"3IM36K6XWBOF","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3IM36K6XWBOF4B24","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3IM36K6X","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:bf2f8c76360a392109b99044fe59beedd5a8203fb08fc2a4b7dadd0539c732b3","target":"graph","created_at":"2026-05-18T03:05:00Z","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":"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","authors_text":"Xueliang Li, Yan Zhao, Yuefang Sun","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:13:18Z","title":"Characterize graphs with rainbow connection number $m-2$ and $m-3$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.3068","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:18162a6933e6912fe9d2550db2efab1048346a9585002037023171b771d9850b","target":"record","created_at":"2026-05-18T03:05:00Z","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":"f799c5dbe2f518b3dd359fe25ee6f581ee73223b333543ca4f3e1dd664b568f1","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-12-11T08:13:18Z","title_canon_sha256":"ce53c8e1a21ccabb5f0d9c1da552969afd3bb12c03a7d0c4ca6bd16bf554ccda"},"schema_version":"1.0","source":{"id":"1312.3068","kind":"arxiv","version":1}},"canonical_sha256":"da19bf2bd7b05c5e075c495f23a33a66516706e8cf96b7cbe4b34938c6ee37c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"da19bf2bd7b05c5e075c495f23a33a66516706e8cf96b7cbe4b34938c6ee37c0","first_computed_at":"2026-05-18T03:05:00.566057Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:00.566057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bc4Xbt+XDWY7Tb0MTIIkEtCPLu/zO5Do2wvcCiul9gj5HJAEts9ZGz3w7eyK4n9XPjpknNGlqkqGCWHUk82mBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:00.567040Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.3068","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:18162a6933e6912fe9d2550db2efab1048346a9585002037023171b771d9850b","sha256:bf2f8c76360a392109b99044fe59beedd5a8203fb08fc2a4b7dadd0539c732b3"],"state_sha256":"d7647cf4285d52a9d9c15a513c9c17ef31a0ed0f0792f1b46a3e5d59df617165"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lad0ZggJjOXCLaTKWq53jXK+M7HocmOGAVGyHkeln6gU9wMFTVNBZNUS/4CjzHmYJ+TVxhaxkfpclv8ly/iRCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T23:32:13.040863Z","bundle_sha256":"a005819561eeabb16c136f68cd56e7df60f36751d1abd1de597c1945c1cfb8b1"}}