{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:ANEYGVNZ6IUP5L7N3FCOFWW2UB","short_pith_number":"pith:ANEYGVNZ","canonical_record":{"source":{"id":"1310.2934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"d050c56cbfe28433835b810779eb2c922ab04862b5ae83abbe502f4378151fee","abstract_canon_sha256":"23954705b9a74987661339696fae522dcedde235e559c128789a0751d0b4fb37"},"schema_version":"1.0"},"canonical_sha256":"03498355b9f228feafedd944e2dadaa0467b51d63f7a500de0996029cc674c7b","source":{"kind":"arxiv","id":"1310.2934","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2934","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2934v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2934","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"ANEYGVNZ6IUP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ANEYGVNZ6IUP5L7N","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ANEYGVNZ","created_at":"2026-05-18T12:27:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:ANEYGVNZ6IUP5L7N3FCOFWW2UB","target":"record","payload":{"canonical_record":{"source":{"id":"1310.2934","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:14:00Z","cross_cats_sorted":[],"title_canon_sha256":"d050c56cbfe28433835b810779eb2c922ab04862b5ae83abbe502f4378151fee","abstract_canon_sha256":"23954705b9a74987661339696fae522dcedde235e559c128789a0751d0b4fb37"},"schema_version":"1.0"},"canonical_sha256":"03498355b9f228feafedd944e2dadaa0467b51d63f7a500de0996029cc674c7b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:10:12.571955Z","signature_b64":"MrFnrOZhnfWHNiDe/HuA/JBW29mAd0syZvQtB67si2WtD0j6xbuT28NNj7pfFgZ4WoU567GbgJEjo0G2fSFDCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03498355b9f228feafedd944e2dadaa0467b51d63f7a500de0996029cc674c7b","last_reissued_at":"2026-05-18T03:10:12.571441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:10:12.571441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.2934","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-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T7ljRc1Il7ajjseYs2uaR6JIOMXYingCUcvDGBLTj4IoJzyK8X7kowTTxH86ZUn28uDDzfec/wHEJLvcNjlOBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:51:30.723614Z"},"content_sha256":"c73bef613128cd2a8610e0bdbeb1cb64528a024f9215aff9818d9882f0a50939","schema_version":"1.0","event_id":"sha256:c73bef613128cd2a8610e0bdbeb1cb64528a024f9215aff9818d9882f0a50939"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:ANEYGVNZ6IUP5L7N3FCOFWW2UB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The $(k,\\ell)$-rainbow index of random graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jiangli Song, Qingqiong Cai, Xueliang Li","submitted_at":"2013-10-10T12:14:00Z","abstract_excerpt":"A tree in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\\ell$ with $k\\geq 3$, the \\emph{$(k,\\ell)$-rainbow index} $rx_{k,\\ell}(G)$ of $G$ is the minimum number of colors needed in an edge-coloring of $G$ such that for any set $S$ of $k$ vertices of $G$, there exist $\\ell$ internally disjoint rainbow trees connecting $S$. This concept was introduced by Chartrand et. al., and there have been very few related results about it. In this paper, We establish a sharp threshold function for $rx_{k,\\ell}(G_{n,p})\\le"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2934","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-18T03:10:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CODVWyrbv1UPzhbdpGEy6yOOBdq8CeCylqk3h/0/5X9xugnedW6bOe2vaE0XRrhJzsZjXuwt7d2GSlZj6qLJDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T17:51:30.723956Z"},"content_sha256":"900e12a6eee422b6e6e6a42a6f4a7df55a39d660482391745d7dbfd2d4e41a62","schema_version":"1.0","event_id":"sha256:900e12a6eee422b6e6e6a42a6f4a7df55a39d660482391745d7dbfd2d4e41a62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB/bundle.json","state_url":"https://pith.science/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB/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-01T17:51:30Z","links":{"resolver":"https://pith.science/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB","bundle":"https://pith.science/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB/bundle.json","state":"https://pith.science/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ANEYGVNZ6IUP5L7N3FCOFWW2UB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ANEYGVNZ6IUP5L7N3FCOFWW2UB","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":"23954705b9a74987661339696fae522dcedde235e559c128789a0751d0b4fb37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:14:00Z","title_canon_sha256":"d050c56cbfe28433835b810779eb2c922ab04862b5ae83abbe502f4378151fee"},"schema_version":"1.0","source":{"id":"1310.2934","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.2934","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"arxiv_version","alias_value":"1310.2934v1","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.2934","created_at":"2026-05-18T03:10:12Z"},{"alias_kind":"pith_short_12","alias_value":"ANEYGVNZ6IUP","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_16","alias_value":"ANEYGVNZ6IUP5L7N","created_at":"2026-05-18T12:27:38Z"},{"alias_kind":"pith_short_8","alias_value":"ANEYGVNZ","created_at":"2026-05-18T12:27:38Z"}],"graph_snapshots":[{"event_id":"sha256:900e12a6eee422b6e6e6a42a6f4a7df55a39d660482391745d7dbfd2d4e41a62","target":"graph","created_at":"2026-05-18T03:10:12Z","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 in an edge colored graph is said to be a rainbow tree if no two edges on the tree share the same color. Given two positive integers $k$, $\\ell$ with $k\\geq 3$, the \\emph{$(k,\\ell)$-rainbow index} $rx_{k,\\ell}(G)$ of $G$ is the minimum number of colors needed in an edge-coloring of $G$ such that for any set $S$ of $k$ vertices of $G$, there exist $\\ell$ internally disjoint rainbow trees connecting $S$. This concept was introduced by Chartrand et. al., and there have been very few related results about it. In this paper, We establish a sharp threshold function for $rx_{k,\\ell}(G_{n,p})\\le","authors_text":"Jiangli Song, Qingqiong Cai, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:14:00Z","title":"The $(k,\\ell)$-rainbow index of random graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.2934","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:c73bef613128cd2a8610e0bdbeb1cb64528a024f9215aff9818d9882f0a50939","target":"record","created_at":"2026-05-18T03:10:12Z","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":"23954705b9a74987661339696fae522dcedde235e559c128789a0751d0b4fb37","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-10-10T12:14:00Z","title_canon_sha256":"d050c56cbfe28433835b810779eb2c922ab04862b5ae83abbe502f4378151fee"},"schema_version":"1.0","source":{"id":"1310.2934","kind":"arxiv","version":1}},"canonical_sha256":"03498355b9f228feafedd944e2dadaa0467b51d63f7a500de0996029cc674c7b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03498355b9f228feafedd944e2dadaa0467b51d63f7a500de0996029cc674c7b","first_computed_at":"2026-05-18T03:10:12.571441Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:10:12.571441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MrFnrOZhnfWHNiDe/HuA/JBW29mAd0syZvQtB67si2WtD0j6xbuT28NNj7pfFgZ4WoU567GbgJEjo0G2fSFDCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:10:12.571955Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.2934","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c73bef613128cd2a8610e0bdbeb1cb64528a024f9215aff9818d9882f0a50939","sha256:900e12a6eee422b6e6e6a42a6f4a7df55a39d660482391745d7dbfd2d4e41a62"],"state_sha256":"dad394b2c2b5b8e6add0a4e2630fd3d75baad176d0479d296f59e753ef86d934"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYfRsQSZ8BOtiCX2j2pfNzUT41LX9LyIvvf1Jle/QDIfw4XUtN1rG0hPqDjtepXI+KxO7oVJA+tWEpRNNVhMAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T17:51:30.725912Z","bundle_sha256":"9eb2c5c28854a2efc86c5be3d11ca75fa5d3a12af9937890a090380d0006454c"}}