{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WHQVUCJXB3CK3SVMZHPSXY2LQV","short_pith_number":"pith:WHQVUCJX","schema_version":"1.0","canonical_sha256":"b1e15a09370ec4adcaacc9df2be34b857da0d2690b0c2282d696a7baaed6c500","source":{"kind":"arxiv","id":"1308.4251","version":1},"attestation_state":"computed","paper":{"title":"Graphs with 3-rainbow index $n-1$ and $n-2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Xueliang Li, Yan Zhao","submitted_at":"2013-08-20T08:24:35Z","abstract_excerpt":"Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\\rightarrow \\{1,2,\\ldots,q\\},$ $q\\in \\mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex set $S\\subseteq V(G)$, the tree connecting $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-set $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$. In \\cite{Zhang}, they got that the $k$-rainbow index of a"},"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":"1308.4251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-08-20T08:24:35Z","cross_cats_sorted":[],"title_canon_sha256":"40dd45f72e1be828e6465091287f6827c0221afa7ed30421e95eca8a0b91dcff","abstract_canon_sha256":"d77a54e4bd02f39f1aa52036d8e0d75e4966beb57e7741bbb1309f46f9a952ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:33.345161Z","signature_b64":"KcrhAZhF6ms6G0dkjikh8JLR51TIB+7L5eLxmwDLXVPxXuRkzl35ylifJqyMWdZ1xPJ3N08kV4M5HjFiPtVhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b1e15a09370ec4adcaacc9df2be34b857da0d2690b0c2282d696a7baaed6c500","last_reissued_at":"2026-05-18T03:15:33.343743Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:33.343743Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Graphs with 3-rainbow index $n-1$ and $n-2$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Kang Yang, Xueliang Li, Yan Zhao","submitted_at":"2013-08-20T08:24:35Z","abstract_excerpt":"Let $G$ be a nontrivial connected graph with an edge-coloring $c:E(G)\\rightarrow \\{1,2,\\ldots,q\\},$ $q\\in \\mathbb{N}$, where adjacent edges may be colored the same. A tree $T$ in $G$ is a $rainbow tree$ if no two edges of $T$ receive the same color. For a vertex set $S\\subseteq V(G)$, the tree connecting $S$ in $G$ is called an $S$-tree. The minimum number of colors that are needed in an edge-coloring of $G$ such that there is a rainbow $S$-tree for each $k$-set $S$ of $V(G)$ is called the $k$-rainbow index of $G$, denoted by $rx_k(G)$. In \\cite{Zhang}, they got that the $k$-rainbow index of a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.4251","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":"1308.4251","created_at":"2026-05-18T03:15:33.344685+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.4251v1","created_at":"2026-05-18T03:15:33.344685+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.4251","created_at":"2026-05-18T03:15:33.344685+00:00"},{"alias_kind":"pith_short_12","alias_value":"WHQVUCJXB3CK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WHQVUCJXB3CK3SVM","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WHQVUCJX","created_at":"2026-05-18T12:28:04.890932+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/WHQVUCJXB3CK3SVMZHPSXY2LQV","json":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV.json","graph_json":"https://pith.science/api/pith-number/WHQVUCJXB3CK3SVMZHPSXY2LQV/graph.json","events_json":"https://pith.science/api/pith-number/WHQVUCJXB3CK3SVMZHPSXY2LQV/events.json","paper":"https://pith.science/paper/WHQVUCJX"},"agent_actions":{"view_html":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV","download_json":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV.json","view_paper":"https://pith.science/paper/WHQVUCJX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.4251&json=true","fetch_graph":"https://pith.science/api/pith-number/WHQVUCJXB3CK3SVMZHPSXY2LQV/graph.json","fetch_events":"https://pith.science/api/pith-number/WHQVUCJXB3CK3SVMZHPSXY2LQV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV/action/storage_attestation","attest_author":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV/action/author_attestation","sign_citation":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV/action/citation_signature","submit_replication":"https://pith.science/pith/WHQVUCJXB3CK3SVMZHPSXY2LQV/action/replication_record"}},"created_at":"2026-05-18T03:15:33.344685+00:00","updated_at":"2026-05-18T03:15:33.344685+00:00"}