{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:AWI4G2MAHEMKIAOV2UUBR3YKPH","short_pith_number":"pith:AWI4G2MA","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"},"canonical_sha256":"0591c369803918a401d5d52818ef0a79ff8db88412abcf3b5ff7e2c965a06b68","source":{"kind":"arxiv","id":"1501.01806","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01806","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01806v1","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01806","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"AWI4G2MAHEMK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AWI4G2MAHEMKIAOV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AWI4G2MA","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:AWI4G2MAHEMKIAOV2UUBR3YKPH","target":"record","payload":{"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"},"canonical_sha256":"0591c369803918a401d5d52818ef0a79ff8db88412abcf3b5ff7e2c965a06b68","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"},"source_kind":"arxiv","source_id":"1501.01806","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-18T02:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rneAHmGg85LmhlxX/br5jX0lIdK7mT5ZfovpbOtRhYmNyNnINRQ0g4sr5Wfc1Om1yuwlhJonL4ELxiGl9sORAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:29:50.496827Z"},"content_sha256":"bd120eb5dbda1880875ea06367b1ba5de2303a9b3e3172ee715649307db21dc5","schema_version":"1.0","event_id":"sha256:bd120eb5dbda1880875ea06367b1ba5de2303a9b3e3172ee715649307db21dc5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:AWI4G2MAHEMKIAOV2UUBR3YKPH","target":"graph","payload":{"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"},"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-18T02:29:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4NqBwf2HKgEHZoep0uRGMLqLeJu9HSQOObWDp1zTzX4OmIO50sdOVPYSh6imqoC2UEFLTJw1qhcLeGxgzDH3CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T00:29:50.497164Z"},"content_sha256":"56a990c3cc285e6cfd53a14bad5ced8f2049e0b1c54e06eefab690b660336fdc","schema_version":"1.0","event_id":"sha256:56a990c3cc285e6cfd53a14bad5ced8f2049e0b1c54e06eefab690b660336fdc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/bundle.json","state_url":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/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-04T00:29:50Z","links":{"resolver":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH","bundle":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/bundle.json","state":"https://pith.science/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AWI4G2MAHEMKIAOV2UUBR3YKPH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:AWI4G2MAHEMKIAOV2UUBR3YKPH","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":"b12a0b5cbd4d44dc81ead655805f39661de65b261598dc3fc75d18e717920a61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T11:50:05Z","title_canon_sha256":"732e668d213e7fb4e35042fc7870f8d596025076672f0374c7eabe93f2056015"},"schema_version":"1.0","source":{"id":"1501.01806","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.01806","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"arxiv_version","alias_value":"1501.01806v1","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.01806","created_at":"2026-05-18T02:29:46Z"},{"alias_kind":"pith_short_12","alias_value":"AWI4G2MAHEMK","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"AWI4G2MAHEMKIAOV","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"AWI4G2MA","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:56a990c3cc285e6cfd53a14bad5ced8f2049e0b1c54e06eefab690b660336fdc","target":"graph","created_at":"2026-05-18T02:29:46Z","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 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\\","authors_text":"Hui Jiang, Xueliang Li, Yingying Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T11:50:05Z","title":"Good upper bounds for the total rainbow connection of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.01806","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:bd120eb5dbda1880875ea06367b1ba5de2303a9b3e3172ee715649307db21dc5","target":"record","created_at":"2026-05-18T02:29:46Z","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":"b12a0b5cbd4d44dc81ead655805f39661de65b261598dc3fc75d18e717920a61","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-01-08T11:50:05Z","title_canon_sha256":"732e668d213e7fb4e35042fc7870f8d596025076672f0374c7eabe93f2056015"},"schema_version":"1.0","source":{"id":"1501.01806","kind":"arxiv","version":1}},"canonical_sha256":"0591c369803918a401d5d52818ef0a79ff8db88412abcf3b5ff7e2c965a06b68","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0591c369803918a401d5d52818ef0a79ff8db88412abcf3b5ff7e2c965a06b68","first_computed_at":"2026-05-18T02:29:46.340761Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:29:46.340761Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mMmrEMuzBjW+8SwoB5KELks5URBL1TBs92yfhDW3pwGGCw80tIXQh1LmQHxBpevB+C3IGsFg3sSCrgG7huluDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:29:46.341273Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.01806","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd120eb5dbda1880875ea06367b1ba5de2303a9b3e3172ee715649307db21dc5","sha256:56a990c3cc285e6cfd53a14bad5ced8f2049e0b1c54e06eefab690b660336fdc"],"state_sha256":"7f2818eb45995228cf8e96e233bcc2077652d198a9c8fd441e63092f8696514f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rQMgxD6tSkBwsxan2mun1fdK/5iSCkxgUJtl6vXLlAtI/0jmnSWO7g20xJJU6iA5KN4BDnPL13+1Hm99XzQiCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T00:29:50.499000Z","bundle_sha256":"dd3fa4eb7e53e613d213e00d502cc4e75a0e3c5b37d8b872e1f34d32a2dd434e"}}