{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:SOSFJ6UGXHUMHLS674BO7CKIU3","short_pith_number":"pith:SOSFJ6UG","schema_version":"1.0","canonical_sha256":"93a454fa86b9e8c3ae5eff02ef8948a6cb72f14a31058e14e028d51174443f16","source":{"kind":"arxiv","id":"1312.0098","version":2},"attestation_state":"computed","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"},"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.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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1312.0098","created_at":"2026-05-18T02:57:17.172633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.0098v2","created_at":"2026-05-18T02:57:17.172633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0098","created_at":"2026-05-18T02:57:17.172633+00:00"},{"alias_kind":"pith_short_12","alias_value":"SOSFJ6UGXHUM","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_16","alias_value":"SOSFJ6UGXHUMHLS6","created_at":"2026-05-18T12:27:59.945178+00:00"},{"alias_kind":"pith_short_8","alias_value":"SOSFJ6UG","created_at":"2026-05-18T12:27:59.945178+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/SOSFJ6UGXHUMHLS674BO7CKIU3","json":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3.json","graph_json":"https://pith.science/api/pith-number/SOSFJ6UGXHUMHLS674BO7CKIU3/graph.json","events_json":"https://pith.science/api/pith-number/SOSFJ6UGXHUMHLS674BO7CKIU3/events.json","paper":"https://pith.science/paper/SOSFJ6UG"},"agent_actions":{"view_html":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3","download_json":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3.json","view_paper":"https://pith.science/paper/SOSFJ6UG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.0098&json=true","fetch_graph":"https://pith.science/api/pith-number/SOSFJ6UGXHUMHLS674BO7CKIU3/graph.json","fetch_events":"https://pith.science/api/pith-number/SOSFJ6UGXHUMHLS674BO7CKIU3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/action/storage_attestation","attest_author":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/action/author_attestation","sign_citation":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/action/citation_signature","submit_replication":"https://pith.science/pith/SOSFJ6UGXHUMHLS674BO7CKIU3/action/replication_record"}},"created_at":"2026-05-18T02:57:17.172633+00:00","updated_at":"2026-05-18T02:57:17.172633+00:00"}