{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AWI4G2MAHEMKIAOV2UUBR3YKPH","short_pith_number":"pith:AWI4G2MA","schema_version":"1.0","canonical_sha256":"0591c369803918a401d5d52818ef0a79ff8db88412abcf3b5ff7e2c965a06b68","source":{"kind":"arxiv","id":"1501.01806","version":1},"attestation_state":"computed","paper":{"title":"Good upper bounds for the total rainbow connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","submitted_at":"2015-01-08T11:50:05Z","abstract_excerpt":"A total-colored graph is a graph $G$ such that both all edges and all vertices of $G$ are colored. A path in a total-colored graph $G$ is a total rainbow path if its edges and internal vertices have distinct colors. A total-colored graph $G$ is total-rainbow connected if any two vertices of $G$ are connected by a total rainbow path of $G$. The total rainbow connection number of $G$, denoted by $trc(G)$, is defined as the smallest number of colors that are needed to make $G$ total-rainbow connected. These concepts were introduced by Liu et al. Notice that for a connected graph $G$, $2diam(G)-1\\"},"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":"1501.01806","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T11:50:05Z","cross_cats_sorted":[],"title_canon_sha256":"732e668d213e7fb4e35042fc7870f8d596025076672f0374c7eabe93f2056015","abstract_canon_sha256":"b12a0b5cbd4d44dc81ead655805f39661de65b261598dc3fc75d18e717920a61"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:46.341273Z","signature_b64":"mMmrEMuzBjW+8SwoB5KELks5URBL1TBs92yfhDW3pwGGCw80tIXQh1LmQHxBpevB+C3IGsFg3sSCrgG7huluDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0591c369803918a401d5d52818ef0a79ff8db88412abcf3b5ff7e2c965a06b68","last_reissued_at":"2026-05-18T02:29:46.340761Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:46.340761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Good upper bounds for the total rainbow connection of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","submitted_at":"2015-01-08T11:50:05Z","abstract_excerpt":"A total-colored graph is a graph $G$ such that both all edges and all vertices of $G$ are colored. A path in a total-colored graph $G$ is a total rainbow path if its edges and internal vertices have distinct colors. A total-colored graph $G$ is total-rainbow connected if any two vertices of $G$ are connected by a total rainbow path of $G$. The total rainbow connection number of $G$, denoted by $trc(G)$, is defined as the smallest number of colors that are needed to make $G$ total-rainbow connected. These concepts were introduced by Liu et al. Notice that for a connected graph $G$, $2diam(G)-1\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01806","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":"1501.01806","created_at":"2026-05-18T02:29:46.340833+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.01806v1","created_at":"2026-05-18T02:29:46.340833+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01806","created_at":"2026-05-18T02:29:46.340833+00:00"},{"alias_kind":"pith_short_12","alias_value":"AWI4G2MAHEMK","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AWI4G2MAHEMKIAOV","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AWI4G2MA","created_at":"2026-05-18T12:29:10.953037+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/AWI4G2MAHEMKIAOV2UUBR3YKPH","json":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH.json","graph_json":"https://pith.science/api/pith-number/AWI4G2MAHEMKIAOV2UUBR3YKPH/graph.json","events_json":"https://pith.science/api/pith-number/AWI4G2MAHEMKIAOV2UUBR3YKPH/events.json","paper":"https://pith.science/paper/AWI4G2MA"},"agent_actions":{"view_html":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH","download_json":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH.json","view_paper":"https://pith.science/paper/AWI4G2MA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.01806&json=true","fetch_graph":"https://pith.science/api/pith-number/AWI4G2MAHEMKIAOV2UUBR3YKPH/graph.json","fetch_events":"https://pith.science/api/pith-number/AWI4G2MAHEMKIAOV2UUBR3YKPH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/action/storage_attestation","attest_author":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/action/author_attestation","sign_citation":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/action/citation_signature","submit_replication":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/action/replication_record"}},"created_at":"2026-05-18T02:29:46.340833+00:00","updated_at":"2026-05-18T02:29:46.340833+00:00"}