{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SOSFJ6UGXHUMHLS674BO7CKIU3","short_pith_number":"pith:SOSFJ6UG","canonical_record":{"source":{"id":"1312.0098","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-11-30T12:11:01Z","cross_cats_sorted":[],"title_canon_sha256":"3cc41b658d91fcb9c410aa9f4fd1cc3bc41e392d8984bc0b045c56680d0630c7","abstract_canon_sha256":"9aa669749bebde5d8e6ba934085b9d62d14a2f5379371204e503b365dfcb32a8"},"schema_version":"1.0"},"canonical_sha256":"93a454fa86b9e8c3ae5eff02ef8948a6cb72f14a31058e14e028d51174443f16","source":{"kind":"arxiv","id":"1312.0098","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0098","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0098v2","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0098","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"SOSFJ6UGXHUM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SOSFJ6UGXHUMHLS6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SOSFJ6UG","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SOSFJ6UGXHUMHLS674BO7CKIU3","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0098","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-11-30T12:11:01Z","cross_cats_sorted":[],"title_canon_sha256":"3cc41b658d91fcb9c410aa9f4fd1cc3bc41e392d8984bc0b045c56680d0630c7","abstract_canon_sha256":"9aa669749bebde5d8e6ba934085b9d62d14a2f5379371204e503b365dfcb32a8"},"schema_version":"1.0"},"canonical_sha256":"93a454fa86b9e8c3ae5eff02ef8948a6cb72f14a31058e14e028d51174443f16","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:57:17.173142Z","signature_b64":"J+HYHwi083//m0o1dBZwHbar5Hgyq44MOsDO8QtufIxCZH98rEtLhZtQc+hyIAysKldvmkDIsLE8d2mGX4h4Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"93a454fa86b9e8c3ae5eff02ef8948a6cb72f14a31058e14e028d51174443f16","last_reissued_at":"2026-05-18T02:57:17.172544Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:57:17.172544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0098","source_version":2,"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:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3z44KJ/AakUjlJ5OE9ZFPsKpGgah+9wu2UFa68ceIPi1h3g3xBPuEea9KURpIcud8u6DeUYOO+R340zuggp9DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:23:06.993027Z"},"content_sha256":"0a25fc40abebce9b3b186808dfb5e9f2ce7a819ae1b6b32f4b54c869322617ea","schema_version":"1.0","event_id":"sha256:0a25fc40abebce9b3b186808dfb5e9f2ce7a819ae1b6b32f4b54c869322617ea"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SOSFJ6UGXHUMHLS674BO7CKIU3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The 3-rainbow index of graph operations","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Tingting Liu, Yumei Hu","submitted_at":"2013-11-30T12:11:01Z","abstract_excerpt":"A tree $T$, in an edge-colored graph $G$, is called {\\em a rainbow tree} if no two edges of $T$ are assigned the same color. A {\\em $k$-rainbow coloring}of $G$ is an edge coloring of $G$ having the property that for every set $S$ of $k$ vertices of $G$, there exists a rainbow tree $T$ in $G$ such that $S\\subseteq V(T)$. The minimum number of colors needed in a $k$-rainbow coloring of $G$ is the {\\em $k$-rainbow index of $G$}, denoted by $rx_k(G)$. Graph operations, both binary and unary, are an interesting subject, which can be used to understand structures of graphs. In this paper, we will st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0098","kind":"arxiv","version":2},"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:57:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"chYDfX+n9v5xRkFhzifgRbNyGEr+spdd798tR2Q1Cbd9av6FZBe6ONBDcEXG5CfE07SLA0BOa960o+/5u7V4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T10:23:06.993704Z"},"content_sha256":"959ff86b1a47d77e029f3a7855e98bc5ceb706dcd6bd45048c372bab7901d7bf","schema_version":"1.0","event_id":"sha256:959ff86b1a47d77e029f3a7855e98bc5ceb706dcd6bd45048c372bab7901d7bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/bundle.json","state_url":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/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-05-28T10:23:06Z","links":{"resolver":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3","bundle":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/bundle.json","state":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SOSFJ6UGXHUMHLS674BO7CKIU3","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":"9aa669749bebde5d8e6ba934085b9d62d14a2f5379371204e503b365dfcb32a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-11-30T12:11:01Z","title_canon_sha256":"3cc41b658d91fcb9c410aa9f4fd1cc3bc41e392d8984bc0b045c56680d0630c7"},"schema_version":"1.0","source":{"id":"1312.0098","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0098","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0098v2","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0098","created_at":"2026-05-18T02:57:17Z"},{"alias_kind":"pith_short_12","alias_value":"SOSFJ6UGXHUM","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SOSFJ6UGXHUMHLS6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SOSFJ6UG","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:959ff86b1a47d77e029f3a7855e98bc5ceb706dcd6bd45048c372bab7901d7bf","target":"graph","created_at":"2026-05-18T02:57:17Z","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 tree $T$, in an edge-colored graph $G$, is called {\\em a rainbow tree} if no two edges of $T$ are assigned the same color. A {\\em $k$-rainbow coloring}of $G$ is an edge coloring of $G$ having the property that for every set $S$ of $k$ vertices of $G$, there exists a rainbow tree $T$ in $G$ such that $S\\subseteq V(T)$. The minimum number of colors needed in a $k$-rainbow coloring of $G$ is the {\\em $k$-rainbow index of $G$}, denoted by $rx_k(G)$. Graph operations, both binary and unary, are an interesting subject, which can be used to understand structures of graphs. In this paper, we will st","authors_text":"Tingting Liu, Yumei Hu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-11-30T12:11:01Z","title":"The 3-rainbow index of graph operations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0098","kind":"arxiv","version":2},"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:0a25fc40abebce9b3b186808dfb5e9f2ce7a819ae1b6b32f4b54c869322617ea","target":"record","created_at":"2026-05-18T02:57:17Z","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":"9aa669749bebde5d8e6ba934085b9d62d14a2f5379371204e503b365dfcb32a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.CO","submitted_at":"2013-11-30T12:11:01Z","title_canon_sha256":"3cc41b658d91fcb9c410aa9f4fd1cc3bc41e392d8984bc0b045c56680d0630c7"},"schema_version":"1.0","source":{"id":"1312.0098","kind":"arxiv","version":2}},"canonical_sha256":"93a454fa86b9e8c3ae5eff02ef8948a6cb72f14a31058e14e028d51174443f16","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"93a454fa86b9e8c3ae5eff02ef8948a6cb72f14a31058e14e028d51174443f16","first_computed_at":"2026-05-18T02:57:17.172544Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:57:17.172544Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"J+HYHwi083//m0o1dBZwHbar5Hgyq44MOsDO8QtufIxCZH98rEtLhZtQc+hyIAysKldvmkDIsLE8d2mGX4h4Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:57:17.173142Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0098","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0a25fc40abebce9b3b186808dfb5e9f2ce7a819ae1b6b32f4b54c869322617ea","sha256:959ff86b1a47d77e029f3a7855e98bc5ceb706dcd6bd45048c372bab7901d7bf"],"state_sha256":"1a33735f5854443467b8e3441cf83e51f1c5e01f5391429f9893f0739db91c96"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o/7XjroLrfmAukqzgsjGKBfM9thTiOTbortGT3ofQGrmWjOmD8FWOIJfeRasPlO/WCydLqou1VJUCxFw/azaAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T10:23:06.997131Z","bundle_sha256":"485cec53f69cd3123ac6730497fe74bee9504836fa0bd1ed85c7bcafed024b48"}}